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

DOI10.2307/2007932zbMath0641.10002OpenAlexW4248603331MaRDI 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 theorycomputation of \(\pi \)NASA Ames Research CenterCray-2distribution of the decimal digitsmulti-precision techniquesstatistical analysis of digits

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Software, source code, etc. for problems pertaining to number theory (11-04) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Software, source code, etc. for problems pertaining to numerical analysis (65-04) Acceleration of convergence in numerical analysis (65B99)

Related Items

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

This page was built for publication: The Computation of π to 29,360,000 Decimal Digits Using Borweins' Quartically Convergent Algorithm