Abstract
For non-Hermitian saddle point problems with the non-Hermitian positive definite (1,1)-block, Zhang et al. (2014) presented a relaxed positive-definite and skew-Hermitian splitting (RPSS) preconditioner to accelerate the convergence rates of the Krylov subspace iteration methods such as GMRES. In this paper, the convergence property of the GRPSS iteration method is proved and a generalized RPSS (GRPSS) preconditioner is proposed. The GRPSS preconditioner is much closer to the coefficient matrix than the RPSS preconditioner in certain norm, which straightforwardly results in an GRPSS iteration method. We employing the GRPSS preconditioner to accelerate some Krylov subspace methods (like GMRES). The spectral distribution of the preconditioned matrix is described and an upper bound of the degree of the minimal polynomial of the preconditioned matrix is obtained. Finally, numerical experiments of a model Navier–Stokes equation are presented to illustrate the efficiency of the GRPSS preconditioner.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.