Contenido de sensagent
Publicidad ▼
Investigaciones anteriores en el diccionario :
computado en 0,031s
|
|
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (April 2009) |
In mathematics, Borwein's algorithm is an algorithm devised by Jonathan and Peter Borwein to calculate the value of 1/π.
Contents |
Start out by setting[citation needed]

Then

Each additional term of the series yields approximately 50 digits.
Start out by setting[citation needed]

Then iterate

Then ak converges cubically to 1/π; that is, each iteration approximately triples the number of correct digits.
Start out by setting[citation needed]

Then

Each additional term of the partial sum yields approximately 31 digits.
Start out by setting[1]
![\begin{align} x_0 & = \sqrt2 \\
y_1 & = \sqrt[4]2 \\
p_0 & = 2+\sqrt2
\end{align}](http://bin.sensegates.com/s/5/d/2/5d2a9c17bb1eb65506e09c0eb5fee73a.png)
Then iterate

Then pk converges monotonically to π; with pk - π ≈ 10−2k+1 for k ≥ 2.s
Start out by setting[2]

Then iterate

Then ak converges quartically against 1/π; that is, each iteration approximately quadruples the number of correct digits.
Start out by setting[3]

Then iterate

Then pk converges quartically to π; that is, each iteration approximately quadruples the number of correct digits. The algorithm is not self-correcting; each iteration must be performed with the desired number of correct digits of π.
Start out by setting[citation needed]

Then iterate

Then ak converges quintically to 1/π (that is, each iteration approximately quintuples the number of correct digits), and the following condition holds:

Start out by setting[citation needed]

Then iterate

Then ak converges nonically to 1/π; that is, each iteration approximately multiplies the number of correct digits by nine.
Publicidad ▼