论文信息 - A bound for the error term in the Brent-McMillan algorithm

A bound for the error term in the Brent-McMillan algorithm

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 modified Bessel functions.

Fredrik Johansson | Richard P. Brent | R. Brent | Fredrik Johansson

[1] Milton Abramowitz,et al. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .

[2] D. Owen. Handbook of Mathematical Functions with Formulas , 1965 .

[3] F. Olver. Asymptotics and Special Functions , 1974 .

[4] Richard P. Brent,et al. Some New Algorithms for High-Precision Computation of Euler’s Constant , 1980 .

[5] Raghu Kacker,et al. Digital Library of Mathematical Functions , 2003 .

[6] J. Mačys. On the Euler-Mascheroni constant , 2013 .

[7] Jean-Michel Muller,et al. Modern Computer Arithmetic , 2016, Computer.