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

DOI10.2307/2006237zbMath0442.10002OpenAlexW4252600114WikidataQ56939255 ScholiaQ56939255MaRDI QIDQ3884167

Edwin McMillan, Richard P. Brent

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

algorithmsrational approximationEuler's constantregular continued fractionsmultiple-precision arithmeticGauss-Kusmin lawMascheroni's

Mathematics Subject Classification ID

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

Related Items (11)

A short note on generalized Euler–Briggs constants ⋮ Rational approximation to Euler’s constant at a geometric rate of convergence ⋮ On one asymptotic formula for the Euler constant ⋮ Computing Stieltjes constants using complex integration ⋮ Legendre modified moments for Euler's constant ⋮ Formulae for Euler's gamma without logarithm ⋮ Fast evaluation of the Hurwitz zeta function and Dirichlet \(L\)-series ⋮ A HARMONIC SUM OVER NONTRIVIAL ZEROS OF THE RIEMANN ZETA-FUNCTION ⋮ Euler’s constant: Euler’s work and modern developments ⋮ Computational strategies for the Riemann zeta function ⋮ A bound for the error term in the Brent-McMillan algorithm

Uses Software

• Algorithm 524

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