New insights in GMRES-like methods with variable preconditioners (Q1903660): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CRAIG / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theoretical Comparison of the Arnoldi and GMRES Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Iterative Methods for Nonsymmetric Systems of Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Changing the Norm in Conjugate Gradient Type Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Flexible Inner-Outer Preconditioned GMRES Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMRESR: a family of nested GMRES methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The superlinear convergence behaviour of GMRES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689522 / rank
 
Normal rank

Latest revision as of 07:48, 24 May 2024

scientific article
Language Label Description Also known as
English
New insights in GMRES-like methods with variable preconditioners
scientific article

    Statements

    New insights in GMRES-like methods with variable preconditioners (English)
    0 references
    29 August 1996
    0 references
    Recently proposed methods, \textit{Y. Saad's} FGMRES [SIAM J. Sci. Comput. 14, No. 2, 461-469 (1993; Zbl 0780.65022)] and \textit{H. A. van der Vorst} and the author's GMRESR [Numer. Linear Algebra Appl. 1, No. 4, 369-386 (1994; Zbl 0839.65040)], are described and compared. Both methods are intended for the solution of sparse linear systems with an unsymmetric nonsingular matrix and compute minimal residual approximation using preconditioners which may be different from step to step. A new method FFOM related to FGMRES is introduced in the paper and used for the comparison of the previous two methods. The insights from the comparison are exploited for the improvements in avoiding breakdown, giving a termination criterion in the inner loop and making cheaper residual computation for FGMRES and developing cheaper implementation for GMRESR.
    0 references
    GMRES-like methods
    0 references
    variable preconditioners
    0 references
    generalized minimal residual method
    0 references
    sparse linear systems
    0 references
    minimal residual approximation
    0 references
    comparison
    0 references
    FGMRES
    0 references
    GMRESR
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers