Unrestricted algorithms for elementary and special functions

MaRDI QIDQ3885046zbMATH OpenFDO

Authors Richard P. Brent

Publication date 1980

Full work available at URL https://arxiv.org/abs/1004.3621

zbMATH Keywords

computation of elementary and special functionsexamplesfloating-point computationsgeneration and testing of accurate tablesinterval arithmeticunrestricted algorithms

Mathematics Subject Classification ID

Special functions (33-XX) Tables in numerical analysis (65A05) Computation of special functions and constants, construction of tables (65D20) Interval and finite arithmetic (65G30)

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).

Cited in

(6)

• Two recursive algorithms for the Fourier series
• Une méthodologie du calcul hardware des fonctions élémentaires
• A modified direct preconditioner for indefinite symmetric Toeplitz systems
• Rounding error analysis of linear recurrences using generating series
• The functions erf and erfc computed with arbitrary precision and explicit error bounds
• On the Cohen--Olivier algorithm for computing \(\zeta (s)\): error analysis in the real case for an arbitrary precision

Describes a project that uses

Uses Software

• Algorithm 524

This page was built for publication: Unrestricted algorithms for elementary and special functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885046)