Explicit Ramanujan-type approximations to pi of higher order (Q1108311): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3751634 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5518575 / rank | |||
Normal rank | |||
Latest revision as of 18:51, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Explicit Ramanujan-type approximations to pi of higher order |
scientific article |
Statements
Explicit Ramanujan-type approximations to pi of higher order (English)
0 references
1987
0 references
The authors record the results of their systematic attempts to exploit Ramanujan's Nth order modular equations for \(N=3,7,11,15\) and 23 to make explicit, in very simple form, recursive algebraic approximations to \(\pi\) that exhibit a staggering rate of convergence. [See also their recent article in Ramanujan revisited, Proc. Conf., Urbana-Champaign/Illinois 1987, 359-374 (1988; Zbl 0652.10019).]
0 references
Ramanujan's Nth order modular equations
0 references
recursive algebraic approximations to \(\pi \)
0 references
0 references
