On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems
Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders

TL;DR
This paper introduces the GSOR method for solving complex saddle-point problems, providing convergence analysis, spectral bounds for preconditioners, and demonstrating effectiveness through numerical experiments.
Contribution
The paper develops the GSOR method for block saddle-point problems, offering new convergence conditions and spectral bounds, with practical validation on fluid dynamics models.
Findings
GSOR converges under derived conditions.
Spectral bounds for preconditioned matrices are sharp.
Numerical tests confirm GSOR's effectiveness.
Abstract
We consider the generalized successive overrelaxation (GSOR) method for solving a class of block three-by-three saddle-point problems. Based on the necessary and sufficient conditions for all roots of a real cubic polynomial to have modulus less than one, we derive convergence results under reasonable assumptions. We also analyze a class of block lower triangular preconditioners induced from GSOR and derive explicit and sharp spectral bounds for the preconditioned matrices. We report numerical experiments on test problems from the liquid crystal director model and the coupled Stokes-Darcy flow, demonstrating the usefulness of GSOR.
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 · Numerical methods for differential equations · Electromagnetic Scattering and Analysis
