Efficient algorithm for summation of some slowly convergent series

摘要

The 2 transformation, introduced recently by Wozny and Nowak, may serve as a good tool for summation of slowly convergence series. This approach can be easily applied to the case of generalized or basic hypergeometric series, as well as some orthogonal polynomial expansions. It is closely related to the famous Wynn's epsilon algorithm, Weniger's or Homeier's transformations, and the method introduced by Cizek, Zamastil and Skala. However, it is difficult to use the algorithm proposed by Wozny and Nowak in the general case, because of its high complexity, and some other restrictions. We propose another realization of the ￡ transformation, which results in obtaining a simpler and faster algorithm. Four illustrative numerical examples are given.