Unrestricted Algorithms for Generating Elementary Functions

  • F. W. J. Olver
Part of the Computing Supplementum book series (COMPUTING, volume 2)


An “unrestricted” algorithm for generating a mathematical function is a computational algorithm in which the user may demand any accuracy for arguments of any magnitude. Two interesting mathematical problems arise in the construction of such algorithms for the elementary functions. First, an efficient method is needed to determine realistic a priori error bounds that is applicable when the number of arithmetical Operations is unbounded. Secondly, the free parameters associated with the algorithm need to be optimized in order to minimize the total Computing time. The first problem is solved by application of a recently-developed logarithmic form of interval analysis. The second is solved by asymptotic methods.


Word Length Dual Form Relative Precision Conventional Definition Arbitrary Precision 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Brent, R. P.: Fast multiple-precision evaluation of elementary functions. J. Assoc. Computing Machinery 23, 242–251 (1976).CrossRefMATHMathSciNetGoogle Scholar
  2. [2]
    Brent, R. P.: Multiple-precision zero-finding methods and the complexity of elementary function evaluation. In: Analytic Computational Complexity (Traub, J. F., ed.), pp. 151–176. New York: Academic Press 1976.Google Scholar
  3. [3]
    Brent, R. P.: A Fortran multiple-precision arithmetic package. ACM Trans. Math. Software 4, 57–70 (1978).CrossRefGoogle Scholar
  4. [4]
    Brent, R. P.: Algorithm 524. MP, A Fortran multiple-precision arithmetic package. ACM Trans. Math. Software 4, 71–81 (1978).CrossRefGoogle Scholar
  5. [5]
    Clenshaw, C. W., Olver, F. W. J.: An unrestricted algorithm for the exponential function. SIAM J. Numer. Anal. (In press.)Google Scholar
  6. [6]
    Knuth, D. E.: The Art of Computer Programming, 2: Seminumerical Algorithms. Reading, Mass.: Addison-Wesley 1969.Google Scholar
  7. [7]
    Olver, F. W. J.: An new approach to error arithmetic. SIAM J. Numer. Anal. 15, 368–393 (1978).CrossRefMATHMathSciNetGoogle Scholar
  8. [8]
    Schonfelder, J. L., Keech, M. S.: Arbitrary precision elementary functions in ALGOL 68. (To be published.)Google Scholar
  9. [9]
    Wyatt, W. T., Jr., Lozier, D. W., Orser, D. J.: A portable extended precision arithmetic package and library with Fortran precompiler. ACM Trans. Math. Software 2, 209–231 (1976).CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag 1980

Authors and Affiliations

  • F. W. J. Olver
    • 1
  1. 1.Institute for Physical Science and TechnologyUniversity of MarylandCollege ParkUSA

Personalised recommendations