Next Article in Journal
New Symmetries, Conserved Quantities and Gauge Nature of a Free Dirac Field
Previous Article in Journal
Applicable Image Security Based on New Hyperchaotic System
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Convergence Analysis of the LDG Method for Singularly Perturbed Reaction-Diffusion Problems

1
International Education School, Suzhou University of Science and Technology, Suzhou 215009, China
2
School of Mathematical Sciences, Suzhou University of Science and Technology, Suzhou 215009, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Symmetry 2021, 13(12), 2291; https://doi.org/10.3390/sym13122291
Submission received: 8 November 2021 / Revised: 25 November 2021 / Accepted: 26 November 2021 / Published: 1 December 2021
(This article belongs to the Section Mathematics)

Abstract

:
We analyse the local discontinuous Galerkin (LDG) method for two-dimensional singularly perturbed reaction–diffusion problems. A class of layer-adapted meshes, including Shishkin- and Bakhvalov-type meshes, is discussed within a general framework. Local projections and their approximation properties on anisotropic meshes are used to derive error estimates for energy and “balanced” norms. Here, the energy norm is naturally derived from the bilinear form of LDG formulation and the “balanced” norm is artificially introduced to capture the boundary layer contribution. We establish a uniform convergence of order k for the LDG method using the balanced norm with the local weighted L 2 projection as well as an optimal convergence of order k + 1 for the energy norm using the local Gauss–Radau projections. The numerical method, the layer structure as well as the used adaptive meshes are all discussed in a symmetry way. Numerical experiments are presented.

1. Introduction

Over the past few decades, singularly perturbed problems have attracted considerable attention in the scientific community. Such problems arise in many applications, including the modelling of viscous fluid flows, semiconductor devices, and more [1]. For reaction–diffusion problems, difficulties arise owing to the presence of boundary layers in the solution. Unless the meshes are sufficiently refined, traditional finite-difference or finite-element methods on uniform or quasi-uniform meshes yield oscillatory and inaccurate numerical solutions. Consequently, three common approaches have been proposed in the literature. The first is to use traditional numerical methods on strongly refined, layer-adapted meshes, such as the Shishkin-type (S-type) or Bakhvalov-type (B-type) mesh [2,3,4,5]. Various parameter-uniform convergence results have been established in this way; notably, the order of convergence and error constant are independent of the singular perturbation parameters. The second approach is to use a stabilised numerical method, such as the streamline diffusion finite-element method, interior-penalty discontinuous Galerkin method, or local discontinuous Galerkin (LDG) method [6,7,8]; well-behaved local error estimates have been investigated using uniform or quasi-uniform meshes. The third approach [2,9,10,11] is to combine the aforementioned stabilised numerical methods with layer-adapted meshes. From a practical perspective, the third approach is preferable because it is more stable and less sensitive to the choice of transition point on the layer-adapted mesh.
The LDG method is a form of finite-element method; it was first proposed as a generalisation of the discontinuous Galerkin (DG) method for a convection–diffusion problem [12]. Later, it was applied to solve the purely elliptic problem [13], convection–diffusion problems [14], Stokes system [15], KdV-type equations [16], Hamilton–Jacobi equations [17], time-dependent fourth-order problems [18] and other higher-order partial differential equations [19]. Because the LDG method shares many advantages of the DG methods and can effectively simulate the acute change of a singular solution, it is particularly suited to solving singularly perturbed problems. For example, Cheng et al. performed double-optimal local error estimates for two explicit, fully discrete LDG methods on quasi-uniform meshes [6,7]. Xie et al. established uniform convergence and super-convergence analyses of the LDG method on a standard Shishkin mesh [10,11,20]. However, few results have been established for the LDG method on general S-type or B-type meshes.
Recently, we analysed the LDG method on several S-type meshes and a B-type mesh for singularly perturbed convection–diffusion problems. Robust error estimates were derived from the energy norm [9]. However, the reaction–diffusion case remains unexplored. Despite its simpler appearance, reaction-dominated diffusion without convection differs from convection–diffusion in the following three respects:
  • For singularly perturbed reaction–diffusion problems, the boundary layer structure is considerably more complicated because of the parabolic layers along all boundary edges [21]. As a result, the regularity of the solution is complex. This adds many difficulties to the theoretical analysis, such as in the construction of layer-adapted meshes and the estimates of various approximation errors.
  • Better than the convergence order obtained in [9] for the convection–diffusion problem, we can establish an optimal convergence of order k + 1 for the LDG method in the energy norm through a more elaborate analysis for the two-dimensional Gauss–Radau projections on anisotropic meshes.
  • In the reaction–diffusion region, the balanced-norm is more suitable to reflect the contribution of the boundary layer component [22]. To date, balanced-norm error estimates are only available for the Galerkin finite-element method (FEM) [23,24], mixed FEM [22], and hp-FEM [25], but not for the LDG method. For the first time, we establish the uniform convergence of the LDG method for the balanced norm.
Note that the numerical method, layer structure as well as the used adaptive meshes are all discussed in a symmetry way, which simplify our analysis to some extent.
The remainder of this paper is organised as follows. In Section 2, we describe the LDG method. In Section 3, we introduce a class of layer-adapted meshes and state some elementary lemmas for them. In Section 4, we establish uniform convergence for the balanced and energy norms. In Section 5, we present numerical experiments.

2. The LDG Method

Consider a two-dimensional singularly perturbed reaction–diffusion problem, expressed as
ε Δ u + b ( x , y ) u = f ( x , y ) , in Ω = ( 0 , 1 ) 2 ,
u = 0 , on Ω ,
where 0 < ε 1 is a perturbation parameter, and b ( x , y ) 2 β 2 > 0 for any ( x , y ) Ω ¯ and for some positive constant β . In this section, we present the LDG method for (1).
Let Ω N = { K i j } i = 1 , 2 , , N x j = 1 , 2 , , N y be a rectangle partition of Ω with element K i j = I i × J j , where I i = ( x i 1 , x i ) and J j = ( y j 1 , y j ) . We set h x , i = x i x i 1 , h y , j = y j y j 1 , and = min K i j Ω N min { h x , i , h y , j } . We let
V N = { v L 2 ( Ω ) : v | K Q k ( K ) , K Ω N } ,
be the discontinuous finite-element space, where Q k ( K ) represents the space of polynomials on K with a maximum degree of k in each variable. V N is contained in a broken Sobolev space, expressed as
H 1 ( Ω N ) = { v L 2 ( Ω ) : v | K H 1 ( K ) , K Ω N } ,
whose function is allowed to have discontinuities across element interfaces. For v H 1 ( Ω N ) and y J j , j = 1 , 2 , , N y , we use v i , y ± = lim x x i ± v ( x , y ) and v x , j ± = lim y y j ± v ( x , y ) to express the traces evaluated from the four directions. We denote
[ [ v ] ] i , y = v i , y + v i , y , for i = 1 , 2 , , N x 1 , [ [ v ] ] 0 , y = v 0 , y + , [ [ v ] ] N x , y = v N x , y , [ [ v ] ] x , j = v x , j + v x , j , for j = 1 , 2 , , N y 1 , [ [ v ] ] x , 0 = v x , 0 + , [ [ v ] ] x , N y = v x , N y ,
as the jumps on the vertical and horizontal edges, respectively.
Rewrite (1) into an equivalent first-order system:
p x q y + b u = f , ε 1 p = u x , ε 1 q = u y , in Ω .
Let · , · D be the inner product in L 2 ( D ) . In order to determine the approximate solution 𝕨 = ( 𝕦 , 𝕡 , 𝕢 ) V N 3 V N × V N × V N , we first multiply each of the Equation (4) by arbitrary smooth functions v , s , r , respectively, and integrating over K i j , we get after a simple formal integration by parts in (4),
p , v x K i j p i , y , v i , y J j + p i 1 , y , v i 1 , y + J j + q , v y K i j q x , j , v x , j I i + q x , j 1 , v x , j 1 + I i + b u , v K i j = f , v K i j , ε 1 p , s K i j + u , s x K i j u i , y , s i , y J j + u i 1 , y , s i 1 , y + J j = 0 , ε 1 q , r K i j + u , r y K i j u x , j , r x , j I i + u x , j 1 , r x , j 1 + I i = 0 .
Next, we replace the smooth functions v , s , r by test functions 𝕧 , 𝕤 , 𝕣 , respectively, in the finite element space V N and the exact solution w = ( u , p , q ) by the approximate solution 𝕨 = ( 𝕦 , 𝕡 , 𝕢 ) . As this function is discontinuous in each of its components, we must also replace the fluxes u i , y , u x , j , p i , y , q x , j by the numerical fluxes 𝕦 ^ i , y , 𝕦 ^ x , j , 𝕡 ^ i , y , 𝕢 ^ x , j . Then, the LDG scheme is defined as follows. Find 𝕨 = ( 𝕦 , 𝕡 , 𝕢 ) V N 3 such that in each element K i j , the variational forms
𝕡 , 𝕧 x K i j 𝕡 ^ i , y , 𝕧 i , y J j + 𝕡 ^ i 1 , y , 𝕧 i 1 , y + J j
+ 𝕢 , 𝕧 y K i j 𝕢 ^ x , j , 𝕧 x , j I i + 𝕢 ^ x , j 1 , 𝕧 x , j 1 + I i + b 𝕦 , 𝕧 K i j = f , 𝕧 K i j ,
ε 1 𝕡 , 𝕤 K i j + 𝕦 , 𝕤 x K i j 𝕦 ^ i , y , 𝕤 i , y J j + 𝕦 ^ i 1 , y , 𝕤 i 1 , y + J j = 0 ,
ε 1 𝕢 , 𝕣 K i j + 𝕦 , 𝕣 y K i j 𝕦 ^ x , j , 𝕣 x , j I i + 𝕦 ^ x , j 1 , 𝕣 x , j 1 + I i = 0 ,
hold for any 𝕫 = ( 𝕧 , 𝕤 , 𝕣 ) V N 3 , where
𝕡 ^ i , y = 𝕡 i , y + + λ i , y [ [ 𝕦 ] ] i , y , i = 0 , 1 , , N x 1 , 𝕡 N x , y λ N x , y 𝕦 N x , y , i = N x ,
𝕦 ^ i , y = 0 , i = 0 , N x , 𝕦 i , y , i = 1 , 2 , , N x 1 ,
for y J j and j = 1 , 2 , , N y . Here, λ i , y 0 ( i = 0 , 1 , , N x ) are stabilisation parameters to be determined later. Analogously, for x I i and i = 1 , 2 , , N x , we can define 𝕢 ^ x , j and 𝕦 ^ x , j for j = 0 , 1 , , N y .
Write w , v = K i j Ω N w , v K i j . Then, we write the above LDG method into a compact form: Find 𝕨 = ( 𝕦 , 𝕡 , 𝕢 ) V N 3 such that
B ( 𝕨 ; 𝕫 ) = f , 𝕧 , 𝕫 = ( 𝕧 , 𝕤 , 𝕣 ) V N 3 ,
where
B ( 𝕨 ; 𝕫 ) = T 1 ( 𝕨 ; 𝕫 ) + T 2 ( 𝕦 ; 𝕫 ) + T 3 ( 𝕨 ; 𝕧 ) + T 4 ( 𝕦 ; 𝕧 ) ,
with
T 1 ( 𝕨 ; 𝕫 ) = ε 1 𝕡 , 𝕤 + ε 1 𝕢 , 𝕣 + b 𝕦 , 𝕧 , T 2 ( 𝕦 ; 𝕫 ) = 𝕦 , 𝕤 x + j = 1 N y i = 1 N x 1 𝕦 i , y , [ [ 𝕤 ] ] i , y J j + 𝕦 , 𝕣 y + i = 1 N x j = 1 N y 1 𝕦 x , j , [ [ 𝕣 ] ] x , j I i , T 3 ( 𝕨 ; 𝕧 ) = 𝕡 , 𝕧 x + j = 1 N y i = 0 N x 1 𝕡 i , y + , [ [ 𝕧 ] ] i , y J j 𝕡 N x , y , 𝕧 N x , y J j + 𝕢 , 𝕧 y + i = 1 N x j = 0 N y 1 𝕢 x , j + , [ [ 𝕧 ] ] x , j I i 𝕢 x , N y , 𝕧 x , N y I i , T 4 ( 𝕦 ; 𝕧 ) = j = 1 N y i = 0 N x λ i , y [ [ 𝕦 ] ] i , y , [ [ 𝕧 ] ] i , y J j + i = 1 N x j = 0 N y λ x , j [ [ 𝕦 ] ] x , j , [ [ 𝕧 ] ] x , j I i .

