The Computation of π to 29,360,000 Decimal Digits Using Borweins' Quartically Convergent Algorithm

DOI10.2307/2007932zbMath0641.10002MaRDI QIDQ3781812

David H. Bailey

Publication date: 1988

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

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

zbMATH Keywords

computational number theory; computation of \(\pi \); NASA Ames Research Center; Cray-2; distribution of the decimal digits; multi-precision techniques; statistical analysis of digits

Mathematics Subject Classification ID

11A63: Radix representation; digital problems

11-04: Software, source code, etc. for problems pertaining to number theory

11K16: Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc.

65-04: Software, source code, etc. for problems pertaining to numerical analysis

65B99: Acceleration of convergence in numerical analysis

Related Items

Congruent Number Theta Coefficients to 1012, A multiprecise integer arithmetic package, Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era, The quest for pi, Birth, growth and computation of pi to ten trillion digits, Multiprecision arithmetic using fast Hartley transforms, The method for solving fixed point problem of \(G\)-nonexpansive mapping in Hilbert spaces endowed with graphs and numerical example, Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era, An algorithm for multiple-precision floating-point multiplication, The Borwein Brothers, Pi and the AGM, Numerical results on relations between fundamental constants using a new algorithm