To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Gauss–Legendre algorithm

From Wikipedia, the free encyclopedia

The Gauss–Legendre algorithm is an algorithm to compute the digits of π. It is notable for being rapidly convergent, with only 25 iterations producing 45 million correct digits of π. However, it has some drawbacks (for example, it is 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 π.

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 roots. It repeatedly replaces two numbers by their arithmetic and geometric mean, in order to approximate their arithmetic-geometric mean.

The version presented below is also known as the Gauss–Euler, Brent–Salamin (or Salamin–Brent) algorithm;[1] it was independently discovered in 1975 by Richard Brent and 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.

YouTube Encyclopedic

  • 1/3
    Views:
    70 745
    65 439
    100 413
  • Quick Revision of Gauss Quadrature Formula| Direct Example| One point|Two Point| Three Point Formula
  • Gaussian Quadrature | Lecture 40 | Numerical Methods for Engineers
  • Chapter 07.05: Lesson: Two Point Gauss Quadrature Rule: Example

Transcription

Algorithm

  1. Initial value setting:
  2. Repeat the following instructions until the difference of and is within the desired accuracy:
  3. π is then approximated as:

The first three iterations give (approximations given up to and including the first incorrect digit):

The algorithm has quadratic convergence, which essentially means that the number of correct digits doubles with each iteration of the algorithm.

Mathematical background

Limits of the arithmetic–geometric mean

The arithmetic–geometric mean of two numbers, a0 and b0, is found by calculating the limit of the sequences

which both converge to the same limit.
If and then the limit is where is the complete elliptic integral of the first kind

If , , then

where is the complete elliptic integral of the second kind:

and

Gauss knew of these two results.[2] [3] [4]

Legendre’s identity

Legendre proved the following identity:

[2]

Elementary proof with integral calculus

The Gauss-Legendre algorithm can be proven to give results converging to π using only integral calculus. This is done here[5] and here.[6]

See also

References

  1. ^ Brent, Richard, Old and New Algorithms for pi, Letters to the Editor, Notices of the AMS 60(1), p. 7
  2. ^ a b Brent, Richard (1975), Traub, J F (ed.), "Multiple-precision zero-finding methods and the complexity of elementary function evaluation", Analytic Computational Complexity, New York: Academic Press, pp. 151–176, archived from the original on 23 July 2008, retrieved 8 September 2007
  3. ^ Salamin, Eugene, Computation of pi, Charles Stark Draper Laboratory ISS memo 74–19, 30 January 1974, Cambridge, Massachusetts
  4. ^ Salamin, Eugene (1976), "Computation of pi Using Arithmetic–Geometric Mean", Mathematics of Computation, vol. 30, no. 135, pp. 565–570, doi:10.2307/2005327, ISSN 0025-5718, JSTOR 2005327
  5. ^ Lord, Nick (1992), "Recent Calculations of π: The Gauss-Salamin Algorithm", The Mathematical Gazette, 76 (476): 231–242, doi:10.2307/3619132, JSTOR 3619132, S2CID 125865215
  6. ^ Milla, Lorenz (2019), Easy Proof of Three Recursive π-Algorithms, arXiv:1907.04110
This page was last edited on 12 December 2023, at 07:56
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.