Stopping criteria for iterative methods: applications to PDE's (Q2568764): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s100920170006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983961353 / rank
 
Normal rank

Latest revision as of 01:53, 20 March 2024

scientific article
Language Label Description Also known as
English
Stopping criteria for iterative methods: applications to PDE's
scientific article

    Statements

    Stopping criteria for iterative methods: applications to PDE's (English)
    0 references
    0 references
    0 references
    19 October 2005
    0 references
    The authors focus on the fact that, when considering Galerkin-type discretizations of partial differential equations (PDE), the residual \(\rho^{(n)}=A x^{(n)}-b\) is the discrete counterpart of a linear functional, \(R^{(n)}\), which belongs to the dual of the space that contains the exact solution. They show the difference between the exact algebraic and the functional convergence of a Krylow-based method when this method is applied to a linear system which comes from the Galerkin discretization of an elliptic PDE. They present the advantages of measuring the residual in the correct norm. Examples are presented which come from the finite element discretization of elliptic PDE's. It is shown that measuring the residual in \(H^{-1}(\Omega)\) gives a true evaluation of the error in the solution, whereas measuring the residual with an algebraic norm can give misleading information about the convergence.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references