Worst Cases of a Periodic Function for Large Arguments

One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approximated by a polynomial. This is one of the last few issues that prevents from guaranteeing an efficient computation of correctly rounded transcendentals for the whole IEEE-754 double precision format. The first non-naive algorithm for that problem is presented, with a heuristic complexity of O(20.676p) for a precision of p bits. The efficiency of the algorithm is shown on the largest IEEE-754 double precision binade for the sine function, and some corresponding bad cases are given. We can hope that all the worst cases of the trigonometric functions in their whole domain will be found within a few years, a task that was considered out of reach until now.

[1]  Tomás Lang,et al.  Bounds on runs of zeros and ones for algebraic functions , 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

[2]  Tommy Färnqvist.  Number Theory Meets Cache Locality – Efficient Implementation of a Small Prime FFT for the GNU Multiple Precision Arithmetic Library , 2005 .

[3]  Don Coppersmith,et al.  Finding Small Solutions to Small Degree Polynomials , 2001, CaLC.

[4]  Vincent Lefèvre,et al.  Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format , 2008, Reliable Implementation of Real Number Algorithms.

[5]  18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 25-27 June 2007, Montpellier, France , 2007, IEEE Symposium on Computer Arithmetic.

[6]  Vincent Lefèvre,et al.  Worst cases and lattice reduction , 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.

[7]  Jean-Michel Muller,et al.  Worst cases for correct rounding of the elementary functions in double precision , 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

[8]  Abraham Ziv,et al.  Fast evaluation of elementary mathematical functions with correctly rounded last bit , 1991, TOMS.

[9]  Damien Stehlé,et al.  On the Randomness of Bits Generated by Sufficiently Smooth Functions , 2006, ANTS.

[10]  Vincent Lefèvre,et al.  Searching worst cases of a one-variable function using lattice reduction , 2005, IEEE Transactions on Computers.

[11]  Ansi Ieee,et al.  IEEE Standard for Binary Floating Point Arithmetic , 1985 .