Abstract
In this paper we consider to solve the linear systems of the saddle point problems by preconditioned Krylov subspace methods. The preconditioners are based on a special splitting of the saddle point matrix. The convergence theory of this class of the extended shift-splitting preconditioned iteration methods is established. The spectral properties of the preconditioned matrices are analyzed. Numerical implementations show that the resulting preconditioners lead to fast convergence when they are used to precondition Krylov subspace iteration methods such as GMRES.
Sign-in/Register to access full text options 
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.
