Numerical results on relations between fundamental constants using a new algorithm

DOI10.1090/S0025-5718-1989-0979934-9MaRDI QIDQ4205483zbMATH OpenOpenAlexFDO

Authors D. H. Bailey, Helaman 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

algorithmcomputational number theoryconstantsEuler's constantimaginary part of the first complex zerointegral relationslattice approximationmultiprecision computationsRiemann's zeta-function evaluated at 3

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1114499
• Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function
• Analysis of PSLQ, an integer relation finding algorithm
• Integer Relations Among Algebraic Numbers
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers

Cites work

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

Cited in

(7)

• The complexity of number-theoretic constants
• Precise error estimate of the Brent-McMillan algorithm for Euler's constant
• On the fast computing of some constants
• Numerical results on the transcendence of constants involving 𝜋,𝑒, and Euler’s constant
• scientific article; zbMATH DE number 1114499 (Why is no real title available?)
• Numerical approximation of the Masser-Gramain constant to four decimal digits: \(\delta= 1.819\dots\)
• Multiple zeta values

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

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