Abstract
We describe (without proofs) some recent theory, confirmed by numerical experiments, which shows that Block Elimination with Iterative Refinement is an easily programmed and usually robust method for solving bordered linear systems with a border of width greater than 1. We compare it for accuracy, efficiency and convenience with the Generalized Deflated Block Elimination methods of Chan and Resasco.
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.
