$hp$-discontinuous Galerkin Methods for the Helmholtz Equation with Large Wave Number
Xiaobing Feng, Haijun Wu

TL;DR
This paper introduces stable $hp$-discontinuous Galerkin methods for solving the Helmholtz equation with large wave numbers, providing error estimates and stability analysis that depend explicitly on mesh size, polynomial degree, and wave number.
Contribution
The paper develops novel $hp$-DG methods with complex penalty parameters ensuring stability and derives explicit error and stability estimates for high wave number Helmholtz problems.
Findings
Methods are absolutely stable and well-posed.
Error estimates are sub-optimal without mesh constraints.
Optimal order error estimates are achieved under specific mesh conditions.
Abstract
This paper develops some interior penalty -discontinuous Galerkin (-DG) methods for the Helmholtz equation in two and three dimensions. The proposed -DG methods are defined using a sesquilinear form which is not only mesh-dependent but also degree-dependent. In addition, the sesquilinear form contains penalty terms which not only penalize the jumps of the function values across the element edges but also the jumps of the first order tangential derivatives as well as jumps of all normal derivatives up to order . Furthermore, to ensure the stability, the penalty parameters are taken as complex numbers with positive imaginary parts. It is proved that the proposed -discontinuous Galerkin methods are absolutely stable (hence, well-posed). For each fixed wave number , sub-optimal order error estimates in the broken -norm and the -norm are derived without any…
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 · Differential Equations and Numerical Methods
-discontinuous Galerkin Methods for the Helmholtz Equation with Large Wave Number
Xiaobing Feng
Department of Mathematics
The University of Tennessee
Knoxville, TN 37996, U.S.A.
and
Haijun Wu
Department of Mathematics
Nanjing University
Nanjing, Jiangsu 210093, P. R. China.
Abstract.
This paper develops some interior penalty -discontinuous Galerkin (-DG) methods for the Helmholtz equation in two and three dimensions. The proposed -DG methods are defined using a sesquilinear form which is not only mesh-dependent but also degree-dependent. In addition, the sesquilinear form contains penalty terms which not only penalize the jumps of the function values across the element edges but also the jumps of the first order tangential derivatives as well as jumps of all normal derivatives up to order . Furthermore, to ensure the stability, the penalty parameters are taken as complex numbers with positive imaginary parts. It is proved that the proposed -discontinuous Galerkin methods are absolutely stable (hence, well-posed). For each fixed wave number , sub-optimal order error estimates in the broken -norm and the -norm are derived without any mesh constraint. The error estimates and the stability estimates are improved to optimal order under the mesh condition by utilizing these stability and error estimates and using a stability-error iterative procedure To overcome the difficulty caused by strong indefiniteness of the Helmholtz problems in the stability analysis for numerical solutions, our main ideas for stability analysis are to make use of a local version of the Rellich identity (for the Laplacian) and to mimic the stability analysis for the PDE solutions given in [19, 20, 33], which enable us to derive stability estimates and error bounds with explicit dependence on the mesh size , the polynomial degree , the wave number , as well as all the penalty parameters for the numerical solutions.
Key words and phrases:
Helmholtz equation, time harmonic waves, absorbing boundary conditions, -discontinuous Galerkin methods, error estimates
1991 Mathematics Subject Classification:
65N12, 65N15, 65N30, 78A40
The work of the first author was partially supported by the NSF grants DMS-0410266 and DMS-0710831. The work of the second author was partially supported by the national basic research program of China under grant 2005CB321701 and by the program for the new century outstanding talents in universities of China. Part of this joint work was carried out during the second author’s recent visit of the University of Tennessee, the author would like to thank the host institution for its hospitality and financial support of the visit.
1. Introduction
This is the second installment in a series (cf. [27]) which devotes to developing and analyzing novel interior penalty discontinuous Galerkin (IPDG) methods for the following Helmholtz problem with large wave number:
[TABLE]
where , called wave number, is a (large) positive number, , is known as a scatterer and is assumed to be a bounded Lipschitz domain, , which is assumed to be a polygonal/polyhedral domain and often taken as a -rectangle in applications, defines the size of the computational domain. Note that . denotes the unit outward normal to . denotes the imaginary unit. Condition (1.2) with is known as the first order absorbing boundary condition (cf. [23]), which is used to minimize the reflection at the boundary and to limit the computation of the original scattering problem just on the finite domain . Boundary condition (1.3) implies that the scatterer is sound-soft. We note that the case also arises in applications either as a consequence of frequency domain treatment of waves or when time-harmonic solutions of the scalar wave equation are sought (cf. [22]).
In [27] we proposed and analyzed some IPDG methods for problem (1.1)–(1.3) using piecewise linear polynomial trial and test functions. It was proved that the proposed methods are unconditionally (with respect to mesh size ) stable and well-posed for all wave number . Optimal order error estimates were established showing explicit dependence of the error bounds on , and all penalty parameters. However, due to the existence of a pollution term, the (broken) -norm error bound deteriorates as the wave number increases under the practical “rule of thumb” mesh constraint . To improve the accuracy and efficiency of those IPDG methods, it is necessary to use (piecewise) high order polynomial trial and test functions partly because of the rigidity and low approximability of linear functions and partly because of the very oscillatory nature of high frequency waves. However, simply replacing the linear element by high order elements in the IPDG methods of [27] does not reduce the pollution very much, in particular, the theoretical error bounds do not change much because the analysis of [27] indeed strongly depends on the properties of linear functions.
Motivated by the above challenge and observation, the primary goal of this paper is to develop some new -interior penalty discontinuous Galerkin (-IPDG) methods which retain the advantages of the IPDG methods of [27] but improve their accuracy and stability by exploiting the efficiency and flexibility of piecewise high order polynomial functions. To the end, our key idea is to construct a sesquilinear form (as a discretization of the Laplacian) which is not only mesh-dependent (or -dependent) but also degree-dependent (or -dependent) by introducing penalty terms which not only penalize the jumps of the function values across the element edges but also the jumps of the first order tangential derivatives as well as jumps of all normal derivatives up to order . In addition, as in [27], to ensure the stability, all penalty parameters are taken as complex numbers with positive imaginary parts. Since the Helmholtz equation with large wave number is non-Hermitian and strongly indefinite, as expected, stability estimates (or a priori estimates) for numerical solutions under practical mesh constraints is a difficult task to carry out regardless which discretization method is used. To overcome the difficulty, as in [27], the cruxes of our analysis are to establish and to make use of a local version of the Rellich identity (for the Laplacian) and to mimic the stability analysis for the PDE solutions given in [19, 20, 33]. The key idea here is to use the special test function (defined element-wise) with denoting the -IPDG solution, such a test function is valid for any DG method. We remark that the same technique was successfully employed by Shen and Wang in [38] to establish the stability and error analysis for the spectral Galerkin approximation of the Helmholtz problem. We also note that although the similar techniques to those in [27, 38] are utilized in this paper to carry out the stability analysis, the analysis of this paper is more involved because the special sesquilinear form of this paper, which contains jumps of high order normal derivatives, is a lot more complicate to deal with, even they are similar conceptually.
Since the Helmholtz equation appears, in one way or another, directly or indirectly, in almost all wave-related problems arisen from many science, engineering, and industry applications, solving the Helmholtz equation, in one form or another, has always been and remains at the center of wave computation. We refer the reader to ([1, 5, 6, 10, 13, 14, 18, 19, 22, 24, 29, 32, 36, 37, 39, 46] and the references therein) for some recent developments on numerical methods, in particular, Galerkin type methods, for the Helmholtz equation. We also refer the reader to [27] for a brief review about some theoretical issues for finite element approximations (and other types of Galerkin approximations) of the Helmholtz equation.
The -finite element method (-FEM) is a modern version of the finite element method, capable of achieving exceptionally fast (exponential) convergence. It combines the flexibility of the standard finite element method and the high order accuracy of the spectral method. Consequently, the -FEM can often attain more accurate results than the standard finite element method does while using less CPU time and resources. The -FEM has undergone intensive developments both on theory and implementation in the past twenty five years. We refer the reader to the survey paper [7] and two recent monographs [41, 42] for a detailed exposition on the basic theory and advanced topics of the -FEM.
Discontinuous Galerkin (DG) methods was first proposed in 1970s, they were not popular then because they produce larger algebraic systems than standard finite element methods do. However, due to the emergence of high performance computers and fast solvers since early 1990s, especially, massively parallel computers and parallel solvers such as multilevel and domain decomposition methods, which together with advantages of DG methods has quickly attracted renewed interests in DG methods. They have been heavily developed and tested in the past fifteen years, we refer the reader to [4] and the references therein for a review of recent developments. As is well known now, DG methods have several advantages over other types of numerical methods. For example, the trial and test spaces are easy to construct, they can naturally handle inhomogeneous boundary conditions and curved boundaries; they also allow the use of highly nonuniform and unstructured meshes, and have built-in parallelism which permits coarse-grain parallelism. In addition, the fact that the mass matrices are block diagonal is an attractive feature in the context of time-dependent problems, especially if explicit time discretizations are used. Moreover, as proved in [27], DG methods are also effective and have advantages over finite element methods for the strongly indefinite Helmholtz equation, which has not been well understood before. We refer the reader to [3, 4, 9, 16, 17, 21, 26, 40, 45] and the references therein for a detailed account on DG methods for coercive elliptic and parabolic problems, and to [43, 25, 28, 35, 34] and the references therein for recent developments on -discontinuous Galerkin (-DG) methods.
The remainder of this paper is organized as follows. In Section 2, we first introduce notation and gather some preliminaries, and then formulate our -IPDG methods. Both symmetric and non-symmetric methods are constructed and various possible variants are also discussed. Section 3 devotes to the stability analysis for the -IPDG methods proposed in Section 2. It is proved that the proposed -IPDG methods are stable (hence well-posed) without any mesh constraint. In Section 4, using the stability results of Section 3 we prove that for each fixed wave number , sub-optimal order (with respect to and ) error estimates in the broken -norm and the -norm are derived without any mesh constraint. Finally, using the stability estimate of Section 3, the error estimates of Section 4 and a stability-error iterative procedure we obtain some much improved (optimal order) stability and error estimates for the -IPDG solutions under the mesh condition in Section 5, where is some constant independent of , , , and the penalty parameters.
2. Formulation of -interior penalty discontinuous Galerkin methods
2.1. Notation and preliminaries
The space, norm and inner product notation used in this paper all are standard, we refer to [11, 15, 9] for their precise definitions. On the other hand, we note that all functions in this paper are complex-valued, so the familiar terminologies such “symmetric/non-symmetric” and “bilinear” are replaced respectively by terms “Hermitian/non-Hermitian” and “sesquilinear”. For a complex number ( and are real numbers), denotes the complex conjugate of . and for denote the complex -inner product on and spaces, respectively. and . We also define
[TABLE]
Throughout the paper, is used to denote a generic positive constant which is independent of , , , and the penalty parameters. We also use the shorthand notation and for the inequality and . is for the statement and .
We now give the definition of star-shaped domains.
Definition 2.1**.**
* is said to be a star-shaped domain with respect to if there exists a nonnegative constant such that*
[TABLE]
* is said to be strictly star-shaped if is positive.*
In this paper, we assume that is a strictly star-shaped domain. Recall that is often taken as a -rectangle in practice. We also assume that the scatterer is a star-shaped domain, without loss of the generality, with respect to the same point as does. This implies that . Under these assumptions, there hold following stability estimates for problem (1.1)–(1.3).
Theorem 2.1**.**
Suppose is a strictly star-shaped domain and is a star-shaped domain. Then the solution to problem (1.1)–(1.3) satisfies
[TABLE]
for if for some . (2.2) also holds for if . Furthermore, there hold
[TABLE]
for if for some positive integer .
Proof.
Inequality (2.2) for was proved in [19, 20, 33]. Inequality (2.3) follows from (2.2) and an application of the standard cutoff function technique together with an induction argument. We leave the derivation to the interested reader. ∎
2.2. Formulation of -IPDG methods
To formulate our -IPDG methods, we need to introduce some notation, most of them were already appeared in [27]. Let be a family of partitions of the domain parameterized by . For any , we define . Similarly, for each edge/face of , . We impose the following mild restrictions on the partition :
- (i)
The elements of satisfy the minimal angle condition,
- (ii)
is locally quasi-uniform, that is if two elements and are adjacent ( i.e., ), then . Where stands for -dimensional Lebesgue measure of .
For convenience, we assume , hence
For any two elements , we call an interior edge/face of if . Note that could be portion of a side/face of the element or in the case of geometrically nonconforming partition. Also, for any element , we call a boundary edge/face if . Then we define
[TABLE]
We also define the jump of on an interior edge/face as
[TABLE]
If , set . The following convention is adopted in this paper
[TABLE]
If , set . For every , let be the unit outward normal to edge/face of the element if the global label of is bigger and of the element if the other way around. For every , let the unit outward normal to .
Let be a fixed integer, which will be used to denote the degree of the -IPDG methods in this paper. For each integer , we define the “energy” space
[TABLE]
and the sesquilinear form on
[TABLE]
[TABLE]
and is a real number. and are numbers to be specified later. denote an orthogonal coordinate frame on the edge/face , stands for the tangential derivative of in the direction , and denotes the th order normal derivative of on .
It is easy to check that for all and . Hence, is a consistent discretization for . When , is symmetric, that is, . On the other hand, when , is non-symmetric. In particular, would correspond to the non-symmetric IPDG method studied in [40] for coercive elliptic problems. In this paper, for the ease of presentation, we only consider the case . The penalty constants in {\rm\mathbf{i}}\bigl{(}L_{1}(u,v)+J_{0}(u,v)+\cdots+J_{q}(u,v)\bigr{)} are , respectively. So they are pure imaginary numbers with positive imaginary parts. It turns out that if any of them is replaced by a complex number with positive imaginary part, the ideas of the paper still apply. Here we set their real parts to be zero because the terms from real parts do not help much (and do not cause any problem either) in our analysis.
Next, we introduce the following semi-norms on the space :
[TABLE]
Clearly, and are norms on if but only semi-norms if .
It is easy to check that the sesquilinear form satisfies: For any
[TABLE]
Using the sesquilinear form we now introduce the following weak formulation for (1.1)–(1.2): Find such that
[TABLE]
for any . The above formulation is consistent with the boundary value problem (1.1)–(1.2) because is consistent with .
For any , let denote the set of all polynomials whose degrees do not exceed . We define our -IPDG approximation space as
[TABLE]
Clearly, . But . We are now ready to define our -IPDG methods based on the weak formulation (2.14): For each , find such that
[TABLE]
Remark 2.1**.**
(a) When , the above method (2.15) is exactly the scheme proposed in [27]. The term, which penalizes the jumps of the first order tangential derivatives, plays an important role for getting a better (theoretical) stability estimate in [27]. However, our analysis to be given in the next section suggests that the term plays a less pivotal role for high order IPDG methods.
(b) In fact, (2.15) defines different IPDG methods for . would correspond to using high order elements in the IPDG formulation proposed in [27].
(c) The idea of penalizing the jumps of normal derivatives (i.e., the term above) for second order PDEs was used early by Douglas and Dupont [21] in the context of finite element methods, by Baker [9] (with a different weighting, also see [26]) for fourth order PDEs. The idea of using multipenalties with positive penalty parameters was first used by Arnold in [3] for coercive elliptic and parabolic PDEs. The use of term was first introduced in [27].
In the next two sections, we shall study the stability and error analysis for the -IPDG method (2.15). Especially, we are interested in knowing how the stability constants and error constants depend on the wave number (and mesh size and element degree , of course) and on the penalty parameters, and what are the “optimal” relationship between mesh size and the wave number .
3. Stability estimates
The goal of this section is to derive stability estimates (or a priori estimates) for schemes (2.15). To the end, momentarily, we assume that the solution to (2.15) exists and will revisit the existence and uniqueness issues later at the end of the section. We like to note that because its strong indefiniteness, unlike in the case of coercive elliptic and parabolic problems (cf. [3, 4, 9, 21, 26, 40, 45]), the well-posedness of scheme (2.15) is difficult to prove under practical mesh constraints.
To derive stability estimates for scheme (2.15), our approach is to mimic the stability analysis for the Helmholtz problem (1.1)–(1.2) given in [19, 20, 33]. The key ingredients of our analysis are to use a special test function (defined element-wise) with in (2.15) and to use the Rellich identity (cf. [20] and below) on each element. Due to existence of multiple penalty terms in , which do not appear in [19, 20, 33], the analysis to be given below is much more delicate and complicate than those of [19, 20, 33], although they are similar conceptually. Since most proofs of this section are in the same lines as those of the proofs in Section 4 of [27], we shall omit some details if they are already given in [27], but shall provide them if there are meaningful differences.
We first cite the following lemma which establishes three integral identities and play a crucial role in our analysis. A proof of the lemma can be found in [27, Lemma 4.1].
Lemma 3.1**.**
Let , , and . Then there hold
[TABLE]
where denotes the point in the star-shaped domain definition for (see Definition 2.1).
Remark 3.1**.**
The identity (3.2) can be viewed as a local version of the Rellich identity for the Laplacian (cf. [19, 20]). Since , hence, (3.1)–(3.3) hold for any function .
We also need the following trace and inverse inequalities (cf. [41, 44, 12]).
Lemma 3.2**.**
For any and
[TABLE]
Now, taking in (2.15) yields
[TABLE]
Therefore, taking real part and imaginary part of the above equation and using (2.12) and (2.13) we get the following lemma.
Lemma 3.3**.**
Let solve (2.15). Then
[TABLE]
From (3.5) and (3.6) we can bound \bigl{|}u_{h}^{q}\bigr{|}_{1,h} and the jumps in terms of . In order to get the desired a priori estimates, we need to derive a reverse inequality whose coefficients can be controlled. Such a reverse inequality, which is often difficult to get under practical mesh constraints, and stability estimates for will be derived next.
Theorem 3.1**.**
Let solve (2.15) and suppose . Then
[TABLE]
where
[TABLE]
Proof.
We divide the proof into three steps.
Step 1: Derivation of a representation identity for . Define by for every . Since is a polynomial of degree no more than on , hence, . Using this as a test function in (2.15) and taking the real part of the resulted equation we get
[TABLE]
It follows from (3.1), (3.4), and (3.10) that (compare with (4.11) of [27])
[TABLE]
Using the identity \bigl{|}a\bigr{|}^{2}-\bigl{|}b\bigr{|}^{2}=\operatorname{{Re}}(a+b)(\bar{a}-\bar{b}) we have
[TABLE]
Using the identity again followed by the Rellich identity (3.2) we get (compare with (4.13) of [27])
[TABLE]
Plugging (3.12) and (3.13) into (3.11) gives (compare with (4.15) of [27])
[TABLE]
Step 2: Derivation of a reverse inequality. Our task now is to estimate each term on the right-hand side of (3.14). Since the terms on the first four lines can be bounded in the exactly same way as done in [27], we omit their derivations and only give the final results here for the reader’s convenience.
[TABLE]
The extra work here is to estimate the terms on the last two lines in (3.14). For an edge/face , let denote the set of element(s) in containing as one edge/face. By (3.3) we obtain
[TABLE]
The first term on the line six of (3.14) is bounded as follows (compare with (4.20) of [27]):
[TABLE]
The penalty term is estimated as follows. Recall that with for each . Noting that
[TABLE]
by the definition of and Lemma 3.2 we get
[TABLE]
We remark that when .
Next we estimate the penalty terms . Since and are piecewise polynomials of degree in general and those terms contain jumps of high order normal derivatives, it is quite delicate to control those terms as shown below.
By direct calculations we get that on each edge/face of
[TABLE]
Here we have used the fact that th order derivatives of is zero because is a polynomial of degree at most .
For , by (3.24) we have
[TABLE]
If , then, from Lemma 3.2 and the inequality \left\|\dfrac{\partial^{q}\varphi}{\partial n_{e}^{q}}\right\|_{L^{2}(\partial K)}\lesssim ph_{e}^{-\frac{1}{2}}\bigl{|}\varphi\bigr{|}_{H^{q}(K)}, we have
[TABLE]
If , (3.25) and the definition of immediately imply that (compare with (4.14) of [27])
[TABLE]
The estimate for is similar to (3.26), so we get
[TABLE]
We also need the following estimate (compare with (4.22) of [27])
[TABLE]
where we have used the inverse inequality and the assumption that is star-shaped to derive the last inequality.
Step 3: Finishing up. We only prove the case of since the proof for is the same except using (3.27) instead of (3.28). Substituting (3.26), (3.28), (3.29) (with ) and (3.15)–(3.19) into (3.14), and using (3.30) we obtain
[TABLE]
Therefore, it follows from Lemma 3.3 and (3.9) that
[TABLE]
where we have used the following inequality, which is a consequence of (3.6),
[TABLE]
to derive the last inequality. and are defined by (3.8) and (3.9), respectively. Hence,
[TABLE]
which together with (3.6) gives (3.7). The proof is completed. ∎
As (2.15) can be written as a linear system, an immediate consequence of the above stability estimate is the following well-posedness theorem for (2.15).
Theorem 3.2**.**
For and , the -IPDG method (2.15) has a unique solution provided that and .
Next we consider the case of quasi-uniform meshes. Note that large penalty parameters () for jumps of normal derivatives may cause a large interpolation error in the norm , and hence, may pollute the error estimates of the IPDG solution (see Section 4). It is interested to minimize the stability constant under the constraints of and We have the following consequence of Theorem 3.1. The proof is straightforward and is omitted.
Theorem 3.3**.**
Let Suppose the mesh is quasi-uniform, that is Suppose and . Assume that , , , and that
[TABLE]
Suppose if or . Then
[TABLE]
where
[TABLE]
It is clear that, in the above theorem, if or , otherwise. We conclude this section by several remarks.
Remark 3.2**.**
(a) The -IPDG method (2.15) is well-posed for all provided that all penalty parameters are positive. As a comparison, we recall that the standard finite element method is well-posed only if mesh size satisfies a constraint for some , hence, the existence is only guaranteed for very small mesh size when wave number is large.
(b). It is well known that [3, 4, 9, 26, 40, 45] symmetric IPDG methods for coercive elliptic and parabolic PDEs often require the penalty parameter is sufficiently large to guarantee the well-posedness of numerical solutions, and the low bound for is theoretically hard to determine and is also problem-dependent. However, this is no issue for scheme (2.15), which solves the (indefinite) Helmholtz equation, because they are well-posed for all .
(c) In the linear element case of , a better estimate is obtained in [27] with the help of the penalty term . Unfortunately the penalty term does not help too much for higher order elements.
(d). The stability estimates will be improved greatly when , where is some constant independent of , , , and the penalty parameters (see Theorem 5.1). The above estimates are only interested when and .
4. Error estimates
In this section, we derive the error estimates of the solutions of scheme (2.15). This will be done in two steps. First, we introduce elliptic projections of the PDE solution and derive error estimates for the projections. We note that such a result also has an independent interest. Second, we bound the error between the projections and the IPDG solutions by making use of the stability results obtained in Section 3. In this and the next section, we assume that the mesh is quasi-uniform, that for , and that . Let . For simplicity, we also assume that the mesh is conforming, that is, contains no hanging nodes, since the parallel results for non-conforming meshes can be derived in a similar way.
In this and the next section the following assumption (cf. Theorem 2.1) is required for some results. Suppose problem (1.1)–(1.3) is -regular and
[TABLE]
where is an integer and
[TABLE]
Note that the assumption is proved to hold for and .
4.1. Elliptic projection and its error estimates
For any , we define its elliptic projection by
[TABLE]
In other words, is an IPDG approximation to the solution of the following (complex-valued) Poisson problem:
[TABLE]
for some given functions and which are determined by .
Before estimating the projection error, we state the following continuity and coercivity properties for the sesquilinear form . Since they follow easily from (2.4)–(2.13), so we omit their proofs to save space.
Lemma 4.1**.**
For any and , the mesh-dependent sesquilinear form satisfies
[TABLE]
In addition, for any , there exists a positive constant independent of , , , and the penalty parameters such that
[TABLE]
Let be the solution of problem (1.1)–(1.3) and be its elliptic projection defined as above. Define . Then (4.2) immediately implies the following Galerkin orthogonality:
[TABLE]
Lemma 4.2**.**
Suppose problem (1.1)–(1.3) is -regular. Then there hold the following estimates:
[TABLE]
where and if .
Proof.
For any , let . From and (4.5), we have
[TABLE]
Take in (4.4) and assume without loss of generality that . It follows from (4.4) and (4.8) that
[TABLE]
Therefore,
[TABLE]
which together with yields (4.6).
To show (4.7), we use the Nitsche’s duality argument (cf. [11, 15]). Consider the following auxiliary problem:
[TABLE]
It can be shown that satisfies
[TABLE]
Let be the continuous linear finite element interpolant of on . From (4.5),
[TABLE]
Testing the conjugated (4.10) by and using the above orthogonality we get
[TABLE]
which together with (4.6) and (4.11) gives (4.7). The proof is completed. ∎
We have the following lemma that gives approximation properties of the space .
Lemma 4.3**.**
**
- (i)
Let and . Suppose . Then there exists such that
[TABLE] 2. (ii)
Suppose . Then there exists such that (4.12) holds with and
[TABLE]
where if
Proof.
The following approximation properties are well-known for the finite element functions (cf. [8, 30, 31]):
- •
There exists such that, for ,
[TABLE]
- •
There exists such that
[TABLE]
Here the invisible constants in the above two inequalities depending on but independent of , , , and the penalty parameters. Then (4.12) follows from (4.16) and the trace inequality.
It follows from the inverse inequalities in Lemma 3.2 that, for ,
[TABLE]
Therefore, by the following local trace inequality
[TABLE]
we have
[TABLE]
Noting that is continuous, we have from (4.16) and (4.18),
[TABLE]
That is, (4.13) holds.
(4.14) can be proved similarly as above. It is clear that (4.16) and (4.17) hold with and (4.18) holds with and , that is,
[TABLE]
Since , we have from Lemma 3.2 and (4.21) that, for ,
[TABLE]
Now (4.14) follows by combining the equality in (4.19) and (4.20)–(4.23). This completes the proof of the lemma. ∎
By combining Lemma 4.2 and Lemma 4.3(i) we have the following estimates for the projection error.
Lemma 4.4**.**
Let and . Suppose problem (1.1)–(1.3) is -regular and (4.1) holds. Then there hold the following estimates:
[TABLE]
where
[TABLE]
Remark 4.1**.**
The requirement in the lemma is clear since the projection is not defined for . However, for , can be bounded without using full regularity of , and such a bound is also useful (see Lemma 5.1).
4.2. Error estimates for
In this subsection we shall derive error estimates for scheme (2.15). This will be done by exploiting the linearity of the Helmholtz equation and making use of the stability estimates derived in Theorem 3.1 and the projection error estimates established in Lemma 4.4.
Let and denote the solutions of (1.1)–(1.3) and (2.15), respectively. Assume that with , then (2.14) holds for . Define the error function . Subtracting (2.15) from (2.14) yields the following error equation:
[TABLE]
Let be the elliptic projection of as defined in the previous subsection. Write with . From (4.26) and (4.5) we get
[TABLE]
The above equation implies that is the solution of scheme (2.15) with sources terms and . Then an application of Theorem 3.1 and Lemma 4.4 immediately gives
Lemma 4.5**.**
* satisfies the following estimate:*
[TABLE]
We are ready to state our error estimate results for scheme (2.15), which follows from Lemma 4.5, Lemma 4.4 and an application of the triangle inequality.
Theorem 4.1**.**
Let and denote the solutions of (1.1)–(1.3) and (2.15), respectively. Let and . Assume assumption (4.1) holds. Then
[TABLE]
Remark 4.2**.**
* is required in the theorem because is not defined for . However, we note that the -IPDG solution is always well-defined regardless the regularity of underlying PDE solution . For , can be bounded without using full regularity of , and such a bound is also useful (see Lemma 5.2).*
By combining Theorem 4.1 and Theorem 3.3 we have the following theorem that gives the best convergence order so far that we can obtain theoretically for the method (2.15) under the mesh condition (cf. Theorem 5.1).
Theorem 4.2**.**
Under the assumptions of Theorem 3.3 and 4.1, we have
[TABLE]
Proof.
The proof is obvious since ∎
Remark 4.3**.**
(a) Estimates (4.29)–(4.31) are so-called preasymptotic error estimates which are suboptimal in and . They can be improved to optimal order when , where is some constant independent of , , , and the penalty parameters (see Theorem 5.1). The second term on the right-hand side of (4.29) is called a pollution term for .
(b) Theorem 4.2 shows that if and , or if and .
5. Stability-error iterative improvement
In this section we derive some improved optimal order stability and error estimates for the -IPDG solution under the mesh condition that by using a stability-error iterative procedure, where is some constant independent of , , , and the penalty parameters (see Theorem 5.1).
By combining Lemma 4.2 and Lemma 4.3(ii), we have the following estimates for the projection error when only the -norm of the solution is allowed in the error bound.
Lemma 5.1**.**
Suppose problem (1.1)–(1.3) is -regular. Then there hold the following estimates:
[TABLE]
where
[TABLE]
By a similar argument to that used to prove Theorem 4.1, we have the following error bounds which only involves .
Lemma 5.2**.**
Let and denote the solutions of (1.1)–(1.3) and (2.15), respectively. Suppose . Then
[TABLE]
We are now ready to state our final main theorem of this paper.
Theorem 5.1**.**
Let and denote the solutions of (1.1)–(1.3) and (2.15), respectively. Suppose . Assume that , , and that . Then there exists a constant , which is independent of , , , and the penalty parameters, such that if , then the following stability estimates hold:
[TABLE]
Moreover, under the assumption (4.1), there hold the following error estimates:
[TABLE]
Proof.
We only prove (5.5) since (5.6) can be proved similarly and (5.7)–(5.8) follow from the improved stability estimates and the argument used in the proof of Theorem 4.1.
From Theorem 3.1 we have
[TABLE]
where is defined in (3.9). From Lemma 5.2 we have
[TABLE]
Now it follows from Theorem 2.1 and the triangle inequality that
[TABLE]
Repeating the above process yields that there exists a constant independent of , , , and the penalty parameters, and a sequence of positive numbers such that
[TABLE]
with
[TABLE]
A simple calculation yields that if for some positive constant then
[TABLE]
which implies (5.5) by noting that and that C_{{\rm err},2,q}\,k\,h\lesssim\big{(}C_{{\rm err},2,q}^{2}k^{3}h^{2}\big{)}^{\frac{1}{2}}\lesssim\big{(}\widehat{C}_{{\rm err},2,q}^{2}k^{3}h^{2}\big{)}^{\frac{1}{2}}\lesssim p^{\frac{1}{2}}. ∎
Note that the stability estimates in (5.5) and (5.6) are of the same order as the PDE stability estimates given in Theorem 2.1.
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:5–40, 2006.
- 2[2] G. B. Alvarez, A. F. D. Loula, E. G. Dutra do Carmo, F. A. Rochinha. A discontinuous finite element formulation for Helmholtz equation. Comput. Methods Appl. Mech. Engrg. , 195:4018–4035, 2006.
- 3[3] D. Arnold. An interior penalty finite element method with discontinuous elements. SIAM J. Numer. Anal. , 19:742–760, 1982.
- 4[4] D. Arnold, F. Brezzi, B. Cockburn, and D. Marini. Unified analysis of discontinuous Galerkin methods for elliptic problems. SIAM J. Numer. Anal. , 39:1749–1779, 2001.
- 5[5] A. K. Aziz and R. B. Kellogg. A scattering problem for the Helmholtz equation. In Advances in computer methods for partial differential equations, III (Proc. Third IMACS Internat. Sympos., Lehigh Univ., Bethlehem, Pa., 1979) , pages 93–95. IMACS, New Brunswick, N.J., 1979.
- 6[6] A. K. Aziz and A. Werschulz. On the numerical solutions of Helmholtz’s equation by the finite element method. SIAM J. Numer. Anal. , 17(5):681–686, 1980.
- 7[7] I. Babuška and B. Guo. Approximation properties of the h − p ℎ 𝑝 h-p version of the finite element method. Comput. Methods Appl. Mech. Engrg. , 133:319–346, 1996.
- 8[8] I. Babuška and M. Suri. The h ℎ h - p 𝑝 p version of the finite element method with quasiuniform meshes. Math. Modeling Numer. Anal. , 21:199–238, 1987.
