ScholarGate
Assistent
Machine learningKrylov Subspace Iterative

GMRES

GMRES (Generalisert Minimalresidual) er en iterativ metode for å løse store sparsomme usymmetriske lineære systemer Ax = b, utviklet av Saad og Schultz i 1986. Den bygger en ortonormal Krylov-basis ved hjelp av Arnolds metode og løser et minste kvadraters problem for å minimere residualet ved hver iterasjon.

Åpne i MethodMindSnartVideoSnartDownload slides

Les hele metoden

Kun for medlemmer

Logg inn med en gratis konto for å lese denne delen.

Logg inn

Method map

The neighbourhood of related methods — select a node to explore.

Kilder

  1. Saad, Y., & Schultz, M. H. (1986). GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing, 7(3), 856–869. DOI: 10.1137/0907058
  2. Walker, H. F. (1988). Implementation of the GMRES method using Householder reflections. SIAM Journal on Scientific and Statistical Computing, 9(1), 152–163. DOI: 10.1137/0909010
  3. Saad, Y. (2003). Iterative Methods for Sparse Linear Systems (2nd ed.). SIAM. DOI: 10.1137/1.9780898718003

Slik siterer du denne siden

ScholarGate. (2026, June 3). Generalized Minimal Residual Method. ScholarGate. https://scholargate.app/no/numerical-methods/gmres

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

Referert av

ScholarGateGMRES (Generalized Minimal Residual Method). Hentet 2026-06-15 fra https://scholargate.app/no/numerical-methods/gmres · Datasett: https://doi.org/10.5281/zenodo.20539026