Convergence acceleration from the point of view of linear programming
- 23 Downloads
The best possible bounds for the sum of an alternating series with completely monotonic terms, when 2N terms have been computed, are determined. It is shown that their difference decreases exponentially withN. Various generalizations are indicated. The optimal application of Euler's transformation is also discussed. The error of that method also decreases exponentially, though the logarithmic decrement is only about 2/3 compared with the best possible error bounds.
KeywordsComputational Mathematic Error Bound Optimal Application Logarithmic Decrement Convergence Acceleration
Unable to display preview. Download preview PDF.
- 1.Aitken, A. C.,On Bernoulli's Numerical Solution of Algebraic Equations, Proc. Roy. Soc., Edinburgh. Vol. 46 (1926), p. 289–305.Google Scholar
- 2.Gass, S. I.,Linear Programming, Methods and Applications, McGraw-Hill, New York, Toronto, London (1958), chapter 5.Google Scholar
- 3.Lysegård, A.,Problemsamling i Numerisk analys, Lund (1963), p. 25–27.Google Scholar
- 4.Shanks, D.,Non-Linear Transformations of Divergent and Slowly Convergent Series, Journ. of Math. and Phys., Vol. 34 (1955), p. 1–42.Google Scholar
- 5.Shohat, J. A. and Tamarkin, J. D.,The problem of moments, American Mathematical Society, Providence (1943).Google Scholar
- 6.Todd, J.,Survey of Numerical Analysis, McGraw-Hill (1962).Google Scholar
- 7.Widder, D. V.,The Laplace Transform, Princton (1946).Google Scholar
- 8.Wynn, P.,Acceleration techniques in numerical analysis, Proc. of IFIP Congress 62, p. 149–155.Google Scholar