Kummer's transformation of series

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics, specifically in the field of numerical analysis, Kummer's transformation of series is a method used to accelerate the convergence of an infinite series. The method was first suggested by Ernst Kummer in 1837.

Technique

Let A=∑n=1∞an be an infinite sum whose value we wish to compute, and let B=∑n=1∞bn be an infinite sum with comparable terms whose value is known. If the limit γ:=limn→∞anbn exists, then an−γbn is always also a sequence going to zero and the series given by the difference, ∑n=1∞(an−γbn), converges. If γ≠0, this new series differs from the original ∑n=1∞an and, under broad conditions, converges more rapidly.[1] We may then compute A as

A=γB+∑n=1∞(an−γbn),

where γB is a constant. Where an≠0, the terms can be written as the product (1−γbn/an)an. If an≠0 for all n, the sum is over a component-wise product of two sequences going to zero,

A=γB+∑n=1∞(1−γbn/an)an.

Example

Consider the Leibniz formula for π: 1−13+15−17+19−⋯=π4. We group terms in pairs as 1−(13−15)−(17−19)+⋯=1−2(115+163+⋯)=1−2A where we identify A=∑n=1∞116n2−1. We apply Kummer's method to accelerate A, which will give an accelerated sum for computing π=4−8A.

Let B=∑n=1∞14n2−1=13+115+⋯=12−16+16−110+⋯ This is a telescoping series with sum value Template:Frac. In this case γ:=limn→∞116n2−114n2−1=limn→∞4n2−116n2−1=14 and so Kummer's transformation formula above gives A=14⋅12+∑n=1∞(1−1414n2−1116n2−1)116n2−1=18−34∑n=1∞116n2−114n2−1 which converges much faster than the original series.

Coming back to Leibniz formula, we obtain a representation of π that separates 3 and involves a fastly converging sum over just the squared even numbers (2n)2, π=4−8A=3+6⋅∑n=1∞1(4(2n)2−1)((2n)2−1)=3+215+2315+65005+⋯

See also

References

Template:Reflist Template:Refbegin

Template:Refend


Template:Mathanalysis-stub

  1. ↑ Holy et al., On Faster Convergent Infinite Series, Mathematica Slovaca, January 2008