Richard P. Brent
Abstract
Let ƒ(x) be one of the usual elementary functions (exp, log, artan, sin, cosh, etc.), and let M(n) be the number of single-precision operations required to multiply n-bit integers. It is shown that ƒ(x) can be evaluated, with relative error Ο(2-n), in Ο(M(n)log (n)) operations as n → ∞, for any floating-point number x (with an n-bit fraction) in a suitable finite interval. From the Schönhage-Strassen bound on M(n), it follows that an n-bit approximation to ƒ(x) may be evaluated in Ο(n log2(n) log log(n)) operations. Special cases include the evaluation of constants such as π, e, and eπ. The algorithms depend on the theory of elliptic integrals, using the arithmetic-geometric mean iteration and ascending Landen transformations.
- 1 ABRAMOWITZ, M., AND STEGUN, I.A. Handbook of mathematical functions with formulas, graphs, and mathematical tables. National Bureau of Standards, Washington, D.C., 1964; Dover, 1965, Ch. 17. Google Scholar
- 2 BEELER, M, GOSPEl, R.W, xsv SCHROEPPEL, R Hakmem Memo No. 239, M.I.T. Artfficial Intelligence Lab., M I T., Cambridge, Mass., 1972, pp. 70-71 Google Scholar
- 3 BORCHAttDT, C W. Gesammelte Werke. Berlin, 1888, pp. 455-462Google Scholar
- 4 BRENT, R P. The complexity of multiple-precision arithmetic. Proc Seminar on Complexity of Computattonal Problem Solving (held at Austrahan National U., Dec. 1974), Queensland U. Press, Brisbane, Australia 1975, pp 126-165Google Scholar
- 5 BRENT, R P. Multiple-precision zero-finding methods and the complexity of elementary functmn evaluation Proc Symp. on Analytic Computational Complexity, J.F. Traub, Ed, Academm Press, New York, 1976, pp 151-176.Google Scholar
- 6 BRENT, R.P. Computer Solutwn of Nonlinear Equations. Academm Press, New York (to appear), Ch. 6.Google Scholar
- 7 BRENT, R P. A Fortran multiple-precision arithmetic package. Submitted to a technical journal. Google Scholar
- 8 CARLSON, B.C Algorithms involving arithmetic and geometric means. Amer. Math. Monthly 78 (May 1971), 496-505.Google Scholar
- 9 CARLSON, B C. An algorithm for computing logarithms and arctangents. Math. Comput. ~6 (Aprd 1972), 543-549.Google Scholar
- 10 FINKEL, R, GUIBAs, L, AND SIMONYI, C Manuscript in preparation.Google Scholar
- 11 FISCHER, M j, ASB STOCKMEYER, L J Fast on-line integer multiphcation. J. Compu~. System Scis. 9 (Dec. 1974), 317-331Google Scholar
- 12 GAuss, C.F Carl Fmedmch Gauss Werke, Bd. 3 Gottingen, 1876, pp. 362-403.Google Scholar
- 13 GosP~R, R.W. Acceleratton of series. Memo No 304, M.I.T. Artificml Intelligence Lab., M I.T, Cambridge, Mass, 1974. Google Scholar
- 14 GUILLOUV, J., AND BOUYER, M 1,000,000 decimals de pi. Unpublished manuscriptGoogle Scholar
- 15 KNUTH, D.E. The Art of Computer Proqramm~nq, Vol. 2 Addison-Wesley, Reading, Mass, 1969. Errata and addenda: Rep. CS 194, Computer Sci Dep., Stanford U., Stanford, Calif., 1970. Google Scholar
- 16 LAGRANGE, J.L. Oeuvres de Lagrange, Tome $ Gauthmr-Vlllars, Parm, 1868, pp. 267-272.Google Scholar
- 17 LEGENDRE, A.M Exercwes de CalculIntegral, Vol. 1. Paris, 1811, p. 61.Google Scholar
- 18 SALAMIN, E. Computation of ~ using arithmetic-geometric mean. To appear in Math. Comput.Google Scholar
- 19 SCHOSHAGE, A., ASD STRASSEN, V. Schnelle Multiphkation grosset Zahlen. Computing 7 (1971), 281-292.Google Scholar
- 20 SCHROEPPEL, R. Unpubhshed manuscript dated May 1975Google Scholar
- 21 SHAs~:S, D., AND WRENCH, J.W. CMculatmn of v to 100,000 decorums. Ma~h Compug. 16 (1962), 76-99.Google Scholar
- 22 SWEENEY, D W. On the computatmn of Euler's constant Math. Comput. 17 (1963), 170-178.Google Scholar
- 23 THACHER, H.C. iterated square root expansions for the inverse cosine and inverse hyperbolic cosine. Math. Comput. 15 (1961), 399--403.Google Scholar
Index Terms
- Fast Multiple-Precision Evaluation of Elementary Functions
Recommendations
Integration of elementary functions
We extend a recent algorithm of Trager to a decision procedure for the indefinite integration of elementary functions. We can express the integral as an elementary function or prove that it is not elementary. We show that if the problem of integration ...
Fast Evaluation of the Elementary Functions in Single Precision
In this paper we will introduce a new method for the fast evaluation of the elementary functions in single precision based on the evaluation of truncated Taylor series using a difference method. We assume the availability of large and fast (at least for ...
On multivariate orthogonal polynomials and elementary symmetric functions
AbstractWe study families of multivariate orthogonal polynomials with respect to the symmetric weight function in d variables
for , where is an univariate weight function in and with ...
Comments