Worst Cases of a Periodic Function for Large Arguments - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Worst Cases of a Periodic Function for Large Arguments

Vincent Lefèvre
Damien Stehlé
  • Function : Author
  • PersonId : 837772


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 an heuristic complexity of $O(2^{0.676 p})$ 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.
Fichier principal
Vignette du fichier
RR-6106.pdf (244.15 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00126474 , version 1 (25-01-2007)
inria-00126474 , version 2 (29-01-2007)



Guillaume Hanrot, Vincent Lefèvre, Damien Stehlé, Paul Zimmermann. Worst Cases of a Periodic Function for Large Arguments. 18th IEEE Symposium in Computer Arithmetic, Jun 2007, Montpellier, France. pp.133-140, ⟨10.1109/ARITH.2007.37⟩. ⟨inria-00126474v2⟩
449 View
280 Download



Gmail Mastodon Facebook X LinkedIn More