Skip to search formSkip to main contentSkip to account menu

Generalized minimal residual method

Known as: Gmres, Minimal residual method, Residual 
In mathematics, the generalized minimal residual method (usually abbreviated GMRES) is an iterative method for the numerical solution of a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

25 relations
Arnoldi iterationBiconjugate gradient methodBiconjugate gradient stabilized methodChebyshev iteration

Broader (1)

Numerical linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A Class of New Preconditioners for Linear Solvers Used in Power System Time-Domain Simulation
In this paper, a new class of preconditioners for iterative methods is proposed for the solution of linear equations that arise… 
2002
2002
A message-passing distributed-memory Newton-GMRES parallel power flow algorithm
  • Feng TuA. Flueck
  • IEEE Power Engineering Society Summer Meeting,
  • 2002
  • Corpus ID: 15440003
This paper presents a parallel Newton-GMRES (generalised minimal residual) power flow solution algorithm based on a message… 
Highly Cited
2001
Highly Cited
2001
On Three-Grid Fourier Analysis for Multigrid
In this paper, we present three-grid Fourier analysis for multigrid methods. Due to the recursive structure of a multigrid… 
Highly Cited
1999
Highly Cited
1999
Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains
Experimental results for large, sparse Markov chains, especially the ill-conditioned nearly completely decomposable (NCD) ones… 
Highly Cited
1998
Highly Cited
1998
Accelerated Inexact Newton Schemes for Large Systems of Nonlinear Equations
Classical iteration methods for linear systems, such as Jacobi iteration, can be accelerated considerably by Krylov subspace… 
1998
1998
On IGMRES: An incomplete generalized minimal residual method for large unsymmetric linear systems
The truncated version of the generalized minimal residual method (GMRES), the incomplete generalized minimal residual method… 
1996
1996
A Parallel Version of the Unsymmetric Lanczos Algorithm and its Application to QMR
A new version of the unsymmetric Lanczos algorithm without l ok-ahead is described combining elements of numerical stability and… 
1996
1996
A Parallel Version of the Quasi-Minimal Residual Method, Based on Coupled Two-Term Recurrences
For the solution of linear systems of equations with unsymmetric coefficient matrix, Freund and Nachtigal (SIAM J. Sci. Comput… 
Highly Cited
1994
Highly Cited
1994
Towards Polyalgorithmic Linear System Solvers for Nonlinear Elliptic Problems
The authors investigate the performance of several preconditioned conjugate gradient-like algorithms and a standard stationary… 
Highly Cited
1994
Highly Cited
1994
Parallel implicit unstructured grid Euler solvers
A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on a multiple… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)