An algorithm for the summation of series (Q1098220): Difference between revisions

In the context of the transformation of power series of the form \(\sum^{\infty}_{k=0}u(k)x^ k\) it is shown that the expressions \(T(x| n)=\sum^{2n-1}_{k=0}\alpha (x| n,k)u(k)x^ k\) where \(\alpha (x| n,k)=(1-x)^{-n}\sum^{2n-k-1}_{r=0}\left( \begin{matrix} n\\ r\end{matrix} \right)(-x)^ r\) may be constructed by setting \(W(x| m,0)=\sum^{m-1}_{k=0}u(k)x^ k\) \((m=0,1,...)\) and using the relationship \(W(x| m,n+1)=(1-x)^{-1}\{W(x| m+2,n)-xW(x| m+1,n)\}\) \((m=0,1,...;n=0,...,m)\), for then \(T(x| n)=W(x| 0,n)\) \((n=0,1,...)\).