Approximating with Ramanujan's modular equations

DOI10.1216/RMJ-1989-19-1-93MaRDI QIDQ1264170zbMATH OpenFDO

Authors Peter Borwein, Jonathan M. Borwein

Publication date 1989

Published in Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1216/RMJ-1989-19-1-93

zbMATH Keywords

high-order convergencemodular equationsmodular identityRamanujan

Mathematics Subject Classification ID

Modular and automorphic functions (11F03) Evaluation of number-theoretic constants (11Y60) Elliptic functions and integrals (33E05)

Review text

An algorithm for computing \(\pi\), with fifth-order convergence, is given: it is based on a modular identity due to Ramanujan. A seventh-order algorithm is sketched.

Recommendations

• Some Modular Identities of Ramanujan useful in Approximating &#960
• Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi
• Ramanujan type \(1/\pi\) approximation formulas
• Explicit Ramanujan-type approximations to pi of higher order
• A modular proof of two of Ramanujan's formulae for \(1/ \pi\)
• scientific article; zbMATH DE number 1114500
• scientific article; zbMATH DE number 1114498

Cited in

(4)

• Birth, growth and computation of pi to ten trillion digits
• scientific article; zbMATH DE number 1114498 (Why is no real title available?)
• The Rogers-Ramanujan continued fraction and a quintic iteration for $1/\pi$
• Cubic and quintic analogues of Ramanujan's septic theta function identity

This page was built for publication: Approximating \(\pi\) with Ramanujan's modular equations

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