About convergence of the algorithm of W. Borchardt
Authors:
Abstract
The W. Borchardt algorithm, which is a generalization of the arithmetic-geometric mean algorithm, was first introduced by Borchardt and then studied by I. Hettner.In these works, the Borchardt mean was studied for valid positive initial arguments. The study of the Borchardt mean from complex initial elements is devoted to the work of G. Genpert. The proof of convergence of the Borchardt algorithm is carried out by Geppert on the basis of geometric considerations.In the present paper we give an analytical proof of convergence of the Borchardt algorithm and consider cases of degeneracy of the algorithm.
Область исследования:
(Archived) Articles
Funding:
None
References
- Воhrchardt W. Monatsber. Konigl. Akad. Wiss., 1876, S. 611.
- Bohrchardt W. Abhandlung. Konigl. Akad. Wiss., 1878, S. 33.
- Hettner I. J. reine und angew. Math., 1880, Bd. 89, s. 221; Bd. 112, S. 89.
- Geppert H. J. reine und angew. Math., 1929, Bd. 161, S. 21.