Generalized minimal residual method
URI(s)
Variants
Broader Terms
Closely Matching Concepts from Other Schemes
Sources
found: Work cat.: Cullum, J. Iterative methods for solving Ax=b, GMRES/FOM versus QMR/BiCG, 1996.
found: International Conference on Industrial and Applied Mathematics (3rd : 1995 : Hamburg, Germany). Numerical analysis, scientific computing, computer science, 1996:p. 595 (Our attention is concentrated on the GMRES (the Generalized Minimal Residual method) which is one of the most effective methods for the solution of systems of linear algebraic equations with a nonsymmetric matrix)
found: MathWorld, via WWW, Dec. 22, 2006(The generalized minimal residual (GMRES) method is an extension of the minimal residual method (MINRES), which is only applicable to symmetric systems, to unsymmetric systems. Like MINRES, it generates a sequence of orthogonal vectors, but in the absence of symmetry this can no longer be done with short recurrences; instead, all previously computed vectors in the orthogonal sequence have to be retained)
found: Wikipedia, via WWW, Dec. 22, 2006(Generalized minimal residual method-- In mathematics, the generalized minimal residual method (usually abbreviated GMRES) is an iterative method for the numerical solution of a system of linear equations. The method approximates the solution by the vector in a Krylov subspace with minimal residual. The Arnoldi iteration is used to find this vector)
found: AP-S International Symposium (1994 : University of Washington). 1994 international symposium digest : antennas and propagation, 1994:v. 3, p. 2178 (GMRES is an iterative method for general unsymmetric systems of linear equations)
notfound: Glossary of mathematical terms, via WWW, Dec. 22, 2006;James, R.C. Mathematics dictionary, 1992;Encyclopedic dictionary of mathematics, 1987
Instance Of
Scheme Membership(s)
Collection Membership(s)
Change Notes
2007-02-05: new
2007-02-06: revised
Alternate Formats