3. Layer-Adapted Meshes

To introduce the layer-adapted meshes, we extract some precise information from the exact solution of (1) and its derivatives in [21] (Theorem 2.2) and in [26] (Theorem 4.2).
Proposition 1.
Assume that the solution u of (1) can be decomposed by
u = S + k = 1 4 W k + k = 1 4 Z k , ( x , y ) Ω ¯ ,
where S is a smooth part, W k is a boundary layer part and Z k is a corner layer part. More precisely, for 0 i , j k + 2 , there exists a constant C independent of ε such that
x i y j S C , x i y j W 1 C ε i 2 e β x ε , x i y j Z 1 C ε i + j 2 e β ( x + y ) ε ,
and so on for the remaining terms. Here, x i y j v = i + j v x i y j .
The layer-adapted mesh is constructed as follows: For notational simplification, we assume that N x = N y = N . Let N 4 be a multiple of four. We introduce the mesh points
0 = x 0 < x 1 < < x N 1 < x N = 1 , 0 = y 0 < y 1 < < y N 1 < y N = 1 ,
and consider a tensor-product mesh with mesh points ( x i , y j ) . Because both meshes have the same structure, we only describe the mesh in the x-direction.
Suppose φ is a function defined in [ 0 , 1 / 4 ] with
φ ( 0 ) = 0 , φ > 0 , φ 0 .
We define the transition parameter
τ = min 1 4 , σ ε β φ ( 1 / 4 ) ,
where σ > 0 is determined later. Assume that ε N 1 means that we are in the singularly perturbed case. Moreover, ε is sufficiently small that (12) is replaced by τ = σ ε β φ ( 1 / 4 ) .
The mesh in the x-direction is equidistant on [ τ , 1 τ ] with N / 2 elements, but it is gradually divided on [ 0 , τ ] and [ 1 τ , 1 ] with N / 4 elements. Therefore, we set the mesh points as
x i = σ ε β φ ( i / N ) , for i = 0 , 1 , , N / 4 , τ + 2 ( 1 2 τ ) ( i / N 1 / 4 ) , for i = N / 4 + 1 , , 3 N / 4 1 , 1 σ ε β φ ( 1 i / N ) , for i = 3 N / 4 , , N .
In Table 1, we list three typical layer-adapted meshes [2] (Sections 1.2 and 1.3): Shishkin (S-mesh), Bakhvalov–Shishkin (BS mesh) and Bakhvalov-type (B-type mesh), together with ψ = e φ and the important quantity max | ψ | , which arises in error estimates. Figure 1 illustrates the divisions of Ω and the generated meshes for ε = 10 2 and N = 16 .
Note that for these meshes and under the assumption ε N 1 , we always have τ σ ε β ln N .
In the following, we state two preliminary lemmas that will be frequently employed in the subsequent analysis. Because h x , i = h y , i , i = 1 , 2 , , N , we simply use h i to denote one of them.
Lemma 1.
Suppose that
Θ i = min h i ε , 1 e β x i 1 σ ε , i = 1 , 2 , , N / 4 .
Then, there exists a constant C > 0 independent of ε and N such that
max 1 i N / 4 Θ i C N 1 max | ψ | ,
i = 1 N / 4 Θ i C .
Because of the symmetry of the mesh and layer function, (14) is also valid for the cases with y i , 1 y i 1 and 1 x i 1 .
Proof. 
See in [9] (Lemma 3.1) for details. □
Lemma 2.
We have h N / 4 + 1 = h N / 4 + 2 = = h 3 N / 4 and C ε N 1 max | ψ | . For the S-type meshes,
1 h i / h i + 1 C i = 1 , 2 , , N / 4 1 , 1 h i + 1 / h i C i = 3 N / 4 + 1 , 3 N / 4 + 2 , , N 1 .
For the B-type mesh,
1 h i / h i + 1 C i = 1 , 2 , , N / 4 2 , 1 h i + 1 / h i C i = 3 N / 4 + 2 , 3 N / 4 + 3 , , N 1 .
Moreover,
h l y max i = 1 , , N / 4 i = 3 N / 4 , , N h i C ϱ C ε , f o r S t y p e   m e s h e s , N 1 , f o r a   B t y p e   m e s h e s .
Proof. 
It can be seen that h N / 4 + 1 = h N / 4 + 2 = = h 3 N / 4 . (15) and (16) can be verified trivially (see [9] (Lemma 3.2)). By (13) and (11), and ψ = e φ , we have
C ε N 1 min | φ | = C ε N 1 | φ ( 0 ) | = C ε N 1 | ψ ( 0 ) | = C ε N 1 max | ψ | .
Now, we prove (17). Combining the fact that h l y C N 1 with the inequality
h l y C ε N 1 max | φ | C ε N 1 | φ ( 1 / 4 ) | ,
we obtain
h l y C min ε N 1 | φ ( 1 / 4 ) | , N 1 ,
which implies (17). □

4. Convergence Analysis

In this section, we perform uniform convergence analysis for the LDG method on layer-adapted meshes. Two related norms are considered.
The first is the energy norm, which is naturally derived from the formulation of the LDG method; that is, 𝕨 E 2 B ( 𝕨 ; 𝕨 ) . Therefore, we obtain
𝕨 E 2 = ε 1 𝕡 2 + ε 1 𝕢 2 + b 1 / 2 𝕦 2 + j = 1 N i = 0 N λ i , y , [ [ 𝕦 ] ] i , y 2 J j + i = 1 N j = 0 N λ x , j , [ [ 𝕦 ] ] x , j 2 I i ,
by using integration by parts and some trivial manipulations. Here,
z 2 = K Ω N z K 2 and z K 2 = z , z K .
However, this norm is inadequate for reaction–diffusion problems because the layer contributions are not “seen” In fact, letting u = e β ( x + y ) / ε , we have ( u , ε u x , ε u y ) E = O ( ε 4 ) , which vanishes as ε 0 . Thus, the following “balanced” norm is introduced:
𝕨 B 2 = ε 3 / 2 𝕡 2 + ε 3 / 2 𝕢 2 + b 1 / 2 𝕦 2 + j = 1 N i = 0 N 1 , [ [ 𝕦 ] ] i , y 2 J j + i = 1 N j = 0 N 1 , [ [ 𝕦 ] ] x , j 2 I i .
This norm is balanced in the sense that both the regular and layer parts are bounded away from zero uniformly in ε . We drop the penalty parameter λ because they will be taken as O ( ε ) in the subsequent analysis and computation of balanced-norm error.
In the following subsections, we perform convergence analysis for these two norms. Different projections are introduced, and the related approximation properties are investigated.

