Abstract
In this paper, we propose two new iterative methods for solving the nonsingular saddle point problem based on partitioning the coefficient matrix. One is combining the block Gauss–Seidel iterative method with the Uzawa iterative method, and the other one is combining the block Jacobi iterative method with the Uzawa iterative method. Then we study the convergence of the two novel methods under suitable restrictions on the iteration parameters, respectively. Numerical experiments are also presented to illustrate the behavior of the considered algorithms.
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.
