Abstract
Although sparse direct solvers are very competitive, they can be less efficient for challenging problems due to their storage and computational limitations. If we cannot solve the saddle-point problem directly, in many applications, we have to use some iterative method. Coupled iterative methods applied to the system ( 1.1) take some initial guess Open image in new window and generate approximate solutions Open image in new window for k = 1, … such that they satisfy Open image in new window . The convergence to the exact solution Open image in new window can be also measured using the residual vectors given as Open image in new window , where we eventually have Open image in new window .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.