4.1. Convergence of Balanced Norm

First, we analyse the LDG method for the balanced norm (20). Let ω C 1 ( Ω N ) and ω ω 0 > 0 be a general weight function. We define the piecewise local weight L 2 projection Π ω as follows: For each element K Ω N and for any z L 2 ( Ω N ) , Π ω z V N satisfies
ω Π ω z , 𝕧 K = ω z , 𝕧 K , 𝕧 Q k ( K ) .
In the special case of ω = 1 , this operator reduces to the classical local L 2 projection, which is denoted by Π .
Lemma 3.
[27] (Lemma 2.14) There exists a constant C > 0 , independent of the element size and z, such that
Π ω z L m ( K i j ) C z L m ( K i j ) ,
z Π ω z L m ( K i j ) C h i k + 1 x k + 1 z L m ( K i j ) + h j k + 1 y k + 1 z L m ( K i j ) ,
where m { 2 , } .
Lemma 4.
Let σ k + 1.5 . Then, there holds
u Π ω u C ε 4 ( N 1 max | ψ | ) k + 1 + N ( k + 1 ) ,
u Π ω u L ( Ω N ) C ( N 1 max | ψ | ) k + 1 ,
j = 1 N i = 1 N 1 ( u Π ω u ) i , y J j 2 C ( N 1 max | ψ | ) 2 k + 1 ,
j = 1 N i = 0 N 1 , [ [ u Π ω u ] ] i , y 2 J j C ( N 1 max | ψ | ) 2 k + 1 ,
p Π ω p C ε 3 4 ( N 1 max | ψ | ) k + 1 ,
j = 1 N ( p Π ω p ) N , y J j 2 C ε ( N 1 max | ψ | ) 2 ( k + 1 ) ,
j = 1 N i = 0 N 1 ( p Π ω p ) i , y + J j 2 C ε ( N 1 max | ψ | ) 2 k + 1 ,
where C > 0 is independent of ε and N. A similar procedure applies for u and q in other spatial directions.
Proof. 
The proof is provided in the Appendix A.1. □
Theorem 1.
Suppose that λ i , y = λ x , j = ε for i , j = 0 , 1 , , N . Let w = ( u , p , q ) be the solution to problem (1), satisfying Proposition 1; furthermore, let 𝕨 = ( 𝕦 , 𝕡 , 𝕢 ) V N 3 be the numerical solution of the LDG scheme (5) on layer-adapted meshes (13) when σ k + 1.5 . Here, k 0 is the degree of the piecewise polynomials used in the discontinuous finite element space. Then, there exists a constant C > 0 , independent of ε and N, such that
w 𝕨 B C N k ( max | ψ | ) k + 1 / 2 .
Proof. 
Denote e = w 𝕨 = η ξ as
η = ( η u , η p , η q ) = ( u Π b u , p Π p , q Π q ) ,
ξ = ( ξ u , ξ p , ξ q ) = ( 𝕦 Π b u , 𝕡 Π p , 𝕢 Π q ) V N 3 ,
where Π b is defined in (21) with weight ω = b .
From Proposition 1 and the consistency of numerical flux, we obtain the error equation:
B ( ξ ; 𝕫 ) = B ( η ; 𝕫 ) = T 1 ( η ; 𝕫 ) + T 2 ( η u ; 𝕫 ) + T 3 ( η ; 𝕧 ) + T 4 ( η u ; 𝕧 ) .
It can be seen that T 1 ( η ; 𝕫 ) = 0 .
To bound T 2 ( η u ; 𝕫 ) , we use the Cauchy–Schwarz inequality, inverse inequality, C ε N 1 max | ψ | C N 1 , (23b), and ε 1 / 2 𝕤 𝕫 E to obtain
| η u , 𝕤 x | K η u K 𝕤 x K C K | K | 1 / 2 η u L ( K ) h x 1 𝕤 K C K h y h x η u L ( K ) 2 1 / 2 𝕤 C ε 4 N k ( max | ψ | ) k + 1 / 2 𝕫 E ,
and we use (23c) to obtain
| j = 1 N i = 1 N 1 ( η u ) i , y , [ [ 𝕤 ] ] i , y J j | C j = 1 N i = 1 N 1 ( η u ) i , y J j 2 1 / 2 ( 1 / 2 𝕤 ) C ε 4 ( N 1 max | ψ | ) k 𝕫 E .
Consequently, we have
T 2 ( η u ; 𝕫 ) C ε 4 N k ( max | ψ | ) k + 1 / 2 𝕫 E .
Analogously, we have
T 3 ( η ; 𝕧 ) = j = 1 N i = 0 N 1 ( η p ) i , y + , [ [ 𝕧 ] ] i , y J j ( η p ) N , y , 𝕧 N , y J j + i = 1 N j = 0 N 1 ( η q ) x , j + , [ [ 𝕧 ] ] x , j I i ( η q ) x , N , 𝕧 x , N I i C j = 1 N i = 0 N 1 ε 1 ( η p ) i , y + J j 2 + j = 1 N ε 1 ( η p ) N , y J j 2 1 / 2 ( ε 1 / 2 𝕧 ) + C i = 1 N j = 0 N 1 ε 1 ( η q ) x , j + I i 2 + i = 1 N ε 1 ( η q ) x , N I i 2 1 / 2 ( ε 1 / 2 𝕧 ) C 1 / 2 ε ( N 1 max | ψ | ) k + 1 / 2 𝕧 C ε 4 ( N 1 max | ψ | ) k 𝕫 E .
Here, (23f) and (23g) are used.
Finally, we use the Cauchy–Schwarz inequality, (23d), and the assumption that λ i , y = λ x , j = ε for i , j = 0 , 1 , , N , to obtain
T 4 ( η u ; 𝕧 ) = j = 1 N i = 0 N λ i , y [ [ η u ] ] i , y , [ [ 𝕧 ] ] i , y J j + i = 1 N j = 0 N λ x , j [ [ η u ] ] x , j , [ [ 𝕧 ] ] x , j I i i = 0 N j = 1 N λ i , y 1 , [ [ η u ] ] i , y 2 J j + j = 0 N i = 1 N λ x , j 1 , [ [ η u ] ] x , j 2 I i 1 / 2 𝕫 E C ε 4 ( N 1 max | ψ | ) k + 1 / 2 𝕫 E .
From (27)–(29), we have
ξ E 2 = B ( ξ ; ξ ) = B ( η ; ξ ) C ε 4 N k ( max | ψ | ) k + 1 / 2 ξ E ,
which implies
ξ B ε 1 / 4 ξ E C N k ( max | ψ | ) k + 1 / 2 ,
from the definitions (19) and (20) and the choice of λ i , y = λ x , j = ε ( i , j = 0 , 1 , , N ). Using (23) and a trivial inequality, we derive (24). □
Remark that for the meshes listed in Table 1, one has balanced-norm error estimate
w 𝕨 B C N k ( ln N ) k + 1 / 2 , for   S - mesh , C N k , for   BS - , B - type   mesh .

4.2. Improvement of Convergence in Energy Norm

