A priori worst-case error bounds for floating-point computations
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636889,p. 64-71
- https://doi.org/10.1109/arith.1997.614880
Abstract
A new technique for the a-priori calculation of rigorous error bounds for floating-point computations is introduced. The theorems given in this paper, combined with interval arithmetic, lead to the implementation of reliable software routines which enable the user to compute the desired error bounds automatically by a suitable computer program. As a prominent example, a table-lookup algorithm for calculating the function exp(x)-1 that has been published by Tang (1992) is analyzed using these new tools. The result shows the high quality of the new approach.Keywords
This publication has 3 references indexed in Scilit:
- Table-lookup algorithms for elementary functions and their error analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Table-driven implementation of the logarithm function in IEEE floating-point arithmeticACM Transactions on Mathematical Software, 1990
- Table-driven implementation of the exponential function in IEEE floating-point arithmeticACM Transactions on Mathematical Software, 1989