  We construct new sequence transformations based on Wynn's epsilon and rho
algorithms. The recursions of the new algorithms include the recursions of
Wynn's epsilon and rho algorithm and of Osada's generalized rho algorithm as
special cases. We demonstrate the performance of our algorithms numerically by
applying them to some linearly and logarithmically convergent sequences as well
as some divergent series.