By the analysis in Theorem 1, one can only obtain the energy-error bound of order O ( ε 4 N k ( max | ψ | ) k + 1 / 2 ) . In this subsection, we perform an elaborate analysis and establish a more sharp convergence result in the energy norm. The following local Gauss–Radau projections are required.
For each element K i j Ω N and for any z H 1 ( K i j ) , Π z , Π x + z , Π y + z Q k ( K i j ) are defined as
Π z , 𝕧 K i j = z , 𝕧 K i j , 𝕧 Q k 1 ( K i j ) , ( Π z ) i , y , 𝕧 J j = z i , y , 𝕧 J j , 𝕧 P k 1 ( J j ) , ( Π z ) x , j , 𝕧 I i = z x , j , 𝕧 I i , 𝕧 P k 1 ( I i ) , ( Π z ) ( x i , y j ) = z ( x i , y j ) .
Π x + z , 𝕧 K i j = z , 𝕧 K i j , 𝕧 P k 1 ( I i ) P k ( J j ) , ( Π x + z ) i , y + , 𝕧 J j = z i , y + , 𝕧 J j , 𝕧 P k ( J j ) .
Π y + z , 𝕧 K i j = z , 𝕧 K i j 𝕧 P k ( I i ) P k 1 ( J j ) , ( Π y + z ) x , j + , 𝕧 J j = z x , j + , 𝕧 J j , 𝕧 P k ( I i ) .
Lemma 5.
[9] (Inequality (4.4)) There exists a constant C > 0 , independent of the element size and z, such that
Π z K i j C z K i j + h j 1 / 2 z x , j I i + h i 1 / 2 z i , y J j + h i 1 / 2 h j 1 / 2 | z i , j | ,
Π x + z K i j C z K i j + h i 1 / 2 z i 1 , y + J j ,
Π y + z K i j C z K i j + h j 1 / 2 z x , j 1 + I i ,
Φ z L ( K i j ) C z L ( K i j ) ,
z Φ z L m ( K i j ) C h i k + 1 x k + 1 z L m ( K i j ) + h j k + 1 y k + 1 z L m ( K i j ) ,
where Φ { Π , Π x + , Π y + } , m { 2 , } and z i , j = z ( x i , y j ) .
Lemma 6.
Let σ k + 1.5 . Then, there exists a constant C > 0 independent of ε and N such that
u Π u C ( ε 4 + ϱ ) ( N 1 max | ψ | ) k + 1 + N ( k + 1 ) ,
j = 1 N ( u Π u ) N , y J j 2 C ( ε + ϱ ) ( N 1 max | ψ | ) 2 ( k + 1 ) + N 2 ( k + 1 ) ,
ε 1 2 p Π x + p C [ ( ε 4 + ϱ ) ( N 1 max | ψ | ) k + 1 + N ( k + 1 ) ] ,
j = 1 N ε 1 ( p Π x + p ) N , y J j 2 C ( N 1 max | ψ | ) 2 ( k + 1 ) ,
where ϱ is given by (17). Similarly, we can obtain the same conclusions in another spatial direction.
Proof. 
The proof is provided in the Appendix A.2. □
Theorem 2.
Suppose that λ i , y = λ x , j = 0 for i , j = 0 , 1 , , N 1 , λ N , y = λ x , N = ε . Let w = ( u , p , q ) be the solution to problem (1), which satisfies Proposition 1; furthermore, let 𝕨 = ( 𝕦 , 𝕡 , 𝕢 ) V N 3 be the numerical solution of the LDG scheme (5) on layer-adapted meshes (13) with σ k + 2 . Here, k 0 is the degree of the piecewise polynomials used in the discontinuous finite element space. Then, there exists a constant C > 0 independent of ε and N such that
w 𝕨 E C ε 4 ( N 1 ln N ) k + 1 + N ( k + 1 ) , f o r S - m e s h , C N ( k + 1 ) , f o r   for B S - , B - t y p e   m e s h .
Proof. 
We follow the proof of Theorem 1. Instead of the projection ( Π b , Π , Π ) for u , p and q, we use ( Π , Π x + , Π y + ) in (25).
Using the Cauchy–Schwarz inequality, (35a) and (35c), we obtain
T 1 ( η ; 𝕫 ) C ε 1 / 2 η p + ε 1 / 2 η q + b 1 / 2 L ( Ω N ) η u 𝕫 E C ( ε 4 + ϱ ) ( N 1 max | ψ | ) k + 1 + N ( k + 1 ) 𝕫 E .
From (33b), (33c) and (35d), λ N , y = λ x , N = ε , and the Cauchy–Schwarz inequality, we obtain
T 3 ( η ; 𝕧 ) = j = 1 N ( η p ) N , y , 𝕧 N , y J j i = 1 N ( η q ) x , N , 𝕧 x , N I i j = 1 N 1 λ N , y ( η p ) N , y J j 2 + i = 1 N 1 λ x , N ( η q ) x , N I i 2 1 / 2 𝕫 E C ε 4 ( N 1 max | ψ | ) k + 1 𝕫 E .
Similarly, we have
T 4 ( η u ; 𝕧 ) = j = 1 N λ N , y ( η u ) N , y , 𝕧 N , y J j + i = 1 N λ x , N ( η u ) x , N , 𝕧 x , N I i j = 1 N λ N , y ( η u ) N , y J j 2 + i = 1 N λ x , N ( η u ) x , N I i 2 1 / 2 𝕫 E C ε 4 ( ε 4 + ϱ ) ( N 1 max | ψ | ) k + 1 + N ( k + 1 ) 𝕫 E ,
where (35b) is used.
To bound T 2 ( η u ; 𝕫 ) , we follow [9] (Theorem 4.1) and investigate the ε 1 / 4 -factor in the upper-bound. On each element K i j , we define the bilinear forms as
A i j 1 ( η u ; v ) = η u , v x K i j ( η u ) i , y , v i , y J j + ( η u ) i 1 , y , v i 1 , y + J j , A i j 2 ( η u ; v ) = η u , v y K i j ( η u ) x , j , v x , j I i + ( η u ) x , j 1 , v x , j 1 + I i .
We have [9] (Inequality (4.15))
| A i j 1 ( η u ; v ) | C h j h i h i k + 2 x k + 2 u L ( K i j ) + h j k + 2 y k + 2 u L ( K i j ) v K i j ,
| A i j 1 ( η u ; v ) | C h j h i u L ( K i j ) v K i j
for any v Q k ( K i j ) . Because u = 0 on Ω , we obtain
T 2 ( η u ; 𝕫 ) = K i j Ω N A i j 1 ( η u ; 𝕤 ) + K i j Ω N A i j 2 ( η u ; 𝕣 ) .
By (40a), we have
K i j Ω N A i j 1 ( η S ; 𝕤 ) C K i j Ω N h j h i h i k + 2 x k + 2 S L ( K i j ) + h j k + 2 y k + 2 S L ( K i j ) 𝕤 K i j C N ( k + 1 ) 𝕤 Ω 22 + C K i j Ω N \ Ω 22 ( ε max | ψ | ) 1 N 2 ( k + 2 ) 1 / 2 𝕤 Ω \ Ω 22 C ε 4 N ( k + 1 ) 𝕫 E ,
because h i C ε N 1 max | ψ | C ε h j max | ψ | and ε 1 / 2 𝕤 𝕫 E . Denote Ω X L = Ω 11 Ω 21 Ω 31 , Ω X M = Ω 12 Ω 22 Ω 32 , and Ω X R = Ω 13 Ω 23 Ω 33 . Using (40a) and σ k + 2 , we obtain
K i j Ω X M Ω X R A i j 1 ( η W 1 ; 𝕤 ) C K i j Ω X M Ω X R h j h i W 1 L ( K i j ) 𝕤 K i j C K i j Ω X M Ω X R ε 1 / 4 e β x i ε 𝕤 K i j C ε 4 N ( k + 1 ) 𝕫 E .
Using (40), σ k + 2 , and Lemma 1 yields
K i j Ω X L A i j 1 ( η W 1 ; 𝕤 ) C K i j Ω X L h j h i min h i k + 2 x k + 2 W 1 L ( K i j ) + h j k + 2 y k + 2 W 1 L ( K i j ) , W 1 L ( K i j ) 𝕤 K i j C K i j Ω X L ( ε max | ψ | ) 1 / 2 Θ i k + 2 𝕤 K i j C ε 4 ( max | ψ | ) 1 / 2 j = 1 N i = 1 N / 4 Θ i 1 / 2 max 1 i N / 4 Θ i k + 3 / 2 ε 1 / 2 𝕤 C ε 4 ( N 1 max | ψ | ) k + 1 𝕫 E .
Analogously, we can bound K i j Ω N A i j 1 ( η φ ; 𝕤 ) for φ = W 2 , W 3 , W 4 , Z 1 , Z 2 , Z 3 , Z 4 . Consequently,
T 2 ( η u ; 𝕫 ) C ε 4 ( N 1 max | ψ | ) k + 1 𝕫 E .
Using (37)–(41), we obtain
ξ E 2 = B ( ξ ; ξ ) = B ( η ; ξ ) C ( ε 4 + ϱ ) ( N 1 max | ψ | ) k + 1 + N ( k + 1 ) ξ E ,
which leads to
ξ E C ( ε 4 + ϱ ) ( N 1 max | ψ | ) k + 1 + N ( k + 1 ) .
The final assertion follows by repeating similar arguments as before. This completes the proof. □

5. Numerical Experiments

