Skip to main content
Log in

Fast Summation of Power Series with Coefficients Analytic at Infinity

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

We propose a fast summation algorithm for slowly convergent power series of the form ∑ j=j 0 z jφ j j μ i=1 s(j i )−ν i , where μ∈R, ν i ≥0 and α i C, 1≤is, are known parameters, and φ j =φ(j), φ being a given real or complex function, analytic at infinity. Such series embody many cases treated by specific methods in the recent literature on acceleration. Our approach rests on explicit asymptotic summation, started from the efficient numerical computation of the Laurent coefficients of φ. The effectiveness of the resulting method, termed ASM (Asymptotic Summation Method), is shown by several numerical tests.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. C. Brezinski and M. Redivo-Zaglia, Extrapolation Methods. Theory and Practice (North-Holland, Amsterdam, 1991).

    Google Scholar 

  2. S. Dassiè, M. Vianello and R. Zanovello, Asymptotic summation of power series, Numer. Math. 80 (1998) 61–73.

    Google Scholar 

  3. S. Dassiè, M. Vianello and R. Zanovello, A new summation method for power series with rational coefficients, Math. Comp. 69 (2000) 749–756.

    Google Scholar 

  4. B. Fornberg, Numerical differentiation of analytic functions, ACM Trans. Math. Software 7 (1981) 512–526.

    Google Scholar 

  5. W. Gautschi, Orthogonal polynomials: Applications and computation, Acta Numer. (1996) 45–119.

  6. P. Henrici, Fast Fourier methods in computational complex analysis, SIAM Rev. 21 (1979) 481–527.

    Google Scholar 

  7. P. Henrici, Applied and Computational Complex Analysis, Vol. 1 (Wiley, New York, 1984).

    Google Scholar 

  8. J.N. Lyness, Differentiation formulas for analytic functions, Math. Comp. 22 (1968) 352–362.

    Google Scholar 

  9. J.N. Lyness and C.B. Moler, Numerical differentiation of analytic functions, SIAM J. Numer. Anal. 4 (1967) 202–210.

    Google Scholar 

  10. F.W.J. Olver, Asymptotics and Special Functions (Academic Press, New York, 1974; reprinted by A.K. Peters, Wellesley, MA, 1997).

    Google Scholar 

  11. W.H. Press, B.P. Flannery, S.A. Teukolsky and W.T Vetterling, Numerical Recipes in FORTRAN. The Art of Scientific Computing, 2nd edn. (Cambridge Univ. Press, Cambridge, 1992).

    Google Scholar 

  12. A. Sidi, Analysis of convergence of the T-transformation for power series, Math. Comp. 35 (1980) 833–850.

    Google Scholar 

  13. D.A. Smith and W.F. Ford, Acceleration of linear and logarithmic convergence, SIAMJ. Numer. Anal. 16 (1979) 223–240.

    Google Scholar 

  14. D.A. Smith and W.F. Ford, Numerical comparison of nonlinear convergence accelerators, Math. Comp. 38 (1982) 481–499.

    Google Scholar 

  15. S. Wolfram, Mathematica: A System for DoingMathematics by Computer, 2nd edn. (Addison-Wesley, Reading, MA, 1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sommariva, A., Vianello, M. & Zanovello, R. Fast Summation of Power Series with Coefficients Analytic at Infinity. Numerical Algorithms 27, 77–87 (2001). https://doi.org/10.1023/A:1016738517989

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016738517989

Navigation