Chudnovsky algorithm

Chudnovsky algorithm

The Chudnovsky algorithm is a fast method for calculating the digits of π. It was used by the Chudnovsky brothers to calculate more than one billion digits. It was the algorithm used in world record calculations of 2.7 trillion and 5 trillion digits of π in December 2009 and August 2010 respectively.

The algorithm is based on the following rapidly convergent generalized hypergeometric series:

 \frac{1}{\pi} = 12 \sum^\infty_{k=0} \frac{(-1)^k (6k)! (13591409 + 545140134k)}{(3k)!(k!)^3 640320^{3k + 3/2}}.\!

This identity is very similar to some of Ramanujan's formulae involving π.

See also

References



Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Chudnovsky brothers — The Chudnovsky brothers (both born in Kiev; David Volfovich in 1947; Gregory Volfovich in 1952) are American mathematicians known for their wide mathematical ability, their home built supercomputers, and their close working relationship. Careers… …   Wikipedia

  • Approximations of π — Timeline of approximations for pi …   Wikipedia

  • Chronology of computation of π — The table below is a brief chronology of computed numerical values of, or bounds on, the mathematical constant pi (π). See the history of numerical approximations of pi for explanations, comments and details concerning some of the calculations… …   Wikipedia

  • Numerical approximations of π — This page is about the history of numerical approximations of the mathematical constant pi;. There is a summarizing table at chronology of computation of pi;. See also history of pi; for other aspects of the evolution of our knowledge about… …   Wikipedia

  • List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

  • List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

  • Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and …   Wikipedia

  • Even-hole-free graph — In the mathematical area of graph theory, a graph is even hole free if it contains no induced cycle with an even number of vertices. Every even hole free graph contains a bisimplicial vertex. [citation last1 = Addario Berry | first1 = Louigi… …   Wikipedia

  • Computing π — Similarly, the more complex approximations of π given below involve repeated calculations of some sort, yielding closer and closer approximations with increasing numbers of calculations.Continued fractionsBesides its simple continued fraction… …   Wikipedia

  • Perfect graph — The Paley graph of order 9, colored with three colors and showing a clique of three vertices. In this graph and each of its induced subgraphs the chromatic number equals the clique number, so it is a perfect graph. In graph theory, a perfect… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”