In this section, we present some numerical experiments. All calculations are conducted in MATLAB R2015B. The system of linear equations resulting from the discrete problems are solved by the lower–upper (LU)-decomposition algorithm. All integrals are evaluated using the 5-point Gauss–Legendre quadrature rule.
The LDG method (5) is applied to the layer-adapted meshes presented in Table 1, where σ = k + 1 , k = 0 , 1 , 2 , 3 . We let e N be the error in either e E or e B for an N-element. As assumed in Theorems 1 and 2, we take the flux parameter λ 0 = λ N = ε and λ i = 0 ( i = 1 , 2 , , N 1 ) to compute the energy-error e E , and choose λ i = ε ( i = 0 , 1 , , N ) to compute the balanced-error e B . The corresponding convergence rates are computed by the following formulae:
r S = log e N log e 2 N log p , r 2 = log e N log e 2 N log 2 .
with p = 2 ln N / ln ( 2 N ) . Here, we use r S to reflect the convergence rate with respect to the power of N 1 ln N , see the error estimates in (32) and (36).
Example 1.
Consider a linear reaction–diffusion problem
ε Δ u + 2 u = f ( x , y ) , i n Ω = ( 0 , 1 ) 2 ,
u = 0 , o n Ω ,
where f ( x , y ) is suitably taken such that the exact solution is u ( x , y ) = g ( x ) g ( y ) with
g ( v ) = e v / ε e ( 1 v ) / ε 1 e 1 / ε cos ( π v ) .
We set ε = 10 8 , small enough to bring out the singularly perturbed nature of (44). In Table 2, we list the balanced-norm errors and their convergence rates. The convergence rate is plotted in Figure 2. We observe convergence of order k + 1 / 2 , which is a half-order superior to the estimate from (24). In Table 3, we present the energy norm errors and their convergence rates. The convergence rate is plotted in Figure 3, which agrees with our estimate (36).
We show the relevance of these errors to the small parameter ε. We let N = 256 , k = 1 , and vary the values of ε. We see that the errors in the balanced norm are almost unchanged, whereas the errors in the energy norm change slightly. For a visual understanding, we plot the energy errors via ε on log–log coordinates. In Figure 4, we observe the subtle influence of the ε 0.25 -factor on the energy errors; the results agree with our predictions.
Example 2.
Consider the nonlinear reaction–diffusion problem
ε Δ u + [ 2 + x y ( 1 x ) ( 1 y ) ] u = f ( x , y ) , i n Ω = ( 0 , 1 ) 2 ,
u = 0 , o n Ω ,
where f ( x , y ) is suitably taken such that the exact solution is u ( x , y ) = h ( x ) h ( y ) and
h ( v ) = 1 + ( v 1 ) e v / ε v e ( 1 v ) / ε .
We let ε = 10 8 . In Table 4 and Table 5, we list the error and convergence rates for the balanced and energy norms, respectively. We still observe convergence of orders k + 1 / 2 and k + 1 for the balanced-norm and energy norm errors. See the convergence rates for the balanced-norm and energy-norm errors in Figure 5 and Figure 6.
Moreover, we test the dependence of these two types of errors on ε. We observe that the errors in the balanced norm are almost constant, whereas the errors in the energy norm change slightly. In Figure 7, we confirm the influence of the factor ε 0.25 on the energy norm errors obtained for the three layer-adapted meshes. Note that for this example, the ε 0.25 -factor is clearly observed on both the S-type and B-type meshes. This may be due to the fact that the regular part of the exact solution belongs to V N , as described in [10] (Theorem 3.5).

Author Contributions

Resources, S.W.; Visualisation, Z.X.; Validation, Y.M.; Writing—review and editing, C.S.; Supervision, Y.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China (No. 11801396,11802193,12172241), Natural Science Foundation of Jiangsu Province (No. BK20170374) and Nature Science Research Program for Colleges and Universities of Jiangsu Province (No.17KJB110016).

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

In this part, we provide the technical proofs for Lemmas 4 and 6.

Appendix A.1. Proof of Lemma 4

Let η u = u Π ω u , η p = p Π ω p and η q = q Π ω q . We prove (23) separately.
(1) Prove (23a). Recalling the decomposition u = S + k = 1 4 W k + k = 1 4 Z k , we have
η u η S + k = 1 4 η W k + k = 1 4 η Z k .
Using (22b) with m = 2 and (10), we obtain
η S C N ( k + 1 ) x k + 1 S + y k + 1 S C N ( k + 1 ) ,
because h i C N 1 for i = 1 , 2 , , N .
We have
η W 1 2 = K i j Ω X L η W 1 K i j 2 + K i j Ω X M Ω X R η W 1 K i j 2 Λ 1 + Λ 2 .
For Λ 1 , we use (22a) and (22b) with m = 2 to obtain the two estimates
Λ 1 C K i j Ω X L W 1 K i j 2 C K i j Ω X L e β x ε K i j 2 , Λ 1 C K i j Ω X L h i 2 ( k + 1 ) x k + 1 W 1 K i j 2 + h j 2 ( k + 1 ) y k + 1 W 1 K i j 2
C K i j Ω X L h i ε 2 ( k + 1 ) + h j 2 ( k + 1 ) e β x ε K i j 2 ,
respectively, where we have used (10). Combining (A4) with (A5) and using h i / ε C N 1 C h j , j = 1 N h j = 1 , σ k + 1.5 and (14), we have
Λ 1 C K i j Ω X L min h i ε 2 ( k + 1 ) + h j 2 ( k + 1 ) , 1 e β x ε K i j 2 C i = 1 N / 4 min h i ε 2 ( k + 1 ) , 1 ε e 2 β x i 1 ε min h i ε , 1 j = 1 N h j C ε max 1 i N / 4 Θ i 2 ( k + 1 ) i = 1 N 4 Θ i C ε ( N 1 max | ψ | ) 2 ( k + 1 ) ,
where we use the trivial inequality
e β x ε K i j 2 = ε 2 β h j e 2 β x i 1 ε ( 1 e 2 β h i ε ) C ε h j e 2 β x i 1 ε min h i ε , 1 ,
because 1 e x min { 1 , x } for x 0 . For Λ 2 , we use (22a) and (10) to obtain
Λ 2 C K i j Ω X M Ω X R W 1 K i j 2 C 0 1 d y τ 1 e 2 β x ε d x C ε e 2 β τ ε C ε N 2 σ .
Inserting (A6) and (A7) into (A3) yields
η W 1 C ε 4 [ ( N 1 max | ψ | ) k + 1 + N σ ] .
In addition,
η Z 1 2 = K i j Ω 11 η Z 1 K i j 2 + K i j Ω N \ Ω 11 η Z 1 K i j 2 Ξ 1 + Ξ 2 .
Using (22a) and (22b) with m = 2 gives the two estimates
Ξ 1 C K i j Ω 11 Z 1 K i j 2 C K i j Ω 11 e β ( x + y ) ε K i j 2 , Ξ 1 C K i j Ω 11 h i 2 ( k + 1 ) x k + 1 Z 1 K i j 2 + h j 2 ( k + 1 ) y k + 1 Z 1 K i j 2
C K i j Ω 11 h i ε 2 ( k + 1 ) + h j ε 2 ( k + 1 ) e β ( x + y ) ε K i j 2 ,
respectively. This leads to
Ξ 1 C K i j Ω 11 min h i ε 2 ( k + 1 ) + h j ε 2 ( k + 1 ) , 1 e β ( x + y ) ε K i j 2 C i = 1 N / 4 min h i ε 2 ( k + 1 ) , 1 ε e 2 β x i 1 ε min h i ε , 1 j = 1 N / 4 e 2 β y j 1 ε min h j ε , 1 + C j = 1 N / 4 min h j ε 2 ( k + 1 ) , 1 ε e 2 β y j 1 ε min h j ε , 1 i = 1 N / 4 e 2 β x i 1 ε min h i ε , 1 C ε max 1 i N / 4 Θ i 2 ( k + 1 ) i = 1 N 4 Θ i j = 1 N 4 Θ j + C ε max 1 j N / 4 Θ j 2 ( k + 1 ) j = 1 N 4 Θ j i = 1 N 4 Θ i C ε ( N 1 max | ψ | ) 2 ( k + 1 ) ,
where we use σ k + 1.5 , Lemma 1, the trivial inequality min { 1 , a + b } min { 1 , a } + min { 1 , b } and
e β ( x + y ) ε K i j 2 = ε 4 β 2 e 2 β ( x i 1 + y j 1 ) ε ( 1 e 2 β h i ε ) ( 1 e 2 β h j ε ) C ε e 2 β ( x i 1 + y j 1 ) ε min h i ε , 1 min h j ε , 1 .
Similar to before, we have
Ξ 2 C K i j Ω N \ Ω 11 Z 1 K i j 2 C Ω N \ Ω 11 e 2 β ( x + y ) ε d x d y C ε e 2 β τ ε C ε N 2 σ .
From (A11) and (A12), we obtain
η Z 1 C ε ( N 1 max | ψ | ) k + 1 .
Similarly, we can bound the other terms in (A1) and arrive at (23a).
(2) Prove (23b) and (23c). It can be seen that
j = 1 N i = 1 N 1 ( η S ) i , y J j 2 j = 1 N i = 1 N 1 h j η S L ( K i j ) 2 C j = 1 N i = 1 N 1 h j N 2 ( k + 1 ) C N ( 2 k + 1 ) .
For K i j Ω X L , we obtain from the L -stability (22a), the L -approximation (22b), and Lemma 1 that
η W 1 L ( K i j ) 2 C min W 1 L ( K i j ) 2 , h i 2 ( k + 1 ) x k + 1 W 1 L ( K i j ) 2 + h j 2 ( k + 1 ) y k + 1 W 1 L ( K i j ) 2 C min 1 , h i ε 2 ( k + 1 ) + h j 2 ( k + 1 ) e 2 β x i 1 ε C Θ i 2 ( k + 1 ) C ( N 1 max | ψ | ) 2 ( k + 1 ) ,
where we have used (10) and h i / ε C N 1 h j . For K i j Ω X M Ω X R , we obtain from the L -stability (22a) and σ k + 1 that
η W 1 L ( K i j ) 2 C W 1 L ( K i j ) 2 C e 2 β x i ε C e 2 β τ ε C N 2 ( k + 1 ) .
Consequently, we obtain from (14) that
j = 1 N i = 1 N 1 ( η W 1 ) i , y J j 2 C i = 1 N / 4 j = 1 N h j Θ i 2 ( k + 1 ) + C i = N / 4 + 1 N j = 1 N h j N 2 ( k + 1 ) C max 1 i N / 4 Θ i 2 k + 1 i = 1 N / 4 Θ i j = 1 N h j + C N ( 2 k + 1 ) C [ ( N 1 max | ψ | ) ( 2 k + 1 ) + N ( 2 k + 1 ) ] .
Moreover, we have η Z 1 L ( K i j ) 2 C N 2 ( k + 1 ) for K i j Ω N \ Ω 11 . For K i j Ω 11 , we obtain
η Z 1 L ( K i j ) 2 C min Z 1 L ( K i j ) 2 , h i 2 ( k + 1 ) x k + 1 Z 1 L ( K i j ) 2 + h j 2 ( k + 1 ) y k + 1 Z 1 L ( K i j ) 2 C min 1 , h i ε 2 ( k + 1 ) + h j ε 2 ( k + 1 ) e 2 β ( x i 1 + y j 1 ) ε C ( Θ i 2 ( k + 1 ) + Θ j 2 ( k + 1 ) ) C ( N 1 max | ψ | ) 2 ( k + 1 ) ,
using σ k + 1 . In a similar fashion, we obtain
j = 1 N i = 1 N 1 ( η Z 1 ) i , y J j 2 C [ ( N 1 max | ψ | ) ( 2 k + 1 ) + N ( 2 k + 1 ) ] .
From the solution decomposition and similar arguments for the other terms, we arrive at (23b) and (23c).
(3) Prove (23d). We start from the following inequality:
j = 1 N i = 0 N 1 , [ [ η u ] ] i , y 2 J j 2 j = 1 N i = 1 N J j [ ( η u ) i 1 , y + ] 2 d y + j = 1 N i = 1 N J j [ ( η u ) i , y ] 2 d y .
For the first term, we notice that
j = 1 N i = 1 N J j [ ( η u ) i 1 , y + ] 2 d y j = 1 N i = 1 N h j η u L ( K i j ) 2
and proceed as before. For the second term, we use (23c). Thus, (23d) follows.
The remaining inequalities of (23) can be proved analogously; we omit the details here.

