Abstract
We study a preconditioned generalized shift-splitting iteration method for solving saddle point problems. The unconditional convergence theory of the preconditioned generalized shift-splitting iteration method is established. When the splitting matrix is used as a preconditioner, we analyze eigenvalue distribution of the preconditioned saddle point matrix. It is proved that complex eigenvalues having nonzero imaginary parts of the preconditioned matrix are located in an intersection of two circles and the real parts of all eigenvalues of the preconditioned matrix are located in a positive interval. Numerical experiments are used to verify our theoretical results and illustrate effectiveness of the proposed iteration method and the corresponding splitting 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.
