A new relaxed HSS preconditioner for saddle point problems
Numerical Analysis
2016-06-23 v2
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.
Cite
@article{arxiv.1603.02120,
title = {A new relaxed HSS preconditioner for saddle point problems},
author = {Davod Khojasteh Salkuyeh and Mohsen Masoudi},
journal= {arXiv preprint arXiv:1603.02120},
year = {2016}
}
Comments
16 pages, two figures, Accepted for publication in Numerical Algorithms, 2016