- Research
- Open Access
- Published:
A hybridizable direct discontinuous Galerkin method for elliptic problems
Boundary Value Problems volume 2016, Article number: 191 (2016)
Abstract
The aim of this work is to develop a hybridizable discontinuous Galerkin method for elliptic problems. In the proposed method, the numerical flux functions are constructed from the weak formulation of primal equation directly without converting the second-order equation to a first-order system. In order to guarantee the stability and convergence of the method, we derive a computable lower bound for the constant in numerical flux functions. We also establish a prior error estimation and give some theoretical analysis for the proposed method. Finally, a numerical experiment is presented to verify the theoretical results.
1 Introduction
In recent years, the discontinuous Galerkin method (DGM) has been extensively studied by lots of researchers on various problems since it was first introduced by Reed and Hill [1]. Particularly, for elliptic problems, a unified analysis framework for the most of DGMs proposed during the last 30 years has been given by Arnold et al. [2]. Unlike the continuous finite element method (FEM), DGM is able to easily handle non-conforming meshes and work well with varying polynomials on different cells. Therefore, DGM is much flexible for hp-adaptive approaches. For more details of DGM, we refer the reader to [3–6]. However, compared with continuous FEM, DGM results in a much larger linear system which leads to more computational costs. In order to overcome this issue, hybridizable discontinuous Galerkin method (HDGM) was proposed by Cockburn et al. in [7]. In HDGM, additional unknowns defined on interior faces are introduced and the global linear system only involves degrees of freedoms (DOFs) on interior faces. Therefore, this linear system is smaller than that obtained via classical DGM. On the other hand, recently, a new kind of DGM called direct discontinuous Galerkin method (DDGM) was introduced by Liu and Yan [8, 9]. One of the key aspects of DDGM is that it directly uses the weak formulation of the original equation instead of rewriting the equations into a first-order system. In this way, the DDGM is easy to implement and more effective because of there being no extra computation for auxiliary variables.
The purpose of this work is to develop a hybridizable discontinuous Galerkin method, which combines the advantages of HDGM and DDGM together, based on the main idea of DDGM. The rest of the paper is organized as follows. In Section 2, we introduce the model problem and some basic notations which will be used in this work. Then the full derivation of our hybridizable direct discontinuous Galerkin method is given in Section 3. In Section 4, we discuss the theoretical error analysis and derive computable lower bounds for the constant coefficients in numerical fluxes in order to guarantee the stability and convergence of this method. In Section 5, a numerical example is presented to verify the theoretical analysis results. Finally, in Section 6, we give some concluding remarks.
2 Model problem and basic notations
In this work, for the sake of simplicity, we consider the following elliptic boundary value problem:
where Ω is a bounded polygonal domain in \(\mathbb{R}^{2}\) and \(f\in L^{2}(\Omega)\).
Let \(\mathcal{T}_{h}=\{\kappa\}\) be the subdivision of domain Ω. For two adjacent elements \(\kappa^{+}\) and \(\kappa^{-}\), \(\partial k^{+}\cap\partial k^{-}\) is the interior face. For \(\kappa\in\mathcal {T}_{h}\), \(\partial k\cap\partial\Omega\) is the boundary face. We denote by \(\mathcal{E}^{I}_{h}\) the set of interior faces and \(\mathcal {E}^{B}_{h}\) the set of boundary faces. Also, we denote all the faces of \(\mathcal{T}_{h}\) by \(\mathcal{E}_{h}:=\mathcal{E}_{h}^{I}\cup\mathcal {E}_{h}^{B}\). In addition, we denote the outward unit normals of \(\partial \kappa^{+}\) and \(\partial\kappa^{-}\) by \(\mathbf{n}^{+}\) and \(\mathbf{n}^{-}\), respectively. For \(\mathcal{E}\in\mathcal{E}^{I}_{h}\), we define the jumps
where Q is a vector valued function and \((\cdot)^{\pm}\) are the interior traces on \(\partial k^{\pm}\), respectively. In order to approximate the modal problem using discontinuous finite elements, some useful spaces are defined as follows:
and the traced finite element space
Here \(\mathcal{P}^{p}\) is the polynomial of degree at most p. In addition, we introduce the space with Dirichlet boundary conditions
3 The hybridizable direct discontinuous Galerkin method
3.1 Solving the local problems
In order to derive hybridizable discontinuous Galerkin method, we restrict the modal problem to any element \(\kappa\in\mathcal{T}_{h}\) not the entire computational domain. Therefore, if we know the trace value û on ∂κ, we can solve the following local problem to obtain u inside κ:
Thus, we can multiply the local problem (3) by a test function \(v_{h}\) and integrate by parts to obtain the following variational problem over κ: find \(u_{h}\in\mathcal{V}_{h}\) such that
where n is the unit outward normal to ∂κ. In two dimensional case, based on the main idea of direct discontinuous Galerkin method [8, 9], we approximate \(\nabla u_{h}:=(u_{x},u_{y})\) via numerical flux function \(\widehat{\nabla u_{h}}=(\widehat{u_{x}},\widehat{u_{y}})\), i.e.,
where \(n_{i}\) is the ith component of n, β is a constant coefficient and \(h_{\kappa}\) is the characteristic length of ∂k. In this work, \(h_{\kappa}\) is chosen as the diameter of the cell and for two dimensional quadrilateral mesh \(h_{\kappa}\) is approximated by the length of longest diagonal. For more complicated cases, we refer the reader to [10]. Therefore, we get the discretization of the local problem: find \(u_{h}\in\mathcal{V}_{h}\) such that
where
3.2 Defining the global problem
In the above derivation, we have given the discretization of the local problem when the trace value û is known. However, in general, the value of û is unknown. Therefore, we need additional conditions to overcome this issue. In this work, we weakly enforce the flux is normal-continuous, which is the essential condition of hybridizable discontinuous Galerkin method. Thus, the function û can be computed as the solution of the following problems:
Summing (7) and (9) over all \(\kappa\in\mathcal{T}_{h}\), we have
We note that (12) is a face-based form, i.e., each interior face occurs only once. In the following, we rewrite this face-based form to element-based form, namely
Then we add (13) to (11) and enforce the boundary conditions, from which one derives a new discrete form: find \(u_{h}\in\mathcal{V}_{h}\) and \(\hat{u}_{h}\in\mathcal{M}(g)\) such that for all \(v_{h}\in\mathcal{V}_{h}\) and \(\hat{v}_{h}\in\mathcal {M}(0)\) we have
Moreover, we rewrite the above equation into equivalent form, i.e., find \(u_{h}\in\mathcal{V}_{h}\) and \(\hat{u}_{h}\in\mathcal{M}(0)\) such that for all \(v_{h}\in\mathcal{V}_{h}\) and \(\hat{v}_{h}\in\mathcal {M}(0)\) we have
Note that (15) is asymmetric. Thus, it is hard to guarantee the optimal \(L^{2}\) error convergence. In order to overcome this problem, additional interface integral terms are added to the left hand side of (15) to make the discretization symmetric. For more introduction to the symmetric direct discontinuous Galerkin method, cf. [11]. The final discretization is given as follows: find \(u_{h}\in\mathcal{V}_{h}\) and \(\hat{u}_{h}\in\mathcal{M}_{h}(0)\) such that for all \(v_{h}\in\mathcal {V}_{h}\) and \(\hat{v}_{h}\in\mathcal{M}_{h}(0)\) we have
where
and
Remark 1
Although the form of (16) is similar to the hybridizable symmetric interior penalty method (HSIP) [12], the derivation and motivation of the two approaches are different. For the discretization (16), the numerical flux is directly approximated by the solution gradient. For HSIP method, the jumps are introduced as penalty terms to guarantee the stability of the method.
3.3 Hybridization
Utilizing traces defined on element faces, we can eliminate DoFs related with \(u_{h}\) to obtain a global linear system only involving DoFs of traces through static condensation process, as described below.
After assembling all of the cell and face terms in (16) together, we have the following linear system:
Here we divide the global matrix into four blocks \(A^{(u_{h},v_{h})}\), \(B^{(\hat{u}_{h},v_{h})}\), \(C^{(u_{h},\hat{v}_{h})}\), \(D^{(\hat{u}_{h},\hat {v}_{h})}\). The superscript on the block matrix or vector means how the values of this matrix are coupling. For example, \(A^{(u_{h},v_{h})}\) means this block matrix only consists of terms only involving the integrals containing both of \(u_{h}\) and \(v_{h}\). Additionally, \(U^{(u_{h})}\) and \(\hat{U}^{(\hat{u}_{h})}\) represent the vector of unknowns for \(u_{h}\) and \(\hat{u}_{h}\), respectively.
By the block matrix operations, we obtain
where, in order to simplify the formulas, we drop the superscripts of block matrices and vectors. Thus, U can be eliminated by some algebraic operations, i.e.,
Therefore, we obtain a reduced global linear system only for Û. After solving the system (22), we can get U immediately through an element-by-element fashion, namely
Remark 2
We note that in (22) and (23) the inversion of A is needed. However, because of the fact that DoFs related with \(u_{h}\) are not coupled between different elements, A is easy to invert.
4 A prior error estimation
In this section we give a prior error estimation of the method proposed above and derive computable lower bounds for the constant β in numerical flux functions in order to guarantee the stability and convergence of this method. Before giving the theoretical error analysis, let us define the following two energy norms associated to bilinear form (17):
where \(\|\cdot\|\) is the \(L^{2}\) norm. Moreover, let us recall the following \(L^{2}\)-projection error estimation inequality [13].
Lemma 1
Let \(\mathcal{P}_{h}\) be the \(L^{2}\)-projection onto \(\mathcal{V}_{h}\) and \(u\in H^{p+1}(\kappa)\), \(0\leq m\leq p\), then
where \(\kappa\in\mathcal{T}_{h}\).
Theorem 1
Let the bilinear form \(\mathcal{B}(\mathbf{u}_{h},\mathbf{v}_{h})\) be defined by (17), then we have:
-
(i)
If u is the exact solution of (1) and û is the trace value of u. Then
$$ \mathcal{B}_{h}(\mathbf{u},\mathbf{v})=\mathcal{L}(\mathbf{v}),\quad \forall v\in \mathcal{V}, \hat{v}\in\mathcal{M}(0), $$(28)where \(\mathbf{u}:=(u,\hat{u})\) and \(\mathbf{v}:=(v,\hat{v})\). Furthermore, if \(u_{h}\in\mathcal{V}_{h}\) and \(\hat{u}_{h}\in\mathcal{M}_{h}(0)\), then
$$ \mathcal{B}_{h}(\mathbf{u}_{h}-\mathbf{u}, \mathbf{v}_{h})=0,\quad \forall v\in \mathcal{V}_{h}, \hat{v}_{h}\in\mathcal{M}_{h}(0). $$(29) -
(ii)
Assume that \(\theta_{\kappa}\) is the smallest angle in the two triangles obtained by subdividing the quadrilateral cell \(\kappa\in \mathcal{T}_{h}\) along the longest diagonal and \(\gamma_{\kappa}\) is a positive constant associated to κ. For all \(\kappa\in\mathcal {T}_{h}\), define
$$ \beta^{*}_{\kappa}=\frac{p^{\kappa}(p^{\kappa}+1)}{\gamma_{\kappa}\sin \theta_{\kappa}}, $$where \(p^{\kappa}\) is the degree of the polynomial defined on κ. For all \(u_{h}\in\mathcal{V}_{h}\), \(\hat{u}_{h}\in\mathcal{M}_{h}\), if \(\gamma_{\kappa}<1\) and \(\beta>\beta^{*}_{\kappa}\), then there are constants C, α independent of mesh size, such that
$$ \mathcal{B}_{h}(\mathbf{u}_{h},\mathbf{u}_{h}) \geq C|\!|\!|\mathbf{u}_{h} |\!|\!|^{2}_{*}\geq \frac{C}{1+\alpha} |\!|\!|\mathbf{u}_{h} |\!|\!|^{2} , $$(30)where \(C=\min_{\kappa\in\mathcal{T}_{h}} \{\min \{ 1-\gamma_{\kappa},2(\beta-\beta^{*}_{\kappa}) \} \}\) and \(\alpha=\max_{\kappa\in\mathcal{T}_{h}} \{\frac {2p^{\kappa}(p^{\kappa}+1)}{\sin\theta_{\kappa}} \}\).
-
(iii)
For all \(u,v\in\mathcal{V}\) and \(\hat{u},\hat{v}\in\mathcal {M}\), we have
$$ \bigl\vert \mathcal{B}_{h}(\mathbf{u},\mathbf{v})\bigr\vert \leq C{|\!|\!|\mathbf{u} |\!|\!|} {|\!|\!|\mathbf{v} |\!|\!|}, $$(31)where \(C=1+2\beta\).
Proof
First of all, we rewrite the bilinear form \(\mathcal{B}_{h}(\mathbf {u}_{h},\mathbf{v}_{h})\) as follows:
(i) Here u is the exact solution, thus,
therefore,
Furthermore, due to \(v_{h}\in\mathcal{V}\), \(\hat{v}_{h}\in\mathcal {M}(0)\), we have
therefore,
(ii) For all \(u_{h}\in\mathcal{V}_{h}\), \(\hat{u}_{h}\in\mathcal{M}_{h}\), employing the Cauchy-Schwarz inequality we have
Then we recall the inverse trace inequality for the two dimensional simplex [14]:
For a quadrilateral cell with edges \(\mathcal{E}_{1}\), \(\mathcal{E}_{2}\), \(\mathcal{E}_{3}\), \(\mathcal{E}_{4}\), we subdivide it into two triangles \(T_{1}\), \(T_{2}\) along the longest diagonal, as shown in Figure 1, and the angle between \(\mathcal{E}_{i}\) and the longest diagonal is denoted by \(\theta_{i}\), \(i=1, 2, 3, 4\). Then we have
Therefore,
Similarly,
Thus,
Here we assume \(\theta_{\kappa}\) is the smallest angle of \(\{\theta _{i}\}\), namely, \(\theta_{\kappa}=\min\{\theta_{i}\}\), then
Finally, we obtain
Therefore, applying the inverse trace inequality (33), we have
Furthermore, employing Young’s inequality, we have
where \(\gamma_{\kappa}\) is a positive constant. Finally, we obtain
Thus, for all \(\kappa\in\mathcal{T}_{h}\), if \(\gamma_{\kappa}<1\) and \(\beta>\frac{p^{\kappa}(p^{\kappa}+1)}{\gamma_{\kappa}\sin\theta _{\kappa}}\), we have
where \(C=\min_{\gamma\in\mathcal{T}_{h}} \{\min \{ 1-\gamma_{\kappa},2(\beta-\frac{p^{\kappa}(p^{\kappa}+1)}{\gamma _{\kappa}\sin\theta_{\kappa}}) \} \}\).
Moreover, applying inequality (34), we have
where \(\alpha=\max_{\kappa\in\mathcal{T}_{h}} \{\frac {2p^{\kappa}(p^{\kappa}+1)}{\sin\theta_{\kappa}} \}\).
Therefore,
Thus, we have
This completes the proof.
(iii) Applying the Cauchy-Schwarz inequality we obtain
Based on the definition of the energy norm, we have
Therefore,
where \(C=1+2\beta\).
This completes the proof. □
Corollary 1
Assume that \(\theta_{\min}=\min_{\kappa\in\mathcal{T}_{h}}\{ \theta_{\kappa}\}\) and the uniform polynomials are used in the computational domain. Then the threshold value of β is obtained when \(\gamma_{\kappa}=1\), i.e., \(\beta_{\mathrm{ths}}=\frac {p(p+1)}{\sin\theta_{\min}}\).
Theorem 2
Let \(u\in H^{(p+1)}(\mathcal{T}_{h})\) be the exact solution of (1) and \(u_{h}\in\mathcal{V}_{h}\) be the solution of (16). Then there is constant \(C>0\) such that
where \(h=\max_{\kappa\in\mathcal{T}_{h}}h_{\kappa}\) and C is independent of h.
Proof
Employing (30), we have
where \(\boldsymbol{\mathcal{P}}_{h}\mathbf{u}:=(\mathcal{P}_{h}u,\mathcal{P}_{h}\hat{u})\). Furthermore,
Therefore, we have
namely,
Then
Using Lemma 1, we can deduce
Finally, we obtain
□
Theorem 3
Let \(u\in H^{(p+1)}(\mathcal{T}_{h})\) be the exact solution of (1) and \(u_{h}\in\mathcal{V}_{h}\) be the solution of (16). Then there is a constant \(C>0\) such that
where \(h=\max_{\kappa\in\mathcal{T}_{h}}h_{\kappa}\) and C is independent of h.
Proof
We note that \(\mathcal{B}_{h}(\cdot,\cdot)\) is symmetric and discretization (16) is consistent (Theorem 1). Thus, the discretization (16) is adjoint consistent. Therefore, we can define the following adjoint problem:
Find \(z\in\mathcal{V}\), \(\hat{z}\in\mathcal{M}(0)\), \(\forall v\in \mathcal{V}\), \(\hat{v}\in\mathcal{M}(0)\) such that
Particularly, we take \(\mathbf{v}=\mathbf{u}-\mathbf{u}_{h}\), then
For all \(z_{h}\in\mathcal{V}_{h}\), \(\hat{z}_{h}\in\mathcal{M}_{h}(0)\), by employing (29), we obtain
From Theorem 2, we have
And we assume that the elliptic regularity holds [15], i.e.,
Finally, combining the above formulas together, we deduce
where C is a constant and independent of h. □
5 Numerical results
In this section, we present a numerical experiment to assess the practical performance of the proposed method and verify the theoretical analysis. The right hand side f and boundary condition are chosen such that the analytical solution is \(u(x,y)=\cos(8\pi x)+\cos(8\pi y)\), and \(\Omega:=[0,1]^{2}\). The analytical solution of this problem is shown in Figure 2. We carry out the numerical computation on a uniform mesh with 1,024 elements which is shown in Figure 3. For this uniform mesh \(\theta_{\min }=\frac{\pi}{4}\). Therefore, the threshold value \(\beta^{*}=\sqrt{2}p(p+1)\). Figures 4 and 5 show the numerical solution under different β for \(p=1,2\), respectively. From these results we note that for a smaller β the numerical solution is unstable, while for \(\beta>\beta ^{*}\) no oscillation occurs. Furthermore, we plot the error \(\|u-u_{h}\| _{L_{2}}\) under different β in Figures 6 and 7. From these figures, we again observe that for a smaller β the oscillation occurs and when \(\beta>\beta^{*}\) the \(L_{2}\) error tends to be stable. Moreover, we can also get the ‘numerical lower bounds for β’ that are equal to 3 for \(p=1\) and 6 for \(p=2\), which confirms the effectivity of the theoretical lower bounds of β. Table 1 shows the history of the convergence under global mesh refinement with a fixed \(\beta>\beta^{*}\). From these results we note that the convergence rate is optimal in \(L^{2}\) norm, i.e., for \(p=1,2,3\), the order of convergence is \(p+1\). This result coincides with the prior error analysis which has been shown in Theorem 3.
6 Conclusion
In this paper, we have proposed a hybridizable discontinuous Galerkin method based on DDGM. During the derivation of this method, we introduced the main idea of HDGM and showed how to construct numerical flux based on DDGM. Then a rigorous theoretical analysis has been established. We also gave computable lower bounds for the constant in the numerical flux functions. The numerical results obtained coincided with the theoretical analysis and the optimal convergence order has been observed. Although in this work our analysis is based on the Dirichlet boundary condition, we can easily extend this method to the Neumann or Robin boundary condition, which we leave here as future research work.
References
Reed, WH, Hill, TR: Triangular mesh methods for the neutron transport equation. Los Alamos Report LA-UR-73-479 (1973)
Arnold, DN, Brezzi, F, Cockburn, B, Marini, LD: Unified analysis of discontinuous Galerkin methods for elliptic problems. SIAM J. Numer. Anal. 39(5), 1749-1779 (2001)
Douglas, J, Dupont, T: Interior penalty procedures for elliptic and parabolic Galerkin methods. In: Computing Methods in Applied Sciences, pp. 207-216. Springer, New York (1976)
Cockburn, B, Hou, S, Shu, C-W: The Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws. IV. The multidimensional case. Math. Comput. 54(190), 545-581 (1990)
Cockburn, B, Shu, C-W: TVB Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws. II. General framework. Math. Comput. 52(186), 411-435 (1989)
Cockburn, B, Lin, S-Y, Shu, C-W: TVB Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws III: one-dimensional systems. J. Comput. Phys. 84(1), 90-113 (1989)
Cockburn, B, Gopalakrishnan, J, Lazarov, R: Unified hybridization of discontinuous Galerkin, mixed, and continuous Galerkin methods for second order elliptic problems. SIAM J. Numer. Anal. 47(2), 1319-1365 (2009)
Liu, H, Yan, J: The direct discontinuous Galerkin (DDG) method for diffusion with interface corrections. Commun. Comput. Phys. 8(3), 541-564 (2010)
Liu, H, Yan, J: The direct discontinuous Galerkin (DDG) methods for diffusion problems. SIAM J. Numer. Anal. 47(1), 675-698 (2009)
Cheng, J, Yang, X, Liu, T, Luo, H: A direct discontinuous Galerkin method for the compressible Navier-Stokes equations on arbitrary grids. In: 54th AIAA Aerospace Sciences Meeting, p. 1334 (2016)
Vidden, C, Yan, J: A new direct discontinuous Galerkin method with symmetric structure for nonlinear diffusion equations. J. Comput. Math. 31(6), 638-662 (2013)
Lehrenfeld, C, Schöberl, J, Reusken, A: Hybrid discontinuous Galerkin methods for solving incompressible flow problems. PhD thesis, Rheinisch-Westfälischen Technischen Hochschule Aachen (2010)
Hartmann, R: Numerical analysis of higher order discontinuous Galerkin finite element methods (2008)
Warburton, T, Hesthaven, JS: On the constants in hp-finite element trace inverse inequalities. Comput. Methods Appl. Mech. Eng. 192(25), 2765-2773 (2003)
Brenner, S, Scott, R: The Mathematical Theory of Finite Element Methods. Texts in Applied Mathematics. Springer, New York (2008)
Acknowledgements
This work is supported by the National Natural Science Foundation of China (No. 91530325), the International Cooperation Project (No. 2010DFR00700), and the Fundamental Research of Civil Aircraft (No. MJ-F-2012-04).
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
The first author had the idea of this work and drafted the manuscript. The second and third authors gave helpful suggestions on the practical implementation of this method. The fourth author provided some useful theoretical analysis. All authors read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Yue, H., Cheng, J., Liu, T. et al. A hybridizable direct discontinuous Galerkin method for elliptic problems. Bound Value Probl 2016, 191 (2016). https://doi.org/10.1186/s13661-016-0700-x
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13661-016-0700-x
Keywords
- hybridizable method
- discontinuous Galerkin
- elliptic problem