Submit an Article
Become a reviewer
Vol 43 Iss. 3
Pages:
26-32
Download volume:
RUS
Article

On convergence of W. Borchardt's algorithm

Authors:
M. I. Veinger
Date submitted:
1963-09-02
Date accepted:
1963-11-19
Date published:
1964-02-14

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 real positive initial arguments. The study of the Borchardt mean for complex initial elements is devoted to the work of G. Genpert. The proof of convergence of the Borchardt algorithm is carried out by Genpert 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

Go to volume 43

References

  1. Bohrchardt W. Monatsber. Konigl. Akad. Wiss., 1876, p. 611.
  2. Bohrchardt W. Abhandlung. Konigl. Akad. Wiss., 1878, p. 33.
  3. Hettner I. J. reine und angew. Math., 1880, vol. 89, p. 221; vol. 112, p. 89.
  4. Geppert H. J. reine und angew. Math., 1929, vol. 161, p. 21.

Similar articles

On the calculation of laminar boundary layer on bodies of revolution streamlined by a binary mixture of gases.
1964 L. A. Kulonen
Arithmetic-geometric mean algorithm
1964 A. M. Zhuravskii
On one way of integration of laminar boundary layer equations in incompressible fluid
1964 L. A. Kulonen
On Optimal Formulas of Numerical Quadrature for Stationary Random Functions
1964 L. S. Gandin, R. E. Soloveichik
On the Probability of Repetition of a Sequence of Random Signals
1964 M. L. Verzhbinskii
Some Questions on the Breakup of Free Jets
1964 V. Ya. Bril