# Supercloseness Result of Higher Order FEM/LDG Coupled Method for Solving Singularly Perturbed Problem on S-Type Mesh

Authors: Shenglan Xie; Huonian Tu; Peng Zhu
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

we present a first supercloseness analysis for higher order FEM/LDG coupled method for solving singularly perturbed convection-diffusion problem. Based on piecewise polynomial approximations of degreek  (
k
≥
1
), a supercloseness property of k
+
1
/
2 in DG norm is established on S-type mesh. Numerical experiments complement the theoretical results.


---

## Body

## 1. Introduction

In this paper we are interested in the construction and validation of high-order finite element approximations to problems of type(1)
-
ɛ
u
′′
-
b
u
′
+
c
u
=
f
in
Ω
=
(
0,1
)
,
u
(
0
)
=
u
(
1
)
=
0
,
where 0
<
ɛ
≪
1 is a small positive parameter and b, c, and f are sufficiently smooth functions with the following properties:
(2)
b
(
x
)
≥
β
>
0
,
c
(
x
)
≥
0
,
c
(
x
)
+
1
2
b
′
(
x
)
≥
c
0
>
0
,
b
(
x
)
≥
β
>
0
,
c
(
x
)
≥
0
,
c
(
x
)
+
1
2
b
′
(
x
)
≥
∀
x
∈
Ω
¯
,
for some constants β and c
0. This assumption guarantees that (1) has a unique solution in H
2
(
Ω
)
∩
H
0
1
(
Ω
) for all f
∈
L
2
(
Ω
) [1]. Typically the solution of (1) has an exponential boundary layer at x
=
0.Problem (1) is a simple model problem that helps understanding the behavior of numerical methods in presence of layers in more complex problems like the Navier-Stokes equations in fluid dynamics or convection diffusion equations in chemical reaction processes.The smallness ofɛ causes global unphysical oscillations if standard discretization schemes on general meshes are applied. To obtain accurate results without high computational cost, problem (1) is usually solved by strong stability numerical methods on the layer-adapted mesh, such as Shishkin-mesh (S-mesh) [2] or Bakhvalov-Shishkin mesh (B-S mesh) [3, 4]. In [5], a bilinear Galerkin finite element method was applied to (1) using a S-mesh, and it was shown that ∥
u
-
u
Gal
N
∥
1
,
ɛ
=
O
(
N
-
1
ln
⁡
N
), where ∥
·
∥
1
,
ɛ is the ɛ-weighted energy norm, u is the exact solution, and u
Gal
N is the computed solution. On the same method using a B-S mesh [4] improved this result to O
(
N
-
1
). Roos and Linß [6] provided the so-called S-type mesh which was a class of generalized Shishkin-mesh including S-mesh and B-S mesh.A popular stabilization technique is the discontinuous Galerkin (DG) methods which were introduced in the early 1970s for the numerical solution of first order hyperbolic problems. Simultaneously, but quite independently, they were proposed as nonstandard schemes for the approximation of elliptic and parabolic problems. The DG methods on S-meshes for solving singularly perturbed problems (SPPs) were considered in [7–15]. Xie and her collaborators [8–10] investigated the superconvergence and uniform superconvergence properties of the local discontinuous Galerkin (LDG) method on S-mesh for 1D and/or 2D convection-diffusion type SPP. Zhu et al. [13] proved the uniformly convergence properties of the LDG methods with higher order elements on S-mesh for general 1D convection-diffusion and reaction-diffusion type SPPs. And recently Zhu and Zhang [14, 15] analyzed the uniform convergence properties of the LDG methods with bilinear and higher order elements on S-mesh for 2D SPP, respectively. On the other hand, the uniformly convergence of the NIPG method with bilinear elements on S-mesh was analyzed by Zarin and Roos [11] for 2D convection-diffusion type SPP with parabolic layers. In order to reduce the degrees of freedom of NIPG method, Roos and Zarin [7] and Zarin [12] analyzed the uniformly convergence of FEM/NIPG coupled method with bilinear element on S-mesh for 2D convection-diffusion type SPP with exponentially layers or characteristic layers. LDG method has much more advantages than the others in the DG methods family [16], but it also has more degrees of freedom than the others. By this motivation, Zhu and his collaborators [17, 18] analyzed the uniformly convergence property of FEM/LDG coupled method with linear/bilinear element on S-mesh for 1D/2D convection-diffusion type SPP with boundary layer. Recently, Zhu and his collaborator [19] analyzed the uniformly convergence property of higher order FEM/LDG coupled method on S-mesh for 1D convection-diffusion type SPP with boundary layer.A supercloseness property is a useful tool to prove superconvergence by postprocessing. Recently, Franz [20] numerically studies the supercloseness properties for higher order finite element methods and the streamline diffusion finite element methods on 2D Bakhvalov-Shishkin meshes. By the authors’ knowledge, there is a few works about uniform supercloseness result of higher order DG method for solving SPP on S-type mesh. In this paper, we are interested in uniformly convergence properties and supercloseness properties of higher order FEM/LDG coupled method for 1D SPP of convection-diffusion type on S-type mesh. The paper is organized as follows. In Section 2, we introduce the S-type mesh and the FEM/LDG coupled method. The stability and error analysis of the FEM/LDG coupled method with higher order elements on S-type mesh is given in Section 3. A numerical example is presented in Section 4. It aims to validate our theoretical result.In the sequel withC we will denote a generic positive constant independent of the perturbation parameter ɛ and mesh size.


## 2. The S-Type Mesh and the FEM/LDG Coupled Method

### 2.1. The S-Type Mesh

