Minimal Polynomial and Reduced Rank Extrapolation Methods Are Related
Avram Sidi

TL;DR
This paper explores the theoretical relationship between Minimal Polynomial Extrapolation (MPE) and Reduced Rank Extrapolation (RRE), revealing conditions under which they are related and how their approximations are interconnected.
Contribution
It establishes new, general connections between MPE and RRE, including conditions for stagnation and explicit formulas linking their approximations, applicable in weighted inner product spaces.
Findings
RRE stagnates if and only if MPE approximation does not exist.
When MPE exists, RRE and MPE approximations are linearly related with positive scalar coefficients.
Results generalize known connections between Arnoldi and GMRES methods.
Abstract
Minimal Polynomial Extrapolation (MPE) and Reduced Rank Extrapolation (RRE) are two polynomial methods used for accelerating the convergence of sequences of vectors . They are applied successfully in conjunction with fixed-point iterative schemes in the solution of large and sparse systems of linear and nonlinear equations in different disciplines of science and engineering. Both methods produce approximations to the limit or antilimit of that are of the form with , for some scalars . The way the two methods are derived suggests that they might, somehow, be related to each other; this has not been explored so far, however. In this work, we tackle this issue and show that the vectors and produced by the two methods are related in more than one way, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
