PIMS/ AMI Seminar: Claude Brezinski

When a sequence of numbers is slowly converging and when it is impossible to have access to the process producing it, it can be transformed, by a sequence transformation, into a new sequence which, under some assumptions, converges faster to the same limit. Among these general techniques is Shanks' transformation (Shanks, 1949, 1955) which is arguably the best all-purpose method for accelerating convergence of sequences. First, this transformation will be explained. Then, we will see how it can be recursively implemented by the ?-algorithm of Wynn (1956). This algorithm can be transformed to treat sequences of vectors (Wynn, 1962). But, since its algebraic theory is quite complicated, another way to extend Shanks transformation to sequences of elements of a general vector space was proposed (C.B., 1975). This topological Shanks transformation was recently overgeneralized, and it gave rise to a framework including many well-known methods transformations such as the MMPE, the MPE, the RRE, and others (C.B., M.R.-Z., Y. Saad, 2017). Finally, we will see how the topological Shanks transformation can be recursively implemented by the topological ?-algorithm (C.B., 1975) whose rules will be described.

This is a joint work with Michela Redivo-Zaglia, Università di Padova, Italia and Yousef Saad, University of Minnesota, USA