Optimal order a posteriori error estimates for a class of Runge-Kutta and Galerkin methods (Q849056)

From MaRDI portal
Revision as of 11:17, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Optimal order a posteriori error estimates for a class of Runge-Kutta and Galerkin methods
scientific article

    Statements

    Optimal order a posteriori error estimates for a class of Runge-Kutta and Galerkin methods (English)
    0 references
    24 February 2010
    0 references
    The main purpose of the paper is to introduce a new methodology for performing a posteriori error estimates, which exhibit optimal global order, for a class of time stepping methods of any order that include Runge-Kutta collocation (RK-C) methods and the continuous Galerkin (cG) method for linear and nonlinear stiff ordinary differential equations and parabolic partial differential equations. The first section is an introduction in nature. The second section presents an abstract framework for the discretization and time reconstruction, with emphasis on the simple linear case. These results are applied to cG and then extended to nonlinear equations in the third section. The fourth section deals with RK-C. The authors discuss the relation between the classical order and the stage order. Thus, viewing RK-C methods as collocation or Galerkin-type methods, they clarify the connection between the stage order and the order of convergence in \(L^\infty([0,T];H)\). The latter is \(O(k^{q+1})\) because the approximate solution is a piecewise polynomial of degree \(q\). In the last section one provides explicit conditions on the data and the reconstruction which guarantee the validity for time discrete case.
    0 references
    Runge-Kutta Collocation methods
    0 references
    continuous Galerkin method
    0 references
    stiff ODE, parabolic PDE
    0 references
    global error bound
    0 references
    a posteriori error bound
    0 references
    optimal order
    0 references
    time stepping methods
    0 references
    convergence
    0 references
    0 references
    0 references
    0 references

    Identifiers