Fast summation of power series with coefficients analytic at infinity (Q5948209)

Let \(\mu\), \(\{\alpha_i\}\), \(\{\nu_i\}\) be parameters such that \(\mu\in \mathbb{R}\), \(\nu_i\geq 0\) and \(\alpha_i\in \mathbb{C}\setminus \{-j_0, -j_0- 1,\dots\}\) for \(i= 1,\dots, s\); \(s\), \(j_0\in \mathbb{N}\). Let \(\phi\) be an analytic and nonvanishing function at \(\omega= \infty\). This paper presents a new asymptotic summation method (ASM) for slowly convergent power series of the form \[ \sum^\infty_{j= j_0} z^j\phi(n) j^\mu \prod^s_{i=1} (j+ \alpha_i)^{-\nu_i},\quad|z|\leq 1.\tag{1} \] The paper reports numerical tests for the case \(j_0= 1\), \(s= 2\), \(\alpha_1= 0.5\), \(\alpha_2= i\), considering three different functions \(w^\mu\phi(w)\) with the corresponding pairs \((\nu_1,\nu_2)\), \(\mu- \nu_1-\nu_2\geq -2\). The sums computed by the ASM have been compared with those given by the automatic summation tool of \textit{Mathematica} to confirm the precision. In order to illustrated the effectiveness of the ASM, it is compared with the Levin \(u\)-transform by calculating the computational costs ratio of both methods, correspondingly to different ``lengths'' of the asymptotic correction, in the summation of the series (1) when \(\phi(j) j^\mu= (j+ 1)(j+ 0.5)^{-1} (j^2+ j+ 1)^{-1}\), \(\nu_1= 1\), \(\nu_2= 0\), and \(z= \pm 1\). One of the purpose of the numerial results of the paper is to show that Fornberg's differentiation code for analytic functions and explicit asymptotic summation can be combined to produce a fast and reliable algorithm.