Then, use iteration, with a1 taking the place of x and g1 taking the place of y. In this way, two sequences (an) and (gn) are defined:
These two sequences converge to the same number, which is the arithmetic–geometric mean of x and y; it is denoted by M(x, y), or sometimes by agm(x, y).
This can be used for algorithmic purposes as in the AGM method, which makes it possible to construct fast algorithms for calculating exponential and trigonometric functions, as well as some mathematical constants, in particular, to quickly compute .
To find the arithmetic–geometric mean of a0 = 24 and g0 = 6, first calculate their arithmetic and geometric means, thus:
and then iterate as follows:
The first five iterations give the following values:
n an gn 0 24 6 1 15 12 2 13.5 13.416407864998738178455042… 3 13.458203932499369089227521… 13.458139030990984877207090… 4 13.458171481745176983217305… 13.458171481706053858316334… 5 13.458171481725615420766820… 13.458171481725615420766806…
As can be seen, the number of digits in agreement (underlined) approximately doubles with each iteration. The arithmetic–geometric mean of 24 and 6 is the common limit of these two sequences, which is approximately 13.4581714817256154207668131569743992430538388544.
The geometric mean of two positive numbers is never bigger than the arithmetic mean (see inequality of arithmetic and geometric means); as a consequence, (gn) is an increasing sequence, (an) is a decreasing sequence, and gn ≤ M(x, y) ≤ an. These are strict inequalities if x ≠ y.
M(x, y) is thus a number between the geometric and arithmetic mean of x and y; it is also between x and y.
If r ≥ 0, then M(rx,ry) = r M(x,y).
There is an integral-form expression for M(x,y):
where K(k) is the complete elliptic integral of the first kind:
Indeed, since the arithmetic–geometric process converges so quickly, it provides an efficient way to compute elliptic integrals via this formula. In engineering, it is used for instance in elliptic filter design.
The geometric–harmonic mean can be calculated by an analogous method, using sequences of geometric and harmonic means. The arithmetic–harmonic mean can be similarly defined, but takes the same value as the geometric mean.
The arithmetic–geometric mean can be used to compute – among others – logarithms, complete and incomplete elliptic integrals of the first and second kind, and Jacobi elliptic functions.
Proof of existence
From the inequality of arithmetic and geometric means we can conclude that:
that is, the sequence gn is nondecreasing.
Furthermore, it is easy to see that it is also bounded above by the larger of x and y (which follows from the fact that both the arithmetic and geometric means of two numbers lie between them). Thus, by the monotone convergence theorem, the sequence is convergent, so there exists a g such that:
However, we can also see that:
Proof of the integral-form expression
This proof is given by Gauss. Let
Changing the variable of integration to , where
Thus, we have
The last equality comes from observing that .
Finally, we obtain the desired result
The AGM method
have the same limit:
the arithmetic–geometric mean, agm.
The number π
which can be computed without loss of precision using
Complete elliptic integral K(sinα)
Taking , yields the agm,
where K(k) is a complete elliptic integral of the first kind,
That is to say that this quarter period may be efficiently computed through the agm,
Using this property of the AGM along with the ascending transformations of Landen, Richard Brent suggested the first AGM algorithms for the fast evaluation of elementary transcendental functions (ex, cos x, sin x). Subsequently, many authors went on to study the use of the AGM algorithms.
- agm(24, 6) at WolframAlpha
- David A. Cox (2004). "The Arithmetic-Geometric Mean of Gauss". In J.L. Berggren; Jonathan M. Borwein; Peter Borwein. Pi: A Source Book. Springer. p. 481. ISBN 978-0-387-20571-7. first published in L'Enseignement Mathématique, t. 30 (1984), p. 275-330
- Hercules G. Dimopoulos (2011). Analog Electronic Filters: Theory, Design and Synthesis. Springer. pp. 147–155. ISBN 978-94-007-2189-0.
- Abramowitz, Milton; Stegun, Irene Ann, eds. (1983) [June 1964]. "Chapter 17". Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Applied Mathematics Series. 55 (Ninth reprint with additional corrections of tenth original printing with corrections (December 1972); first ed.). Washington D.C.; New York: United States Department of Commerce, National Bureau of Standards; Dover Publications. pp. 598–599. ISBN 978-0-486-61272-0. LCCN 64-60036. MR 0167642. LCCN 65-12253.
- King, Louis V. (1924). On The Direct Numerical Calculation Of Elliptic Functions And Integrals. Cambridge University Press.
- B. C. Carlson (1971). "Algorithms involving arithmetic and geometric means". Amer. Math. Monthly. 78: 496–505. MR 0283246. doi:10.2307/2317754.
- B. C. Carlson (1972). "An algorithm for computing logarithms and arctangents". Math.Comp. 26 (118): 543–549. MR 0307438. doi:10.2307/2005182.
- E. Salamin (1976). "Computation of π using arithmetic-geometric mean". Math. Comp. 30 (135): 565–570. MR 0404124. doi:10.2307/2005327.
- J. Landen (1775). "An investigation of a general theorem for finding the length of any arc of any conic hyperbola, by means of two elliptic arcs, with some other new and useful theorems deduced therefrom". Philosophical Transactions of the Royal Society. 65: 283–289. doi:10.1098/rstl.1775.0028.
- R. P. Brent (1976). "Fast Multiple-Precision Evaluation of Elementary Functions". J. Assoc. Comput. Mach. 23 (2): 242–251. CiteSeerX . MR 0395314. doi:10.1145/321941.321944.
- Borwein, J. M.; Borwein, P. B. (1987). Pi and the AGM. New York: Wiley. ISBN 0-471-83138-7. MR 0877728.
- Zoltán Daróczy, Zsolt Páles, (2002): "Gauss-composition of means and the solution of the Matkowski–Suto problem", Publ. Math. Debrecen 61(1-2) pp 157–218.
- M. Hazewinkel (2001), "Arithmetic–geometric mean process", in Hazewinkel, Michiel, Encyclopedia of Mathematics, Springer, ISBN 978-1-55608-010-4
- Weisstein, Eric W. "Arithmetic–Geometric mean". MathWorld.