Abstract
We present interval methods to get reliable a priori error bounds for the machine evaluation of algorithms implementing some mathematical expression. The term expression not only means simple arithmetical expressions but also more complex program parts including loops or recursive structures (e.g. a complete elementary function routine).
We sketch a method that can be used to get an upper bound for the approximation error of a polynomial or a rational approximation. We also discuss a method to compute worst case a priori error estimates for arbitrary IEEE double floating-point computations. Our theoretical results lead to reliable and easy to use public domain software tools. The application of these tools to an accurate table method shows that error bounds of high quality can be derived.
Similar content being viewed by others
References
American National Standards Institute / Institute of Electrical and Electronics Engineers: A Standard for Binary Floating-Point Arithmetic, ANSI/IEEE Std. 754-1985, New York, 1985 (reprinted in SIGPLAN 22 (2) (1987), pp 9–25).
Hofschuster, W. and Krämer, W.: Ein rechnergest ützter Fehlerkalkül mit Anwendung auf ein genaues Tabellenverfahren, Preprint 96/5 des Instituts für Wissenschaftliches Rechnen und Mathematische Modellbildung, 1996, ftp://iamk4515.mathematik.uni-karlsruhe.de, directory: /pub/iwrmm/preprints.
Krämer, W.: Sichere und genaue Abschätzung des Approximationsfehlers bei rationalen Approximationen, Bericht des Instituts für Angewandte Mathematik, Universität Karlsruhe, 1996, ftp://iamk4515.mathematik.uni-karlsruhe.de, directory: /pub/documents/reports.
Tang, P. T. P.: Table-Driven Implementation of the Expm1 Function in IEEE Floating-Point Arithmetic, ACM Trans. on Math. Software 18 (2) (1992), pp. 211–222.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hofschuster, W., Krämer, W. A Computer Oriented Approach to Get Sharp Reliable Error Bounds. Reliable Computing 3, 239–248 (1997). https://doi.org/10.1023/A:1009966622475
Issue Date:
DOI: https://doi.org/10.1023/A:1009966622475