scholarly journals Discontinuous Galerkin Methods for a Class of Nonvariational Problems

Author(s):  
Andreas Dedner ◽  
Tristan Pryer

AbstractWe extend the finite element method introduced by Lakkis and Pryer (SIAM J. Sci. Comput. 33(2): 786–801, 2011) to approximate the solution of second-order elliptic problems in nonvariational form to incorporate the discontinuous Galerkin (DG) framework. This is done by viewing the “finite element Hessian” as an auxiliary variable in the formulation. Representing the finite element Hessian in a discontinuous setting yields a linear system of the same size and having the same sparsity pattern of the compact DG methods for variational elliptic problems. Furthermore, the system matrix is very easy to assemble; thus, this approach greatly reduces the computational complexity of the discretisation compared to the continuous approach. We conduct a stability and consistency analysis making use of the unified framework set out in Arnold et al. (SIAM J. Numer. Anal. 39(5): 1749–1779, 2001/2002). We also give an a posteriori analysis of the method in the case where the problem has a strong solution. The analysis applies to any consistent representation of the finite element Hessian, and thus is applicable to the previous works making use of continuous Galerkin approximations. Numerical evidence is presented showing that the method works well also in a more general setting.

2019 ◽  
Vol 19 (4) ◽  
pp. 849-861 ◽  
Author(s):  
Xiao Zhang ◽  
Xiaoping Xie ◽  
Shiquan Zhang

AbstractThe embedded discontinuous Galerkin (EDG) method by Cockburn, Gopalakrishnan and Lazarov [B. Cockburn, J. Gopalakrishnan and R. Lazarov, Unified hybridization of discontinuous Galerkin, mixed, and continuous Galerkin methods for second-order elliptic problems, SIAM J. Numer. Anal. 47 2009, 2, 1319–1365] is obtained from the hybridizable discontinuous Galerkin method by changing the space of the Lagrangian multiplier from discontinuous functions to continuous ones, and adopts piecewise polynomials of equal degrees on simplex meshes for all variables. In this paper, we analyze a new EDG method for second-order elliptic problems on polygonal/polyhedral meshes. By using piecewise polynomials of degrees {k+1}, {k+1}, k ({k\geq 0}) to approximate the potential, numerical trace and flux, respectively, the new method is shown to yield optimal convergence rates for both the potential and flux approximations. Numerical experiments are provided to confirm the theoretical results.


Sign in / Sign up

Export Citation Format

Share Document