@Article{JCM-31-398,
author = {},
title = {A Relaxed HSS Preconditioner for Saddle Point Problems from Meshfree Discretization},
journal = {Journal of Computational Mathematics},
year = {2013},
volume = {31},
number = {4},
pages = {398--421},
abstract = {<p style="text-align: justify;">In this paper, a relaxed Hermitian and skew-Hermitian splitting (RHSS) preconditioner is proposed for saddle point problems from the element-free Galerkin (EFG) discretization method. The EFG method is one of the most widely used meshfree methods for solving partial differential equations. The RHSS preconditioner is constructed much closer to the coefficient matrix than the well-known HSS preconditioner, resulting in a RHSS fixed-point iteration. Convergence of the RHSS iteration is analyzed and an optimal parameter, which minimizes the spectral radius of the iteration matrix is described. Using the RHSS preconditioner to accelerate the convergence of some Krylov subspace methods (like GMRES) is also studied. Theoretical analyses show that the eigenvalues of the RHSS preconditioned matrix are real and located in a positive interval. Eigenvector distribution and an upper bound of the degree of the minimal polynomial of the preconditioned matrix are obtained. A practical parameter is suggested in implementing the RHSS preconditioner. Finally, some numerical experiments are illustrated to show the effectiveness of the new preconditioner.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.1304-m4209},
url = {http://global-sci.org/intro/article_detail/jcm/9743.html}
}