Some New Algorithms for High-Precision Computation of Euler's Constant

DOI10.2307/2006237MaRDI QIDQ3884167zbMATH OpenOpenAlexWikidataFDO

Authors Richard P. Brent, Edwin McMillan

Publication date 1980

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

Full work available at URL https://escholarship.org/uc/item/2gz7s1tm

zbMATH Keywords

algorithmsEuler's constantGauss-Kusmin lawMascheroni'smultiple-precision arithmeticrational approximationregular continued fractions

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Continued fractions and generalizations (11J70) Transcendence (general theory) (11J81) Tables in numerical analysis (65A05) Algorithms in computer science (68W99)

Cited in

(12)

• Fast evaluation of the Hurwitz zeta function and Dirichlet \(L\)-series
• Computational strategies for the Riemann zeta function
• On one asymptotic formula for the Euler constant
• Formulae for Euler's gamma without logarithm
• Euler's constant: Euler's work and modern developments
• Computing Stieltjes constants using complex integration
• A harmonic sum over nontrivial zeros of the Riemann zeta-function
• A short note on generalized Euler-Briggs constants
• Rational approximation to Euler's constant at a geometric rate of convergence
• A bound for the error term in the Brent-McMillan algorithm
• Deep learning-based method for solving seepage equation under unsteady boundary
• Legendre modified moments for Euler's constant

Describes a project that uses

Uses Software

• Algorithm 524

This page was built for publication: Some New Algorithms for High-Precision Computation of Euler's Constant

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