A new relaxed HSS preconditioner for saddle point problems
Preprint
Abstract
We present a preconditioner for saddle point problems. The proposed preconditioner is extracted from a stationary iterative method which is convergent under a mild condition. Some properties of the preconditioner as well as the eigenvalues distribution of the preconditioned matrix are presented. The preconditioned system is solved by a Krylov subspace method like restarted GMRES. Finally, some numerical experiments on test problems arisen from finite element discretization of the Stokes problem are given to show the effectiveness of the preconditioner.Keywords
All Related Versions
This publication has 29 references indexed in Scilit:
- A relaxed positive semi-definite and skew-Hermitian splitting preconditioner for non-Hermitian generalized saddle point problemsNumerical Algorithms, 2015
- A modified positive-definite and skew-Hermitian splitting preconditioner for generalized saddle point problems from the Navier-Stokes equationNumerical Algorithms, 2015
- On parameterized block triangular preconditioners for generalized saddle point problemsApplied Mathematics and Computation, 2010
- Symmetric-triangular decomposition and its applications part II: Preconditioners for indefinite systemsBIT Numerical Mathematics, 2008
- Component‐based iterative methods for sparse linear systemsConcurrency and Computation: Practice and Experience, 2006
- New preconditioners for saddle point problemsApplied Mathematics and Computation, 2006
- On generalized successive overrelaxation methods for augmented linear systemsNumerische Mathematik, 2005
- Block triangular preconditioners for symmetric saddle-point problemsApplied Numerical Mathematics, 2004
- Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite linear systemsNumerische Mathematik, 2004
- Preconditioning Techniques for Large Linear Systems: A SurveyJournal of Computational Physics, 2002