Computer Arithmetic, IEEE Symposium on (1997)
Mar. 6, 1997 to Mar. 9, 1997
Vincent Lefevre , Ecole Normale Superieure de Lyon
Arnaud Tisserand , Ecole Normale Superieure de Lyon
Jean-Michel Muller , CNRS
The Table Maker's Dilemma is the problem of always getting exactly rounded results when computing the elementary functions. After a brief presentation of this problem, we present new developments that 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 double-precision format, for the most usual functions.
elementary functions, floating-point arithmetic.
J. Muller, A. Tisserand and V. Lefevre, "Towards Correctly Rounded Transcendentals," Computer Arithmetic, IEEE Symposium on(ARITH), Asilomar, CA, 1997, pp. 132.