Skip to main content
SpringerLink
Log in

Evaluating Elementary Functions with Guaranteed Precision

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

Because of changes in the computer markets, the problem of efficient evaluation of elementary functions (which seemed to be already solved) becomes important again. In this paper, after a brief review of current approaches to this problem, algorithms for finding guaranteed bounds for values of elementary functions are suggested. The evaluation time is reduced through increasing the amount of memory used.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Alefeld, G. and Herzberger, J., Introduction to Interval Computations, New York: Academic, 1983. Translated under the title Vvedenie v interval'nye vychisleniya, Moscow: Mir, 1987.

    Google Scholar 

  2. Dobronets, B.S. and Shaidurov, V.V., Dvustoronnie chislennye metody (Duplex Numerical Methods), Novosibirsk: Nauka, 1990.

    Google Scholar 

  3. Kalmykov, S.A., Shokin, Yu.I., and Yuldashev, Z.Kh., Metody interval'nogo analiza (Methods for Interval Analysis), Novosibirsk: Nauka, 1986.

    Google Scholar 

  4. Korn, G. and Korn, T., Mathematical Handbook for Scientists and Engineers, New York: McGraw-Hill, 1971. Translated under the title Spravochnik po matematike, Moscow: Nauka, 1974.

    Google Scholar 

  5. Remez, U.Ya., Osnovy chislennykh metodov chebyshevskogo priblizheniya (Fundamentals of Numerical Methods for Chebyshev Approximation), Kiev: Naukova Dumka, 1969.

    Google Scholar 

  6. Shokin, Yu.I., Interval'nyi analiz (Interval Analysis), Novosibirsk: Nauka, 1981.

    Google Scholar 

  7. Benhamou, F.,Interval Constraint Logic Programming, in Constraint Programming: Basics and Trends, Podelski, A., Ed., LNCS, 1995, vol. 910, pp. 1–21.

  8. elefunt.bib, BibTeX Bibliography, http://netlib2.cs.utk.edu/bibnet/journals/elefunt.html.

  9. Glibc, Library for Use with GNU/HURD and GNU/LINUX, http://www.gnu/org/gnulist/production/glibc.html.

  10. Goto, E. and Wong, W.F., Fast Evaluation of the Elementary Function in Double Precision, Proc. 27th Hawaii Int. Conf. on System Sci., 1994, vol. 1, pp. 349–358.

    Google Scholar 

  11. Hansen, E., Global Optimization Using Interval Analysis, New York: Marcel Dekker, 1992.

    Google Scholar 

  12. IEEE Standard for Binary Floating-Point Arithmetic, Techn. Report ANSI/IEEE Std 754-1985, New York: IEEE, 1985.

  13. Mathematical Library fdlibm v. 5.1, http://hpux.dsi.unimi.it/hppd/hpux/Maths/Misc/fdlibm-5.1.

  14. Muller, J.-M. and Tisserand, A., Towards Exact Rounding of the Elementary Functions, Proc. SCAN-95 Symp., Wuppertal, 1995.

  15. Numerical Computation Guide, Mountain View, 1995.

  16. Older, W. and Vellino, A., Constraint Arithmetic on Real Intervals, in Constraint Logic Programming: Selected Research, Benhamou, F. and Colmerauer, A., Eds., MIT Press, 1993, pp. 175–195.

  17. XSC Software, http://www.xsc.de.

Download references

Author information

Authors and Affiliations

  1. Ershov Institute of Information Systems, Siberian Division, Russian Academy of Sciences, pr. Akademika Lavrent'eva 6, Novosibirsk, 630090, Russia

    M. Yu. Loenko

Authors
  1. M. Yu. Loenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Loenko, M.Y. Evaluating Elementary Functions with Guaranteed Precision. Programming and Computer Software 27, 101–110 (2001). https://doi.org/10.1023/A:1011054928373

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011054928373

Keywords

Search

Navigation