Appendix A.2. Proof of Lemma 6

The conclusions are more precise than Lemma 4.1 of [9]. The proof proceeds similarly to Lemma 4. We mention several differences and use the same notations to prevent confusion.
(1) Prove (35a). As before, we have
η S C N ( k + 1 ) .
To bound η W 1 , we express it as (A3). Using (34a) and (34e) with m = 2 , we obtain the two estimates
Λ 1 C K i j Ω X L W 1 K i j 2 + h j ( W 1 ) x , j I i 2 + h i ( W 1 ) i , y J j 2 + h i h j | ( W 1 ) i , j | 2
C K i j Ω X L e β x ε K i j 2 , Λ 1 C K i j Ω X L h i 2 ( k + 1 ) x k + 1 W 1 K i j 2 + h j 2 ( k + 1 ) y k + 1 W 1 K i j 2
C K i j Ω X L h i ε 2 ( k + 1 ) + h j 2 ( k + 1 ) e β x ε K i j 2 ,
respectively, where we use (10) and the monotonic decreasing property of the function e β x / ε . Consequently, we obtain the same estimate for Λ 1 as before. For Λ 2 , we use the stability (34a) and (10) to obtain
Λ 2 = C K i j Ω X M Ω X R W 1 K i j 2 + h j ( W 1 ) x , j I i 2 + h i ( W 1 ) i , y J j 2 + h i h j | ( W 1 ) i , j | 2 C K i j Ω X M Ω X R e β x ε K i j 2 = C 0 1 d y τ 1 e 2 β x ε d x C ε e 2 β τ ε C ε N 2 σ .
As a result, we have
η W 1 C ε 4 [ ( N 1 max | ψ | ) k + 1 + N σ ] .
The term η W 3 must be treated carefully. We decompose it as
η W 3 2 = K i j Ω X L η W 3 K i j 2 + K i j Ω X M η W 3 K i j 2 + K i j Ω X R η W 3 K i j 2 Γ 1 + Γ 2 + Γ 3 .
Using L -stability and (10), we have
Γ 1 C K i j Ω X L h i h j W 3 L ( K i j ) 2 C W 3 L ( Ω X L ) 2 i = 1 N / 4 h i j = 1 N h j C W 3 L ( Ω X L ) 2 C e 2 β ( 1 τ ) ε C ε e 2 β τ ε C ε N 2 σ ,
because 2 ( 1 τ ) 1 + 2 τ for 0 τ 1 / 4 , and e x < x 1 for x 1 .
Using the L 2 -stability, the uniformity of the mesh in Ω X M , and Proposition 1, we have
Γ 2 C K i j Ω X M W 3 K i j 2 + h j ( W 3 ) x , j I i 2 + h i ( W 3 ) i , y J j 2 + h i h j | ( W 3 ) i , j | 2 C K i j Ω X M e β x ε K i j 2 + C j = 1 N h j h 3 N / 4 e 2 β ( 1 x 3 N / 4 ) ε C ε e 2 β τ ε + N 1 e 2 β τ ε C ( ε + N 1 ) N 2 σ .
To bound B 3 , we decompose it into two parts:
Γ 3 = i = 3 N / 4 + 2 N 1 j = 1 N η W 3 K i j 2 + i { 3 N / 4 + 1 , N } j = 1 N η W 3 K i j 2 Γ 3 ( 1 ) + Γ 3 ( 2 ) .
From (34a), (34d), and Lemma 2, we have
Γ 3 ( 1 ) C i = 3 N / 4 + 2 N 1 j = 1 N W 3 K i j 2 + h j ( W 3 ) x , j I i 2 + h i ( W 3 ) i , y J j 2 + h i h j | ( W 3 ) i , j | 2 C K i j Ω X R e 2 β ( 1 x ) ε K i j 2 .
Using (34e) with m = 2 yields
Γ 3 ( 1 ) C K i j Ω X R h i 2 ( k + 1 ) x k + 1 W 3 K i j 2 + h j 2 ( k + 1 ) y k + 1 W 3 K i j 2 C K i j Ω X R h i ε 2 ( k + 1 ) + h j 2 ( k + 1 ) e β ( 1 x ) ε K i j 2 .
Then, combining (A25) and (A26), we obtain
Γ 3 ( 1 ) C i = 3 N 4 + 1 N min h i ε 2 ( k + 1 ) , 1 ε e 2 β ( 1 x i ) ε min h i ε , 1 C ε ( N 1 max | ψ | ) 2 ( k + 1 ) ,
as before.
In a similar manner to (A14), we have
η W 3 L ( K i j ) 2 C Θ i 2 ( k + 1 ) C ( N 1 max | ψ | ) 2 ( k + 1 ) .
Because h i C ϱ for i = 3 N / 4 , . . . , N , we have
Γ 3 ( 2 ) i { 3 N / 4 + 1 , N } j = 1 N h i h j η W 3 L ( K i j ) 2 C ϱ ( N 1 max | ψ | ) 2 ( k + 1 ) .
Combining (A27) with (A28) leads to
Γ 3 C ( ε + ϱ ) ( N 1 max | ψ | ) 2 ( k + 1 ) .
Collecting up (A22), (A23) and (A29) yields
η W 3 C ( ε 4 + ϱ ) ( N 1 max | ψ | ) k + 1 + ( ε 4 + N 1 / 2 ) N ( k + 1 ) .
Similarly, we can prove the remainder of (A1) and arrive at (35a).
(2) Note that ( η u ) N , y = u N , y π y ( u N , y ) , where π y is a one-dimensional Gauss–Radau projection regarding y and satisfies analogous stability and approximation conditions to that in Lemma 5. From the solution decomposition, we express u N , y = S N , y + E N , y + F N , y , where S N , y , E N , y and F N , y are functions of one variable y and satisfy | S N , y ( j ) | C , | E N , y ( j ) | C ε j / 2 e β y / ε and | F N , y ( j ) | C ε j / 2 e β ( 1 y ) / ε . Following the similar line to that used to prove (34a), we obtain
j = 1 N ( η S ) N , y J j 2 N 2 ( k + 1 ) , j = 1 N ( η E ) N , y J j 2 C ε [ ( N 1 max | ψ | ) 2 ( k + 1 ) + N 2 σ ] , j = 1 N ( η F ) N , y J j 2 C ( ε + ϱ ) ( N 1 max | ψ | ) 2 ( k + 1 ) + ( ε + N 1 ) N 2 ( k + 1 ) .
Using the triangle inequality leads to (35b).
The proofs of (35c) and (35d) are similar and therefore omitted.

