Robust iterative methods for linear systems with saddle point structure

2025/02/28 by Manguoğlu, Murat, Mehrmann, Volker · 1 citation
#65F08 #65F10 #65F50 #FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.2502.21174

Abstract

We propose a new class of multi-layer iterative schemes for solving sparse linear systems in saddle point structure. The new scheme consist of an iterative preconditioner that is based on the (approximate) nullspace method, combined with an iterative least squares approach and an iterative projection method. We present a theoretical analysis and demonstrate the effectiveness and robustness of the new scheme on sparse matrices from various applications.

Cited by

• Iterative solvers for partial differential equations with dissipative structure: Operator preconditioning and optimal control

Related

• A preconditioned iteration method for solving saddle point problems
• A Robust Iterative Scheme for Symmetric Indefinite Systems
• A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers
• Sparse Hierarchical Solvers with Guaranteed Convergence
• Convergence Analysis for A Class of Iterative Methods for Solving Saddle Point Systems