Error estimation in preconditioned conjugate gradients (Q2490362): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q346907
Property / reviewed by
 
Property / reviewed by: Raffaella Pavani / rank
Normal rank
 

Revision as of 07:05, 13 February 2024

scientific article
Language Label Description Also known as
English
Error estimation in preconditioned conjugate gradients
scientific article

    Statements

    Error estimation in preconditioned conjugate gradients (English)
    0 references
    0 references
    0 references
    0 references
    2 May 2006
    0 references
    The authors deal with the problem of convergence in the preconditioned conjugate gradient method for the solution of a linear system \(Ax=b\), where \(A\) is a symmetric positive definite \(n\times n\) matrix. Indeed, the problem of this convergence was the subject of many papers in literature. However, they always assume exact arithmetic and consequently, they assume preserving orthogonality and exploiting the finite termination property (i.e. getting the exact solution in a finite number of steps, which does not exceed the dimension \(n\) of the problem). Unfortunately, most practical computations violate these assumptions. Taking this fact into account, the authors focus on estimating the \(A\)-norm of the error and present a practical estimate for such norm. It is simple and numerically stable. Eventually, they propose to combine their results with the standard quantities, which are already used, to establish a convenient stopping criteria. Some nice numerical experiments are reported to illustrate how this new estimate works.
    0 references
    conjugate gradient method
    0 references
    error bounds
    0 references
    stopping criteria
    0 references
    preconditioning
    0 references
    convergence
    0 references
    numerical experiments
    0 references

    Identifiers