Gauss–Legendre algorithm: Difference between revisions

Revision as of 01:12, 26 February 2022

Revision as of 17:31, 7 June 2022

Line 1:

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, theit drawbackhas issome thatdrawbacks (for example, it is [[Random-access_memory|computer memory]]-intensive) and therefore sometimesall [[Machinrecord-likebreaking formulas]]calculations aresince 2009 have used the [[Chudnovsky algorithm]] instead.

The method is based on the individual work of [[Carl Friedrich Gauss]] (1777–1855) and [[Adrien-Marie Legendre]] (1752–1833) combined with modern algorithms for multiplication and [[square root]]s. It repeatedly replaces two numbers by their [[arithmetic mean|arithmetic]] and [[geometric mean]], in order to approximate their [[arithmetic-geometric mean]].