Unrestricted algorithms for elementary and special functions
Numerical Analysis
2010-04-22 v1 Numerical Analysis
Abstract
We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by examples. The topics include: power series methods, use of halving identities, asymptotic expansions, continued fractions, recurrence relations, Newton's method, numerical contour integration, and the arithmetic-geometric mean. Most of the algorithms discussed are implemented in the MP package (arXiv:1004.3173).
Cite
@article{arxiv.1004.3621,
title = {Unrestricted algorithms for elementary and special functions},
author = {Richard P. Brent},
journal= {arXiv preprint arXiv:1004.3621},
year = {2010}
}
Comments
Corrected and updated version of a paper first published in 1980. 13 pages. For further details see http://wwwmaths.anu.edu.au/~brent/pub/pub052.html