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≤i≤s, 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.