Gal's Accurate Tables Method Revisited - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2004

Gal's Accurate Tables Method Revisited

Abstract

Gal's accurate tables algorithm aims at providing an efficient implementation of elementary functions with correct rounding as often as possible. This method requires an expensive pre-computation of a table made of the values taken by the function - or by several related functions - at some distinguished points. Our improvements of Gal's method are two-fold: on the one hand we describe what is the arguably best set of distinguished values and how it improves the efficiency and correctness of the implementation of the function, and on the other hand we give an algorithm which drastically decreases the cost of the pre-computation. These improvements are related to the worst cases for the correct rounding of mathematical functions and to the algorithms for finding them. We show that the whole method can be turned into practice by giving complete tables for $2^x$ and $\sin x$ for $x \in [\frac{1}{2},1[$, in double precision.
Fichier principal
Vignette du fichier
RR-5359.pdf (362.83 Ko) Télécharger le fichier

Dates and versions

inria-00070644 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070644 , version 1

Cite

Damien Stehlé, Paul Zimmermann. Gal's Accurate Tables Method Revisited. [Research Report] RR-5359, INRIA. 2004, pp.23. ⟨inria-00070644⟩
164 View
1166 Download

Share

Gmail Mastodon Facebook X LinkedIn More