Implementation of the Topological $\varepsilon $-Algorithm
Roger C. E. Tan · SIAM Journal on Scientific and Statistical Computing · 1988
A recent survey paper of D. A. Smith, W. F. Ford, and A. Sidi [SIAM Review, 29 (1987), pp. 199–233] found the topological $\varepsilon $-algorithm (TEA) to compare very unfavourably with certain other methods for the acceleration of vector sequences. It is suggested that this poor performance of the TEA is due to an error in implementation. When this error is removed the method is found to perform at least as well as the other methods in most situations.