Wynn's epsilon algorithm

Summary

Wynn's epsilon algorithm is a recursive scheme that computes the values of the Shanks transformation without evaluating determinants. Each new entry of its table is computed from three earlier entries by one subtraction, one division and one addition. It is one of the most widely used nonlinear series acceleration methods.