Analysis of the convergence of the minimal and the orthogonal residual methods
- 135 Downloads
We consider two Krylov subspace methods for solving linear systems, which are the minimal residual method and the orthogonal residual method. These two methods are studied without referring to any particular implementations. By using the Petrov–Galerkin condition, we describe the residual norms of these two methods in terms of Krylov vectors, and the relationship between there two norms. We define the Ritz singular values, and prove that the convergence of these two methods is governed by the convergence of the Ritz singular values.
KeywordsGMRES Krylov subspace methods convergence analysis
Unable to display preview. Download preview PDF.
- H.C. Elman, Iterative methods for large sparse nonsymmetric systems of linear equations, Ph.D. thesis, Computer Science Department, Yale University, New Haven, CT (1982). Google Scholar
- F.R. Gantmacher, The Theory of Matrices, Vol. 1 (Chelsea, New York, 1959). Google Scholar
- A. Greenbaum and L.N. Trefethen, GMRES/CR and ARNOLDI/LANCZOS as matrix approximation problems, SIAM J. Sci. Statist. Comput. 15 (1994) 357–368. Google Scholar
- M.R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Standards 49 (1952) 409–436. Google Scholar
- G. Golub and C.F. van Loan, Matrix Computations, 2nd ed. (Johns Hopkins Univ. Press, Baltimore, MD, 1989). Google Scholar
- Y. Huang and H.A. van der Vorst, Some observations on the convergence behaviour of GMRES, Delft University of Technology, Report 89–09 (1989). Google Scholar
- Y. Saad, Krylov subspace methods for solving large unsymmetric linear systems, Math. Comp. 37 (1981) 105–126. Google Scholar
- Y. Saad and M.H. Schultz, Conjugate gradient-like algorithms for solving nonsymmetric linear systems, Math. Comp. 44 (1985) 417–424. Google Scholar
- G.W. Stewart and J.G. Sun, Matrix Perturbation Theory (Academic Press, New York, 1990). Google Scholar