Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 
 

 

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


Authors: Richard P. Brent and Fredrik Johansson
Journal: Math. Comp. 84 (2015), 2351-2359
MSC (2010): Primary 33C10, 11Y60, 65G99, 65Y20, 68Q25, 68W40, 68W99
DOI: https://doi.org/10.1090/S0025-5718-2015-02931-7
Published electronically: March 4, 2015
MathSciNet review: 3356029
Full-text PDF

Abstract | References | Similar Articles | Additional Information

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 $ I_0(x)$ and $ K_0(x)$ for positive real $ x$.


References [Enhancements On Off] (What's this?)

  • [1] M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Dover Publications, New York, 1964. MR 1225604 (94b:00012)
  • [2] R. P. Brent, Ramanujan and Euler's Constant, Presented at the CARMA Workshop on Exploratory Experimentation and Computation in Number Theory, Newcastle, Australia, July 2010, http://maths-people.anu.edu.au/~brent/pd/Euler_CARMA_10.pdf.
  • [3] Richard P. Brent and Edwin M. McMillan, Some new algorithms for high-precision computation of Euler's constant, Math. Comp. 34 (1980), no. 149, 305-312. MR 551307 (82g:10002), https://doi.org/10.2307/2006237
  • [4] Richard P. Brent and Paul Zimmermann, Modern Computer Arithmetic, Cambridge Monographs on Applied and Computational Mathematics, vol. 18, Cambridge University Press, Cambridge, 2011. MR 2760886 (2012h:65315)
  • [5] J. D. Jackson and W. K. H. Panofsky, Edwin Mattison McMillan 1907-1991, Biographical Memoirs, Nat. Acad. Sci. (USA), 69:213-237, 1996.
  • [6] C. Koutschan, HolonomicFunctions (User's Guide), Technical Report 10-01, RISC Report Series, University of Linz, Austria, 2010.
  • [7] National Institute of Standards and Technology, Digital Library of Mathematical Functions, http://dlmf.nist.gov/, 2013.
  • [8] Frank W. J. Olver, Asymptotics and Special Functions, AKP Classics, A K Peters, Ltd., Wellesley, MA, 1997. Reprint of the 1974 original [Academic Press, New York; MR0435697 (55 #8655)]. MR 1429619 (97i:41001)
  • [9] A. J. Yee, Euler-Mascheroni Constant, http://www.numberworld.org/digits/EulerGamma/, 2011.

Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2010): 33C10, 11Y60, 65G99, 65Y20, 68Q25, 68W40, 68W99

Retrieve articles in all journals with MSC (2010): 33C10, 11Y60, 65G99, 65Y20, 68Q25, 68W40, 68W99


Additional Information

Richard P. Brent
Affiliation: Mathematical Sciences Institute, Australian National University, Canberra, ACT 0200, Australia
Email: richard.brent@anu.edu.au

Fredrik Johansson
Affiliation: RISC, Johannes Kepler University, 4040 Linz, Austria
Email: fredrik.johansson@risc.jku.at

DOI: https://doi.org/10.1090/S0025-5718-2015-02931-7
Received by editor(s): November 29, 2013
Received by editor(s) in revised form: January 1, 2014
Published electronically: March 4, 2015
Additional Notes: The first author was supported by Australian Research Council grant DP140101417.
The second author was supported by the Austrian Science Fund (FWF) grant Y464-N18.
Article copyright: © Copyright 2015 American Mathematical Society

American Mathematical Society