Content deleted Content added
Reverted 2 edits by 2001:4DD4:FA27:0:B5FF:B0BC:C0CB:27CA (talk) to last revision by Citation bot |
Importing Wikidata short description: "Quadratically converging iterative algorithm for computing π" |
||
Line 1:
{{Short description|Quadratically converging iterative algorithm for computing π}}
The '''Gauss–Legendre algorithm''' is an [[algorithm]] to compute the digits of [[Pi|{{pi}}]]. It is notable for being rapidly convergent, with only 25 iterations producing 45 million correct digits of {{pi}}. However, it has some drawbacks (for example, it is [[Random-access_memory|computer memory]]-intensive) and therefore all record-breaking calculations for many years have used other methods, almost always the [[Chudnovsky algorithm]]. For details, see [[chronology of computation of π|Chronology of computation of {{pi}}]].
| |||