Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Efficient multiple-precision evaluation of elementary functions

Author: David M. Smith
Journal: Math. Comp. 52 (1989), 131-134
MSC: Primary 65D15; Secondary 26-04
MathSciNet review: 971406
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Let $ M(t)$ denote the time required to multiply two t-digit numbers using base b arithmetic. Methods are presented for computing the elementary functions in $ O({t^{1/3}}M(t))$ time.

References [Enhancements On Off] (What's this?)

  • [1] Richard P. Brent, Multiple-precision zero-finding methods and the complexity of elementary function evaluation, Analytic computational complexity (Proc. Sympos., Carnegie-Mellon Univ., Pittsburgh, Pa., 1975) Academic Press, New York, 1976, pp. 151–176. MR 0423869
  • [2] Richard P. Brent, Fast multiple-precision evaluation of elementary functions, J. Assoc. Comput. Mach. 23 (1976), no. 2, 242–251. MR 0395314
  • [3] R. P. Brent, "A Fortran multiple-precision arithmetic package," ACM Trans. Math. Software, v. 4, 1978, pp. 57-70.
  • [4] Donald E. Knuth, The art of computer programming. Vol. 2, 2nd ed., Addison-Wesley Publishing Co., Reading, Mass., 1981. Seminumerical algorithms; Addison-Wesley Series in Computer Science and Information Processing. MR 633878
  • [5] Michael S. Paterson and Larry J. Stockmeyer, On the number of nonscalar multiplications necessary to evaluate polynomials, SIAM J. Comput. 2 (1973), 60–66. MR 0314238

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65D15, 26-04

Retrieve articles in all journals with MSC: 65D15, 26-04

Additional Information

Article copyright: © Copyright 1989 American Mathematical Society