Abstract
AbstractThe GMRES(m) method proposed by Saad and Schultz is one of the most successful Krylov subspace methods for solving nonsymmetric linear systems. In this paper, we investigate how to update the initial guess to make it converge faster, and in particular propose an efficient variant of the method that exploits an unfixed update. The mathematical background of the unfixed update variant is based on the error equations, and its potential for efficient convergence is explored in some numerical experiments.
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.
