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

DOI10.1090/S0025-5718-2015-02931-7zbMATH Open1320.33007arXiv1312.0039OpenAlexW3099902031MaRDI QIDQ5264130FDOQ5264130

Fredrik Johansson, Richard P. Brent

Publication date: 20 July 2015

Published in: Mathematics of Computation (Search for Journal in Brave)

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

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

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Bessel and Airy functions, cylinder functions, ({}_0F_1) (33C10) Error analysis and interval analysis (65G99) Evaluation of number-theoretic constants (11Y60) Algorithms in computer science (68W99)

Cites Work

• Modern Computer Arithmetic
• Some New Algorithms for High-Precision Computation of Euler's Constant
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• A Conjectured Integer Sequence Arising From the Exponential Integral
• Computing Hypergeometric Functions Rigorously
• A HARMONIC SUM OVER NONTRIVIAL ZEROS OF THE RIEMANN ZETA-FUNCTION

Uses Software

• Digital Library of Mathematical Functions
• HolonomicFunctions

Recommendations

• On computation of the Bessel function by summing up the series 👍 👎
• A fast algorithm for computing the digamma function 👍 👎
• On Computing Euler's Constant 👍 👎
• Formulae for Euler's gamma without logarithm 👍 👎
• Precise error estimate of the Brent-McMillan algorithm for Euler's constant 👍 👎
• Accuracy of Euler's \(\gamma\) expansion without logarithm 👍 👎
• A Recursive Scheme for Improving the Original Rate of Convergence to the Euler—Mascheroni Constant 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A bound for the error term in the Brent-McMillan algorithm

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