Abstract
Recently, a class of generalized shift-splitting iteration methods were proposed for solving nonsingular nonsymmetric saddle point problems (Cao et al., 2015). In this paper, the generalized shift-splitting iteration method is extended to solve singular nonsymmetric saddle point problems. Semi-convergence of the generalized shift-splitting iteration method is carefully analyzed, which shows that the iterative sequence generated by the generalized shift-splitting iteration method converges to a solution of the singular saddle point problem unconditionally. Numerical results verify the robustness and efficiency of the generalized shift-splitting iteration method.
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.
