Iterated Gauss-Seidel GMRES
Stephen Thomas, Erin Carson, Miro Rozlo\v{z}n\'ik, Arielle Carr, Kasia, \'Swirydowicz

TL;DR
This paper introduces IGS-GMRES, an iterated Gauss-Seidel variant of GMRES that maintains backward stability and high orthogonality of Krylov basis vectors, suitable for large-scale parallel computing.
Contribution
It presents a novel IGS-GMRES algorithm that improves orthogonality and stability over traditional methods, with efficient implementation for parallel environments.
Findings
Maintains orthogonality to O(ε) or O(ε)κ(B_k) depending on iterations.
Ensures Krylov basis vectors are close to orthogonal with high precision.
Prevents residual stagnation in highly non-normal systems.
Abstract
The GMRES algorithm of Saad and Schultz (1986) is an iterative method for approximately solving linear systems , with initial guess and residual . The algorithm employs the Arnoldi process to generate the Krylov basis vectors (the columns of ). It is well known that this process can be viewed as a factorization of the matrix at each iteration. Despite an loss of orthogonality, for unit roundoff and condition number , the modified Gram-Schmidt formulation was shown to be backward stable in the seminal paper by Paige et al. (2006). We present an iterated Gauss-Seidel formulation of the GMRES algorithm (IGS-GMRES) based on the ideas of Ruhe (1983) and \'{S}wirydowicz et al. (2020). IGS-GMRES maintains orthogonality to the level…
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.
Taxonomy
TopicsMatrix Theory and Algorithms · Advanced Optimization Algorithms Research · Parallel Computing and Optimization Techniques
