Borwein's algorithm

From Free net encyclopedia

Revision as of 23:32, 27 March 2006; view current revision
←Older revision | Newer revision→

Borwein's algorithm is an algorithm devised by Jonathan and Peter Borwein to calculate the value of 1/π. See also Bailey-Borwein-Plouffe formula.

It works as follows:

  • Start out by setting
    <math>a_0 = 6 - 4\sqrt{2}</math>
    <math>y_0 = \sqrt{2} - 1</math>
  • Then iterate
    <math>y_{k+1} = \frac{1-(1-y_k^4)^{1/4}}{1+(1-y_k^4)^{1/4}}</math>
    <math>a_{k+1} = a_k(1+y_{k+1})^4 - 2^{2k+3} y_{k+1} (1 + y_{k+1} + y_{k+1}^2)</math>

Then ak converges quartically against 1/π; that is, each iteration approximately quadruples the number of correct digits.

See also