LetN be an even integer. Denote by λ the transition parameter which indicates where the mesh changes from fine to coarse. This parameter is given by
(3)
λ
=
min
⁡
⁡
{
1
2
,
k
+
1.5
β
ɛ
ln
⁡
N
}
,
where our trial space, which is defined below, comprises functions that are piecewise in P
k for some integer k
≥
1. Notice that ɛ
≪
1; here and below we take λ
=
(
(
k
+
1.5
)
/
β
)
ɛ
ln
⁡
N. Moreover, we suppose that ɛ
≤
N
-
1 which is realistic for this type of problems.LetT
N
=
{
I
j
=
(
x
j
-
1
,
x
j
)
:
j
=
1
,
…
,
N
} be a partition of the domain Ω. Let T
N
=
{
I
j
=
(
x
j
-
1
,
x
j
)
:
j
=
1
,
…
,
N
} be a partition of the domain Ω and H
=
2
(
1
-
λ
)
/
N. We choose
(4)
x
j
=
{
(
k
+
1.5
)
ɛ
β
ϕ
(
j
N
)
,
j
=
0,1
,
…
,
N
2
,
λ
+
(
j
-
N
2
)
H
,
j
=
N
2
+
1
,
…
,
N
,
where ϕ is a monotonically increasing mesh-generating function satisfying ϕ
(
0
)
=
0 and ϕ
(
1
/
2
)
=
ln
⁡
N. Given an arbitrary function ϕ fulfilling these conditions, a S-type mesh is defined.We define a mesh-characterizing functionψ that is closely related to ϕ by
(5)
ϕ
=
-
ln
⁡
ψ
,
which is monotonically decreasing with ψ
(
0
)
=
1 and ψ
(
1
/
2
)
=
N
-
1. Table 1 gives some examples of S-type meshes introduced in [6].Table 1
Some examples of mesh-generating and mesh-characterizing functions of S-type meshes.
Name
ϕ
(
t
)
max
⁡
ϕ
′
ψ
(
t
)
max
⁡
|
ψ
′
|
S-mesh
2
t
ln
⁡
N
2
ln
⁡
N
N
-
2
t
2
ln
⁡
N
B-S mesh
-
ln
⁡
(
1
-
2
t
(
1
-
1
/
N
)
)
2
N
1
-
2
t
(
1
-
1
/
N
)
2
Polynomial S-mesh
(
2
t
)
m
ln
⁡
N
2
m
ln
⁡
N
N
-
(
2
t
)
m
C
(
ln
⁡
N
)
1
/
m
Modified B-S mesh
t
/
(
q
-
t
)
,
q
=
1
/
2
(
1
+
1
/
ln
⁡
N
)
3
ln
2
⁡
N
e
-
t
/
(
q
-
t
)
3
/
(
2
q
)
≤
3Denote the length of any subintervalI
j by h
j
=
x
j
-
x
j
-
1. Some properties of S-type mesh are given in the following lemma.Lemma 1 (see [21]).
Assume that the piecewise differentiable mesh-generating functionϕ satisfies the conditions
(6)
max
⁡
t
∈
[
0
,
1
/
2
]
ϕ
′
(
t
)
≤
C
N
o
r
e
q
u
i
v
a
l
e
n
t
l
y
max
⁡
t
∈
[
0
,
1
/
2
]
|
ψ
′
(
t
)
|
ψ
(
t
)
≤
C
N
.
Let x
j, j
=
0,1
,
…
,
N
/
2 be the points for a S-type mesh. Then, the estimates,
(7)
h
j
≤
C
ɛ
N
-
1
max
⁡
|
ψ
′
|
·
exp
⁡
(
β
x
j
(
k
+
1.5
)
ɛ
)
,
j
=
1
,
…
,
N
2
,
(8)
h
j
m
exp
⁡
(
-
β
x
j
-
1
ɛ
)
≤
C
(
ɛ
N
-
1
max
⁡
⁡
|
ψ
′
|
)
m
,
j
=
1
,
…
,
N
2
,
≤
exp
⁡
(
-
β
x
j
-
1
ɛ
)
yy
C
(
ɛ
N
-
1
max
⁡
⁡
|
ψ
′
|
)
m
m
∈
[
0
,
k
+
1.5
]
,
hold true.Remark 2.
Takingσ
=
k
+
1.5, the proof of this lemma is similar to the statements given on page 142 of [21]. From (6) we can also get a simpler bound
(9)
h
j
≤
C
ɛ
N
-
1
max
⁡
ϕ
′
≤
C
ɛ
,
j
=
1
,
…
,
N
2
.SetT
N
1
=
{
I
j
}
j
=
1
N
/
2 and T
N
2
=
{
I
j
}
j
=
N
/
2
+
1
N. We denote by u
(
x
j
+
) and u
(
x
j
-
) the values of u at x
j, from the right cell and the left cell of x
j, respectively.


### 2.2. The Weak Formulation of the FEM/LDG Coupled Method

The S-type mesh defined in Section2.1 is fine on Ω
1
=
[
0
,
λ
] and coarse on Ω
2
=
[
λ
,
1
]. We discretize problem (1) by using the FEM on Ω
1 where the mesh is fine enough and strong stable LDG method is used on coarse mesh part Ω
2. The derived method is the so-called FEM/LDG coupled method. The motivation to this coupled approach is to construct a numerical scheme with strong stability property but has less degrees of freedom than LDG method.Letu
i
=
u
|
Ω
i, i
=
1,2, and q
=
(
u
2
)
′ in Ω
2. Rewrite problem (1) as the following equivalent transmission problem:
(10)
-
ɛ
(
u
1
)
′′
-
b
(
u
1
)
′
+
c
u
1
=
f
in
Ω
1
,
q
-
(
u
2
)
′
=
0
in
Ω
2
,
-
ɛ
q
′
-
b
(
u
2
)
′
+
c
u
2
=
f
in
Ω
2
,
u
1
(
λ
)
=
u
2
(
λ
)
,
(
u
1
)
′
(
λ
)
=
q
(
λ
)
,
with boundary conditions
(11)
u
1
(
0
)
=
u
2
(
1
)
=
0
.Let us now denote byP
k
(
K
) the space of polynomials of degree at most k on K and define the finite element space V
N
1 and V
N
2 as follows:
(12)
V
N
1
=
{
v
1
∈
H
1
(
Ω
1
)
:
v
1
(
0
)
=
0
,
v
1
|
K
∈
P
k
(
K
)
,
∀
K
∈
T
N
1
}
,
V
N
2
=
{
v
2
∈
L
2
(
Ω
2
)
:
v
2
|
K
∈
P
k
(
K
)
,
∀
K
∈
T
N
2
}
.
The space V
N
1 is a standard conforming finite element space, whereas the functions in V
N
2 are completely discontinuous across interelement boundaries.We will search for approximate solutions(
U
N
1
,
U
N
2
,
Q
N
) of (10) and (11) in the finite element space V
N
1
×
V
N
2
×
V
N
2 that satisfy (10) and (11) in a weak sense. The FEM/LDG coupled method (see more details in [17, 22]) for problems (10) and (11) is defined as follows: find (
U
N
1
,
U
N
2
,
Q
N
)
∈
V
N
1
×
V
N
2
×
V
N
2 such that
(13)
∫
Ω
1
‍
[
ɛ
(
U
N
1
)
′
+
b
U
N
1
]
(
v
1
)
′
d
x
+
∫
Ω
1
‍
(
c
+
b
′
)
U
N
1
v
1
d
x
-
(
ɛ
Q
^
N
+
b
U
~
N
2
)
(
λ
)
v
1
(
λ
)
=
∫
Ω
1
‍
f
v
1
d
x
,
for all test function v
1
∈
V
N
1, and
(14)
∫
I
j
‍
Q
N
w
d
x
+
∫
I
j
‍
U
N
2
w
′
d
x
-
U
^
N
2
(
x
j
)
w
(
x
j
-
)
+
U
^
N
2
(
x
j
-
1
)
w
(
x
j
-
1
+
)
=
0
,
(15)
∫
I
j
‍
(
ɛ
Q
N
+
b
U
N
2
)
(
v
2
)
′
d
x
+
∫
I
j
‍
(
c
+
b
′
)
U
N
2
v
2
d
x
-
(
ɛ
Q
^
N
+
b
U
~
N
2
)
(
x
j
)
v
2
(
x
j
-
)
+
(
ɛ
Q
^
N
+
b
U
~
N
2
)
(
x
j
-
1
)
v
2
(
x
j
-
1
+
)
=
∫
I
j
‍
f
v
2
d
x
,
for all test function (
w
,
v
2
)
∈
V
N
2
×
V
N
2 and for all I
j
∈
T
N
2, where U
^
N
2, U
~
N
2, and Q
^
N are the numerical fluxes, which approximate the traces of U
N
2 and Q
N on the boundary of the elements of T
N
2. To complete the specification of the method, it only remains to define the numerical fluxes.The Numerical Fluxes. We use the following notation to describe the numerical fluxes at the interior nodes. Theaverage andjump of the trace of smooth function v
∈
L
2
(
Ω
2
) at the interior node x
j are given by
(16)
{
v
(
x
j
)
}
=
v
(
x
j
+
)
+
v
(
x
j
-
)
2
,
[
v
(
x
j
)
]
=
v
(
x
j
+
)
-
v
(
x
j
-
)
,
respectively. We now define the numerical fluxes U
^
N
2 and Q
^
N by
(17)
U
^
N
2
(
x
j
)
=
{
U
N
1
(
λ
)
,
if
j
=
N
2
,
{
U
N
2
(
x
j
)
}
-
γ
[
U
N
2
(
x
j
)
]
,
if
j
=
N
2
+
1
,
…
,
N
-
1
,
0
,
if
j
=
N
,
(18)
Q
^
N
(
x
j
)
=
{
Q
N
(
λ
+
)
+
α
(
U
N
2
(
λ
+
)
-
U
N
1
(
λ
)
)
,
if
j
=
N
2
,
{
Q
N
(
x
j
)
}
+
γ
[
Q
N
(
x
j
)
]
+
α
[
U
N
2
(
x
j
)
]
,
if
j
=
N
2
+
1
,
…
,
N
-
1
,
Q
N
(
1
-
)
-
α
U
N
2
(
1
-
)
,
if
j
=
N
.
Here the scalars α
=
α
(
x
) and γ
=
γ
(
x
) are auxiliary parameters. Their purpose is to enhance the stability and accuracy properties of the LDG method (see [23, 24]).The numerical flux associated with the convection is the classical upwinding flux; namely,(19)
U
~
N
2
(
x
j
)
=
{
U
N
2
(
x
j
+
)
,
if
j
=
N
2
,
…
,
N
-
1
,
0
,
if
j
=
N
.


## 2.1. The S-Type Mesh

LetN be an even integer. Denote by λ the transition parameter which indicates where the mesh changes from fine to coarse. This parameter is given by
(3)
λ
=
min
⁡
⁡
{
1
2
,
k
+
1.5
β
ɛ
ln
⁡
N
}
,
where our trial space, which is defined below, comprises functions that are piecewise in P
k for some integer k
≥
1. Notice that ɛ
≪
1; here and below we take λ
=
(
(
k
+
1.5
)
/
β
)
ɛ
ln
⁡
N. Moreover, we suppose that ɛ
≤
N
-
1 which is realistic for this type of problems.LetT
N
=
{
I
j
=
(
x
j
-
1
,
x
j
)
:
j
=
1
,
…
,
N
} be a partition of the domain Ω. Let T
N
=
{
I
j
=
(
x
j
-
1
,
x
j
)
:
j
=
1
,
…
,
N
} be a partition of the domain Ω and H
=
2
(
1
-
λ
)
/
N. We choose
(4)
x
j
=
{
(
k
+
1.5
)
ɛ
β
ϕ
(
j
N
)
,
j
=
0,1
,
…
,
N
2
,
λ
+
(
j
-
N
2
)
H
,
j
=
N
2
+
1
,
…
,
N
,
where ϕ is a monotonically increasing mesh-generating function satisfying ϕ
(
0
)
=
0 and ϕ
(
1
/
2
)
=
ln
⁡
N. Given an arbitrary function ϕ fulfilling these conditions, a S-type mesh is defined.We define a mesh-characterizing functionψ that is closely related to ϕ by
(5)
ϕ
=
-
ln
⁡
ψ
,
which is monotonically decreasing with ψ
(
0
)
=
1 and ψ
(
1
/
2
)
=
N
-
1. Table 1 gives some examples of S-type meshes introduced in [6].Table 1
Some examples of mesh-generating and mesh-characterizing functions of S-type meshes.
Name
ϕ
(
t
)
max
⁡
ϕ
′
ψ
(
t
)
max
⁡
|
ψ
′
|
S-mesh
2
t
ln
⁡
N
2
ln
⁡
N
N
-
2
t
2
ln
⁡
N
B-S mesh
-
ln
⁡
(
1
-
2
t
(
1
-
1
/
N
)
)
2
N
1
-
2
t
(
1
-
1
/
N
)
2
Polynomial S-mesh
(
2
t
)
m
ln
⁡
N
2
m
ln
⁡
N
N
-
(
2
t
)
m
C
(
ln
⁡
N
)
1
/
m
Modified B-S mesh
t
/
(
q
-
t
)
,
q
=
1
/
2
(
1
+
1
/
ln
⁡
N
)
3
ln
2
⁡
N
e
-
t
/
(
q
-
t
)
3
/
(
2
q
)
≤
3Denote the length of any subintervalI
j by h
j
=
x
j
-
x
j
-
1. Some properties of S-type mesh are given in the following lemma.Lemma 1 (see [21]).
Assume that the piecewise differentiable mesh-generating functionϕ satisfies the conditions
(6)
max
⁡
t
∈
[
0
,
1
/
2
]
ϕ
′
(
t
)
≤
C
N
o
r
e
q
u
i
v
a
l
e
n
t
l
y
max
⁡
t
∈
[
0
,
1
/
2
]
|
ψ
′
(
t
)
|
ψ
(
t
)
≤
C
N
.
Let x
j, j
=
0,1
,
…
,
N
/
2 be the points for a S-type mesh. Then, the estimates,
(7)
h
j
≤
C
ɛ
N
-
1
max
⁡
|
ψ
′
|
·
exp
⁡
(
β
x
j
(
k
+
1.5
)
ɛ
)
,
j
=
1
,
…
,
N
2
,
(8)
h
j
m
exp
⁡
(
-
β
x
j
-
1
ɛ
)
≤
C
(
ɛ
N
-
1
max
⁡
⁡
|
ψ
′
|
)
m
,
j
=
1
,
…
,
N
2
,
≤
exp
⁡
(
-
β
x
j
-
1
ɛ
)
yy
C
(
ɛ
N
-
1
max
⁡
⁡
|
ψ
′
|
)
m
m
∈
[
0
,
k
+
1.5
]
,
hold true.Remark 2.
Takingσ
=
k
+
1.5, the proof of this lemma is similar to the statements given on page 142 of [21]. From (6) we can also get a simpler bound
(9)
h
j
≤
C
ɛ
N
-
1
max
⁡
ϕ
′
≤
C
ɛ
,
j
=
1
,
…
,
N
2
.SetT
N
1
=
{
I
j
}
j
=
1
N
/
2 and T
N
2
=
{
I
j
}
j
=
N
/
2
+
1
N. We denote by u
(
x
j
+
) and u
(
x
j
-
) the values of u at x
j, from the right cell and the left cell of x
j, respectively.


## 2.2. The Weak Formulation of the FEM/LDG Coupled Method

The S-type mesh defined in Section2.1 is fine on Ω
1
=
[
0
,
λ
] and coarse on Ω
2
=
[
λ
,
1
]. We discretize problem (1) by using the FEM on Ω
1 where the mesh is fine enough and strong stable LDG method is used on coarse mesh part Ω
2. The derived method is the so-called FEM/LDG coupled method. The motivation to this coupled approach is to construct a numerical scheme with strong stability property but has less degrees of freedom than LDG method.Letu
i
=
u
|
Ω
i, i
=
1,2, and q
=
(
u
2
)
′ in Ω
2. Rewrite problem (1) as the following equivalent transmission problem:
(10)
-
ɛ
(
u
1
)
′′
-
b
(
u
1
)
′
+
c
u
1
=
f
in
Ω
1
,
q
-
(
u
2
)
′
=
0
in
Ω
2
,
-
ɛ
q
′
-
b
(
u
2
)
′
+
c
u
2
=
f
in
Ω
2
,
u
1
(
λ
)
=
u
2
(
λ
)
,
(
u
1
)
′
(
λ
)
=
q
(
λ
)
,
with boundary conditions
(11)
u
1
(
0
)
=
u
2
(
1
)
=
0
.Let us now denote byP
k
(
K
) the space of polynomials of degree at most k on K and define the finite element space V
N
1 and V
N
2 as follows:
(12)
V
N
1
=
{
v
1
∈
H
1
(
Ω
1
)
:
v
1
(
0
)
=
0
,
v
1
|
K
∈
P
k
(
K
)
,
∀
K
∈
T
N
1
}
,
V
N
2
=
{
v
2
∈
L
2
(
Ω
2
)
:
v
2
|
K
∈
P
k
(
K
)
,
∀
K
∈
T
N
2
}
.
The space V
N
1 is a standard conforming finite element space, whereas the functions in V
N
2 are completely discontinuous across interelement boundaries.We will search for approximate solutions(
U
N
1
,
U
N
2
,
Q
N
) of (10) and (11) in the finite element space V
N
1
×
V
N
2
×
V
N
2 that satisfy (10) and (11) in a weak sense. The FEM/LDG coupled method (see more details in [17, 22]) for problems (10) and (11) is defined as follows: find (
U
N
1
,
U
N
2
,
Q
N
)
∈
V
N
1
×
V
N
2
×
V
N
2 such that
(13)
∫
Ω
1
‍
[
ɛ
(
U
N
1
)
′
+
b
U
N
1
]
(
v
1
)
′
d
x
+
∫
Ω
1
‍
(
c
+
b
′
)
U
N
1
v
1
d
x
-
(
ɛ
Q
^
N
+
b
U
~
N
2
)
(
λ
)
v
1
(
λ
)
=
∫
Ω
1
‍
f
v
1
d
x
,
for all test function v
1
∈
V
N
1, and
(14)
∫
I
j
‍
Q
N
w
d
x
+
∫
I
j
‍
U
N
2
w
′
d
x
-
U
^
N
2
(
x
j
)
w
(
x
j
-
)
+
U
^
N
2
(
x
j
-
1
)
w
(
x
j
-
1
+
)
=
0
,
(15)
∫
I
j
‍
(
ɛ
Q
N
+
b
U
N
2
)
(
v
2
)
′
d
x
+
∫
I
j
‍
(
c
+
b
′
)
U
N
2
v
2
d
x
-
(
ɛ
Q
^
N
+
b
U
~
N
2
)
(
x
j
)
v
2
(
x
j
-
)
+
(
ɛ
Q
^
N
+
b
U
~
N
2
)
(
x
j
-
1
)
v
2
(
x
j
-
1
+
)
=
∫
I
j
‍
f
v
2
d
x
,
for all test function (
w
,
v
2
)
∈
V
N
2
×
V
N
2 and for all I
j
∈
T
N
2, where U
^
N
2, U
~
N
2, and Q
^
N are the numerical fluxes, which approximate the traces of U
N
2 and Q
N on the boundary of the elements of T
N
2. To complete the specification of the method, it only remains to define the numerical fluxes.The Numerical Fluxes. We use the following notation to describe the numerical fluxes at the interior nodes. Theaverage andjump of the trace of smooth function v
∈
L
2
(
Ω
2
) at the interior node x
j are given by
(16)
{
v
(
x
j
)
}
=
v
(
x
j
+
)
+
v
(
x
j
-
)
2
,
[
v
(
x
j
)
]
=
v
(
x
j
+
)
-
v
(
x
j
-
)
,
respectively. We now define the numerical fluxes U
^
N
2 and Q
^
N by
(17)
U
^
N
2
(
x
j
)
=
{
U
N
1
(
λ
)
,
if
j
=
N
2
,
{
U
N
2
(
x
j
)
}
-
γ
[
U
N
2
(
x
j
)
]
,
if
j
=
N
2
+
1
,
…
,
N
-
1
,
0
,
if
j
=
N
,
(18)
Q
^
N
(
x
j
)
=
{
Q
N
(
λ
+
)
+
α
(
U
N
2
(
λ
+
)
-
U
N
1
(
λ
)
)
,
if
j
=
N
2
,
{
Q
N
(
x
j
)
}
+
γ
[
Q
N
(
x
j
)
]
+
α
[
U
N
2
(
x
j
)
]
,
if
j
=
N
2
+
1
,
…
,
N
-
1
,
Q
N
(
1
-
)
-
α
U
N
2
(
1
-
)
,
if
j
=
N
.
Here the scalars α
=
α
(
x
) and γ
=
γ
(
x
) are auxiliary parameters. Their purpose is to enhance the stability and accuracy properties of the LDG method (see [23, 24]).The numerical flux associated with the convection is the classical upwinding flux; namely,(19)
U
~
N
2
(
x
j
)
=
{
U
N
2
(
x
j
+
)
,
if
j
=
N
2
,
…
,
N
-
1
,
0
,
if
j
=
N
.


## 3. Stability and Error Analysis of the FEM/LDG Coupled Method

This section is devoted to the existence and uniqueness of the solution of the coupled method (13)–(15) with numerical fluxes (17)–(19) and its corresponding error analysis. Firstly, we rewrite our method in the primal form by eliminating Q
N following Arnold et al. [16]. And then we get stability of the FEM/LDG coupled method, if the stabilization parameter α is taken of order O
(
1
/
H
). Under this condition, we obtain the higher order uniform convergence of the coupled method.Primal Formulation. Let us introduce the space
(20)
V
N
:
=
{
v
∈
L
2
(
Ω
)
:
v
i
=
v
|
Ω
i
,
v
i
∈
V
N
i
,
i
=
1,2
}
,
V
(
N
)
=
[
H
2
(
Ω
)
∩
H
0
1
(
Ω
)
]
+
V
N
,
where
(21)
H
0
1
(
Ω
)
=
{
v
∈
H
1
(
Ω
)
:
v
|
Ω
i
=
v
i
,
i
=
1,2
,
v
1
(
0
)
=
0
,
v
2
(
1
-
)
=
0
}
.
For v
∈
V
(
N
), we define L
1
(
v
) as the unique element in V
N
2 satisfying
(22)
∫
Ω
2
‍
L
1
(
v
)
r
d
x
=
∑
j
=
N
/
2
+
1
N
-
1
‍
[
v
2
(
x
j
)
]
(
{
r
(
x
j
)
}
+
γ
[
r
(
x
j
)
]
)
-
v
2
(
1
-
)
r
(
1
-
)
-
(
v
1
(
λ
)
-
v
2
(
λ
+
)
)
r
(
λ
+
)
,
for all r
∈
V
N
2.As a result, from (14) we get
(23)
Q
N
=
(
U
N
2
)
′
+
L
1
(
U
N
)
in
V
N
2
.
Similar to the definition of L
1
(
v
), for v
∈
V
(
N
), we define L
2
(
v
) as the unique element in V
N
2 satisfying
(24)
∫
Ω
2
‍
b
L
2
(
v
)
r
d
x
=
∑
j
=
N
/
2
+
1
N
-
1
‍
b
(
x
j
)
[
v
2
(
x
j
)
]
r
(
x
j
+
)
-
b
(
λ
)
r
(
λ
+
)
(
v
1
(
λ
)
-
v
2
(
λ
+
)
)
,
for all r
∈
V
N
2.Following [19], using the lifting operators L
1
(
·
) and L
2
(
·
), the flux form FEM/LDG coupled method (13)–(15) with numerical fluxes (17)–(19) can be rewritten as the primal form: find U
N
∈
V
N such that
(25)
A
N
(
U
N
,
v
)
≔
B
N
(
U
N
,
v
)
+
C
N
(
U
N
,
v
)
+
S
N
(
U
N
,
v
)
=
F
N
(
v
)
,
∀
v
∈
V
N
,
with
(26)
B
N
(
w
,
v
)
=
∫
Ω
‍
ɛ
(
w
′
+
L
1
(
w
)
)
(
v
′
+
L
1
(
v
)
)
d
x
,
F
N
(
v
)
=
∫
Ω
‍
f
v
d
x
,
C
N
(
w
,
v
)
=
∫
Ω
‍
b
w
(
v
′
+
L
2
(
v
)
)
d
x
+
∫
Ω
‍
(
c
+
b
′
)
w
v
d
x
,
S
N
(
w
,
v
)
=
∑
j
=
N
/
2
+
1
N
-
1
ɛ
α
[
w
2
(
x
j
)
]
[
v
2
(
x
j
)
]
+
ɛ
α
w
2
(
1
-
)
v
2
(
1
-
)
+
ɛ
α
(
w
1
(
λ
)
-
w
2
(
λ
+
)
)
×
(
v
1
(
λ
)
-
v
2
(
λ
+
)
)
.
Here, L
1
(
·
) and L
2
(
·
) have been defined in L
2
(
Ω
) by a trivial extension.From the following lemma, the primal formulation is consistent.Lemma 3.
Letu be the exact solution of the problems (10) and (11). Then the primal form (25) has the Galerkin orthogonality property
(27)
A
N
(
u
-
U
N
,
v
)
=
0
,
∀
v
∈
V
N
.Proof.
The proof is similar to Lemma 3.1 in [19].Stability Analysis. To consider the stability of the primal form A
N, we define the following norms and seminorms for v
∈
V
(
N
):
(28)
|
∥
v
∥
|
ɛ
2
=
∥
v
∥
0
,
Ω
2
+
ɛ
|
v
|
1
,
N
2
+
ɛ
|
v
|
*
2
+
|
v
|
c
2
,
|
v
|
1
,
N
2
=
∥
(
v
1
)
′
∥
0
,
Ω
1
2
+
∑
j
=
N
/
2
+
1
N
‍
∥
(
v
2
)
′
∥
0
,
I
j
2
,
|
v
|
*
2
=
∑
j
=
N
/
2
+
1
N
-
1
‍
α
[
v
2
(
x
j
)
]
2
+
α
(
v
2
(
1
-
)
)
2
+
α
(
v
1
(
λ
)
-
v
2
(
λ
+
)
)
2
,
|
v
|
c
2
=
1
2
∑
j
=
N
/
2
+
1
N
-
1
‍
b
(
x
j
)
[
v
2
(
x
j
)
]
2
+
1
2
b
(
1
)
(
v
2
(
1
-
)
)
2
|
v
|
c
2
=
+
1
2
b
(
λ
)
(
v
1
(
λ
)
-
v
2
(
λ
+
)
)
2
,
where ∥
·
∥
0
,
D is the usual Sobolev norm defined on region D.According to [25] (page 422), when the coefficient α
=
O
(
H
-
1
), there exists a constant C
>
0, such that
(29)
∥
L
1
(
v
)
∥
0
,
Ω
≤
C
|
v
|
*
,
v
∈
V
(
N
)
.Lemma 4.
Ifα
=
O
(
1
/
H
), there exists a constant C
>
0, such that
(30)
A
N
(
v
,
v
)
≥
C
|
∥
v
∥
|
ɛ
2
,
∀
v
∈
V
N
.Proof.
The proof is similar to Lemma 3.2 in [19].From Lemma4, we easily get
(31)
|
∥
u
N
∥
|
ɛ
≤
C
∥
f
∥
0
,
Ω
,
which implies the uniqueness of the solution to (25). Further, since (25) is a linear problem over the finite-dimensional space V
N, the existence of the solution follows from its uniqueness. Consequently, by (23), we get the existence and uniqueness of the solution to the problem (13)–(15) with numerical fluxes (17)–(19).Remark 5.
In fact, following [25] or [8], for any α
≥
0, we can prove the existence and uniqueness of the solution to the problem (13)–(15) with numerical fluxes (17)–(19). In this paper, we are only interested in the special case α
=
O
(
H
-
1
).Error Analysis. We are now going to provide a ɛ-uniform estimate for the error u
-
U
N in the norm (28). The error analysis presented in this paper relies on a priori estimate of the exact solution of (1) and a special interpolation which was firstly introduced in [26].Lemma 6 (see [27, Lemma 1.9]).
Letq be some positive integer. Consider the boundary value problem (1) with the assumption of (2). Its exact solution u can be composed as u
=
S
+
E, where the smooth part S and the layer part E satisfy
(32)
-
ɛ
S
′′
-
b
S
′
+
c
S
=
f
,
-
ɛ
E
′′
-
b
E
′
+
c
E
=
0
,
(33)
|
S
(
l
)
(
x
)
|
≤
C
,
|
E
(
l
)
(
x
)
|
≤
C
ɛ
-
l
exp
⁡
(
-
β
x
ɛ
)
|
E
(
l
)
(
x
)
|
≤
C
ɛ
-
l
exphhhh
(
-
β
x
ɛ
)
f
o
r
0
≤
l
≤
q
.Next we introduce a special interpolant in [26] that will be useful later. On each element K
=
[
x
j
-
1
,
x
j
], we define k
+
1 nodal functionals N
l by
(34)
N
0
(
w
)
=
w
(
x
j
-
1
)
,
N
k
(
w
)
=
w
(
x
j
)
,
N
l
(
w
)
=
1
(
x
j
-
x
j
-
1
)
l
∫
x
j
-
1
x
j
‍
(
x
-
x
j
-
1
)
l
-
1
w
(
x
)
d
x
,
hhhhhhhhhhhhhhhhhhhhhhhhhh
l
=
1
,
…
,
k
-
1
.
Now a local interpolation I
K
w
∣
∈
P
k
(
K
) is defined by
(35)
N
l
(
I
K
w
-
w
)
=
0
,
l
=
0
,
…
,
k
,
which can be extended to a continuous global interpolation I
w
∈
V
N via set
(36)
I
w
|
K
=
I
K
w
,
∀
K
∈
T
N
.
Obviously, if k
=
1, this special interpolation is just the Lagrange linear interpolation.The following error estimate is adapted from Lemma 7 of [26].Lemma 7.
The special interpolant has the following properties:(37)
(
(
w
-
I
w
)
′
,
v
N
′
)
K
=
0
,
∀
v
N
∈
V
N
,
|
w
-
I
w
|
l
,
K
≤
C
h
K
k
+
1
-
l
|
w
|
k
+
1
,
K
,
l
=
0,1
,
…
,
k
+
1
,
∀
w
∈
H
k
+
1
(
K
)
,
∥
w
-
I
w
∥
L
∞
(
K
)
≤
C
h
K
k
+
1
|
w
|
k
+
1
,
∞
,
K
,
hhhhhhhhhhhhh
∀
w
∈
W
k
+
1
,
∞
(
K
)
,
where K is any element of partition T
N and h
K is the length of element K.Lemma 8.
Assume that the piecewise differential mesh-generating functionϕ satisfies (6). Let the exact solution u
=
S
+
E of the problem (1) be decomposed into a smooth and layered part, respectively, I
S and I
E are the interpolants of S and E on a S-type mesh respectively. Then, one has I
u
=
I
S
+
I
E and the estimates
(38)
∥
u
-
I
u
∥
L
∞
(
Ω
i
)
≤
{
C
(
N
-
1
max
⁡
|
ψ
′
|
)
k
+
1
if
i
=
1
,
C
N
-
(
k
+
1
)
if
i
=
2
,
(39)
∥
u
-
I
u
∥
L
2
(
Ω
)
≤
C
(
N
-
1
max
⁡
|
ψ
′
|
)
k
+
1
,
(40)
|
S
-
I
S
|
1
,
Ω
≤
C
N
-
k
,
(41)
|
E
-
I
E
|
1
,
Ω
1
≤
C
ɛ
-
1
/
2
(
N
-
1
max
⁡
|
ψ
′
|
)
k
,
(42)
|
E
-
I
E
|
1
,
Ω
2
≤
C
N
-
(
k
+
1
)
.Proof.
Our proof is based on arguments given by Tobiska [26]. The linearity of the interpolation operator implies I
u
=
I
(
S
+
E
)
=
I
S
+
I
E.
(i) The proof of (38): by Lemma 1, Lemma 7, and (33), we have
(43)
∥
S
-
I
S
∥
L
∞
(
Ω
)
≤
C
N
-
(
k
+
1
)
,
(44)
∥
E
-
I
E
∥
L
∞
(
I
j
)
≤
C
h
j
k
+
1
|
E
|
k
+
1
,
∞
,
I
j
≤
C
h
j
k
+
1
·
ɛ
-
(
k
+
1
)
exp
⁡
(
-
β
x
j
-
1
ɛ
)
≤
C
(
N
-
1
max
⁡
|
ψ
′
|
)
k
+
1
,
for any I
j
=
[
x
j
-
1
,
x
j
]
⊂
Ω
1. Hence, we obtain
(45)
∥
E
-
I
E
∥
L
∞
(
Ω
1
)
≤
C
(
N
-
1
max
⁡
|
ψ
′
|
)
k
+
1
.
From (33), we get
(46)
∥
E
∥
L
∞
(
Ω
2
)
≤
C
max
⁡
x
∈
[
λ
,
1
]
exp
⁡
(
-
β
x
ɛ
)
=
C
exp
⁡
(
-
β
λ
ɛ
)
≤
C
N
-
(
k
+
1.5
)
.
Consider the element K
=
[
x
j
-
1
,
x
j
]
⊂
Ω
2. The local nodal functional can be estimated by
(47)
|
N
i
(
E
)
|
≤
C
exp
⁡
(
-
β
x
j
-
1
ɛ
)
;
thus, we have from the local representation,
(48)
I
E
|
K
=
∑
i
=
0
k
‍
N
i
(
E
)
φ
i
,
the estimate
(49)
∥
I
E
∥
L
∞
(
K
)
≤
∑
i
=
0
k
‍
|
N
i
(
E
)
|
·
∥
φ
i
∥
L
∞
(
K
)
≤
C
exp
⁡
(
-
β
x
j
-
1
ɛ
)
≤
C
exp
⁡
(
-
β
λ
ɛ
)
≤
C
N
-
(
k
+
1.5
)
,
where we used ∥
φ
i
∥
L
∞
(
K
)
≤
C, φ
i are basis functions on element K. And then, we obtain ∥
I
E
∥
L
∞
(
Ω
2
)
≤
C
N
-
(
k
+
1.5
). Combining this with (46), we get
(50)
∥
E
-
I
E
∥
L
∞
(
Ω
2
)
≤
∥
E
∥
L
∞
(
Ω
2
)
+
∥
I
E
∥
L
∞
(
Ω
2
)
≤
C
N
-
(
k
+
1.5
)
.
Collecting (43), (45), and (50), we conclude
(51)
∥
u
-
I
u
∥
L
∞
(
Ω
i
)
≤
∥
S
-
I
S
∥
L
∞
(
Ω
i
)
+
∥
E
-
I
E
∥
L
∞
(
Ω
i
)
≤
∥
S
-
I
S
∥
L
∞
(
Ω
)
+
∥
E
-
I
E
∥
L
∞
(
Ω
i
)
≤
{
C
(
N
-
1
max
⁡
|
ψ
′
|
)
k
+
1
,
if
i
=
1
,
C
N
-
(
k
+
1
)
,
if
i
=
2
.
(ii) The proof of (39): by (38), we easily get
(52)
∥
u
-
I
u
∥
L
2
(
Ω
)
≤
∥
u
-
I
u
∥
L
∞
(
Ω
)
·
|
Ω
|
1
/
2
≤
C
(
N
-
1
max
⁡
|
ψ
′
|
)
k
+
1
.
(iii) The proof of (40): by Lemma 1, Lemma 7, and (33), we easily obtain
(53)
|
S
-
I
S
|
1
,
Ω
≤
C
N
-
k
.
(iv) The proof of (41): let x
j
-
1
/
2
=
(
x
j
+
x
j
-
1
)
/
2. Then on the fine part of the mesh, we have
(54)
|
E
-
E
I
|
1
,
I
j
2
≤
C
h
j
2
k
|
E
|
k
+
1
,
I
j
2
≤
C
h
j
2
k
ɛ
-
(
2
k
+
1
)
(
exp
⁡
(
-
2
β
x
j
-
1
ɛ
)
-
exp
⁡
(
-
2
β
x
j
ɛ
)
)
≤
C
ɛ
-
1
(
N
-
1
max
⁡
⁡
|
ψ
′
|
)
2
k
exp
⁡
(
2
k
β
x
j
(
k
+
1.5
)
ɛ
)
×
sinh
⁡
(
β
h
j
ɛ
)
exp
⁡
(
-
2
β
x
j
-
1
/
2
ɛ
)
,
where we have used Lemma 7 and (7). From (9) we get h
j
/
ɛ
≤
C, and therefore sinh
⁡
⁡
(
β
h
j
/
ɛ
)
≤
C
β
h
j
/
ɛ for j
=
1
,
…
,
N
/
2. The representation
(55)
β
h
j
ɛ
=
α
∫
t
j
-
1
t
j
‍
ϕ
′
(
t
)
d
t
for
j
=
1
,
…
,
N
2
yields
(56)
|
E
-
E
I
|
1
,
I
j
2
≤
C
ɛ
-
1
(
N
-
1
max
⁡
⁡
|
ψ
′
|
)
2
k
exp
⁡
(
2
k
β
x
j
(
k
+
1.5
)
ɛ
)
×
∫
t
j
-
1
t
j
‍
-
ψ
′
(
t
)
ψ
(
t
)
d
t
exp
⁡
(
-
2
β
x
j
-
1
/
2
ɛ
)
≤
C
ɛ
-
1
(
N
-
1
max
⁡
⁡
|
ψ
′
|
)
2
k
exp
⁡
(
2
k
β
x
j
(
k
+
1.5
)
ɛ
)
1
ψ
(
t
j
)
×
∫
t
j
-
1
t
j
‍
-
ψ
′
(
t
)
d
t
exp
⁡
(
-
2
β
x
j
-
1
/
2
ɛ
)
≤
C
ɛ
-
1
(
N
-
1
max
⁡
⁡
|
ψ
′
|
)
2
k
∫
t
j
-
1
t
j
‍
-
ψ
′
(
t
)
d
t
exp
⁡
(
β
h
j
ɛ
)
≤
C
ɛ
-
1
(
N
-
1
max
⁡
|
ψ
′
|
)
2
k
∫
t
j
-
1
t
j
‍
-
ψ
′
(
t
)
d
t
,
since ψ
>
0, ψ
′
≤
0 and exp
⁡
(
β
h
j
/
ɛ
)
≤
C by (9). We sum the overall subintervals in the layer region to get
(57)
|
E
-
E
I
|
1
,
Ω
1
2
≤
C
ɛ
-
1
(
N
-
1
max
⁡
⁡
|
ψ
′
|
)
2
k
(
ψ
(
0
)
-
ψ
(
1
2
)
)
≤
C
ɛ
-
1
(
N
-
1
max
⁡
|
ψ
′
|
)
2
k
,
where ψ
(
0
)
=
1 and ψ
(
1
/
2
)
=
1
/
N are used.
(v) The proof of (42): by triangle inequality
(58)
|
E
-
I
E
|
1
,
Ω
2
≤
|
E
|
1
,
Ω
2
+
|
I
E
|
1
,
Ω
2
,
we estimate |
E
|
1
,
Ω
2 and |
I
E
|
1
,
Ω
2, respectively. From (33), we obtain
(59)
|
E
|
1
,
Ω
2
≤
C
(
∫
λ
1
‍
ɛ
-
2
exp
⁡
(
-
2
β
x
ɛ
)
d
x
)
1
/
2
≤
C
ɛ
-
1
/
2
exp
⁡
(
-
β
λ
ɛ
)
≤
C
ɛ
-
1
/
2
N
-
(
k
+
1.5
)
.
An inverse inequality yields
(60)
|
I
E
|
1
,
Ω
2
≤
C
N
∥
I
E
∥
L
2
(
Ω
2
)
,
and it remains to bound ∥
I
E
∥
L
2
(
Ω
2
). Consider the element K
=
[
x
j
-
1
,
x
j
]
⊂
Ω
2. From local representation of I
E
|
K, it follows
(61)
∥
I
E
∥
L
2
(
K
)
≤
∑
i
=
0
k
‍
|
N
i
(
E
)
|
·
∥
φ
i
∥
L
2
(
K
)
≤
C
N
-
1
/
2
exp
⁡
(
-
β
x
j
-
1
ɛ
)
,
where we used ∥
φ
i
∥
L
2
(
K
)
≤
C
N
-
1
/
2
∥
φ
^
i
∥
L
2
(
K
^
)
≤
C
N
-
1
/
2. Here K
^ is the reference element of K and φ
^
i are the basis functions on K
^. Summing up we get
(62)
∥
I
E
∥
L
2
(
Ω
2
)
2
=
∑
K
⊂
Ω
2
‍
∥
I
E
∥
L
2
(
K
)
2
≤
C
N
-
1
∑
j
=
N
/
2
+
1
N
‍
exp
⁡
(
-
2
β
x
j
-
1
ɛ
)
.
Recall that the mesh size on the coarse mesh has been denoted by H and satisfies 1
/
N
≤
H
≤
2
/
N. Integrating the inequality
(63)
exp
⁡
(
-
2
β
x
j
-
1
ɛ
)
=
exp
⁡
(
2
β
H
ɛ
)
exp
⁡
(
-
2
β
x
j
ɛ
)
≤
exp
⁡
(
2
β
H
ɛ
)
exp
⁡
(
-
2
β
x
ɛ
)
hhhhhhhhh
for
x
∈
[
x
j
-
1
,
x
j
]
over (
x
j
-
1
,
x
j
) and summing up for j
=
N
/
2
+
2
,
…
,
N, we obtain
(64)
N
-
1
exp
⁡
(
-
2
β
x
j
-
1
ɛ
)
≤
exp
⁡
(
2
β
H
ɛ
)
∫
x
j
-
1
x
j
‍
exp
⁡
(
-
2
β
x
ɛ
)
d
x
,
N
-
1
∑
j
=
N
/
2
+
2
N
‍
exp
⁡
(
-
2
β
x
j
-
1
ɛ
)
≤
exp
⁡
(
2
β
H
ɛ
)
∫
x
N
/
2
+
1
1
‍
exp
⁡
(
-
2
β
x
ɛ
)
d
x
≤
ɛ
exp
⁡
(
2
β
H
ɛ
)
exp
⁡
⁡
(
-
2
β
x
N
/
2
+
1
ɛ
)
d
x
≤
C
ɛ
N
-
2
(
k
+
1.5
)
.
Therefore, we get
(65)
∥
I
E
∥
L
2
(
Ω
2
)
2
≤
C
N
-
1
exp
⁡
(
-
2
β
x
N
/
2
ɛ
)
+
C
ɛ
N
-
2
(
k
+
1.5
)
≤
C
(
N
-
1
+
ɛ
)
N
-
2
(
k
+
1.5
)
.
And then, we have
(66)
|
I
E
|
1
,
Ω
2
≤
C
N
(
N
-
1
+
ɛ
)
1
/
2
N
-
(
k
+
1.5
)
≤
C
N
-
(
k
+
1
)
.
Combining this with (59), we conclude (42).The following statement is the direct consequence of Lemma8.Theorem 9.
Under the conditions of Lemma8, one has η
=
u
-
I
u satisfies
(67)
|
∥
η
∥
|
ɛ
≤
C
(
N
-
1
max
⁡
|
ψ
′
|
)
k
,
for S-type mesh.Proof.
Sinceu
-
I
u is continuous in Ω, we have |
η
|
*
=
0 and |
η
|
c
=
0. Then, |
∥
η
∥
|
ɛ
2
=
∥
η
∥
0
,
Ω
2
+
ɛ
|
η
|
1
,
N
2. From (40), (41), and (42) of Lemma 8, we obtain
(68)
ɛ
1
/
2
|
u
-
I
u
|
1
,
Ω
≤
ɛ
1
/
2
(
|
S
-
I
S
|
1
,
Ω
+
|
E
-
I
E
|
1
,
Ω
1
+
|
E
-
I
E
|
1
,
Ω
2
)
≤
C
(
N
-
1
max
⁡
|
ψ
′
|
)
k
.
Using this together with (39), we easily conclude the result of Theorem 9.Now we turn to estimate|
∥
ξ
∥
|
ɛ.Lemma 10.
Under the conditions of Lemma8, one has
(69)
|
∫
Ω
‍
b
(
S
-
I
S
)
ξ
′
d
x
|
≤
C
N
-
(
k
+
1
/
2
)
|
∥
ξ
∥
|
ɛ
,
(70)
|
∫
Ω
‍
b
(
E
-
I
E
)
ξ
′
d
x
|
≤
C
C
ψ
(
N
-
1
max
⁡
|
ψ
′
|
)
k
+
1
/
2
|
∥
ξ
∥
|
ɛ
,
where C
ψ
:
=
1
+
(
N
-
1
max
⁡
|
ψ
′
|
ln
⁡
N
)
1
/
2.Proof.
(i) The proof of (69): by Lemma 8 and integrating by parts, we get
(71)
|
∫
Ω
‍
b
(
S
-
I
S
)
ξ
′
d
x
|
≤
∥
S
-
I
S
∥
L
∞
(
Ω
)
|
∑
j
=
1
N
‍
∫
I
j
‍
b
ξ
′
d
x
|
≤
C
N
-
(
k
+
1
)
|
∑
j
=
1
N
‍
[
(
b
ξ
)
(
x
j
-
)
-
(
b
ξ
)
(
x
j
-
1
+
)
]
-
∫
Ω
‍
b
′
ξ
d
x
|
≤
C
N
-
(
k
+
1
)
|
∑
j
=
1
N
‍
[
(
b
ξ
)
(
x
j
-
)
-
(
b
ξ
)
(
x
j
-
1
+
)
]
|
+
C
N
-
(
k
+
1
)
∥
b
′
∥
L
2
(
Ω
)
∥
ξ
∥
L
2
(
Ω
)
.
Recalling that ξ
=
I
u
-
U
N is continuous in Ω
1, we have [
ξ
(
x
j
)
]
=
0, j
=
0
,
…
,
N
/
2
-
1. And then,
(72)
|
∑
j
=
1
N
‍
[
(
b
ξ
)
(
x
j
-
)
-
(
b
ξ
)
(
x
j
-
1
+
)
]
|
≤
b
(
x
0
)
|
ξ
(
x
0
+
)
|
+
∑
j
=
1
N
-
1
‍
b
(
x
j
)
|
[
ξ
(
x
j
)
]
|
+
b
(
x
N
-
)
|
ξ
(
x
N
-
)
|
=
∑
j
=
N
/
2
N
-
1
‍
b
(
x
j
)
|
[
ξ
(
x
j
)
]
|
+
b
(
x
N
-
)
|
ξ
(
x
N
-
)
|
≤
(
∑
j
=
N
/
2
N
‍
b
(
x
j
)
)
1
/
2
×
(
∑
j
=
N
/
2
N
-
1
‍
b
(
x
j
)
[
ξ
(
x
j
)
]
2
+
b
(
x
N
-
)
ξ
(
x
N
-
)
2
)
1
/
2
≤
C
N
1
/
2
|
ξ
|
c
.
Combining this with (71), we can easily get (69).
(ii) The proof of (70): by Cauchy-Schwarz inequality,
(73)
|
∫
Ω
‍
b
(
E
-
I
E
)
ξ
′
d
x
|
≤
C
∥
E
-
I
E
∥
L
2
(
Ω
1
)
|
ξ
|
1
,
Ω
1
+
C
∥
E
-
I
E
∥
L
2
(
Ω
2
)
|
ξ
|
1
,
Ω
2
,
where by Lemma 7,
(74)
∥
E
-
I
E
∥
L
2
(
Ω
1
)
≤
|
Ω
1
|
1
/
2
∥
E
-
I
E
∥
L
∞
(
Ω
1
)
≤
C
(
ɛ
ln
⁡
N
)
1
/
2
(
N
-
1
max
⁡
|
ψ
′
|
)
k
+
1
,
and from (33), (65),
(75)
∥
E
-
I
E
∥
L
2
(
Ω
2
)
≤
∥
E
∥
L
2
(
Ω
2
)
+
∥
I
E
∥
L
2
(
Ω
2
)
≤
C
ɛ
1
/
2
N
-
(
k
+
1
)
+
C
(
N
-
1
/
2
+
ɛ
1
/
2
)
N
-
(
k
+
1.5
)
≤
C
(
ɛ
1
/
2
N
-
(
k
+
1
)
+
N
-
(
k
+
2
)
)
.
Thus, we obtain
(76)
|
∫
Ω
‍
b
(
E
-
I
E
)
ξ
′
d
x
|
≤
C
ɛ
1
/
2
[
(
ln
⁡
N
)
1
/
2
(
N
-
1
max
⁡
|
ψ
′
|
)
k
+
1
+
N
-
(
k
+
1
)
]
|
ξ
|
1
,
Ω
+
C
N
-
(
k
+
2
)
|
ξ
|
1
,
Ω
2
≤
C
[
(
ln
⁡
N
)
1
/
2
(
N
-
1
max
⁡
⁡
|
ψ
′
|
)
k
+
1
+
N
-
(
k
+
1
)
]
×
|
∥
ξ
∥
|
ɛ
+
C
N
-
(
k
+
2
)
·
N
∥
ξ
∥
L
2
(
Ω
2
)
≤
C
[
(
ln
⁡
N
)
1
/
2
(
N
-
1
max
⁡
⁡
|
ψ
′
|
)
k
+
1
+
N
-
(
k
+
1
)
]
|
∥
ξ
∥
|
ɛ
≤
C
C
ψ
(
N
-
1
max
⁡
|
ψ
′
|
)
k
+
1
/
2
|
∥
ξ
∥
|
ɛ
,
where C
ψ
:
=
1
+
(
N
-
1
max
⁡
|
ψ
′
|
ln
⁡
N
)
1
/
2.Remark 11.
The factorC
ψ is bounded by a constant for all meshes listed in Table 1. But there also exists counterexample that C
ψ increases with the increasing of N; see [21] for details.Theorem 12.
Under the conditions of Lemma8. Assuming α
=
O
(
1
/
H
), then ξ
=
I
u
-
U
N satisfies
(77)
|
∥
ξ
∥
|
ɛ
≤
C
C
ψ
(
N
-
1
max
⁡
|
ψ
′
|
)
k
+
1
/
2
.Proof.
By Lemma3 and Lemma 4, we first obtain
(78)
C
1
|
∥
ξ
∥
|
ɛ
2
≤
A
N
(
ξ
,
ξ
)
=
-
A
N
(
η
,
ξ
)
=
-
B
N
(
η
,
ξ
)
-
C
N
(
η
,
ξ
)
-
S
N
(
η
,
ξ
)
.
By the definition of I
u, we have η
(
x
j
)
=
0, j
=
0,1
,
…
,
N. Consequently,
(79)
B
N
(
η
,
ξ
)
=
∫
Ω
‍
ɛ
η
′
(
ξ
′
+
L
1
(
ξ
)
)
d
x
,
C
N
(
η
,
ξ
)
=
∫
Ω
‍
b
η
ξ
′
d
x
+
∫
Ω
‍
(
c
+
b
′
)
η
ξ
d
x
≡
I
1
+
I
2
,
S
N
(
η
,
ξ
)
=
0
.
Firstly, we consider the termB
N
(
η
,
ξ
). By Lemma 7, Lemma 8, and (29), we have
(80)
|
B
N
(
η
,
ξ
)
|
=
|
∫
Ω
2
‍
ɛ
η
′
L
1
(
ξ
)
d
x
|
≤
C
ɛ
∥
η
′
∥
L
2
(
Ω
2
)
|
ξ
|
*
≤
C
ɛ
1
/
2
(
|
S
-
I
S
|
1
,
Ω
2
+
|
E
-
I
E
|
1
,
Ω
2
)
|
∥
ξ
∥
|
ɛ
≤
C
ɛ
1
/
2
N
-
k
|
∥
ξ
∥
|
ɛ
.
Now consider the termC
N
(
η
,
ξ
). By Lemma 10, we get
(81)
|
I
1
|
≤
|
∫
Ω
‍
b
(
S
-
I
S
)
ξ
′
d
x
|
+
|
∫
Ω
‍
b
(
E
-
I
E
)
ξ
′
d
x
|
≤
C
[
N
-
(
k
+
1
/
2
)
+
C
ψ
(
N
-
1
max
⁡
⁡
|
ψ
′
|
)
k
+
1
/
2
]
|
∥
ξ
∥
|
ɛ
≤
C
C
ψ
(
N
-
1
max
⁡
|
ψ
′
|
)
k
+
1
/
2
|
∥
ξ
∥
|
ɛ
.
By (39), the second term in the right hand side of (79) can be easily estimated with
(82)
|
I
2
|
≤
C
∥
η
∥
0
,
Ω
∥
ξ
∥
0
,
Ω
≤
C
(
N
-
1
max
⁡
|
ψ
′
|
)
k
+
1
|
∥
ξ
∥
|
ɛ
.
This, combined with (81), yields
(83)
|
C
N
(
η
,
ξ
)
|
≤
C
C
ψ
(
N
-
1
max
⁡
|
ψ
′
|
)
k
+
1
/
2
|
∥
ξ
∥
|
ɛ
.
Collecting (78), (80), and (83), we conclude Theorem 12.Remark 13.
Uniform convergence of higher order LDG method on 2D Shishkin-mesh was considered in [15]. From Theorem 3.1 of [15], a similar result can be obtained as our Theorem 12. From Theorem 3.1 and Remark 3.3 of [15], we can find the following conditions must hold: 0
≤
C
11
≤
O
(
1
) on E or 0
≤
C
11
≤
O
(
N
) on E
+
B and C
11
=
0 on E
∖
E
+
B. Here C
11 is a parameter in the definition of numerical fluxes, and E, E
+
B are unions of some edges of elements. In our paper, a parameter α in (18), which plays the same role as C
11, takes value as α
=
O
(
1
/
H
). This does not fulfill the condition of Theorem 3.1 of [15].The combination of Theorem9 and Theorem 12 leads to our main results directly, that is, the following.Theorem 14.
Letu and U
N be the solutions of the continuous problem (10) and the discrete problem (25), respectively. Assume that the piecewise differential mesh-generating function ϕ satisfies (6). Taking α
=
O
(
1
/
H
), then
(84)
|
∥
u
-
U
N
∥
|
ɛ
≤
C
C
ψ
(
N
-
1
max
⁡
|
ψ
′
|
)
k
.Corollary 15.
Let(
Q
N
,
U
N
) be the solution obtained by the coupled method (13)–(15) with numerical fluxes (17)–(19). Under the assumption of Theorem 14, one has
(85)
|
q
-
Q
N
,
u
-
U
N
|
A
N
≤
C
C
ψ
(
N
-
1
max
⁡
|
ψ
′
|
)
k
,
where |
(
·
,
·
)
|
A
N is a problem-related norm defined by
(86)
|
(
r
,
v
)
|
A
N
2
=
∥
v
∥
0
,
Ω
2
+
ɛ
∥
r
∥
0
,
Ω
2
2
+
ɛ
∥
(
v
1
)
′
∥
0
,
Ω
1
2
+
ɛ
|
v
|
*
2
+
|
v
|
c
2
.Proof.
From (23), we have q
-
Q
N
=
(
u
2
-
U
N
2
)
′
-
L
1
(
U
N
). Since L
1
(
u
)
=
0, we obtain q
-
Q
N
=
(
u
2
-
U
N
2
)
′
+
L
1
(
u
-
U
N
). In terms of (29), we conclude |
(
q
-
Q
N
,
u
-
U
N
)
|
A
N
≤
C
|
∥
u
-
U
N
∥
|
ɛ, which implies the conclusion.


## 4. Numerical Experiments

In this section, we numerically verify the sharpness of our theoretical findings. In our numerical experiments, we takeα
=
1
/
H, β
=
1
/
2 in (17) and (18).Example 16.
We solve the model problem (1) with b
=
3
-
x, c
=
1, and taking f such that the exact solution is
(87)
u
(
x
)
=
(
1
-
e
-
2
x
/
ɛ
)
sin
(
1
-
x
)
,
which exhibits a boundary layer with the width O
(
ɛ
ln
⁡
(
1
/
ɛ
)
) at the outflow boundary x
=
0.In the following, “ln-ord” denotes the exponentr in a convergence order of the form O
(
(
N
-
1
ln
⁡
N
)
r
), while “ord” denotes the exponent r in a convergence order of the form O
(
N
-
r
).The errors|
∥
u
-
u
N
∥
|
ɛ and |
∥
u
I
-
u
N
∥
|
ɛ for the FEM/LDG coupled method with higher order kth elements are shown in Table 2. We have chosen ɛ
=
1
0
-
6 in our calculations on S-meshes and B-S meshes. From Table 2, we observe that the numerical results for |
∥
u
-
u
N
∥
|
ɛ agree with those predicted in Theorem 14. Note that the closeness errors |
∥
u
I
-
u
N
∥
|
ɛ have a supercloseness property of order k
+
1 if kth polynomial is used. This phenomenon indicates that the supercloseness result of order k
+
1
/
2 proved in Theorem 12 is not optimal.Table 2
History of convergence of the FEM/LDG coupled method,ε
=
1
0
-
6.
k
N
|
|
|
u
-
u
N
|
|
|
ε
|
|
|
u
I
-
u
N
|
|
|
ε
S-mesh
B-S mesh
S-mesh
B-S mesh
Error
ln-ord
Error
ord
Error
ln-ord
Error
ord
1
16
2.060
e
-
01
—
9.204
e
-
02
—
3.539
e
-
02
—
6.912
e
-
03
—
32
1.304
e
-
01
0.97
4.750
e
-
02
0.95
1.429
e
-
02
1.93
2.069
e
-
03
1.74
64
7.868
e
-
02
0.99
2.412
e
-
02
0.98
5.217
e
-
03
1.97
6.378
e
-
04
1.70
128
4.599
e
-
02
1.00
1.216
e
-
02
0.99
1.785
e
-
03
1.99
2.051
e
-
04
1.64
256
2.630
e
-
02
1.00
6.101
e
-
03
1.00
5.846
e
-
04
2.00
6.845
e
-
05
1.58
512
1.480
e
-
02
1.00
3.057
e
-
03
1.00
1.854
e
-
04
2.00
2.344
e
-
05
1.55
2
16
4.230
e
-
02
—
8.054
e
-
03
—
6.413
e
-
03
—
7.305
e
-
04
—
32
1.740
e
-
02
1.89
2.151
e
-
03
1.90
1.681
e
-
03
2.85
1.022
e
-
04
2.84
64
6.406
e
-
03
1.96
5.553
e
-
04
1.95
3.744
e
-
04
2.94
1.360
e
-
05
2.91
128
2.198
e
-
03
1.98
1.410
e
-
04
1.98
7.518
e
-
05
2.98
1.777
e
-
06
2.94
256
7.199
e
-
04
1.99
3.554
e
-
05
1.99
1.409
e
-
05
2.99
2.325
e
-
07
2.93
512
2.280
e
-
04
2.00
8.919
e
-
06
1.99
2.510
e
-
06
3.00
3.267
e
-
08
2.83



---

*Source: 260840-2014-06-19.xml*