Optimal convergence and a posteriori error analysis of the original DG method for advection-reaction equations. (Q489250): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016764724 / rank
 
Normal rank

Revision as of 23:06, 19 March 2024

scientific article
Language Label Description Also known as
English
Optimal convergence and a posteriori error analysis of the original DG method for advection-reaction equations.
scientific article

    Statements

    Optimal convergence and a posteriori error analysis of the original DG method for advection-reaction equations. (English)
    0 references
    0 references
    0 references
    27 January 2015
    0 references
    The paper investigates the optimal convergence and a posteriori error estimates of the original discontinuous Galerkin (DG)method for the advection-reaction equations with arbitrary velocity in \(d\) space dimensions. In the first part the prove of the optimal convergence for triangulations satisfying the flow condition is done. Then a very simple derivative recovery formula is given to produce an approximation to the derivative in the flow direction. Futher for a residual based a posteriori error estimate the global upper bound and local lower bound on the error in the DG-norm is presented which is stronger than \(L_2\)-norm. The key elements in the presented a posteriori analysis are the saturation assumptions and an interpolation estimate between the DG spaces. It is shown that the a posteriori error bounds are efficient and reliable. Finally, some numerical experiments are presented to illustrate the theoretical analysis.
    0 references
    0 references
    discontinuous Galerkin method
    0 references
    advection-reaction equation
    0 references
    optimal convergence rate
    0 references
    a posteriori error estimate
    0 references
    numerical experiments
    0 references

    Identifiers

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