References

  1. Roos, H.G.; Stynes, M.; Tobiska, L. Robust Numerical Methods for Singularly Perturbed Differential Equations; Springer: Berlin, Germany, 2008. [Google Scholar]
  2. Linß, T. Layer-adapted meshes for convection-diffusion problems. Comput. Methods Appl. Mech. Engrg. 2003, 192, 1061–1105. [Google Scholar] [CrossRef] [Green Version]
  3. Bakhvalov, N. The optimalization of methods of solving boundary value problems with a boundary layer. USSR Comput. Math. Math. Phys. 1969, 9, 139–166. [Google Scholar] [CrossRef]
  4. Linß, T.; Stynes, M. Numerical methods on Shishkin meshes for convection-diffusion problems. Comput. Methods Appl. Mech. Engrg. 2000, 190, 3527–3542. [Google Scholar] [CrossRef]
  5. Shishkin, G. Grid Approximation of Singularly Perturbed Elliptic and Parabolic Equations. Ph.D. Thesis, Keldysh Institute, Moscow, Russia, 1990. [Google Scholar]
  6. Cheng, Y.; Zhang, F.; Zhang, Q. Local analysis of local discontinuous Galerkin method for the time-dependent singularly perturbed problem. J. Sci. Comput. 2015, 63, 452–477. [Google Scholar] [CrossRef]
  7. Cheng, Y.; Zhang, Q. Local analysis of the local discontinuous Galerkin method with the generalized alternating numerical flux for one-dimensional singularly perturbed problem. J. Sci. Comput. 2017, 72, 792–819. [Google Scholar] [CrossRef]
  8. Johnson, C.; Nävert, U.; Pitkäranta, J. Finite element methods for linear hyperbolic problems. Comput. Methods Appl. Mech. Engrg. 1984, 45, 285–312. [Google Scholar] [CrossRef]
  9. Cheng, Y.; Mei, Y.J.; Roos, H.G. Local analysis of the local discontinuous Galerkin method with the generalized alternating numerical flux for one-dimensional singularly perturbed problem. arXiv 2012, arXiv:2012.03560. [Google Scholar] [CrossRef]
  10. Zhu, H.; Tian, H.; Zhang, Z. Convergence analysis of the LDG method for singularly perturbed two-point boundary value problems. Comm. Math. Sci. 2011, 9, 1013–1032. [Google Scholar]
  11. Zhu, H.; Zhang, Z. Uniform convergence of the LDG method for a singularly perturbed problem with the exponential boundary layer. Math. Comp. 2014, 83, 635–663. [Google Scholar] [CrossRef]
  12. Cockburn, B.; Shu, C.W. The local discontinuous Galerkin method for time-dependent convection-diffusion systems. SIAM J. Numer. Anal. 1998, 35, 2440–2463. [Google Scholar] [CrossRef]
  13. Cockburn, B.; Kanschat, G.; Perugia, I.; Schötzau, D. Superconvergence of the local discontinuous Galerkin method for elliptic problems on cartesian grids. SIAM J. Numer. Anal. 2001, 39, 264–285. [Google Scholar] [CrossRef] [Green Version]
  14. Castillo, P.; Cockburn, B.; Schötzau, D.; Schwab, C. Optimal a priori error estimates for the hp-version of the local discontinuous Galerkin method for convection-diffusion problems. Math. Comp. 2002, 71, 455–478. [Google Scholar]
  15. Cockburn, B.; Kanschat, G.; Schötzau, D.; Schwab, C. Local discontinuous Galerkin methods for the Stokes system. SIAM J. Numer. Anal. 2002, 40, 319–343. [Google Scholar] [CrossRef]
  16. Yan, J.; Shu, C.W. A local discontinuous Galerkin method for KdV type equations. SIAM J. Numer. Anal. 2002, 40, 769–791. [Google Scholar] [CrossRef] [Green Version]
  17. Yan, J.; Osher, S. A local discontinuous Galerkin method for directly solving Hamilton-Jacobi equations. J. Comput. Phys. 2011, 230, 232–244. [Google Scholar] [CrossRef]
  18. Baccouch, M. Analysis of optimal superconvergence of the local discontinuous Galerkin method for nonlinear fourth-order boundary value problems. Numer. Algor. 2021, 86, 1615–1650. [Google Scholar]
  19. Xu, Y.; Shu, C.W. Local discontinous Galerkin methods for high-order time-dependent partial differetial equations. Commun. Comput. Phys. 2010, 7, 1–46. [Google Scholar]
  20. Xie, Z.; Zhang, Z. Uniform superconvergence analysis of the discontinuous Galerkin method for a singularly perturbed problem in 1-D. Math. Comp. 2010, 79, 35–45. [Google Scholar] [CrossRef]
  21. Clavero, C.; Gracia, J.L.; O’Riordan, E. A parameter robust numerical method for a two dimensional reaction-diffusion problem. Math. Comp. 2005, 74, 1743–1758. [Google Scholar] [CrossRef] [Green Version]
  22. Lin, R.; Stynes, M. A balanced finite element method for singularly perturbed reaction-diffusion problems. SIAM J. Numer. Anal. 2012, 50, 2729–2743. [Google Scholar] [CrossRef]
  23. Roos, H.G.; Schopf, M. Convergence and stability in balanced norms of finite element methods on Shishkin meshes for reaction-diffusion problems. ZAMM Z. Angew. Math. Mech. 2015, 95, 551–565. [Google Scholar] [CrossRef]
  24. Roos, H.G. Error estimates in balanced norms of finite element methods on layer-adapted meshes for second order reaction-diffusion problem. In Boundary and Interior Layers, Computational and Asymptotic Methods BAIL 2016; Springer: Cham, Switzerland, 2016. [Google Scholar]
  25. Melenk, J.M.; Xenophontos, C. Robust exponential convergence of hp-FEM in balanced norms for singularly perturbed reaction-diffusion equations. Calcolo 2016, 53, 105–132. [Google Scholar] [CrossRef] [Green Version]
  26. Han, H.; Kellogg, R.B. Differentiability properties of solutions of the equation -εΔu + ru = f(x,y) in a square. SIAM J. Numer. Anal. 1990, 21, 394–408. [Google Scholar] [CrossRef]
  27. Apel, T. Anisotropic Finite Elements: Local Estimates and Applications; Advances in Numerical Mathematics; B.G. Teubner: Stuttgart, Germany, 1999. [Google Scholar]
