Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Discontinuous Galerkin method based on non-polynomial approximation spaces

Journal Article · · Journal of Computational Physics
 [1];  [1]
  1. Division of Applied Mathematics, Brown University, Box F, Providence, RI 02912 (United States)
In this paper, we develop discontinuous Galerkin (DG) methods based on non-polynomial approximation spaces for numerically solving time dependent hyperbolic and parabolic and steady state hyperbolic and elliptic partial differential equations (PDEs). The algorithm is based on approximation spaces consisting of non-polynomial elementary functions such as exponential functions, trigonometric functions, etc., with the objective of obtaining better approximations for specific types of PDEs and initial and boundary conditions. It is shown that L {sup 2} stability and error estimates can be obtained when the approximation space is suitably selected. It is also shown with numerical examples that a careful selection of the approximation space to fit individual PDE and initial and boundary conditions often provides more accurate results than the DG methods based on the polynomial approximation spaces of the same order of accuracy.
OSTI ID:
20840356
Journal Information:
Journal of Computational Physics, Journal Name: Journal of Computational Physics Journal Issue: 1 Vol. 218; ISSN JCTPAH; ISSN 0021-9991
Country of Publication:
United States
Language:
English

Similar Records

Uniform Subspace Correction Preconditioners for Discontinuous Galerkin Methods with hp-Refinement
Journal Article · Thu Jul 08 20:00:00 EDT 2021 · Communications on Applied Mathematics and Computation · OSTI ID:1823212

Optimal numerical parameterization of discontinuous Galerkin method applied to wave propagation problems
Journal Article · Tue Apr 10 00:00:00 EDT 2007 · Journal of Computational Physics · OSTI ID:20991571

Analysis and Entropy Stability of the Line-Based Discontinuous Galerkin Method
Journal Article · Tue Mar 19 20:00:00 EDT 2019 · Journal of Scientific Computing · OSTI ID:1548369