Analogues of the Brent-Salamin algorithm for evaluating \(\pi\) (Q746388)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6495133
Language Label Description Also known as
default for all languages
No label defined
    English
    Analogues of the Brent-Salamin algorithm for evaluating \(\pi\)
    scientific article; zbMATH DE number 6495133

      Statements

      Analogues of the Brent-Salamin algorithm for evaluating \(\pi\) (English)
      0 references
      0 references
      16 October 2015
      0 references
      The Brent-Salamin algorithm is a method to compute the digits of \(\pi\). The algorithm involves the Gauss Arithmetic-Geometric Mean (AGM) iteration and was proved by Brent and Salamin using identities of elliptic integrals. The author gives an alternative proof of the Brent-Salamin algorithm using identities of the Jacobi theta functions, which are known to be related to elliptic integrals. The author's proof is somewhat involved but as a by-product several new AGM iterations for computing \(\pi\) are derived. Also, some comparisons are made with AGM iterations for computing \(\pi\) due to the Borweins.
      0 references
      Brent-Salamin algorithm
      0 references
      elliptic integrals
      0 references
      hypergeometric series
      0 references
      theta series
      0 references
      modular equations
      0 references

      Identifiers