Discontinuous Galerkin method for hyperbolic equations involving \(\delta \)-singularities: negative-order norm error estimates and applications (Q2391809)

From MaRDI portal





scientific article; zbMATH DE number 6195002
Language Label Description Also known as
default for all languages
No label defined
    English
    Discontinuous Galerkin method for hyperbolic equations involving \(\delta \)-singularities: negative-order norm error estimates and applications
    scientific article; zbMATH DE number 6195002

      Statements

      Discontinuous Galerkin method for hyperbolic equations involving \(\delta \)-singularities: negative-order norm error estimates and applications (English)
      0 references
      0 references
      0 references
      5 August 2013
      0 references
      The authors use the discontinuous Galerkin (DG) method to solve hyperbolic conservation laws involving \(\delta\)-singularities. Negative-order norm error estimates for the accuracy of DG approximations to linear hyperbolic conservation laws with singular initial data or singular source terms are investigated. They also obtain error estimates in the \(L^2\)-norm after post-processing in one space dimension. Numerical experiments demonstrate that the rates of convergence obtained by them are optimal. Numerical examples including an acoustic equation and nonlinear rendezvous algorithms are given to demonstrate the good performance of DG methods for solving hyperbolic equations involving \(\delta\)-singularities. In future work they will apply the DG method to more nonlinear hyperbolic equations involving \(\delta\)-singularities.
      0 references
      discontinuous Galerkin method
      0 references
      linear hyperbolic conservation laws
      0 references
      negative-order norm error estimates
      0 references
      initial value \(\delta\)-singularities
      0 references
      source terms \(\delta\)-singularities
      0 references
      numerical experiments
      0 references
      convergence
      0 references
      algorithm
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

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