A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers. ETNA - Electronic Transactions on Numerical Analysis
Fiche du document
28 avril 2021
- handle: 10670/1.x8hyzn
- issn: 1068-9613
- doi: 10.1553/etna_vol54s370
info:eu-repo/semantics/openAccess
Sujets proches
Systems, LinearCiter ce document
Murat Manguoğlu et al., « A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers. ETNA - Electronic Transactions on Numerical Analysis », Elektronisches Publikationsportal der Österreichischen Akademie der Wissenschafte, ID : 10.1553/etna_vol54s370
Métriques
Partage / Export
Résumé
We propose a two-level iterative scheme for solving general sparse linear systems. The proposed scheme consists of a sparse preconditioner that increases the norm of the skew-symmetric part relative to the rest and makes the main diagonal of the coefficient matrix as close to the identity as possible so that the preconditioned system is as close to a shifted skew-symmetric matrix 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 optimality 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.