Figure 1. The division of Ω and three types of layer-adapted meshes.
Figure 1. The division of Ω and three types of layer-adapted meshes.
Symmetry 13 02291 g001
Figure 2. Convergence rate of balanced-norm error in Example 1.
Figure 2. Convergence rate of balanced-norm error in Example 1.
Symmetry 13 02291 g002
Figure 3. Convergence rate of energy-norm error in Example 1.
Figure 3. Convergence rate of energy-norm error in Example 1.
Symmetry 13 02291 g003
Figure 4. Energy norm error from ε in Example 1.
Figure 4. Energy norm error from ε in Example 1.
Symmetry 13 02291 g004
Figure 5. Convergence rate of balanced-norm error in Example 2.
Figure 5. Convergence rate of balanced-norm error in Example 2.
Symmetry 13 02291 g005
Figure 6. Convergence rate of energy-norm error in Example 2.
Figure 6. Convergence rate of energy-norm error in Example 2.
Symmetry 13 02291 g006
Figure 7. Convergence rate of energy-norm error in Example 2.
Figure 7. Convergence rate of energy-norm error in Example 2.
Symmetry 13 02291 g007
Table 1. Layer-adapted meshes.
Table 1. Layer-adapted meshes.
S-MeshBS-MeshB-Type Mesh
φ ( t ) 4 t ln N ln 1 4 ( 1 N 1 ) t ln 1 4 ( 1 ε ) t
ψ ( t ) N 4 t 1 4 ( 1 N 1 ) t 1 4 ( 1 ε ) t
max | ψ | C ln N CC
Table 2. Balanced error and convergence rates for Example 1.
Table 2. Balanced error and convergence rates for Example 1.
kNS-Mesh BS-Mesh B-Mesh
Balanced Error r S Balanced Error r 2 Balanced Error r 2
081.37- 1.36- 1.55-
161.090.57 1.040.39 1.100.49
328.36 × 10 1 0.57 7.47 × 10 1 0.47 7.67 × 10 1 0.52
646.31 × 10 1 0.55 5.30 × 10 1 0.50 5.36 × 10 1 0.52
1284.73 × 10 1 0.54 3.74 × 10 1 0.50 3.76 × 10 1 0.51
2563.52 × 10 1 0.53 2.64 × 10 1 0.50 2.65 × 10 1 0.51
183.67 × 10 1 - 2.48 × 10 1 - 3.86 × 10 1 -
162.22 × 10 1 1.25 9.83 × 10 2 1.33 1.22 × 10 1 1.66
321.19 × 10 1 1.32 3.75 × 10 2 1.39 4.17 × 10 2 1.55
645.83 × 10 2 1.40 1.39 × 10 2 1.43 1.46 × 10 2 1.51
1282.68 × 10 2 1.44 5.04 × 10 3 1.46 5.16 × 10 3 1.50
2561.18 × 10 2 1.46 1.81 × 10 3 1.48 1.83 × 10 3 1.49
281.61 × 10 1 - 7.24 × 10 2 - 1.45 × 10 1 -
167.40 × 10 2 1.92 1.58 × 10 2 2.20 2.26 × 10 2 2.69
322.68 × 10 2 2.16 3.11 × 10 3 2.35 3.71 × 10 3 2.61
648.19 × 10 3 2.32 5.83 × 10 4 2.42 6.34 × 10 4 2.55
1282.23 × 10 3 2.42 1.06 × 10 4 2.45 1.11 × 10 4 2.52
2565.62 × 10 4 2.46 1.91 × 10 5 2.48 1.95 × 10 5 2.51
387.16 × 10 2 - 2.16 × 10 2 - 5.87 × 10 2 -
162.52 × 10 2 2.57 2.52 × 10 3 3.10 4.22 × 10 3 3.80
326.29 × 10 3 2.96 2.55 × 10 4 3.30 3.29 × 10 4 3.68
641.21 × 10 3 3.23 2.42 × 10 5 3.40 2.74 × 10 5 3.59
1281.96 × 10 4 3.38 2.22 × 10 6 3.45 2.35 × 10 6 3.54
2562.85 × 10 5 3.45 2.01 × 10 7 3.47 2.06 × 10 7 3.51
Table 3. Energy error and convergence rates for Example 1.
Table 3. Energy error and convergence rates for Example 1.
kNS-Mesh BS-Mesh B-Mesh
Energy Error r S Energy Error r 2 Energy Error r 2
082.22 × 10 1 - 2.22 × 10 1 - 2.21 × 10 1 -
161.13 × 10 1 1.67 1.13 × 10 1 0.96 1.13 × 10 1 0.98
325.67 × 10 2 1.46 5.66 × 10 2 0.94 5.66 × 10 2 0.99
642.84 × 10 2 1.35 2.83 × 10 2 0.99 2.83 × 10 2 1.00
1281.43 × 10 2 1.28 1.42 × 10 2 1.00 1.42 × 10 2 1.00
2567.15 × 10 3 1.23 7.08 × 10 3 1.00 7.08 × 10 3 1.00
182.30 × 10 2 - 2.29 × 10 2 - 2.30 × 10 2 -
166.06 × 10 3 3.29 5.77 × 10 3 1.99 5.81 × 10 3 1.98
321.73 × 10 3 2.67 1.45 × 10 3 1.99 1.46 × 10 3 1.99
645.40 × 10 4 2.27 3.64 × 10 4 2.00 3.66 × 10 4 2.00
1281.77 × 10 4 2.07 9.12 × 10 5 2.00 9.17 × 10 5 2.00
2565.81 × 10 5 1.99 2.29 × 10 5 1.99 2.30 × 10 5 1.99
282.20 × 10 3 - 1.66 × 10 3 - 2.23 × 10 3 -
167.06 × 10 4 2.80 2.26 × 10 4 2.87 2.89 × 10 4 2.95
322.24 × 10 4 2.44 3.05 × 10 5 2.89 3.72 × 10 5 2.96
646.01 × 10 5 2.58 4.04 × 10 6 2.92 4.77 × 10 6 2.96
1281.39 × 10 5 2.72 5.30 × 10 7 2.93 6.08 × 10 7 2.97
2562.85 × 10 6 2.83 6.90 × 10 8 2.94 7.74 × 10 8 2.97
387.11 × 10 4 - 2.19 × 10 4 - 6.89 × 10 4 -
162.31 × 10 4 2.77 2.03 × 10 5 3.43 4.37 × 10 5 3.98
325.27 × 10 5 3.14 1.60 × 10 6 3.66 2.75 × 10 6 3.99
649.15 × 10 6 3.43 1.16 × 10 7 3.79 1.73 × 10 7 3.99
1281.29 × 10 6 3.63 8.05 × 10 9 3.85 1.08 × 10 8 3.99
2561.56 × 10 7 3.77 5.43 × 10 10 3.89 6.80 × 10 10 3.99
Table 4. Balanced error and convergence rates for Example 2.
Table 4. Balanced error and convergence rates for Example 2.
kNS-Mesh BS-Mesh B-Mesh
Balanced Error r S Balanced Error r 2 Balanced Error r 2
081.32- 1.30- 1.63-
161.090.48 9.81 × 10 1 0.41 1.100.57
328.83 × 10 1 0.45 7.07 × 10 1 0.47 7.47 × 10 1 0.56
646.99 × 10 1 0.46 5.01 × 10 1 0.50 5.15 × 10 1 0.54
1285.42 × 10 1 0.47 3.54 × 10 1 0.50 3.59 × 10 1 0.52
2564.13 × 10 1 0.49 2.50 × 10 1 0.50 2.52 × 10 1 0.51
185.07 × 10 1 - 3.33 × 10 1 - 5.41 × 10 1 -
163.12 × 10 1 1.20 1.37 × 10 1 1.28 1.72 × 10 1 1.65
321.68 × 10 1 1.32 5.27 × 10 2 1.38 5.88 × 10 2 1.55
648.25 × 10 2 1.40 1.96 × 10 2 1.43 2.06 × 10 2 1.51
1283.79 × 10 2 1.44 7.11 × 10 3 1.46 7.29 × 10 3 1.50
2561.67 × 10 2 1.47 2.55 × 10 3 1.48 2.58 × 10 3 1.50
282.27 × 10 1 - 1.01 × 10 1 - 2.05 × 10 1 -
161.05 × 10 1 1.91 2.22 × 10 2 2.19 3.18 × 10 2 2.69
323.80 × 10 2 2.16 4.37 × 10 3 2.34 5.22 × 10 3 2.61
641.16 × 10 2 2.32 8.19 × 10 4 2.42 8.93 × 10 4 2.55
1283.15 × 10 3 2.42 1.50 × 10 4 2.45 1.56 × 10 4 2.52
2567.95 × 10 4 2.46 2.69 × 10 5 2.47 2.74 × 10 5 2.51
381.01 × 10 1 - 3.06 × 10 2 - 8.30 × 10 2 -
163.57 × 10 2 2.57 3.56 × 10 3 3.10 5.96 × 10 3 3.80
328.90 × 10 3 2.96 3.61 × 10 4 3.30 4.66 × 10 4 3.68
641.71 × 10 3 3.23 3.43 × 10 5 3.40 3.87 × 10 5 3.59
1282.78 × 10 4 3.38 3.15 × 10 6 3.45 3.33 × 10 6 3.54
2564.03 × 10 5 3.45 2.84 × 10 7 3.47 2.91 × 10 7 3.51
Table 5. Energy error and convergence rates for Example 2.
Table 5. Energy error and convergence rates for Example 2.
kNS-Mesh BS-Mesh B-Mesh
Energy Error r S Energy Error r 2 Energy Error r 2
081.06 × 10 2 - 9.30 × 10 3 - 1.51 × 10 2 -
168.15 × 10 3 0.65 5.57 × 10 3 0.74 7.65 × 10 3 0.98
325.79 × 10 3 0.73 3.12 × 10 3 0.84 3.96 × 10 3 0.95
643.85 × 10 3 0.80 1.69 × 10 3 0.89 2.05 × 10 3 0.95
1282.41 × 10 3 0.86 8.95 × 10 4 0.92 1.05 × 10 3 0.96
2561.45 × 10 3 0.91 4.69 × 10 4 0.95 5.36 × 10 4 0.97
185.07 × 10 3 - 3.29 × 10 3 - 6.42 × 10 3 -
162.86 × 10 3 1.41 1.12 × 10 3 1.56 1.76 × 10 3 1.86
321.37 × 10 3 1.57 3.35 × 10 4 1.74 4.68 × 10 4 1.91
645.73 × 10 4 1.70 9.48 × 10 5 1.82 1.23 × 10 4 1.93
1282.17 × 10 4 1.80 2.60 × 10 5 1.87 3.18 × 10 5 1.95
2567.59 × 10 5 1.88 6.97 × 10 6 1.91 8.19 × 10 6 1.96
282.27 × 10 3 - 9.73 × 10 4 - 2.34 × 10 3 -
169.63 × 10 4 2.11 1.75 × 10 4 2.47 3.11 × 10 4 2.91
323.15 × 10 4 2.37 2.71 × 10 5 2.69 4.08 × 10 5 2.93
648.49 × 10 5 2.57 3.89 × 10 6 2.80 5.31 × 10 6 2.94
1281.96 × 10 5 2.72 5.36 × 10 7 2.86 6.86 × 10 7 2.95
2564.04 × 10 6 2.82 7.23 × 10 8 2.89 8.80 × 10 8 2.96
381.00 × 10 3 - 2.91 × 10 4 - 9.59 × 10 4 -
163.27 × 10 4 2.76 2.80 × 10 5 3.38 6.15 × 10 5 3.98
327.46 × 10 5 3.14 2.23 × 10 6 3.65 3.87 × 10 6 3.99
641.29 × 10 5 3.43 1.62 × 10 7 3.78 2.43 × 10 7 3.99
1281.83 × 10 6 3.63 1.13 × 10 8 3.85 1.53 × 10 8 3.99
2562.21 × 10 7 3.77 7.62 × 10 10 3.89 9.56 × 10 10 4.00
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Mei, Y.; Wang, S.; Xu, Z.; Song, C.; Cheng, Y. Convergence Analysis of the LDG Method for Singularly Perturbed Reaction-Diffusion Problems. Symmetry 2021, 13, 2291. https://doi.org/10.3390/sym13122291

AMA Style

Mei Y, Wang S, Xu Z, Song C, Cheng Y. Convergence Analysis of the LDG Method for Singularly Perturbed Reaction-Diffusion Problems. Symmetry. 2021; 13(12):2291. https://doi.org/10.3390/sym13122291

Chicago/Turabian Style

Mei, Yanjie, Sulei Wang, Zhijie Xu, Chuanjing Song, and Yao Cheng. 2021. "Convergence Analysis of the LDG Method for Singularly Perturbed Reaction-Diffusion Problems" Symmetry 13, no. 12: 2291. https://doi.org/10.3390/sym13122291

APA Style

Mei, Y., Wang, S., Xu, Z., Song, C., & Cheng, Y. (2021). Convergence Analysis of the LDG Method for Singularly Perturbed Reaction-Diffusion Problems. Symmetry, 13(12), 2291. https://doi.org/10.3390/sym13122291

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop