Staggered discontinuous Galerkin methods for the Helmholtz equations with large wave number
Lina Zhao, Eun-Jae Park, Eric Chung

TL;DR
This paper introduces a flexible staggered discontinuous Galerkin method for solving Helmholtz equations with large wave numbers on complex meshes, demonstrating stability, convergence, and effective handling of singular solutions.
Contribution
It presents a novel, flux-free, and mesh-robust staggered discontinuous Galerkin approach for Helmholtz equations with large wave numbers, accommodating rough and distorted grids.
Findings
Method is stable when κh is small.
Error estimates are established in L2 norm.
Numerical experiments confirm theoretical results.
Abstract
In this paper we investigate staggered discontinuous Galerkin method for the Helmholtz equation with large wave number on general quadrilateral and polygonal meshes. The method is highly flexible by allowing rough grids such as the trapezoidal grids and highly distorted grids, and at the same time, is numerical flux free. Furthermore, it allows hanging nodes, which can be simply treated as additional vertices. By exploiting a modified duality argument, the stability and convergence can be proved under the condition that is sufficiently small, where is the wave number and is the mesh size. Error estimates for both the scalar and vector variables in norm are established. Several numerical experiments are tested to verify our theoretical results and to present the capability of our method for capturing singular solutions.
| order | order | order | order | |||||
|---|---|---|---|---|---|---|---|---|
| 1.72E-1 | – | 1.65E-1 | – | 4.19E-2 | – | 4.78E-2 | – | |
| 3.91E-2 | 2.1358 | 4.43E-2 | 1.9018 | 5.60E-3 | 2.9069 | 5.30E-3 | 3.1641 | |
| 1.07E-2 | 1.8736 | 1.18E-2 | 1.9047 | 7.46E-4 | 2.9046 | 6.17E-4 | 3.1105 | |
| 2.70E-3 | 1.9730 | 3.00E-3 | 1.9702 | 9.49E-5 | 2.9743 | 7.42E-5 | 3.0555 | |
| 6.82E-4 | 1.9933 | 7.58E-4 | 1.9920 | 1.19E-5 | 2.9937 | 9.13E-6 | 3.0242 | |
| 1.70E-4 | 1.9983 | 1.90E-4 | 1.9979 | 1.49E-6 | 2.9984 | 1.13E-6 | 3.0107 | |
| order | order | order | order | |||||
|---|---|---|---|---|---|---|---|---|
| 1355E-1 | – | 2.23E-1 | – | 4.78E-2 | – | 4.87E-2 | – | |
| 3.44E-2 | 1.9794 | 5.18E-2 | 2.1085 | 6.10E-3 | 2.9783 | 7.30E-3 | 2.7415 | |
| 1.04E-2 | 1.7200 | 1.59E-2 | 1.7029 | 8.86E-4 | 2.7756 | 1.10E-3 | 2.6751 | |
| 3.00E-3 | 1.7801 | 4.70E-3 | 1.7572 | 1.75E-4 | 2.3379 | 3.44E-4 | 1.7298 | |
| 9.52E-4 | 1.6723 | 1.50E-3 | 1.6806 | 5.05E-5 | 1.7936 | 1.23E-4 | 1.4858 | |
| 3.22E-4 | 1.5649 | 4.89E-4 | 1.5839 | 1.70E-5 | 1.5683 | 4.44E-5 | 1.4685 | |
| order | order | order | order | |||||
|---|---|---|---|---|---|---|---|---|
| 2.33E-1 | – | 1.92E-1 | – | 4.68E-2 | – | 5.79E-2 | – | |
| 7.35E-2 | 1.6675 | 6.88E-2 | 1.4832 | 8.70E-3 | 2.4330 | 1.15E-2 | 2.3287 | |
| 3.03E-2 | 1.2799 | 2.71E-2 | 1.3428 | 2.30E-3 | 1.8885 | 5.90E-3 | 0.9690 | |
| 1.59E-2 | 0.9317 | 1.64E-2 | 0.7273 | 7.36E-4 | 1.6665 | 3.60E-3 | 0.7182 | |
| 9.40E-3 | 0.7498 | 1.13E-2 | 0.5355 | 2.52E-4 | 1.5477 | 2.20E-3 | 0.6817 | |
| 5.80E-3 | 0.6904 | 7.80E-3 | 0.5370 | 1.01E-4 | 1.3216 | 1.40E-3 | 0.6706 | |
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
TopicsAdvanced Numerical Methods in Computational Mathematics · Electromagnetic Simulation and Numerical Methods · Computational Fluid Dynamics and Aerodynamics
Staggered discontinuous Galerkin methods for
the Helmholtz equations with large wave number
Lina Zhao111Department of Mathematics,The Chinese University of Hong Kong, Hong Kong Special Administrative Region. ([email protected])Department of Computational Science and Engineering, Yonsei University, Seoul 03722, Republic of Korea. ([email protected]) Eun-Jae Park11footnotemark: 1 Eric T. Chung333Department of Mathematics,The Chinese University of Hong Kong, Hong Kong Special Administrative Region. ([email protected])
Abstract: In this paper we investigate staggered discontinuous Galerkin method for the Helmholtz equation with large wave number on general quadrilateral and polygonal meshes. The method is highly flexible by allowing rough grids such as the trapezoidal grids and highly distorted grids, and at the same time, is numerical flux free. Furthermore, it allows hanging nodes, which can be simply treated as additional vertices. By exploiting a modified duality argument, the stability and convergence can be proved under the condition that is sufficiently small, where is the wave number and is the mesh size. Error estimates for both the scalar and vector variables in norm are established. Several numerical experiments are tested to verify our theoretical results and to present the capability of our method for capturing singular solutions.
Keywords: Helmholtz problem, Large wave number, Staggered DG method, Duality argument, General quadrilateral and polygonal meshes
1 Introduction
In this paper we develop a staggered discontinuous Galerkin (DG) method for solving the following Helmholtz problem
[TABLE]
where is the wave number and represents a harmonic source and is a given data function. Here, is a polygonal or polyhedral domain in and is the imaginary unit.
The Helmholtz problem has many practical applications in electrodynamics, especially in optics and in acoustic involving time harmonic wave propagation. The Helmholtz equation with large wave number is indefinite, which makes it difficult to design robust and accurate numerical methods for the Helmholtz problem. For a fixed polynomial order, the pollution effect can be reduced substantially but cannot be avoided in principle [4]. A rigorous analysis for one-dimensional Helmholtz problems and piecewise linear approximation has been given in [2] and [21], respectively, under the condition that is sufficiently small. However, the assumption on is too restrictive and unsatisfactory from a practical point of view. In order to obtain more stable and accurate numerical approximations, a large amount of nonstandard methods have been proposed and analyzed. Among all the methods, we mention in particular the general DG method on regular meshes [34] with mesh condition , the absolutely stable discontinuous Galerkin (DG) methods [22, 23, 24] without any mesh constraint, continuous interior penalty finite element methods (CIP-FEM) [44] with the mesh condition and a new weak Galerkin (WG) finite element method [38] with the mesh condition or , where is the polynomial order. In addition to the above mentioned approaches, many other numerical methods have also been developed, such as the partition of unity finite element methods [3, 33], the least squares finite element methods [9, 27, 28, 37, 11], the generalized finite element methods [6, 5], the hybridized discontinuous Galerkin methods [26], the interior penalty discontinuous Galerkin methods [1] and the Petrov Galerkin methods [20, 25].
Staggered DG method is initially developed for wave propagation problems [13, 14] on triangular meshes. Since then, it have been successfully applied to a large amount of partial differential equations arising from practical applications, see, e.g., [18, 15, 16, 31, 12, 30, 32, 17, 39, 41] and the references therein. Recently, staggered DG methods have been designed on general quadrilateral and polygonal meshes to solve Darcy law and the Stokes equations [40, 42]. The key features of staggered DG methods can be summarized as follows: First, it can preserve the physical properties, such as the local and global mass conservation, and achieve the superconvergent estimates. Second, it can be flexibly applied to rough grids such as the highly distorted grids and polygonal grids, and at the same time hanging nodes can be simply incorporated into the method. Third, thanks to the staggered continuity property, no numerical flux is needed in the construction of the method. All these distinctive properties make staggered DG method competitive in real applications.
The goal of this paper is to extend staggered DG method on general quadrilateral and polygonal meshes to the Helmholtz problem with large wave number. To the best of our knowledge, very few results are available for the Helmholtz problem on general meshes in the existing literature (cf. [38]). The key idea for staggered DG method is to divide the initial partion (quadrilateral or polygonal meshes) into the union of triangles, then the primal mesh, the dual mesh and the primal simplexes can be constructed. Next, two sets of basis functions for the scalar and vector variables, respectively with staggered continuity for the Helmholtz problem are defined. The primary difficulty of analyzing the Helmholtz problem lies in the strong indefiniteness of the problem which makes it hard to establish the stability for the numerical approximation. To analyze staggered DG method, we exploit a modified duality argument. In addition, the elliptic projections in the spirit of staggered DG method for Darcy problem are defined. The key idea employed here is to use the specially designed elliptic projections in the duality argument to bound the errors of the discrete solution by the elliptic projections under the condition that is small enough. It is worth mentioning that the superconvergence of the elliptic projections for the scalar variable is the crux to achieve the optimal convergence for both the scalar and vector variables in errors with explicit dependence on . In addition, our estimates are comparable to those given in [44] for CIP-FEM. Note that our (undisplayed) analysis shows that if we apply traditional duality argument as proposed in [10], then the stability estimates require that should be sufficiently small, but this mesh condition is too restrictive for large wave number . Thus, we turn to the modified duality argument and improve the mesh condition, namely, we only require is small enough. It is worth mentioning that this is the first result on staggered DG method for the Helmholtz problems.
The rest of the paper is organized as follows. In the next section, we present the construction of staggered DG method for the Helmholtz problem. Then in Section 3 we analyze the convergence of staggered DG method, where a modified duality argument is exploited. Finally, some numerical experiments are carried out in Section 4 to confirm the proposed theories.
2 Staggered DG method
The staggered DG method is based on a first order formulation of the Helmholtz problem (1.1)-(1.2), which can be written in mixed form as finding such that
[TABLE]
Next, we will briefly introduce staggered DG method for the Helmholtz problem in mixed form (cf. (2.1)) on general quadrilateral and polygonal meshes, and more details can be referred to [40, 42]. To begin, we construct three meshes: the primal mesh , the dual mesh , and the primal simplexes . For a polygonal domain , consider a general mesh (of ) that consists of nonempty connected close disjoint subsets of (see Figure 1):
[TABLE]
We also let be the set of all primal edges in this partition and be the subset of all interior edges, that is, the set of edges in that do not lie on . We construct the primal submeshes as a triangular subgrid of the primal grid: for an element , elements of are obtained by connecting the interior point to all vertices of (see Figure 1):
[TABLE]
We rename the union of these triangles by . Moreover, we will use to denote the set of all the dual edges generated by this subdivision process. For each triangle , we let be the diameter of and . In addition, we define and . The construction for general meshes is illustrated in Figure 1, where the black solid lines are edges in and the red dotted lines are edges in .
Finally, we construct the dual mesh. For each interior edge , we use to denote the dual mesh, which is the union of the two triangles in sharing the edge , and for each boundary edge , we use to denote the triangle in having the edge , see Figure 1. We write as the union of all .
For each edge , we define a unit normal vector as follows: If , then is the unit normal vector of pointing towards the outside of . If , an interior edge, we then fix as one of the two possible unit normal vectors on . When there is no ambiguity, we use instead of to simplify the notation.
Let , we adopt the standard notations for the Sobolev spaces and their associated norms , and semi-norms for . In particular, and for denote the inner product on complex valued and , respectively. If , the subscript will be dropped unless otherwise mentioned. In the sequel, we use to denote a generic positive constant which may have different values at different occurrences.
The following mesh regularity assumptions are also needed throughout the paper (cf. [7, 8]).
Assumption 2.1**.**
We assume there exists a constant such that
- (1)
For every element and every edge , it satisfies , where denotes the length of edge and denotes the diameter of . 2. (2)
Every element in is star-shaped with respect to a ball of radius .
We remark that the above assumptions ensure that the triangulation is shape regular.
Let be the order of approximation. For every and , we define and as the spaces of polynomials of degree less than or equal to on and , respectively. For and belonging to the broken Sobolev space, the jump and the jump are defined respectively as
[TABLE]
where , and , are the two triangles in having the edge . In the above definitions, we assume is pointing from to .
Next, we will introduce some finite dimensional spaces. First, we define the following locally conforming space :
[TABLE]
Notice that, if , then for each edge . We next define the following locally conforming SDG space :
[TABLE]
Note that if , then for each .
Following [40, 42], we can obtain the staggered DG formulation for (2.1): find such that
[TABLE]
where the bilinear forms are defined as
[TABLE]
The following discrete adjoint property can be verified easily by integration by parts:
[TABLE]
Let . Then we have from integration by parts
[TABLE]
3 Convergence analysis
In this section, we aim to derive the convergence estimates and stability of staggered DG method for the Helmholtz problem, our (undisplayed) analysis shows that standard duality argument requires be sufficiently small to achieve the stability. To overcome this issue, a modified duality argument is exploited, where the elliptic projections are the key tools. From which we can get the stability and convergence estimates provided is small enough.
To begin, we define the following projection operators, which will be useful for the subsequent analysis. Let be defined by
[TABLE]
In addition, is defined by
[TABLE]
By the definitions of and , we can get
[TABLE]
In addition, we can also derive from the definition of the bilinear form (cf. (2.5))
[TABLE]
The next lemma is found to be useful for the subsequent analysis, one can refer to [36] for proof.
Lemma 3.1**.**
The solution to the problem (1.1) and (1.2) can be written as , and satisfies
[TABLE]
where .
The approximation estimates for and with high order convergence are given as follows (cf. [19, 14]).
Lemma 3.2**.**
Assume that , then we have
[TABLE]
For our convergence analysis, we also need the following approximation estimates, which only require regularity. It uses the decomposition given in Lemma 3.1 and is more subtle than the estimates given in Lemma 3.2. The proof is analogous to that of [35], thus we omit the proof for simplicity.
Lemma 3.3**.**
(approximation properties) Let be the solution to (2.1), then
[TABLE]
The rest of this section is devoted to the error analysis for the Helmholtz problem, to this end we introduce the elliptic projections motivated by those proposed in [44, 43]. For any , we define its elliptic projections as the staggered DG approximations to the first order system
[TABLE]
Then is the numerical solution to the following discrete formulation
[TABLE]
Let , then it follows
[TABLE]
which immediately yields
[TABLE]
In addition, we define by
[TABLE]
The following holds
[TABLE]
Indeed, we have
[TABLE]
To be specific,we can obtain from (3.7)
[TABLE]
In other words, is the staggered DG approximation to the following first order system
[TABLE]
On the other hand we have the following identity by integration by parts
[TABLE]
In addition, if is the solution of (2.1) then
[TABLE]
Now we are ready to prove the next lemma.
Lemma 3.4**.**
Assume is any function in and is any function in . Then it holds
[TABLE]
Proof.
The proof for the elliptic projections and are similar, to simplify the presentation, we only give the proof for .
Proceeding analogously to (3.3), we can obtain
[TABLE]
Let , then
[TABLE]
On the other hand, we have from the definition of and the discrete adjoint property (2.4) that
[TABLE]
Taking the imaginary part of (3.10), we can obtain
[TABLE]
Thus
[TABLE]
Next, we will estimate . Consider the auxiliary problem
[TABLE]
which satisfies the following elliptic regularity estimate
[TABLE]
An application of the Cauchy-Schwarz inequality, the discrete adjoint property (2.4), (3.2), (3.6), (3.11) and the elliptic regularity estimate (3.12) lead to
[TABLE]
Therefore, the proof is complete.
∎
Lemmas 3.3 and 3.4 yield the next lemma.
Lemma 3.5**.**
Let be the solution to the problem (2.1). Then we have
[TABLE]
The error estimates for both and are stated in the next lemma.
Lemma 3.6**.**
Let and denote the solution of (2.1) and (2.2)-(2.3), respectively. If is sufficiently small, then the following estimates hold
[TABLE]
Proof.
We first estimate the error of by introducing the dual problem and exploiting the elliptic projections of the solution to the original continuous problem and of the solution to the dual problem. We consider the following dual problem
[TABLE]
Let be the elliptic projections defined by (3.4) and let be the elliptic projections defined by (3.7) by replacing by . It follows from Lemma 3.5 by replacing by that
[TABLE]
In addition, Lemma 3.3 yields
[TABLE]
Therefore
[TABLE]
Integration by parts, (3.4), (3.8), (3.9) and (3.14) reveal that
[TABLE]
Now we will estimate each of the above term separately. First, the definition of yields
[TABLE]
The Cauchy-Schwarz inequality, Lemma 3.4, (3.15) and (3.16) imply
[TABLE]
We have from the Cauchy-Schwarz inequality, the inverse inequality, Lemma 3.4 and (3.15)
[TABLE]
Similarly, we can get
[TABLE]
An appeal to the Cauchy-Schwarz inequality and (3.17) yields
[TABLE]
The trace inequality, the inverse inequality, Lemma 3.4, (3.16) and (3.17) imply
[TABLE]
Combining the preceding estimates yields (3.13) under the condition that is sufficiently small.
Next, we estimate . We have from (3.3)
[TABLE]
Taking the imaginary parts of the above equation implies
[TABLE]
Consequently, we have
[TABLE]
Thus, the proof is complete.
∎
Combining Lemmas 3.3 and 3.6, we can get the following estimates.
Corollary 3.1**.**
If , then
[TABLE]
Combining Lemmas 3.2 and 3.6, we have
Theorem 3.1**.**
If satisfying
[TABLE]
then
[TABLE]
By combining Lemma 3.1 and Corollary 3.1, we can obtain the following stability estimates for staggered DG method.
Corollary 3.2**.**
(stability) Suppose the solution , then the following estimate holds provided is sufficiently small
[TABLE]
4 Numerical experiments
This section presents numerical experiments for the validation of the theoretical results and investigates the accuracy of our staggered DG method. In addition, an singular example is given to test the capability of the proposed method to capture the singularities.
Example 4.1**.**
(Typical smooth solution example)
We first consider a Helmholtz equation defined on the unit square . Here, we set in (1.1)-(1.2) and is chosen such that the exact solution is given by
[TABLE]
in polar coordinates, where are Bessel functions of the first kind.
The exact solution for is displayed in Figure 2, and the numerical solution for by using and is shown in Figure 3. As expected, higher order polynomial approximation yields better numerical solution.
For the fixed wave number ,we first show the dependence of the convergence of , on polynomial order and mesh size . The convergence history against the number of degrees of freedom for and with different polynomial orders on square grids are reported in Figure 4. It is easy to see that the pollution errors always appear on the coarse meshes, and the optimal convergence can be obtained on fine meshes for different polynomial orders, which confirm the proposed theories.
Next we verify the convergence properties of the SDG method for different wave numbers by piecewise and approximations, respectively. We can see from Figure 5 that in the pre-asymptotic region, the errors always oscillate for different polynomial orders, and optimal convergence can be obtained for fine meshes. In addition, high order polynomial approximation has better performances.
In addition, to test the flexibility of the proposed method on rough grids, we employ the -perturbation grids (cf. [40]) as shown in Figure 6. The errors for both the scalar and vector variables by using different polynomial approximations for and are displayed in Figure 7. From which we can see that similar performances as for square grids can be obtained, thus, the proposed method is robust in the sense that it can be flexibly applied to rough grids. Undisplayed numerical experiments on polygonal grids also yield similar results.
Example 4.2**.**
(Singular solution example)
In this example, we consider a square domain . The boundary conditions and are chosen such that the exact solution is given by
[TABLE]
for , and , respectively, where denotes the Bessel function of the first kind and order . It is well known that is smooth for , while its derivative has a singularity at origin for (cf. [29]). We fix , and we compute the numerical solution in the regular case and in the singular cases and . The profiles of the numerical solutions corresponding to these three cases are displayed in Figures 8 and 9. The convergence order against the mesh size for these three cases by using and polynomial approximations are reported in Tables 1–3. It is easy to see that when , optimal convergence can be obtained for both variables in norm using linear and quadratic approximations. when , a reduced convergence order can be achieved for both the flux variable and the scalar variable, in addition, the orders are the same for and polynomial approximations. When , the convergence order gets worse. From the above, we can conclude that a reduced convergence order can be obtained due to the reduced regularity.
Acknowledgements
The research of Eric Chung is partially supported by the Hong Kong RGC General Research Fund (Project numbers 14304217 and 14302018) and CUHK Faculty of Science Direct Grant 2018-19.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Ainsworth, P. Monk, and W. Muniz , Dispersive and dissipative properties of discontinuous Galerkin finite element methods for the second-order wave equation , J. Sci. Comput., 27 (2006), pp. 5–40.
- 2[2] A. K. Aziz, R. B. Kellogg, and A. B. Stephens , A two point boundary value problem with a rapidly oscillating solution , Numer. Math., 53 (1988), pp. 107–121.
- 3[3] I. Babus̆ka and J. M. Melenk , The partition of unity method , Internat J. Numer. Methods Engrg., 40 (1997), pp. 727–758.
- 4[4] I. Babus̆ka and S. A. Sauter , Is the pollution effect of the FEM avoidable for the Helmholtz equation considering high wave number , SIAM review, 42 (2000), pp. 451–484.
- 5[5] I. Babus̆ka, U. Banerjee, and J. Osborn , Generalized finite element method-main ideas, results and perspective , Int. J. Comput. Methods., 1 (2004), pp. 67–103.
- 6[6] I. Babus̆ka, F. Ihlenburg, E. T. Paik, and S. A. Sauter , A generalized finite element method for solving the Helmholtz equation in two dimensions with minimal pollution , Comput. Methods Appl. Mech. Engrg., 128 (1995), pp. 325–359.
- 7[7] L. Beirão da Veiga, F. Brezzi, A. Cangiani, G. Manzini, L. D. Marini, and A. Russo , Basic principles of virtual element method , Math. Models Methods Appl. Sci., 23 (2013), pp. 199–214.
- 8[8] A. Cangiani, E. H. Georgoulis, T. Pryer, and O. J. Sutton , A posteriori error estimates for the virtual element method , Numer. Math., 137 (2017), pp. 857–893.
