Arithmetic–geometric mean

From Wikipedia, the free encyclopedia
(Redirected from AGM method)
Jump to navigation Jump to search
File:Generalized means + agm.png
Plot of the arithmetic–geometric mean agm(1,x) among several generalized means.

In mathematics, the arithmetic–geometric mean (AGM or agM[1]) of two positive real numbers x and y is the mutual limit of a sequence of arithmetic means and a sequence of geometric means. The arithmetic–geometric mean is used in fast algorithms for exponential, trigonometric functions, and other special functions, as well as some mathematical constants, in particular, computing π.

The AGM is defined as the limit of the interdependent sequences ai and gi. Assuming xy0, we write:a0=x,g0=yan+1=12(an+gn),gn+1=angn.These two sequences converge to the same number, the arithmetic–geometric mean of x and y; it is denoted by M(x, y), or sometimes by agm(x, y) or AGM(x, y).

The arithmetic–geometric mean can be extended to complex numbers and, when the branches of the square root are allowed to be taken inconsistently, it is a multivalued function.[1]

Example

[edit | edit source]

To find the arithmetic–geometric mean of a0 = 24 and g0 = 6, iterate as follows:a1=12(24+6)=15g1=246=12a2=12(15+12)=13.5g2=1512=13.416 407 8649The first five iterations give the following values:

n an gn
0 24 6
1 15 12
2 13.5 13.416 407 864 998 738 178 455 042...
3 13.458 203 932 499 369 089 227 521... 13.458 139 030 990 984 877 207 090...
4 13.458 171 481 745 176 983 217 305... 13.458 171 481 706 053 858 316 334...
5 13.458 171 481 725 615 420 766 820... 13.458 171 481 725 615 420 766 806...

