Content deleted Content added
m Reverted edits by 117.96.230.221 to last revision by Michael Hardy (HG) |
m fixed redirect |
||
Line 3:
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]].
The version presented below is also known as the '''Brent–Salamin (or Salamin–Brent) algorithm'''; it was independently discovered in 1975 by [[Richard Brent (scientist) | Richard Brent]] and [[Eugene Salamin (mathematician)|Eugene Salamin]]. It was used to compute the first 206,158,430,000 decimal digits of π on September 18 to 20, 1999, and the results were checked with [[Borwein's algorithm]].
1. Initial value setting:
| |||