GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- 1 July 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 7 (3) , 856-869
- https://doi.org/10.1137/0907058
Abstract
We present an iterative method for solving linear systems, which has the property ofminimizing methods, minimalKeywords
This publication has 10 references indexed in Scilit:
- Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear SystemsSIAM Journal on Scientific and Statistical Computing, 1984
- Iterative Solution of Linear Equations in ODE CodesSIAM Journal on Scientific and Statistical Computing, 1983
- Variational Iterative Methods for Nonsymmetric Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1983
- Krylov subspace methods for solving large unsymmetric linear systemsMathematics of Computation, 1981
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matricesLinear Algebra and its Applications, 1980
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methodsLinear Algebra and its Applications, 1980
- A new look at the Lanczos algorithm for solving symmetric systems of linear equationsLinear Algebra and its Applications, 1980
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equationsLinear Algebra and its Applications, 1980
- Solution of Sparse Indefinite Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1975
- The principle of minimized iterations in the solution of the matrix eigenvalue problemQuarterly of Applied Mathematics, 1951