Numerical Algorithms

, Volume 37, Issue 1–4, pp 367–375 | Cite as

Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic

  • David Defour
  • Guillaume Hanrot
  • Vincent Lefèvre
  • Jean-Michel Muller
  • Nathalie Revol
  • Paul Zimmermann
Article

Abstract

Some aspects of what a standard for the implementation of the mathematical functions could be are presented. Firstly, the need for such a standard is motivated. Then the proposed standard is given. The question of roundings constitutes an important part of this paper: three levels are proposed, ranging from a level relatively easy to attain (with fixed maximal relative error) up to the best quality one, with correct rounding on the whole range of every function. We do not claim that we always suggest the right choices, or that we have thought about all relevant issues. The mere goal of this paper is to raise questions and to launch the discussion towards a standard.

floating-point arithmetic IEEE-754 standard mathematical function rounding exception implementation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    American National Standards Institute and Institute of Electrical and Electronic Engineers, IEEE standard for binary floating-point arithmetic, ANSI/IEEE Standard, Std 754–1985, New York (1985).Google Scholar
  2. [2]
    C: ISO/IEC 9899, Revision of the standardization of the C language, known as C99. http://std.dkuug.dk/jtc1/sc22/wg14/ (2002).Google Scholar
  3. [3]
    W.J. Cody, J.T. Coonen, D.M. Gay, K. Hanson, D. Hough, W. Kahan, R. Karpinski, J. Palmer, F.N. Ris and D. Stevenson, A proposed radix-and-word-length-independent standard for floating-point arithmetic, IEEE MICRO 4(4) (1984) 86–100.Google Scholar
  4. [4]
    D. Goldberg, What every computer scientist should know about floating-point arithmetic, ACM Comput. Surveys 23(1) (1991) 5–47.Google Scholar
  5. [5]
    T.J. Hickey, Q. Ju and M.H. van Emden, Interval arithmetic: From principles to implementation, J. ACM 48(5) (2001) 1038–1068.Google Scholar
  6. [6]
    IEEE Standard for binary floating-point arithmetic (Draft of the 17th December 2002), http://www.validlab.com/754R/ (2002).Google Scholar
  7. [7]
    W. Kahan, Minimizing qm – n, http://http.cs.berkeley.edu/~wkahan/testpi/nearpi.c(1983).Google Scholar
  8. [8]
    W. Kahan, Computer system support for scientific and engineering computation, Lecture notes available at http://www.validlab.com/fp-1988/lectures/(1988).Google Scholar
  9. [9]
    W. Kahan, Lecture notes on the status of IEEE-754, http://http.cs.berkeley.edu/~wkahan/ieee754status/ieee754.ps(1996).Google Scholar
  10. [10]
    W. Kahan, What can you learn about floating-point arithmetic in one hour? http://http.cs.berkeley.edu/~wkahan/ieee754status/cs267fp.ps(1996).Google Scholar
  11. [11]
    W. Kraemer and A. Bantle, Automatic forward error analysis for floating point algorithms, Reliable Comput. 7 (2001) 321–340.Google Scholar
  12. [12]
    V. Lefèvre and J.M. Muller, Worst cases for correct rounding of the elementary functions in double precision, in: Proc. of the 15th IEEE Symposium on Computer Arithmetic, Vail, USA, 2001 (IEEE Computer Soc. Press) pp. 111–118.Google Scholar
  13. [13]
    V. Lefèvre, J.-M. Muller and A. Tisserand, Toward correctly rounded transcendentals, IEEE Trans. Comput. 47(11) (1998) 1235–1243.Google Scholar
  14. [14]
    LIA-ISO/IEC 10967: Language Independent Arithmetic; LIA-2: Elementary numerical functions, Binding techniques, http://std.dkuug.dk/jtc1/sc22/wg11/ (2002).Google Scholar
  15. [15]
    R.E. Moore, Interval Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1966).Google Scholar
  16. [16]
    J.M. Muller, Elementary Functions, Algorithms and Implementation (Birkhäuser, Boston, 1997).Google Scholar
  17. [17]
    K.C. Ng, Argument reduction for huge arguments: Good to the last bit, Technical Report, SunPro (1992); available by e-mail: kwok.ng@eng.sun.com.Google Scholar
  18. [18]
    D. Stehlé, V. Lefèvre and P. Zimmermann, Worst cases and lattice reduction, in: Proc. of the 16th IEEE Symposium on Computer Arithmetic, Santiago de Compostela, Spain (IEEE Computer Soc. Press, 2003) pp. 142–147.Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • David Defour
    • 1
  • Guillaume Hanrot
    • 2
  • Vincent Lefèvre
    • 2
  • Jean-Michel Muller
    • 1
  • Nathalie Revol
    • 1
  • Paul Zimmermann
    • 2
  1. 1.CNRS/ENSL/INRIA project Arenaire, LIPÉcole Normale Supérieure de LyonFrance
  2. 2.Project Spaces, LORIA/INRIAVillers-lès-Nancy CedexFrance

Personalised recommendations