A Relaxed Hss Preconditioner for Saddle Point Problems from Meshfree Discretization
نویسندگان
چکیده
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. Mathematics subject classification: 65F10.
منابع مشابه
H-matrix preconditioners for saddle-point systems from meshfree discretization∗
In this paper we describe and compare preconditioners for saddle-point systems obtained from meshfree discretizations, using the concepts of hierarchical (or H-)matrices. Previous work by the authors using this approach did not use H-matrix techniques throughout, as is done here. Comparison shows the method described here to be better than the author’s previous method, an AMG method adapted to ...
متن کاملH - matrix preconditioners for saddle - point systems from meshfree discretization 1
In this paper we describe and compare preconditioners for saddle-point systems obtained from meshfree discretizations, using the concepts of hierarchical (or H )matrices. Previous work by the authors using this approach did not use H -matrix techniques throughout, as is done here. Comparison shows the method described here to be better than the author’s previous method, an AMG method adapted to...
متن کاملOn the generalized shift-splitting preconditioner for saddle point problems
In this paper, the generalized shift-splitting preconditioner is implemented for saddle point problems with symmetric positive definite (1,1)-block and symmetric positive semidefinite (2,2)-block. The proposed preconditioner is extracted form a stationary iterative method which is unconditionally convergent. Moreover, a relaxed version of the proposed preconditioner is presented and some proper...
متن کاملPreconditioned Hss-like Iterative Method for Saddle Point Problems
A new HSS-like iterative method is first proposed based on HSS-like splitting of nonHermitian (1,1) block for solving saddle point problems. The convergence analysis for the new method is given. Meanwhile, we consider the solution of saddle point systems by preconditioned Krylov subspace method and discuss some spectral properties of the preconditioned saddle point matrices. Numerical experimen...
متن کاملRegularized HSS Iteration Method for Saddle - Point Linear Systems
We propose a class of regularized Hermitian and skew-Hermitian splitting methods for the solution of large, sparse linear systems in saddle-point form. These methods can be used as stationary iterative solvers or as preconditioners for Krylov subspace methods. We establish unconditional convergence of the stationary iterations and we examine the spectral properties of the corresponding precondi...
متن کامل