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

DOI10.1090/S0025-5718-2015-02931-7MaRDI QIDQ5264130zbMATH OpenOpenAlexFDO

Authors Richard P. Brent, Fredrik Johansson

Publication date 20 July 2015

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

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)

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.

Recommendations

• Precise error estimate of the Brent-McMillan algorithm for Euler's constant
• Fast converging sequence to Euler-Mascheroni constant
• A recursive scheme for improving the original rate of convergence to the Euler-Mascheroni constant
• Formulae for Euler's gamma without logarithm
• On Computing Euler's Constant
• scientific article; zbMATH DE number 4179778
• On computation of the Bessel function by summing up the series
• A fast algorithm for computing the digamma function
• An approximation formula for Euler-Mascheroni's constant
• Accuracy of Euler's \(\gamma\) expansion without logarithm

Cites work

• scientific article; zbMATH DE number 994432 (Why is no real title available?)
• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• Modern computer arithmetic
• Some New Algorithms for High-Precision Computation of Euler's Constant

Cited in

(4)

• Computing hypergeometric functions rigorously
• A harmonic sum over nontrivial zeros of the Riemann zeta-function
• A conjectured integer sequence arising from the exponential integral
• Precise error estimate of the Brent-McMillan algorithm for Euler's constant

Describes a project that uses

Uses Software

• HolonomicFunctions
• DLMF

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)