BIT Numerical Mathematics

, Volume 36, Issue 4, pp 766–774 | Cite as

A note on the summation of slowly convergent alternating series

  • D. A. MacDonald
Article

Abstract

Thekth term of the infinite series\(\sum\nolimits_{k = 0}^\infty {( - 1)^k [\ln (k + 2)]^{ - 0.1} }\) is larger than 0.5 wheneverk <k0, wherek0 + 1 =e1024. To sum this series correct to order 10−1 using direct summation seems an impossible task, notwithstanding the power of modern computers. This note will present an alternative approach to those classical methods (the Euler transformation is one) which can accurately sum such series. The theory to be presented has the added advantage of providing accurate bounds for the error in the approximate result. The method used will be Euler-Maclaurin summation, revitalised by computer algebra.

Key words

Summation slowly convergent alternating series Euler-Maclaurin formula 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Abramowitz and I. A. Stegun,Handbook of Mathematical Functions, Dover Publications Inc., New York, 1970.Google Scholar
  2. 2.
    C. Brezinski and M. Redivo Zaglia,Extrapolation Methods—Theory and Practice, Elsevier, North-Holland, Amsterdam, 1991.Google Scholar
  3. 3.
    T. J. I'A Bromwich,An Introduction to the Theory of Infinite Series, Macmillan, London, 1926.Google Scholar
  4. 4.
    G. Dahlquist, S.-Å. Gustafson, and K. Siklósi,Convergence acceleration from the point of view of linear programming, BIT, 5 (1965), pp. 1–16.Google Scholar
  5. 5.
    B. Gabuti,An algorithm for computing generalised Euler transformation of series, Computing, 34 (1985), pp. 107–116.Google Scholar
  6. 6.
    W. Gautschi,A class of slowly convergent series and their summation by Gaussian quadrature, Math. Comp., 57 (1991), pp. 309–325.Google Scholar
  7. 7.
    C. C. Grosjean, An Euler-Maclaurin type asymptotic series expansion of the sum\(\sum\nolimits_{n = 2}^\infty {\frac{{( - 1)^n }}{{\ln n}}}\), Simon Stevin, 65 (1991), pp. 31–55.Google Scholar
  8. 8.
    S.-Å. Gustafson,Convergence acceleration on a general class of power series, Computing, 21 (1978), pp. 53–69.Google Scholar
  9. 9.
    F. B. Hildebrand,Introduction to Numerical Analysis, McGraw-Hill, New York, 1974.Google Scholar
  10. 10.
    M. Klamkin, ed.Problems and solutions, SIAM Review, 32 (1990), pp. 481–483.Google Scholar
  11. 11.
    R. E. Scraton,The practical use of the Euler transformation, BIT, 29 (1989), pp. 356–360.Google Scholar
  12. 12.
    E. T. Whittaker and G. N. Watson,A Course of Modern Analysis, C.U.P., Cambridge, 1927.Google Scholar
  13. 13.
    P. Wynn,A note on the generalised Euler transformation, Computer J., 14 (1971), pp. 437–441.Google Scholar

Copyright information

© BIT Foundation 1996

Authors and Affiliations

  • D. A. MacDonald
    • 1
  1. 1.Department of Applied Mathematics and Theoretical PhysicsThe University, LiverpoolUK

Personalised recommendations