A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers

2020/09/15 by Manguoglu, Murat, Mehrmann, Volker · 1 citation
#65F08 #65F10 #65F50 #FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.2009.06954

Abstract

We propose a two-level iterative scheme for solving general sparse linear systems. The proposed scheme consists of a sparse preconditioner that increases the skew-symmetric part and makes the main diagonal of the coefficient matrix as close to the identity as possible. The preconditioned system is then solved via a particular Minimal Residual Method for Shifted Skew-Symmetric Systems (mrs). This leads to a two-level (inner and outer) iterative scheme where the mrs has short term recurrences and satisfies an optimally condition. A preconditioner for the inner system is designed via a skew-symmetry preserving deflation strategy based on the skew-Lanczos process. We demonstrate the robustness of the proposed 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 Robust Iterative Scheme for Symmetric Indefinite Systems
• Robust iterative methods for linear systems with saddle point structure
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• Second Order Accurate Hierarchical Approximate Factorization of Sparse SPD Matrices
• A comparison of Krylov methods for Shifted Skew-Symmetric Systems