Numerical stability of GMRES (Q1904273): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jitka Drkošova / rank
 
Normal rank
Property / author
 
Property / author: Anne Greenbaum / rank
 
Normal rank
Property / author
 
Property / author: Miroslav Rozložnik / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving linear least squares problems by Gram-Schmidt orthogonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability analysis of the method of seminormal equations for linear least squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerics of Gram-Schmidt orthogonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3894866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weak and strong stability of algorithms in numerical linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4310134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite precision behavior of stationary iteration for solving singular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative algorithms for Gram-Schmidt orthogonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Variants of the Lanczos Method for the Eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Compatibility of a Given Solution With the Data of a Linear System / 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: Implementation of the GMRES Method Using Householder Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementations of the GMRES method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation theory for pseudo-inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roundoff-error analysis of a new class of conjugate-gradient algorithms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01732607 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037785139 / rank
 
Normal rank

Latest revision as of 08:53, 30 July 2024

scientific article
Language Label Description Also known as
English
Numerical stability of GMRES
scientific article

    Statements

    Numerical stability of GMRES (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 May 1996
    0 references
    The generalized minimal residual (GMRES) method is one of the most popular methods for solving systems of linear equations with nonsymmetric coefficient matrices. The authors study the numerical stability of GMRES when the computation of approximations is based on constructing an orthonormal basis of Krylov subspaces (Arnoldi basis) and after that the transformed least squares problem is solved. It is shown that if the Arnoldi basis is computed via Householder orthogonalization and the transformed least squares problem is solved using Givens rotations, then the computed GMRES approximation has a guaranteed backward error of size at worst \(O(N^{{5\over 2}}\varepsilon)\), where \(N\) is the size of the coefficient matrix and \(\varepsilon\) is the machine precision. Reading the paper, one can find the description of the Arnoldi recurrence for the quantities actually computed in finite precision arithmetic and an analysis of the relation between the true and Arnoldi residuals in the presence of rounding errors.
    0 references
    nonsymmetric linear system
    0 references
    generalized minimal residual method
    0 references
    iterative methods
    0 references
    Arnoldi basis
    0 references
    numerical stability
    0 references
    GMRES
    0 references
    Krylov subspaces
    0 references
    least squares problem
    0 references
    Householder orthogonalization
    0 references
    Givens rotations
    0 references
    backward error
    0 references

    Identifiers