The number of digits in which an and gn agree (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.[2]

History

[edit | edit source]

The first algorithm based on this sequence pair appeared in the works of Joseph-Louis Lagrange. Its properties were further analyzed by Carl Friedrich Gauss.[1]

Properties

[edit | edit source]

Both the geometric mean and arithmetic mean of two positive numbers x and y are between the two numbers. (They are strictly between when xy.) The geometric mean of two positive numbers is never greater than the arithmetic mean.[3] So the geometric means are an increasing sequence g0g1g2 ≤ ...; the arithmetic means are a decreasing sequence a0a1a2 ≥ ...; and gnM(x, y) ≤ an for any n. These are strict inequalities if xy.

M(x, y) is thus a number between x and y; it is also between the geometric and arithmetic mean of x and y.

If r ≥ 0 then M(rx, ry) = r M(x, y).

There is an integral-form expression for M(x, y):[4]M(x,y)=π2(0π2dθx2cos2θ+y2sin2θ)1=π(0dtt(t+x2)(t+y2))1=π4x+yK(xyx+y)where K(k) is the complete elliptic integral of the first kind:K(k)=0π2dθ1k2sin2θSince the arithmetic–geometric process converges so quickly, it provides an efficient way to compute elliptic integrals, which are used, for example, in elliptic filter design.[5]


The arithmetic–geometric mean is connected to the Jacobi theta function θ3 by[6]M(1,x)=θ32(exp(πM(1,x)M(1,1x2)))=(nexp(n2πM(1,x)M(1,1x2)))2,which upon setting x=1/2 givesM(1,1/2)=(nen2π)2.

[edit | edit source]

The reciprocal of the arithmetic–geometric mean of 1 and the square root of 2 is Gauss's constant.1M(1,2)=G=0.8346268In 1799, Gauss proved[note 1] thatM(1,2)=πϖwhere ϖ is the lemniscate constant.


In 1941, M(1,2) (and hence G) was proved transcendental by Theodor Schneider.[note 2][7][8] The set {π,M(1,1/2)} is algebraically independent over ,[9][10] but the set {π,M(1,1/2),M(1,1/2)} (where the prime denotes the derivative with respect to the second variable) is not algebraically independent over . In fact,[11]π=22M3(1,1/2)M(1,1/2).The geometric–harmonic mean GH can be calculated using analogous sequences of geometric and harmonic means, and in fact GH(x, y) = 1/M(1/x, 1/y) = xy/M(x, y).[12] The arithmetic–harmonic mean is equivalent to 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,[13] and Jacobi elliptic functions.[14]

Proof of existence

[edit | edit source]

The inequality of arithmetic and geometric means implies thatgnanand thusgn+1=gnangngn=gnthat is, the sequence gn is nondecreasing and bounded above by the larger of x and y. By the monotone convergence theorem, the sequence is convergent, so there exists a g such that:limngn=gHowever, we can also see that:an=gn+12gn and so: limnan=limngn+12gn=g2g=g

Q.E.D.

Proof of the integral-form expression

[edit | edit source]

This proof is given by Gauss.[1] Let

I(x,y)=0π/2dθx2cos2θ+y2sin2θ,

Changing the variable of integration to θ, where

sinθ=2xsinθ(x+y)+(xy)sin2θd(sinθ)=d(2xsinθ(x+y)+(xy)sin2θ)cosθ dθ=2x(x+y)(xy)sin2θ((x+y)+(xy)sin2θ)2 cosθdθ

cosθ=(x+y)22(x2+y2)sin2θ+(xy)2sin4θ(x+y)+(xy)sin2θ=cosθ(xy)2cos2θ+4xy(x+y)+(xy)sin2θ=cosθ(x+y)2cos2θ+4xysin2θ(x+y)+(xy)sin2θ,

cosθ dθ=cosθ(x+y)2cos2θ+4xysin2θ(x+y)+(xy)sin2θ dθ=2x(x+y)(xy)sin2θ((x+y)+(xy)sin2θ)2 cosθdθ,

dθ=x((x+y)(xy)sin2θ)((x+y)+(xy)sin2θ)2dθ(x+y)2cos2θ+4xysin2θ ,

x2cos2θ+y2sin2θ=x2((x+y)22(x2+y2)sin2θ+(xy)2sin4θ)+4x2y2sin2θ((x+y)+(xy)sin2θ)=x((x+y)(xy)sin2θ)((x+y)+(xy)sin2θ)

This yields dθx2cos2θ+y2sin2θ=2dθ(x+y)2cos2θ+4xysin2θ=dθ((x+y2)2cos2θ+(xy)2sin2θ,

gives

I(x,y)=0π/2dθ((x+y2)2cos2θ+(xy)2sin2θ=I(x+y2,xy).

Thus, we have

I(x,y)=I(a1,g1)=I(a2,g2)==I(M(x,y),M(x,y))=π/(2M(x,y)). The last equality comes from observing that I(z,z)=π/(2z).

Finally, we obtain the desired result

M(x,y)=π/(2I(x,y)).

Applications

[edit | edit source]

The number π

[edit | edit source]

According to the Gauss–Legendre algorithm,[15]

π=4M(1,1/2)21j=12j+1cj2,

where

cj=12(aj1gj1),

with a0=1 and g0=1/2, which can be computed without loss of precision using

cj=cj124aj.

Complete elliptic integral K(sinα)

[edit | edit source]

Taking a0=1 and g0=cosα yields the AGM

M(1,cosα)=π2K(sinα),

where K(k) is a complete elliptic integral of the first kind:

K(k)=0π/2(1k2sin2θ)1/2dθ.

That is to say that this quarter period may be efficiently computed through the AGM, K(k)=π2M(1,1k2).

Other applications

[edit | edit source]

Using this property of the AGM along with the ascending transformations of John Landen,[16] Richard P. Brent[17] 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.[18]

See also

[edit | edit source]

References

[edit | edit source]

Notes

[edit | edit source]
  1. ^ By 1799, Gauss had two proofs of the theorem, but neither of them was rigorous from the modern point of view.
  2. ^ In particular, he proved that the beta function B(a,b) is transcendental for all a,b such that a+b0. The fact that M(1,2) is transcendental follows from M(1,2)=12B(12,34).

Citations

[edit | edit source]
  1. ^ a b c d Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ agm(24, 6) at Wolfram Alpha
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)..
  5. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  6. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). pages 35, 40
  7. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  8. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  9. ^ G. V. Choodnovsky: Algebraic independence of constants connected with the functions of analysis, Notices of the AMS 22, 1975, p. A-486
  10. ^ G. V. Chudnovsky: Contributions to The Theory of Transcendental Numbers, American Mathematical Society, 1984, p. 6
  11. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). p. 45
  12. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  13. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  14. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  15. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  16. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  17. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  18. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).

Sources

[edit | edit source]
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).