Abstract
For saddle point problems, a two-parameter shift-splitting (TPSS) preconditioner is proposed. Estimated lower and upper bounds of the real eigenvalues and the real and imaginary parts of the non-real eigenvalues of the TPSS preconditioned matrix are obtained, respectively. As special cases, bounds obtained are tighter than the ones for the GSS, PGSS, IGSS and NESS preconditioners, respectively. Meanwhile, the corresponding TPSS iteration method is constructed and the convergence analysis is studied. Numerical experiments for two frequently used problems are given to illustrate the great robustness of the TPSS preconditioner.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
