1. A BOUND FOR THE ERROR TERM IN THE BRENT-MCMILLAN ALGORITHM.
- Author
-
BRENT, RICHARD P. and JOHANSSON, FREDRIK
- Subjects
- *
BESSEL functions , *NUMERICAL solutions to functional equations , *MATHEMATICAL analysis , *ALGORITHMS , *ALGEBRAIC number theory - Abstract
The Brent-McMillan algorithm B3 (1980), when implemented with binary splitting, is the fastest known algorithm for high-precision computation of Euler's constant. However, no rigorous error bound for the algorithm has ever been published. We provide such a bound and justify the empirical observations of Brent and McMillan. We also give bounds on the error in the asymptotic expansions of functions related to the Bessel functions I0(x) and K0(x) for positive real x. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF