by
Vincent Lefèvre
,
Cole Normale Suprieure De Lyon
,
Jean-Michel Muller
,
Jean-michel Muller
,
Arnaud Tisserand
,
Arnaud Tisserand
Add To MetaCart
Abstract:
The Table Maker's Dilemma is the problem of always getting correctly rounded results when computing the elementary functions. After a brief presentation of this problem, we present new developments that have helped us to solve this problem for the double-precision exponential function in a small domain. These new results show that this problem can be solved, at least for the doubleprecision format, for the most usual functions. Keywords: Table Maker's Dilemma, Elementary Functions, Correct Rounding, Floating-Point Arithmetic. R#sum# Le dilemme du concepteur de tables est le probl#me de toujours fournir des r#sultats arrondis correctement lors du calcul de fonctions #l#mentaires. Apr#s une br#ve pr#sentation du probl#me, nous pr#sentons de nouveaux r#sultats qui permettent de r#soudre ce probl#me pour l'exponentielle en double pr#cision dans un petit domaine. Ces r#sultats montrent que le probl#me peut #tre r#solu, au moins pour le format double pr#cision, pour la plupart d...
Citations
|
1516
|
The Art of Computer Programming
– Knuth
- 1968
|
|
220
|
What every computer scientist should know about floatingpoint arithmetic
– Goldberg
- 1991
|
|
118
|
Elementary Functions, Algorithms and Implementation
– Muller
- 1997
|
|
25
|
Three distance theorems and combinatorics on words
– Alessandri, Berthé
- 1998
|
|
22
|
Fast evaluation of elementary mathematical functions with correctly rounded last bit
– Ziv
- 1991
|
|
21
|
Hardware Designs for Exactly Rounded Elementary Functions
– Schulte, Swartzlander
- 1994
|
|
17
|
Radian Reduction for Trigonometric Functions
– Payne, Hanek
- 1983
|
|
15
|
More on squaring and multiplying large integers
– Zuras
- 1994
|
|
13
|
An accurate elementary mathematical library for the IEEE floating point standard
– Gal, Bachelis
- 1991
|
|
12
|
Modular range reduction: a new algorithm for fast and accurate computation of the elementary functions
– Daumas, Mazenc, et al.
- 1995
|
|
11
|
Exact Rounding of Certain Elementary Functions
– Schulte, Swartzlander
- 1993
|
|
10
|
Fast multiple precision evaluation of elementary functions
– Brent
- 1976
|
|
9
|
A continued-fraction analysis of trigonometric argument reduction
– Smith
- 1995
|
|
7
|
New scalar and vector elementary functions for the IBM system/370
– Agarwal, Cooley, et al.
- 1986
|
|
6
|
On the approximation of the values of exponential function and logarithm by algebraic numbers
– Nesterenko, Waldschmidt
- 1996
|
|
5
|
Essentials of Pad e Approximants
– Baker
- 1975
|
|
5
|
A Class of Algorithms for Automatic Evaluation of Functions and Computations in a Digital Computer
– DeLugish
- 1970
|
|
5
|
Minimizing q*m-n, text accessible electronically at http://http.cs.berkeley.edu/∼wkahan/. At the beginning of the file ”nearpi.c
– Kahan
- 1983
|
|
4
|
Lecture notes on the status of IEEE-754. Postscript file accessible electronically through the Internet at the address http://http.cs.berkeley.edu/∼wkahan/ieee754status/ieee754.ps
– Kahan
- 1996
|
|
4
|
Towards exact rounding of the elementary functions
– Muller, Tisserand
- 1996
|
|
1
|
Rounding of AEoating-point intervals
– Daumas, Matula
- 1993
|
|
1
|
Feasibility of iperfectj function evaluation
– Dunham
- 1990
|
|
1
|
An algorithm that computes a lower bound on the distance between a segment and z . Research report RR9718, LIP, Ecole Normale Sup#rieure de Lyon
– Lefvre
- 1997
|
