No label defined (Q4377085)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1114500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1114500 |
Statements
9 February 1998
0 references
Dedekind eta functions
0 references
algorithms for approximating \(\pi\)
0 references
iterations
0 references
modular equations
0 references
0.8147557973861694
0 references
0.796385645866394
0 references
\textit{J. M. Borwein} and \textit{P. B. Borwein} have developed remarkably efficents algorithms for approximating \(\pi\) using connections with Ramanujan's work. They utilize a function \(\alpha(r)\) defined in terms of theta functions such that \(\alpha(r)\to 1/\pi\) as \(r\to \infty\). Modular equations for theta functions lead to \(p\)th order iterations based on \(\alpha (r)\). This paper constructs an infinite family of functions \(\alpha_p\), each of which leads to a \(p\)-th order iteration. For \(p=3\) and \(p=4\) this leads to iterations due to the Borweins that do not come from their function \(\alpha(r)\). For \(p=7\) a septic iteration occurs analogous to the cubic iteration. And for \(p=9\) they obtain a ninth order iteration that does not appear to come from iterating the cubic twice. Their method uses the computer and a symbolic algebra package to solve certain modular equations. For the entire collection see [Zbl 0872.00022].
0 references