ScholarGate
Msaidizi
Machine learningKrylov Subspace Iterative

GMRES

GMRES (Generalized Minimal Residual) ni mbinu ya kurudia-rudia kwa ajili ya kutatua mifumo mikubwa ya mstari isiyo-simetrikali au isiyo-simetrikali Ax = b, iliyoandaliwa na Saad na Schultz mwaka 1986. Inajenga msingi wa Krylov ulio na uti wa mgongo wa pande zote kwa kutumia mbinu ya Arnoldi na kutatua tatizo la viwango vidogo zaidi ili kupunguza mabaki katika kila hatua.

Fungua katika MethodMindHivi karibuniVideoHivi karibuniDownload slides

Soma mbinu kamili

Kwa wanachama pekee

Ingia kwa akaunti ya bure ili kusoma sehemu hii.

Ingia

Method map

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

Vyanzo

  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

Jinsi ya kunukuu ukurasa huu

ScholarGate. (2026, June 3). Generalized Minimal Residual Method. ScholarGate. https://scholargate.app/sw/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

Imerejelewa na

ScholarGateGMRES (Generalized Minimal Residual Method). Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/numerical-methods/gmres · Seti ya data: https://doi.org/10.5281/zenodo.20539026