Numerical results on relations between fundamental constants using a new algorithm

DOI10.1090/S0025-5718-1989-0979934-9zbMath0687.10002OpenAlexW4243745139MaRDI QIDQ4205483

David H. Bailey, Helaman R. P. Ferguson

Publication date: 1989

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

Full work available at URL: https://doi.org/10.2307/2008727

zbMATH Keywords

algorithmconstantsintegral relationsEuler's constantcomputational number theorylattice approximationmultiprecision computationsimaginary part of the first complex zeroRiemann's zeta-function evaluated at 3

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Transcendence (general theory) (11J81) Software, source code, etc. for problems pertaining to number theory (11-04) Evaluation of number-theoretic constants (11Y60) Analytic computations (11Y35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiprocessor FFTs
• Quantitative universality for a class of nonlinear transformations
• The Arithmetic-Geometric Mean and Fast Computation of Elementary Functions
• Disproof of the Mertens conjecture.
• A Short Proof of the Existence of Vector Euclidean Algorithms
• The Computation of π to 29,360,000 Decimal Digits Using Borweins' Quartically Convergent Algorithm
• Numerical results on the transcendence of constants involving 𝜋,𝑒, and Euler’s constant
• A noninductive GL(n, Z) algorithm that constructs integral linear relations for n Z-linearly dependent real numbers
• Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two

This page was built for publication: Numerical results on relations between fundamental constants using a new algorithm