East Asian J. Appl. Math., 2 (2012), pp. 19-32.
Published online: 2018-02
Cited by
- BibTex
- RIS
- TXT
The 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.
}, issn = {2079-7370}, doi = {https://doi.org/10.4208/eajam.280611.030911a}, url = {http://global-sci.org/intro/article_detail/eajam/10864.html} }The 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.