A hybridizable discontinuous Galerkin method for the indefinite time-harmonic Maxwell equations
Gang Chen, Haijun Wu, Liwei Xu

TL;DR
This paper develops a hybridizable discontinuous Galerkin (HDG) method for solving the indefinite time-harmonic Maxwell equations in 3D, providing error estimates independent of the wavenumber and validated by numerical tests.
Contribution
The paper introduces a novel HDG method for Maxwell equations with explicit wavenumber regularity and a discrete inf-sup condition, ensuring stability and optimal error estimates.
Findings
Error estimates are independent of the wavenumber.
The method is stable for all mesh sizes and domain shapes.
Numerical experiments confirm theoretical predictions.
Abstract
In this paper, we aim to develop a hybridizable discontinuous Galerkin (HDG) method for the indefinite time-harmonic Maxwell equations with the perfectly conducting boundary in the three-dimensional space. First, we derive the wavenumber explicit regularity result, which plays an important role in the error analysis for the HDG method. Second, we prove a discrete inf-sup condition which holds for all positive mesh size , for all wavenumber , and for general domain . Then, we establish the optimal order error estimates of the underlying HDG method with constant independent of the wavenumber. The theoretical results are confirmed by numerical experiments.
| and | DOF | |||||||
| Error | Rate | Error | Rate | Error | Rate | |||
| 2 | 3.7906E-01 | 9.5130E-02 | 1.6667E-02 | 360 | ||||
| 4 | 2.5031E-01 | 0.60 | 4.1590E-02 | 1.19 | 1.6667E-02 | 0.00 | 2592 | |
| 8 | 1.4666E-01 | 0.77 | 2.1067E-02 | 0.98 | 1.6667E-02 | 0.00 | 19584 | |
| 16 | 9.1599E-02 | 0.68 | 1.6154E-02 | 0.38 | 1.6667E-02 | 0.00 | 152064 | |
| 32 | 6.9852E-02 | 0.39 | 1.5301E-02 | 0.08 | 1.6667E-02 | 0.00 | 1198080 | |
| 2 | 3.6969E-01 | 2.1000E-01 | 1.1601E-01 | 1080 | ||||
| 4 | 2.7883E-01 | 0.41 | 8.4783E-02 | 1.31 | 1.1252E-01 | 0.04 | 7776 | |
| 8 | 1.5310E-01 | 0.86 | 2.8027E-02 | 1.60 | 5.7498E-02 | 0.97 | 58752 | |
| 16 | 7.7765E-02 | 0.98 | 7.9120E-03 | 1.82 | 1.8379E-02 | 1.65 | 456192 | |
| 20 | 6.2272E-02 | 1.00 | 5.1567E-03 | 1.92 | 1.2200E-02 | 1.84 | 885600 | |
| 24 | 5.1907E-02 | 1.00 | 3.6202E-03 | 1.94 | 8.6610E-03 | 1.88 | 1524096 | |
| 2 | 1.1268E-01 | 1.7747E-02 | 4.6996E-02 | 2160 | ||||
| 4 | 2.0568E-02 | 2.45 | 2.5278E-03 | 2.81 | 9.8661E-03 | 2.25 | 15552 | |
| 8 | 3.0455E-03 | 2.76 | 3.0921E-04 | 3.03 | 1.4088E-03 | 2.81 | 117504 | |
| 10 | 1.6555E-03 | 2.73 | 1.5837E-04 | 3.00 | 7.2701E-04 | 2.96 | 226800 | |
| and | DOF | |||||||
| Error | Rate | Error | Rate | Error | Rate | |||
| 2 | 7.4437E-01 | 3.2849E-01 | 5.1282E-04 | 360 | ||||
| 4 | 7.3811E+00 | -3.31 | 1.3346E+00 | -2.02 | 5.1282E-04 | 0.00 | 2592 | |
| 8 | 2.7629E-01 | 4.74 | 2.6318E-02 | 5.66 | 5.1282E-04 | 0.00 | 19584 | |
| 16 | 2.4892E-01 | 0.15 | 2.5806E-02 | 0.03 | 5.1282E-04 | 0.00 | 152064 | |
| 32 | 2.1269E-01 | 0.23 | 2.2993E-02 | 0.17 | 5.1282E-04 | 0.00 | 1198080 | |
| 2 | 1.5005E+02 | 6.4286E+01 | 4.2702E+00 | 1080 | ||||
| 4 | 4.3338E+01 | 1.79 | 7.8929E+00 | 3.03 | 1.8190E+00 | 1.23 | 7776 | |
| 8 | 6.5219E-01 | 6.05 | 8.6414E-02 | 6.51 | 6.3289E-02 | 4.85 | 58752 | |
| 14 | 1.7594E-01 | 2.34 | 2.0004E-02 | 2.61 | 3.1374E-02 | 1.25 | 456192 | |
| 2 | 2.1350E+00 | 3.6243E-01 | 6.0256E-02 | 2160 | ||||
| 4 | 2.5087E-02 | 6.41 | 2.5087E-03 | 7.17 | 4.9402E-03 | 3.61 | 15552 | |
| 8 | 3.8122E-03 | 2.72 | 2.6201E-04 | 3.26 | 1.6822E-03 | 1.55 | 117504 | |
| 10 | 2.0711E-03 | 2.73 | 1.2736E-04 | 3.23 | 1.1009E-03 | 1.90 | 226800 | |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsElectromagnetic Simulation and Numerical Methods · Advanced Numerical Methods in Computational Mathematics · Numerical methods in engineering
A hybridizable discontinuous Galerkin method for the indefinite time-harmonic Maxwell
equations
Gang Chen School of Mathematics Sciences, University of Electronic Science and Technology of China, Chengdu, 611731, China. The first author’s work is supported by National Natural Science Foundation of China (NSFC) grant no. 11801063, China Postdoctoral Science Foundation project no. 2018M633339, and Key Laboratory of Numerical Simulation of Sichuan Province (Neijiang, Sichuan Province) grant no. 2017KF003. (email:[email protected]).
Jintao Cui
- Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Hong Kong. 2. The Hong Kong Polytechnic University Shenzhen Research Institute, Shenzhen, 518057, China. The second author’s research is supported in part by Hong Kong RGC, General Research Fund (GRF) grant no. 15302518 and National Natural Science Foundation of China (NSFC) no. 11771367. (email:[email protected]).
Haijun Wu
Department of Mathematics, Nanjing University, Nanjing, 210093, China (email:[email protected]).
Liwei Xu School of Mathematics Sciences, University of Electronic Science and Technology of China, Chengdu, 611731, China. The third author’s research is supported in part by a Key Project of the Major Research Plan of National Natural Science Foundation of China (NSFC) grant no. 91630202 and National Natural Science Foundation of China (NSFC) grant no. 11771068. (Corresponding author: Liwei Xu, email:[email protected]).
Abstract
In this paper, we aim to develop a hybridizable discontinuous Galerkin (HDG) method for the indefinite time-harmonic Maxwell equations with the perfectly conducting boundary in the three-dimensional space. First, we derive the wavenumber explicit regularity result, which plays an important role in the error analysis for the HDG method. Second, we prove a discrete inf-sup condition which holds for all positive mesh size , for all wavenumber , and for general domain . Then, we establish the optimal order error estimates of the underlying HDG method with constant independent of the wavenumber. The theoretical results are confirmed by numerical experiments.
keywords: Maxwell equations, HDG method, low regularity
1 Introduction
Let be a bounded simply-connected Lipschitz polyhedron in with a connected boundary . We consider the following lossless case of the time-harmonic Maxwell equations with the perfectly conducting boundary condition in a mixed form [45]:
Find the electric field and the Lagrange multiplier such that
[TABLE]
Here, is the outward normal unit vector to the boundary , is a given external source filed, is a real wavenumber, where is a given temporal frequency, and and are the electric permittivity and the magnetic permeability of the free space, respectively. Note that in the special case here (relative electric permittivity of the medium equals one and perfect conducting boundary condition), the real and imaginary parts are decoupled, and thus we assume that , and are real.
The numerical solution of the indefinite time-harmonic Maxwell equations suffers from the following two challenges. First, on a non-convex domain, the solution of Maxwell equations is only in with . A direct application of continuous finite element methods will result in a discrete solution that convergences to a function that is not a solution of the Maxwell equations. Second, the quality of discrete numerical solutions to the Maxwell equation depends significantly on the wavenumber .
Different methods are applied to solve the electromagnetic models, including boundary integral methods [4, 23, 41], boundary element methods [3, 5], and finite element methods. The finite element method was the most popular computational technique for solving the time-harmonic Maxwell equation. In particular, finite element methods using -conforming edge elements have been studied in vast literatures for (1) and its reduced problem where , see [39, 40, 31, 38, 51, 50]. Moreover, preconditioners for finite element methods solving the indefinite Maxwell equations were investigated in [1, 47, 28, 29] and the references therein. Since the late 1970s, the discontinuous Galerkin (DG) methods have become increasingly popular due to its attractive features, including preserving local conservation of physical quantities, their flexible in meshing, easy of design and implementation, their suitable in parallel computation, and easy of use within an -adaptive strategy. DG methods for solving the time-harmonic Maxwell equations with zero wavenumber were first developed in [44, 35]. Later, interior penalty discontinuous Galerkin (IPDG) methods for the indefinite Maxwell equations was studied in [45, 46]. Since there was no wavenumber explicit regularity result available for the time-harmonic Maxwell equation with the perfect conducting boundary condition (1c), the constants in stability results and error estimates of the IPDG methods in [45] are highly dependent on the wavenumber. In [25, 33], the authors proposed and analyzed DG methods for the indefinite Maxwell equations with the impedance boundary condition, and derived the wavenumber explicit convergence results. We would like to remark that there are no research on the error estimates with explicit wavenumber dependence for the indefinite Maxwell equations with the perfect conducting boundary. We should also mention that in [7, 6, 8, 48], the DG methods for the spurious Maxwell modes were considered.
In recent years, the hybridizable discontinuous Galerkin (HDG) method, a “new” type of DG methods, has been successfully applied to solve various types of differential equations, see [18, 10, 11, 21, 27, 17, 13] and many other references. The HDG method retains the advantages of standard DG methods and can significantly reduce the number of degrees of freedom, therefore, allowing for a substantial reduction in the computational cost. The first work [42] that applies HDG methods to solve the indefinite time-harmonic Maxwell equations appears in 2011. In that paper, two HDG schemes are introduced and numerical results are reported to illustrate the performance of the proposed schemes. The convergence analysis is not given therein. Recently, two HDG methods for the time-harmonic Maxwell equations with zero wavenumber are proposed and analyzed in [15, 14, 12], where the a priori and a posteriori error estimates are derived. The HDG methods are also studied in [24, 37] for the indefinite time-harmonic Maxwell equations with the impedance boundary condition. The error estimates are derived where the constants depend explicitly on the wavenumber. The convergence analysis therein is based on the regularity results of Maxwell equations developed in [25, 32].
In this paper, we propose a new HDG method for the indefinite time-harmonic Maxwell equations (1) with the perfect conducting boundary condition. We first derive the wavenumber explicit regularity result of the Maxwell equations, that is: there exists a regularity index dependent on , such that and
[TABLE]
where is defined as
[TABLE]
and is the set of all eigenvalues of the corresponding eigenvalue problems. The above regularity result is not yet available in the literature. Then based on the new regularity result, we establish the error estimates for the proposed HDG method, where the constants are independent of the wavenumber:
[TABLE]
providing is convex and . To the best of our knowledge, such convergence result is also the first of its kind in the numerical study of the indefinite time-harmonic Maxwell equations.
The rest of this paper is organized as follows. In section 2, we give a regularity result of the indefinite time-harmonic Maxwell equations. In section 3 and 4, we propose a new HDG method and establish its well-posedness. In section 5, we develop the convergence analysis of the HDG method based on the regularity and stability results. In section 6, numerical experiments are performed to verify the theoretical results.
Throughout this paper, we use to denote a positive constant independent of mesh size and the wavenumber , not necessarily the same at its each occurrence. For convenience we use the shorthand notation and for the inequality and . stands for and .
2 The wavenumber explicit regularity
For any bounded Lipschitz domain \Lambda\color[rgb]{0,0,0}\subset\color[rgb]{0,0,0}\mathbb{R}^{s} , let and denote the usual -order Sobolev spaces on , and , denote the norm and semi-norm on these spaces. We use to denote the inner product of , with . We use to denote the trace of on . When , we denote by , , . In particular, for a surface and a curve in we use and to denote the inner products on and , respectively. The bold face fonts will be used for vector (or tensor) analogues of the Sobolev spaces along with vector-valued (or tensor-valued) functions. Define the spaces
[TABLE]
and
[TABLE]
Lemma 2.1** (Helmholtz decomposition [38]).**
For any , there exist functions and such that
[TABLE]
and
[TABLE]
We define the bilinear form:
[TABLE]
By testing the first equation of (1) with functions , it is easy to check that the solution of (1) is also the solution of the weak problem:
Find such that
[TABLE]
Similarly, by testing the first equation of (1) with where , we observe that the solution of (1) is also the solution of the weak problem:
Find such that
[TABLE]
Introduce the following auxiliary problem: find such that
[TABLE]
Define the solution operator as: for any , find such that
[TABLE]
Let be the weak solution to (1) (i.e., the solution to (5)), then it is obvious that
[TABLE]
which leads to the following relation:
[TABLE]
We recall the classical estimation for vector potential in the following lemma.
Lemma 2.2** (cf. [26, Proposition 7.4]).**
Let , and , then there exists a constant such that
[TABLE]
The stability results of problems (7) and (8) are established in the next two lemmas.
Lemma 2.3**.**
The problem (7) has a unique solution satisfying the following estimate:
[TABLE]
Proof.
By taking in Lemma 2.2, we have that for any . Therefore the bilinear form is continuous and coercive under the norm \big{(}({k}^{2}+1)\|\bm{v}\|^{2}_{0}+\|\nabla\times\bm{v}\|^{2}_{0}\big{)}^{\frac{1}{2}}. By the Lax-Milgram lemma, (7) attains a unique solution , and there holds
[TABLE]
which implies (10). ∎
Lemma 2.4**.**
There hold
- (i)
For a given , the problem (8) has a unique solution satisfying the following stability estimate:
[TABLE]
- (ii)
* is self-adjoint and compact operator on ;*
- (iii)
* admits a countably infinite orthonormal basis of eigenvectors of , with corresponding eigenvalues satisfying .*
Proof.
It is clear that (i) is a consequence of Lemma 2.3 with .
(ii) follows directly from the definition (8) of and the compact embedding of in (cf. [38, Page 87, Theorem 4.7]).
(iii) follows from (ii), the spectral theory of compact self-adjoint operator on Hilbert space (cf. [30, Page 60, Theorem 6.21]), and the fact that the orthogonal complement of the kernel of is , which may be proved by the definition (8) of . We omitted the details. This completes the proof of the lemma.
∎
Let be the nonzero eigenvalues of the Maxwell operator on and be the corresponding eigenfunctions:
[TABLE]
Lemma 2.5**.**
The eigenvalues of consists of , with corresponding eigenfunctions .
Proof.
First we note that since . It follows from the Helmholtz decomposition lemma 2.1 that (12) is equivalent to the following eigenvalue problem: such that
[TABLE]
Clearly, (13a) is equivalent to
[TABLE]
the proof of the lemma following by using the definition of and some simple calculations. ∎
The well-posedness of (5) is given in the next lemma.
Lemma 2.6**.**
Suppose is not a Maxwell eigenvalue of (12), then problem (5) has a unique solution. Moreover, the inverse of exists, and
[TABLE]
where
[TABLE]
Proof.
From Lemma 2.6, the eigenvalues is given by which are all nonzero. Therefore, is invertible and (14) follows from Lemma 2.4 (iii) and the -orthogonality of the basis Then the well-posedness of (5) follows by using (9). ∎
Remark 2.1**.**
Let us take a close look at the constant . First, it could be arbitrary large if approaches to any nonzero Maxwell eigenvalue. Next we illustrate the lower bound of by considering the case when is a convex polyhedron. Similar to [19, Theorem 4.1], the nonzero Maxwell eigenvalues are also eigenvalues of the Laplace operator with Neumann boundary condition, whose eigenvalue behaves asymptotically as where is a constant depending only on the domain (see e.g.[16, 49]). Therefore if the wave number is sufficient large and is located for some large ,
[TABLE]
In the rest of section, we derive stability and regularity results for the indefinite time-harmonic Maxwell’s equations (1).
Lemma 2.7**.**
(1) has a unique weak solution , and the following stability estimate holds
[TABLE]
Proof.
By combining (9), (10), (14), we get
[TABLE]
It follows from (9), (10), (11) and (17) that
[TABLE]
which together with (17) implies that (16) holds. ∎
The following embedding theory is a useful tool in the analysis of Maxwell equations.
Lemma 2.8** (cf. [2, Proposition 3.7]).**
If the domain is a Lipschitz polyhedron, then and are continuously embedded in for some real number .
Finally, we give the wavenumber explicit regularity result of (1).
Theorem 2.1** (Regularity).**
Let be the solution of (1), then there exists a regularity index dependent on , such that and
[TABLE]
Proof.
Let be the solution of (1). Note that since . Hence by lemma 2.8, there exists a real number such that
[TABLE]
We apply on (1a), and combine (1b) to get
[TABLE]
Since is a Lipschitz polyhedron, by the standard elliptic regularity results in [22], we obtian the regularity resut for (20): there exists a real number such that
[TABLE]
Therefore the first two inequalities hold with . The last inequality may be derived by using the regularity result in [20, §4] and (16). This completes the proof of the theorem. ∎
Remark 2.2**.**
In [45], it has been proved that
[TABLE]
where dependents on . Here, we give explicitly the result that how dependent on .
3 An HDG method
By introducing , we can rewrite (1) as:
Find that satisfies
[TABLE]
Let be a shape-regular partition of the domain consisting of arbitrary polyhedra. For any , let be the infimum of the diameters of spheres containing and denote the mesh size . Let be the union of all faces of ; let and be the set of interior faces and boundary faces, respectively. We denote by the diameter of smallest circle containing face . Moreover, we define the mesh-size function as
[TABLE]
For any , we denote by the unit outward normal vector to . We extend the definition of to the boundary of elements by letting . Note that is double valued on interior faces with opposite directions. For any interior face shared by element and element and any piecewise function , we define the jump of on as
[TABLE]
On a boundary face , we set . For , we define the following inner product and norm
[TABLE]
Broken curl, divergent and gradient operators with respect to mesh partition are donated by , and , respectively.
For an integer , denotes the set of all polynomials defined on with degree no greater than . For any integer and , we introduce the following finite dimensional spaces:
[TABLE]
The HDG method for (1) reads as follows.
Find an approximation such that
[TABLE]
for any , where the numerical fluxes are defined as
[TABLE]
Remark 3.1**.**
The above HDG method is different from it in [42] in the following two aspects: the stabilization parameters in [42] are and the stabilization parameters here are ; the scheme in [42] used polynomials for all variables and we allow polynomials for the approximation of .
By using (24a)–(24b) and (23d)–(23e) to eliminate and in (23a)–(23c) and using integration by parts, we get the following saddle point system:
Find such that
[TABLE]
for all . Here the bilinear forms , , and are defined by
[TABLE]
To simplify the notation, we introduce the spaces
[TABLE]
Clearly . Introduce the following bilinear forms on . Given
[TABLE]
let
[TABLE]
Denote by
[TABLE]
The HDG method (25) can be rewritten in the following compact form.
Find such that
[TABLE]
By doing integration by parts, it is easy to verify that the following orthogonality property holds for the HDG scheme (30).
Lemma 3.1** (Orthogonality).**
Let and be the solutions of (21) and (30), respectively. Then we have
[TABLE]
where \bm{\sigma}=\big{(}\bm{r},\bm{u},\bm{u}|_{\mathcal{F}_{h}},p,p|_{\mathcal{F}_{h}}\big{)} and denotes the restriction of a function to the union of faces in .
We introduce the following mesh-dependent norm and seminorms.
[TABLE]
where .
4 Elliptic projection
In this section, we derive the error estimate of the following elliptic project based on the bilinear form , which will used to analyze the proposed HDG method: Given \bm{\sigma}:=\big{(}\bm{r},\bm{u},\bm{u}|_{\mathcal{F}_{h}},p,p|_{\mathcal{F}_{h}}\big{)}, find such that
[TABLE]
4.1 Approximation errors
In this subsection, we consider approximation properties of the discrete space .
For any , and any integer , let and be the usual projection operators. The following stability and error estimates are standard .
Lemma 4.1**.**
For any and and , it holds
[TABLE]
where .
Next, we recall the error estimate results for the interpolation operator for the Nédélec element of second type (see [40]) .
Lemma 4.2** (cf. [40, 1, 38]).**
There hold for and ,
[TABLE]
Next we recall two lemmas which present two interpolation operators of Osward type [43]. The first one says that every discontinuous piecewise polynomials in has a good -conforming approximation (see, e.g., [43, 9, 12, 36, 52]).
Lemma 4.3**.**
There exists an interpolation operator such that
[TABLE]
Note that the supscript c stands for “conforming”. The second one says that every discontinuous piecewise polynomials in has a good -conforming approximation.
Lemma 4.4** (cf. [34, Proposition 4.5]).**
There is an interpolation from to such that for all , we have the following approximation properties
[TABLE]
with a constant independent of mesh size.
The following lemma says that every discrete function in has a discrete Helmholtz decomposition and the discrete divergence free part in the decomposition has a good “continuous” approximation. (see, e.g., [31, Theorem 4.1 and Lemma 4.5], [38, §7.2.1])
Lemma 4.5**.**
For any , there exist and such that
[TABLE]
Moreover there exist and a constant determined by , such that
[TABLE]
Next we consider the approximation properties of the discrete space . Given , let \bm{\sigma}:=\big{(}\bm{r},\bm{u},\bm{u}|_{\mathcal{F}_{h}},p,p|_{\mathcal{F}_{h}}\big{)} and define its approximation in by
[TABLE]
The following lemma gives the error estimate of in the norm .
Lemma 4.6**.**
Assume that with . Then there holds
[TABLE]
Proof.
From the definition (32) of we have
[TABLE]
Next we estimate the three terms . First, from Lemma 4.1 and Lemma 4.2, we have
[TABLE]
Secondly, from the trace inequality, the inverse inequality, Lemma 4.1, and Lemma 4.2, we conclude that
[TABLE]
Thirdly, It follows from Lemma 4.1 that
[TABLE]
Then the proof of the theorem follows by plugging (38)–(40) into (4.1). ∎
The following lemma show that satisfies an approximate Galerkin orthogonality with respect to the bilinear form .
Lemma 4.7**.**
Assume that with . Let \bm{\sigma}=\big{(}\bm{r},\bm{u},\bm{u}|_{\mathcal{F}_{h}},p,p|_{\mathcal{F}_{h}}\big{)}. Then
[TABLE]
Proof.
For any , it follows from the definition of in (3), integration by parts, and the identity that
[TABLE]
Therefore, from the Cauchy-Schwarz inequality, (4.1), and (32) , we conclude that
[TABLE]
which together with Lemmas 4.6, 4.1, and 4.2 completes the proof of the lemma. ∎
4.2 Discrete inf-sup condition
In this subsection we show that satisfies a discrete inf-sup condition.
The following theorem derive a discrete inf-sup condition for .
Theorem 4.1** (Discrete inf-sup condition).**
For all , the bilinear form defined in (3) satisfies
[TABLE]
where is a constant independent of and .
Proof.
The proof is divided into five steps.
Step one:
Let . By (32) and (3), we have
[TABLE]
and
[TABLE]
Step two:
Let . By (32) and (3), we have
[TABLE]
and
[TABLE]
where we have used the inverse trace inequality and the Young’s inequality to derive the last inequality.
Step three:
Let on and let on and on . Let . By (32) and inverse inequality, we have
[TABLE]
By (3) and , we have
[TABLE]
Step four:
Let . By (32), inverse inequality, and Lemma 4.3, we have
[TABLE]
It follows from (3), Lemma 4.3, Cauthy-Schwarz’s inequality, and Young’s inequality that
[TABLE]
Step five:
Let with . By (43), (45), (4.2) and (4.2), we can get
[TABLE]
Moreover, by combining (4.2), (4.2), (4.2) and (4.2), and (32), we have
[TABLE]
The last two inequalities together lead to
[TABLE]
which implies (42). This completes the proof of Theorem 4.1. ∎
4.3 Error estimates of the elliptic projection
Theorem 4.2**.**
Assume that with . Let \bm{\sigma}:=\big{(}\bm{r},\bm{u},\bm{u}|_{\mathcal{F}_{h}},p,p|_{\mathcal{F}_{h}}\big{)} and let \mathcal{P}_{h}\bm{\sigma}=\big{(}\bm{r}_{h}^{P},\bm{u}_{h}^{P},\widehat{\bm{u}}_{h}^{P},p_{h}^{P},\widehat{p}_{h}^{P}\big{)} be it elliptic projection defined in (33). Then
[TABLE]
Proof.
From the inf-sup condition of Theorem 4.1 and the definition of the elliptic projection (33), we have
[TABLE]
which implies (51a) by using Lemmas 4.7 and 4.6, and the triangle inequality. It remains to prove (51b). Denote by . We have the following decomposition:
[TABLE]
where is defined in Lemma 4.5. Let be decomposed as (35) in Lemma 4.5. For any , by taking in (33) and using the definition (3) of , we conclude that , that is, is discrete divergence free. Noting that , we have
[TABLE]
It follows from Lemmas 4.4 and 4.5, the triangle Inequality, and (32) that
[TABLE]
Introduce the following dual problem: Find such that
[TABLE]
Note that the above dual problem is positive definite since the sign before in the second equation is positive (cf. (21b)). Similar to Theorem 2.1, we have the following regularity estimate of problem (54):
[TABLE]
where the regularity index depends on . Denote by . By a parallel derivation as in § 3, we conclude that satisfies the following variational formulation
[TABLE]
By taking and using (33) and Lemma 4.7, we have
[TABLE]
On the other hand, from Lemmas 4.5 and 4.4 and we have
[TABLE]
By combining (52),(4.3),(4.3), and (4.3) we obtain
[TABLE]
which together with (51a) and (34c) implies (51b). This completes the proof of the theorem. ∎
5 Error estimates of the HDG methods
In this section, we derive error estimates for the HDG method (23) (or (30)) by using a modified duality argument.
We first show that the error of the HDG solution in the norm can be bounded by the interpolation error and the error .
Lemma 5.1**.**
Let and be the solutions to (21) and (30), respectively. Then we have the following estimate
[TABLE]
where \bm{\sigma}=\big{(}\bm{r},\bm{u},\bm{u}|_{\mathcal{F}_{h}},p,p|_{\mathcal{F}_{h}}\big{)}.
Proof.
It follows from the discrete inf-sup condition in Theorem 4.1, (3), and the orthogonality in Lemma 3.1 that
[TABLE]
which together with Lemmas 4.7 and 4.6 and the triangle inequality completes the proof of the lemma. ∎
Finally, we give the error estimates of the proposed HDG method in the following theorem.
Theorem 5.1**.**
Let and be the solutions of (1) and (30), respectively. Suppose with .
(i)* There exists a constant independent of and such that if , we have*
[TABLE]
(ii)* If in addition , it holds*
[TABLE]
(iii)* If is convex, there exists a constant independent of and such that if , we have*
[TABLE]
Proof.
It suffices to prove the error estimates since the estimates (58a) and (58c) are direct consequences of (32d), (32), and (58b). For simplicity, denote by and (LABEL:error1) implies that the following estimate holds if .
[TABLE]
Similar to the proof of (51b), we decompose the square of the error as
[TABLE]
where the is defined as in Lemma 4.5. Let be decomposed as (35) in Lemma 4.5. For any , from (23c), we conclude that . Noting that , we have
[TABLE]
Similar to (4.3), we have
[TABLE]
where we have used (61) and Lemma 4.2 to derive the last Inequality.
Introduce the following duality problem: Find such that
[TABLE]
By Theorem 2.1, we have the following regularity estimate of problem (64):
[TABLE]
and
[TABLE]
where the regularity indices and depend on . By combining Lemma 4.2 and (65)–(66) we have
[TABLE]
where
[TABLE]
It is easy to check that satisfies the following variational formulation.
[TABLE]
Let be the second component of . Then by Lemmas 4.7 and 4.6, the regularity estimate (65), the orthogonality in Lemma 3.1, (67), and the fact that , we have
[TABLE]
On the other hand, from Lemmas 4.5, 4.4, and 4.2, , (61), and the triangle inequality, we have
[TABLE]
Combining (62), (5), (5), (5), and the Young’s inequality gives
[TABLE]
Therefore, if is sufficiently small,
[TABLE]
which implies (58b) and (59). This completes the proof of the theorem. ∎
As a consequence of the above theorem, we have the following well-posedness of the proposed HDG method.
Corollary 5.1**.**
Under the conditions of Theorem 5.1, the HDG scheme (30) has a unique solution .
In view of Theorem 2.1 and Theorem 5.1, we can obtain the following error estimates for the linear HDG method on convex domain.
Corollary 5.2**.**
Suppose is convex, , and . Then there exists a constant independent of and such that if , the following error estimates hold.
[TABLE]
6 Numerical experiments
The numerical tests are programmed in C++. When implementing of the HDG scheme, all interior unknowns , and are eliminated, and the only global unknowns in the resulting system are and . After solving the global system, the , and are recovered locally inside each element. The solvers for the linear systems are chosen as GMRES and SparseLU. Let be a uniform simplex decomposition of , we denote by the smallest length of the edge in decomposition .
Let . We take to following exact solution and , and compute the functions and accordingly.
[TABLE]
Though we require in the error analysis, the numerical results for are all presented to illustrate the performance of the proposed HDG method. We take and and report the errors in Table 1 and 2, respectively. It can be observed that: when , the convergence rates are nearly zero for all variables; when , the convergence orders are as predicted by Corollary 5.2, provided that is small enough; in particular, when , the convergence results are better than the previous prediction for variables and .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Alonso and A. Valli , An optimal domain decomposition preconditioner for low-frequency time-harmonic Maxwell equations , Math. Comp., 68 (1999), pp. 607–631.
- 2[2] C. Amrouche, C. Bernardi, M. Dauge, and V. Girault , Vector potentials in three-dimensional non-smooth domains , Math. Methods Appl. Sci., 21 (1998), pp. 823–864.
- 3[3] A. Bendali , Numerical analysis of the exterior boundary value problem for the time-harmonic Maxwell equations by a boundary finite element method. II. The discrete problem , Math. Comp., 43 (1984), pp. 47–68.
- 4[4] Y. Boubendir and C. Turc , Well-conditioned boundary integral equation formulations for the solution of high-frequency electromagnetic scattering problems , Comput. Math. Appl., 67 (2014), pp. 1772–1805.
- 5[5] A. Buffa, M. Costabel, and C. Schwab , Boundary element methods for Maxwell’s equations on non-smooth domains , Numer. Math., 92 (2002), pp. 679–710.
- 6[6] A. Buffa, P. Houston, and I. Perugia , Discontinuous Galerkin computation of the Maxwell eigenvalues on simplicial meshes , J. Comput. Appl. Math., 204 (2007), pp. 317–333.
- 7[7] A. Buffa and I. Perugia , Discontinuous Galerkin approximation of the Maxwell eigenproblem , SIAM J. Numer. Anal., 44 (2006), pp. 2198–2226.
- 8[8] A. Buffa, I. Perugia, and T. Warburton , The mortar-discontinuous Galerkin method for the 2D Maxwell eigenproblem , J. Sci. Comput., 40 (2009), pp. 86–114.
