Abstract
In this paper, we discuss some more generalized iterative schemes for solving the large sparse saddle point problems proposed by Ling and Hu [X.F. Ling, X.Z. Hu, On the iterative algorithm for large sparse saddle point problems, Appl. Math. Comput. 178 (2006) 372–379.], and apply the preconditioned GMRES to accelerate the convergence. Numerical experiments are reported that show the effectiveness of the proposed methods.
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.
