On hybrid preconditioning methods for large sparse saddle-point problems

DOI10.1016/j.laa.2010.06.035zbMath1214.65013OpenAlexW2030410470MaRDI QIDQ2431153

Publication date: 11 April 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.06.035

zbMATH Keywords

minimal residual method saddle-point problem eigenvalue clustering MINRES method block symmetric Gauss-Seidel iteration matrix preconditioning

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items (2)

A generalization of parameterized block triangular preconditioners for generalized saddle point problems ⋮ Eigenvalue analysis of a generalized indefinite block triangular preconditioner for generalized saddle point problems

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
On parameterized inexact Uzawa methods for generalized saddle point problems
A class of modified block SSOR preconditioners for symmetric positive definite systems of linear equations
A class of new hybrid algebraic multilevel preconditioning methods
On the convergence of additive and multiplicative splitting iterations for systems of linear equations
Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite linear systems
On generalized successive overrelaxation methods for augmented linear systems
Restrictive preconditioners for conjugate gradient methods for symmetric positive definite linear systems
Structured preconditioners for nonsingular matrices of block two-by-two structures
Numerical solution of saddle point problems
Eigenvalue estimates for preconditioned saddle point matrices
A Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations of Elliptic Problems
A Preconditioned Iterative Method for Saddlepoint Problems
An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
Substructure Preconditioners for Elliptic Saddle Point Problems
Iterative Solution Methods
Restrictively preconditioned conjugate gradient methods for systems of linear equations
Optimal Preconditioning for Raviart--Thomas Mixed Formulation of Second-Order Elliptic Problems
A Preconditioner for Generalized Saddle Point Problems
Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations
Schur complement preconditioning for elliptic systems of partial differential equations
On Inexact Preconditioners for Nonsymmetric Matrices
An Augmented Lagrangian‐Based Approach to the Oseen Problem
Modified block SSOR preconditioners for symmetric positive definite linear systems

This page was built for publication: On hybrid preconditioning methods for large sparse saddle-point problems