A fast algorithm based on the arithmetic-geometric mean
\textit{J. M. Borwein} and \textit{P. B. Borwein}'s algorithm [SIAM Rev. 26, 351-366 (1984; Zbl 0557.65009); \(\pi\) and the AGM. A study in analytic number theory and computational complexity (1987; Zbl 0611.10001)] for calculation of \(\pi\) is analyzed in detail. The algorithm is based on differentiation with respect to a parameter in the recursive relations that define Gauss arithmetic-geometric mean sequences. A more natural substantiation of the convergence of the algorithm (without any deviation into the complex plane) is presented. The authors give a more accurate estimate for the rate of convergence: \[ \pi_n- \pi< 10^{-2^{n+1}- 2^{n-1}+2}. \]
- A Simplified Version of the Fast Algorithms of Brent and Salamin
- The Arithmetic-Geometric Mean and Fast Computation of Elementary Functions
- The Borwein brothers, pi and the AGM
- Easy Proofs of Some Borwein Algorithms for π
- More Quadratically Converging Algorithms for π
- scientific article; zbMATH DE number 3992807 (Why is no real title available?)
- Numerical analysis of chords summation algorithm for \(\pi\) value
- Simple algorithms for computing
- Geometric Mean Algorithms Based on Harmonic and Arithmetic Iterations
- Analogues of the Brent-Salamin algorithm for evaluating \(\pi\)
This page was built for publication: A fast algorithm based on the arithmetic-geometric mean
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1974750)
