Generalizations and modifications of the GMRES iterative method (Q1817784)

From MaRDI portal
Revision as of 05:47, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Generalizations and modifications of the GMRES iterative method
scientific article

    Statements

    Generalizations and modifications of the GMRES iterative method (English)
    0 references
    0 references
    0 references
    0 references
    3 May 2000
    0 references
    The paper presents two new iterative methods GGMRES and MGMRES, which are a generalization and a modification of the well-known generalized minimal residual (GMRES) algorithm, respectively. Instead of using a minimization condition as in the derivation of GMRES, a Galerkin condition is used to derive MGMRES. Furthermore, another new iterative method, called LAN/MGMRES is introduced, which combines the reliability of GMRES with the reduced work of a Lanczos-type method. Numerical tests are presented comparing this algorithm with some other commonly used iterative methods.
    0 references
    0 references
    GMRES iterative method
    0 references
    generalized minimal residual algorithm
    0 references
    numerical tests
    0 references
    Galerkin condition
    0 references
    Lanczos-type method
    0 references