DeepAI AI Chat
Log In Sign Up

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

by   Murat Manguoglu, et al.

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.


page 1

page 2

page 3

page 4


A Robust Iterative Scheme for Symmetric Indefinite Systems

We propose a two-level nested preconditioned iterative scheme for solvin...

Parallel solution of saddle point systems with nested iterative solvers based on the Golub-Kahan Bidiagonalization

We present a scalability study of Golub-Kahan bidiagonalization for the ...

A comparison of Krylov methods for Shifted Skew-Symmetric Systems

It is well known that for general linear systems, only optimal Krylov me...

TriCG and TriMR: Two Iterative Methods for Symmetric Quasi-Definite Systems

We introduce iterative methods named TriCG and TriMR for solving symmetr...

Towards Neural Sparse Linear Solvers

Large sparse symmetric linear systems appear in several branches of scie...

A positivity preserving numerical scheme for the mean-reverting alpha-CEV process

In this article, we present a method to construct a positivity preservin...

TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems

The Lanczos method is one of the standard approaches for computing a few...