# A Third Order Accurate Cellwise Relaxation Implicit Discontinuous Galerkin Scheme for Unstructured Hybrid Meshes

Authors: Hiroyuki Asada; Yousuke Ogino; Kanako Yasue; Keisuke Sawada
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

A third order accurate cellwise relaxation implicit Discontinuous Galerkin (DG) scheme for RANS simulations using unstructured hybrid meshes is presented. A scalar parabolic equation is first examined to clarify what is really important in construction of implicit matrix to keep its diagonal dominance for the third and fourth order cellwise relaxation implicit DG schemes. In addition, discussions are given to approximated construction of implicit matrix for reducing computational cost. Then, the third order accurate cellwise relaxation implicit DG scheme for RANS simulations is successfully developed utilizing the expertise learned in the study of solving the parabolic equation. Superior spatial accuracy of the third order accurate cellwise relaxation implicit DG scheme for RANS simulations, while retaining reasonable convergence properties, is demonstrated for typical aerospace applications.


---

## Body

## 1. Introduction

Computational fluid dynamics (CFD) is used in many engineering areas, where accurate predictions of flowfield over various vehicles such as aircrafts, automobiles, and ships, are highly required. Unstructured mesh methods are widely used because of its effectiveness in treating complicated vehicle geometries. For unstructured meshes involving various cell geometries, it is customary to employ finite volume method (FVM) for satisfying conservation laws rigorously. However, there is a serious problem that spatial accuracy of FVM is usually lower than that assumed in the formulation even for the second order case. The cause of this lower spatial accuracy comes from poor reconstruction of dependent variables especially when geometries of nearby cells are highly skewed. In addition, slope limiter can degrade the spatial accuracy of the reconstructed dependent variables at local minimum/maximum points. Furthermore, the choice of cell stencils for local reconstruction of dependent variables in two- or three-dimensional space is not unique. These issues make FVM for unstructured meshes not really effective for high order computing for flowfield of engineering interest.Recently, Discontinuous Galerkin (DG) finite element method attracts attention because of its ability in achieving formal order of spatial accuracy even on unstructured meshes [1]. In this method, basis functions are introduced independently in each cell. The dependent variables are then reconstructed as a sum of these basis functions multiplied by the corresponding degree of freedoms (DOFs). Because DOFs are also independently obtained in each cell as solution unknowns, the resulting reconstructed dependent variables become discontinuous at cell interfaces. The numerical flux is then evaluated by using upwind schemes for convective flux function and by weakly continued viscous flux function. Note that high order spatial accuracy is achieved with information contained solely in each computational cell in DG method. This is in contrast with conventional high order FVMs which require information in nearby cells in reconstruction of dependent variables.However, DG method has an obvious drawback that computational cost is very high due to increased number of equations for DOFs to be solved in each cell. In addition to implicit integration for achieving faster convergence for steady flow problems, parallel computation is definitely needed for DG method to reduce computing time. It is often pointed out in past works that DG method is quite suitable for parallel computation because of its compactness. Such compactness, however, has not been fully exploited in implicit DG method utilizing, for example, LU-SGS scheme [2]. Yasue et al. proposed the cellwise relaxation implicit DG scheme where implicit time integration was carried out in the same way as the point Jacobi scheme [3]. The second order accurate cellwise relaxation implicit DG scheme was shown to be stable with very large CFL number for solving the RANS equations. It was shown that the cellwise relaxation implicit DG scheme could be easily parallelized using MPI library to achieve more than 120 times speedup when 128 PEs were employed.Efforts were then made to improve the spatial accuracy of the cellwise relaxation implicit DG scheme for the RANS equations, but a straightforward attempt to improve spatial accuracy was ended at emergence of numerical instability. In the work of Sawada and Yasue, a fourth order cellwise relaxation implicit DG scheme for computing wave propagation was shown to be stable [4]. Therefore, it seems likely that the numerical instability comes from the treatment of viscous terms. In order to clarify the cause of the numerical instability that appeared in the RANS solver, a scalar parabolic equation is instead considered to critically examine the implicit matrix of the cellwise relaxation implicit DG scheme.In this paper, by examining a scalar parabolic equation, we will discuss rigorous treatment of implicit terms in cellwise relaxation scheme up to a fourth order case and how such treatment can be approximated while retaining numerical stability. We will then apply the rigorous and approximated treatments to third order accurate cellwise relaxation implicit DG method for the RANS equations. The outline of this paper is the following. In Section2, the cellwise relaxation implicit DG method for a scalar parabolic equation is briefly described. In Section 3, we will show that the rigorous treatment of implicit matrix keeps the diagonal dominance for the third and fourth order accurate schemes, while an easier construction of the implicit matrix actually fails. We will then discuss some approximated construction of implicit matrix for reducing computational cost. In Section 4, the rigorous and approximated constructions of implicit matrix for the third order accurate cellwise relaxation implicit DG scheme are attempted for the RANS equations. The computed results for typical aerospace applications are shown. Finally, conclusions are given in Section 5.


## 2. Cellwise Relaxation Implicit DG Method for Scalar Parabolic Problem

### 2.1. Governing Equation

As a typical parabolic equation, we choose a scalar heat conduction equation given by(1)
∂
u
∂
t
-
α
(
∂
2
u
∂
x
2
+
∂
2
u
∂
y
2
+
∂
2
u
∂
z
2
)
=
0
,
where u denotes the scalar variable and α the scalar coefficient, assumed as α
=
1 for simplicity in the present study. In discretizing the above equation, we introduce the three different coordinate systems, namely, the physical coordinate (
x
,
y
,
z
), the reference coordinate (
ξ
,
η
,
ζ
), and the tensor coordinate (
r
,
s
,
t
). Surface integrals of the above equation are evaluated in the reference coordinate using Gaussian quadrature formulae [5, 6], while volume integrals are in the tensor coordinate. The cell geometries considered in this study are tetrahedrons, prisms, pyramids, and hexahedrons. For these cell geometries, the abovementioned three coordinate systems are shown in Figure 1.Figure 1
Cell geometries in the physical coordinate(
x
,
y
,
z
), the reference coordinate (
ξ
,
η
,
ζ
), and the tensor coordinate (
r
,
s
,
t
) [3].


### 2.2. Basis Function

In this study, the orthogonal bases functions in the tensor coordinateϕ
j
(
r
,
s
,
t
) are chosen as described by Warburton [7]. For tetrahedral cells, the orthogonal bases functions are given by
(2)
ϕ
j
=
P
l
0,0
(
r
)
(
1
-
s
2
)
l
P
m
2
l
+
1,0
(
s
)
(
1
-
t
2
)
l
+
m
P
n
2
l
+
2
m
+
2,0
(
t
)
,
for hexahedral cells,
(3)
ϕ
j
=
P
l
0,0
(
r
)
P
m
0,0
(
s
)
P
n
0,0
(
t
)
,
for prismatic cells,
(4)
ϕ
j
=
P
l
0,0
(
r
)
P
m
0,0
(
s
)
(
1
-
t
)
l
P
n
2
l
+
1,0
(
t
)
,
and for pyramidal cells,
(5)
ϕ
j
=
P
l
0,0
(
r
)
P
m
0,0
(
s
)
(
1
-
t
)
l
+
m
P
n
2
l
+
2
m
+
2,0
(
t
)
.
In the above equations, P
γ
α
,
β denotes the Jacobi polynomials given as
(6)
P
γ
α
,
β
=
(
-
1
)
γ
2
γ
γ
!
(
1
-
z
)
-
α
(
1
+
z
)
-
β
d
γ
d
z
γ
[
(
1
-
z
)
α
+
γ
(
1
+
z
)
β
+
γ
]
.
Then subscript j in (2) denotes the index of the DOFs defined by a set of subscripts l, m, and n. For the 3D second order case, (
l
,
m
,
n
)
=
(
0,0
,
0
) for j
=
1, (
l
,
m
,
n
)
=
(
1,0
,
0
) for j
=
2, (
l
,
m
,
n
)
=
(
0,1
,
0
) for j
=
3, and (
l
,
m
,
n
)
=
(
0,0
,
1
) for j
=
4. Thus, 4 DOFs are needed for the 3D second order case. Similarly, 10 DOFs are needed for the third order case and 20 DOFs for the fourth order case.


### 2.3. Discontinuous Galerkin Discretization

Let us consider DG discretization of the heat conduction equation. We first transform (1) in the reference coordinate as
(7)
∂
u
-
∂
t
-
∇
-
·
σ
-
=
0
,
where the transformed dependent variable u
- and the flux functions σ
- are given by
(8)
u
-
=
J
-
1
u
,
σ
-
ξ
=
J
-
1
(
ξ
x
∂
u
∂
x
+
ξ
y
∂
u
∂
y
+
ξ
z
∂
u
∂
z
)
,
σ
-
η
=
J
-
1
(
η
x
∂
u
∂
x
+
η
y
∂
u
∂
y
+
η
z
∂
u
∂
z
)
,
σ
-
ζ
=
J
-
1
(
ζ
x
∂
u
∂
x
+
ζ
y
∂
u
∂
y
+
ζ
z
∂
u
∂
z
)
,
and the transformation Jacobian J
-
1 is given by
(9)
J
-
1
=
∂
(
x
,
y
,
z
)
∂
(
ξ
,
η
,
ζ
)
.
The flux functions can further be rewritten as
(10)
σ
̄
=
A
̄
∇
̄
u
,
where
(11)
A
̄
=
(
A
̄
ξ
A
̄
η
A
̄
ζ
B
̄
ξ
B
̄
η
B
̄
ζ
C
̄
ξ
C
̄
η
C
̄
ζ
)
,
(12)
A
̄
ξ
=
J
-
1
{
(
∂
x
ξ
)
(
∂
x
ξ
)
+
(
∂
y
ξ
)
(
∂
y
ξ
)
+
(
∂
z
ξ
)
(
∂
z
ξ
)
}
,
A
̄
η
=
J
-
1
{
(
∂
x
ξ
)
(
∂
x
η
)
+
(
∂
y
ξ
)
(
∂
y
η
)
+
(
∂
z
ξ
)
(
∂
z
η
)
}
,
A
̄
ζ
=
J
-
1
{
(
∂
x
ξ
)
(
∂
x
ζ
)
+
(
∂
y
ξ
)
(
∂
y
ζ
)
+
(
∂
z
ξ
)
(
∂
z
ζ
)
}
,
B
̄
ξ
=
J
-
1
{
(
∂
x
η
)
(
∂
x
ξ
)
+
(
∂
y
η
)
(
∂
y
ξ
)
+
(
∂
z
η
)
(
∂
z
ξ
)
}
,
B
̄
η
=
J
-
1
{
(
∂
x
η
)
(
∂
x
η
)
+
(
∂
y
η
)
(
∂
y
η
)
+
(
∂
z
η
)
(
∂
z
η
)
}
,
B
̄
ζ
=
J
-
1
{
(
∂
x
η
)
(
∂
x
ζ
)
+
(
∂
y
η
)
(
∂
y
ζ
)
+
(
∂
z
η
)
(
∂
z
ζ
)
}
,
C
̄
ξ
=
J
-
1
{
(
∂
x
ζ
)
(
∂
x
ξ
)
+
(
∂
y
ζ
)
(
∂
y
ξ
)
+
(
∂
z
ζ
)
(
∂
z
ξ
)
}
,
C
̄
η
=
J
-
1
{
(
∂
x
ζ
)
(
∂
x
η
)
+
(
∂
y
ζ
)
(
∂
y
η
)
+
(
∂
z
ζ
)
(
∂
z
η
)
}
,
C
̄
ζ
=
J
-
1
{
(
∂
x
ζ
)
(
∂
x
ζ
)
+
(
∂
y
ζ
)
(
∂
y
ζ
)
+
(
∂
z
ζ
)
(
∂
z
ζ
)
}
.
For later use, we also write the flux function in the form of
(13)
σ
̄
ξ
=
A
̄
ξ
∂
u
∂
ξ
+
A
̄
η
∂
u
∂
η
+
A
̄
ζ
∂
u
∂
ζ
(
≡
A
̄
·
∇
̄
u
)
,
σ
̄
η
=
B
̄
ξ
∂
u
∂
ξ
+
B
̄
η
∂
u
∂
η
+
B
̄
ζ
∂
u
∂
ζ
(
≡
B
̄
·
∇
̄
u
)
,
σ
̄
ζ
=
C
̄
ξ
∂
u
∂
ξ
+
C
̄
η
∂
u
∂
η
+
C
̄
ζ
∂
u
∂
ζ
(
≡
C
̄
·
∇
̄
u
)
.At first, we consider the BR2 formulation [8, 9] for a weak treatment of (10). Assuming that ψ
ξ represents a test function, we can obtain the following relation:
(14)
∫
Ω
̄
ψ
ξ
σ
̄
ξ
*
d
Ω
̄
=
∫
∂
Ω
̄
ψ
ξ
u
*
A
̄
·
n
̄
d
∂
Ω
̄
-
∫
Ω
̄
∇
̄
·
(
ψ
ξ
A
̄
)
u
d
Ω
̄
,
where ∂
Ω
̄ denotes the interface of computational cell Ω
̄ in the reference coordinate, σ
-
* the numerical flux, u
* the dependent variable at the interface, and n
̄ the unit outward normal vector of ∂
Ω
̄. In the BR2 formulation, u
* is given by
(15)
u
*
=
{
u
L
+
u
R
2
(
on
⁡
∂
Ω
̄
i
)
,
u
b
(
on
⁡
∂
Ω
̄
b
)
,
where the superscripts L and R denote the inside value of the cell interface and that at the opposite side of the cell interface, respectively. On the other hand, the subscripts i and b denote the cell interface inside of the computational domain and that on the domain boundary, respectively. Therefore, the interface value in (15) for interior interface is simply evaluated by taking an average of dependent variables of both sides, while it is given as the boundary condition on the domain boundary. Then, (14) becomes
(16)
∫
Ω
̄
ψ
ξ
σ
̄
ξ
*
d
Ω
̄
=
∫
∂
Ω
̄
ψ
ξ
(
u
*
-
u
L
)
A
̄
·
n
̄
d
∂
Ω
̄
+
∫
Ω
̄
ψ
ξ
σ
-
ξ
d
Ω
̄
.
Therefore, the numerical flux function for ξ component is weakly determined as
(17)
σ
̄
ξ
*
=
σ
-
ξ
+
δ
̄
ξ
,
where δ
-
ξ denotes the global lifting operator in ξ direction in reference coordinate given by
(18)
∫
Ω
̄
ψ
ξ
δ
̄
ξ
d
Ω
̄
=
∫
∂
Ω
̄
ψ
ξ
(
u
*
-
u
L
)
A
̄
·
n
̄
d
∂
Ω
̄
.
Similarly, the numerical flux functions for η and ζ component can be written as
(19)
σ
̄
η
*
=
σ
-
η
+
δ
̄
η
,
σ
̄
ζ
*
=
σ
-
ζ
+
δ
̄
ζ
,
where
(20)
∫
Ω
̄
ψ
η
δ
̄
η
d
Ω
̄
=
∫
∂
Ω
̄
ψ
η
(
u
*
-
u
L
)
B
̄
·
n
̄
d
∂
Ω
̄
,
∫
Ω
̄
ψ
ζ
δ
̄
ζ
d
Ω
̄
=
∫
∂
Ω
̄
ψ
ζ
(
u
*
-
u
L
)
C
̄
·
n
̄
d
∂
Ω
̄
.Next, we consider the weak formulation of (7). Multiplying (7) by the basis function ϕ
i as the test function and integrating over the computational cell, we have
(21)
∫
Ω
̄
ϕ
i
∂
u
̄
∂
t
d
Ω
̄
-
∫
∂
Ω
̄
ϕ
i
σ
̄
*
·
n
̄
d
∂
Ω
̄
+
∫
Ω
̄
∇
̄
ϕ
i
·
σ
̄
*
d
Ω
̄
=
0
,
which then yields
(22)
∫
Ω
-
ϕ
i
∂
u
-
∂
t
d
Ω
-
-
∫
∂
Ω
-
ϕ
i
{
σ
-
·
n
-
}
d
∂
Ω
-
+
∫
Ω
-
∇
-
ϕ
i
·
σ
-
d
Ω
-
-
η
e
∫
∂
Ω
-
ϕ
i
{
δ
-
f
·
n
-
}
d
∂
Ω
-
+
∫
Ω
-
∇
-
ϕ
i
·
δ
-
d
Ω
-
=
0
,
where {
·
} denotes the averaged value of those inside and outside of the cell interface and η
e the stabilizing coefficient [9]. The surface integral of the global lifting term in (21) is replaced by the projected local lifting term in (22). It is assumed that the projected local lifting term can be decomposed by the local orthogonal basis as
(23)
δ
-
f
·
n
-
=
δ
-
n
-
f
=
∑
j
ϕ
j
δ
-
n
-
,
j
f
.
Therefore, by multiplying the local basis function and integrating over the computational cell, we have
(24)
∫
Ω
-
ϕ
k
δ
-
n
-
f
d
Ω
-
=
∫
Ω
-
ϕ
k
(
∑
j
ϕ
j
δ
-
n
-
,
j
f
)
d
Ω
-
=
I
k
k
δ
-
n
-
,
k
f
,
where we utilize the orthogonal property of basis function denoted by
(25)
I
i
j
=
{
∫
Ω
-
ϕ
i
ϕ
j
d
Ω
-
(
i
=
j
)
,
0
(
i
≠
j
)
.
The coefficient in (23) is then obtained as
(26)
δ
-
n
-
,
k
f
=
1
I
k
k
∫
∂
Ω
-
f
ϕ
k
n
-
·
A
̄
n
-
(
u
*
-
u
L
)
d
∂
Ω
-
,
which gives
(27)
∫
∂
Ω
-
ϕ
i
{
δ
-
f
·
n
-
}
d
∂
Ω
-
=
∫
∂
Ω
-
ϕ
i
{
∑
j
ϕ
j
δ
-
n
-
,
j
f
}
d
∂
Ω
-
.We note here that taking an average value in (27) is not straightforward because the local lifting term is defined in the reference space where the relation for coordinate transformation and thus the metric terms are not the same for those inside and outside of the interface. Therefore, the average is taken in the physical space and then transformed back to the reference space as shown below. From (22), we can write
(28)
{
σ
-
*
·
n
-
}
=
{
(
σ
-
+
δ
-
f
)
·
n
-
}
=
{
P
x
(
σ
x
+
δ
x
f
)
+
P
y
(
σ
y
+
δ
y
f
)
+
P
z
(
σ
z
+
δ
z
f
)
}
,
where (
P
x
,
P
y
,
P
z
) can be found by substituting the following relations into (28) as
(29)
σ
-
ξ
+
δ
-
ξ
f
=
J
-
1
[
ξ
x
(
σ
x
+
δ
x
f
)
+
ξ
y
(
σ
y
+
δ
y
f
)
+
ξ
z
(
σ
z
+
δ
z
f
)
]
,
σ
-
η
+
δ
-
η
f
=
J
-
1
[
η
x
(
σ
x
+
δ
x
f
)
+
η
y
(
σ
y
+
δ
y
f
)
+
η
z
(
σ
z
+
δ
z
f
)
]
,
σ
-
ζ
+
δ
-
ζ
f
=
J
-
1
[
ζ
x
(
σ
x
+
δ
x
f
)
+
ζ
y
(
σ
y
+
δ
y
f
)
+
ζ
z
(
σ
z
+
δ
z
f
)
]
.
Then, (28) can be further rewritten as
(30)
{
σ
-
*
·
n
-
}
=
P
x
2
+
P
y
2
+
P
z
2
×
[
m
x
{
σ
x
+
δ
x
f
}
+
m
y
{
σ
y
+
δ
y
f
}
+
m
z
{
σ
z
+
δ
z
f
}
]
,
where
(31)
(
m
x
,
m
y
,
m
z
)
=
1
P
x
2
+
P
y
2
+
P
z
2
(
P
x
,
P
y
,
P
z
)
.
Note that (
σ
x
+
δ
x
f
,
σ
y
+
δ
y
f
,
σ
z
+
δ
z
f
) in (30) can be found either from (29) or by evaluating them directly in the physical space.Finally, we write the scalar variable as a sum of basis functions multiplied by the related DOFs as(32)
u
̄
=
∑
j
ϕ
j
u
-
j
.
Therefore, (22) can be read as
(33)
∑
j
d
u
-
j
d
t
I
i
j
-
∫
∂
Ω
̄
ϕ
i
{
σ
-
·
n
̄
}
d
∂
Ω
̄
+
∫
Ω
̄
∇
̄
ϕ
i
·
σ
-
d
Ω
̄
-
η
e
∫
∂
Ω
̄
ϕ
i
{
δ
̄
f
·
n
̄
}
d
∂
Ω
̄
+
∫
Ω
̄
∇
̄
ϕ
i
·
δ
̄
d
Ω
̄
=
0
.


### 2.4. Cellwise Relaxation Implicit Scheme

We first write the time linearization of the flux functionsσ
- in the reference space as
(34)
σ
-
n
+
1
=
σ
-
n
+
∂
σ
-
∂
t
Δ
t
=
σ
-
n
+
∂
σ
-
∂
∇
-
u
Δ
(
∇
-
u
)
=
σ
-
n
+
A
̄
∑
j
∇
-
ϕ
j
Δ
u
j
n
,
where superscript n denotes time step. Therefore, the implicit treatment of the second term in (33) is given by
(35)
∫
∂
Ω
-
ϕ
i
{
σ
-
·
n
-
}
n
+
1
d
∂
Ω
-
≃
∫
∂
Ω
-
ϕ
i
{
σ
-
·
n
-
}
n
d
∂
Ω
-
+
∑
j
∫
∂
Ω
-
ϕ
i
(
A
̄
∇
-
ϕ
j
·
n
-
)
Δ
u
j
n
d
∂
Ω
-
.
Similarly, the third term in (33) becomes
(36)
∫
Ω
-
∇
-
ϕ
i
·
σ
-
n
+
1
d
Ω
-
≃
∫
Ω
-
∇
-
ϕ
i
·
σ
-
n
d
Ω
-
+
∑
j
∫
Ω
-
∇
-
ϕ
i
·
(
A
̄
∇
-
ϕ
j
)
Δ
u
j
n
d
Ω
-
.
Next, the fourth term corresponding to the surface integral of lifting terms in (33) is approximated as
(37)
∫
∂
Ω
̄
ϕ
i
{
δ
̄
f
·
n
̄
}
n
+
1
d
∂
Ω
̄
≃
∫
∂
Ω
̄
ϕ
i
{
δ
̄
f
·
n
̄
}
n
d
∂
Ω
̄
+
∫
∂
Ω
̄
ϕ
i
(
∑
k
ϕ
k
∂
δ
̄
n
-
,
k
f
∂
t
Δ
t
)
d
∂
Ω
̄
=
∫
∂
Ω
̄
ϕ
i
{
δ
̄
f
·
n
̄
}
n
d
∂
Ω
̄
+
∑
j
∫
∂
Ω
̄
ϕ
i
(
∑
k
ϕ
k
∂
δ
̄
n
-
,
k
f
∂
u
̄
)
ϕ
j
J
-
1
Δ
u
j
n
d
∂
Ω
̄
,
where
(38)
∂
δ
̄
n
-
,
k
f
∂
u
̄
=
1
I
k
k
∫
∂
Ω
̄
f
ϕ
k
n
̄
·
A
̄
n
̄
(
-
1
2
)
J
d
∂
Ω
̄
f
.
In the above equation, the surface integration is taken only on the local interface to maintain the compactness. On the other hand, the fifth term corresponding to the volume integral of lifting terms in (33) is approximated as
(39)
∫
Ω
̄
∇
̄
ϕ
i
·
δ
̄
n
+
1
d
Ω
̄
≃
∫
Ω
̄
∇
̄
ϕ
i
·
δ
̄
n
d
Ω
̄
+
∫
∂
Ω
̄
∇
̄
ϕ
i
·
A
̄
n
̄
(
-
1
2
)
J
Δ
u
̄
d
∂
Ω
̄
=
∫
Ω
̄
∇
̄
ϕ
i
·
δ
̄
n
d
Ω
̄
+
∑
j
∫
∂
Ω
̄
∇
̄
ϕ
i
·
A
̄
n
̄
(
-
1
2
)
ϕ
j
Δ
u
j
n
d
∂
Ω
̄
.
Finally, we approximate the first term in (33) as
(40)
∑
j
d
u
̄
j
d
t
I
i
j
=
1
Δ
t
∑
j
I
i
j
J
-
1
Δ
u
j
n
.We now obtain an algebraic equation for temporal change of transformed DOFs,Δ
u
j
n, in each computational cell given by
(41)
∑
j
M
i
j
Δ
u
j
n
=
R
i
,
where
(42)
M
i
j
=
1
Δ
t
I
i
j
J
-
1
-
∫
∂
Ω
-
ϕ
i
(
A
̄
∇
-
ϕ
j
·
n
-
)
d
Ω
-
+
∫
Ω
-
∇
-
ϕ
i
·
(
A
̄
∇
-
ϕ
j
)
d
Ω
-
-
∫
∂
Ω
̄
ϕ
i
(
∑
k
ϕ
k
∂
δ
̄
n
-
,
k
f
∂
u
̄
)
ϕ
j
J
-
1
d
∂
Ω
̄
+
∫
∂
Ω
̄
∇
̄
ϕ
i
·
A
̄
n
̄
(
-
1
2
)
ϕ
j
d
∂
Ω
-
,
(43)
R
i
=
∫
∂
Ω
̄
ϕ
i
{
σ
-
·
n
̄
}
n
d
∂
Ω
̄
-
∫
Ω
̄
∇
̄
ϕ
i
·
σ
-
n
d
Ω
̄
+
η
e
∫
∂
Ω
̄
ϕ
i
{
δ
̄
f
·
n
̄
}
n
d
∂
Ω
̄
-
∫
Ω
̄
∇
̄
ϕ
i
·
δ
̄
n
d
Ω
̄
.
The size of matrix M
i
j depends on the number of DOFs. For example, the size becomes 4
×
4 for 3D second order case and 10
×
10 for 3D third order case.Here, we emphasize thatM
i
j in (41) only needs the information of current cell. Therefore, (41) can be calculated in each cell independently as if it were an explicit scheme. We also note that a conventional implicit scheme such as LU-SGS scheme [2] probably can converge faster than the present cellwise one because the information over the entire computational domain is used for every time step through the implicit matrix inversion. However, the present implicit scheme can possibly have higher efficiency of parallelization than other conventional implicit schemes. We would like to see the consequence of choosing the present cellwise approach for DG scheme.


## 2.1. Governing Equation

As a typical parabolic equation, we choose a scalar heat conduction equation given by(1)
∂
u
∂
t
-
α
(
∂
2
u
∂
x
2
+
∂
2
u
∂
y
2
+
∂
2
u
∂
z
2
)
=
0
,
where u denotes the scalar variable and α the scalar coefficient, assumed as α
=
1 for simplicity in the present study. In discretizing the above equation, we introduce the three different coordinate systems, namely, the physical coordinate (
x
,
y
,
z
), the reference coordinate (
ξ
,
η
,
ζ
), and the tensor coordinate (
r
,
s
,
t
). Surface integrals of the above equation are evaluated in the reference coordinate using Gaussian quadrature formulae [5, 6], while volume integrals are in the tensor coordinate. The cell geometries considered in this study are tetrahedrons, prisms, pyramids, and hexahedrons. For these cell geometries, the abovementioned three coordinate systems are shown in Figure 1.Figure 1
Cell geometries in the physical coordinate(
x
,
y
,
z
), the reference coordinate (
ξ
,
η
,
ζ
), and the tensor coordinate (
r
,
s
,
t
) [3].


## 2.2. Basis Function

In this study, the orthogonal bases functions in the tensor coordinateϕ
j
(
r
,
s
,
t
) are chosen as described by Warburton [7]. For tetrahedral cells, the orthogonal bases functions are given by
(2)
ϕ
j
=
P
l
0,0
(
r
)
(
1
-
s
2
)
l
P
m
2
l
+
1,0
(
s
)
(
1
-
t
2
)
l
+
m
P
n
2
l
+
2
m
+
2,0
(
t
)
,
for hexahedral cells,
(3)
ϕ
j
=
P
l
0,0
(
r
)
P
m
0,0
(
s
)
P
n
0,0
(
t
)
,
for prismatic cells,
(4)
ϕ
j
=
P
l
0,0
(
r
)
P
m
0,0
(
s
)
(
1
-
t
)
l
P
n
2
l
+
1,0
(
t
)
,
and for pyramidal cells,
(5)
ϕ
j
=
P
l
0,0
(
r
)
P
m
0,0
(
s
)
(
1
-
t
)
l
+
m
P
n
2
l
+
2
m
+
2,0
(
t
)
.
In the above equations, P
γ
α
,
β denotes the Jacobi polynomials given as
(6)
P
γ
α
,
β
=
(
-
1
)
γ
2
γ
γ
!
(
1
-
z
)
-
α
(
1
+
z
)
-
β
d
γ
d
z
γ
[
(
1
-
z
)
α
+
γ
(
1
+
z
)
β
+
γ
]
.
Then subscript j in (2) denotes the index of the DOFs defined by a set of subscripts l, m, and n. For the 3D second order case, (
l
,
m
,
n
)
=
(
0,0
,
0
) for j
=
1, (
l
,
m
,
n
)
=
(
1,0
,
0
) for j
=
2, (
l
,
m
,
n
)
=
(
0,1
,
0
) for j
=
3, and (
l
,
m
,
n
)
=
(
0,0
,
1
) for j
=
4. Thus, 4 DOFs are needed for the 3D second order case. Similarly, 10 DOFs are needed for the third order case and 20 DOFs for the fourth order case.


## 2.3. Discontinuous Galerkin Discretization

Let us consider DG discretization of the heat conduction equation. We first transform (1) in the reference coordinate as
(7)
∂
u
-
∂
t
-
∇
-
·
σ
-
=
0
,
where the transformed dependent variable u
- and the flux functions σ
- are given by
(8)
u
-
=
J
-
1
u
,
σ
-
ξ
=
J
-
1
(
ξ
x
∂
u
∂
x
+
ξ
y
∂
u
∂
y
+
ξ
z
∂
u
∂
z
)
,
σ
-
η
=
J
-
1
(
η
x
∂
u
∂
x
+
η
y
∂
u
∂
y
+
η
z
∂
u
∂
z
)
,
σ
-
ζ
=
J
-
1
(
ζ
x
∂
u
∂
x
+
ζ
y
∂
u
∂
y
+
ζ
z
∂
u
∂
z
)
,
and the transformation Jacobian J
-
1 is given by
(9)
J
-
1
=
∂
(
x
,
y
,
z
)
∂
(
ξ
,
η
,
ζ
)
.
The flux functions can further be rewritten as
(10)
σ
̄
=
A
̄
∇
̄
u
,
where
(11)
A
̄
=
(
A
̄
ξ
A
̄
η
A
̄
ζ
B
̄
ξ
B
̄
η
B
̄
ζ
C
̄
ξ
C
̄
η
C
̄
ζ
)
,
(12)
A
̄
ξ
=
J
-
1
{
(
∂
x
ξ
)
(
∂
x
ξ
)
+
(
∂
y
ξ
)
(
∂
y
ξ
)
+
(
∂
z
ξ
)
(
∂
z
ξ
)
}
,
A
̄
η
=
J
-
1
{
(
∂
x
ξ
)
(
∂
x
η
)
+
(
∂
y
ξ
)
(
∂
y
η
)
+
(
∂
z
ξ
)
(
∂
z
η
)
}
,
A
̄
ζ
=
J
-
1
{
(
∂
x
ξ
)
(
∂
x
ζ
)
+
(
∂
y
ξ
)
(
∂
y
ζ
)
+
(
∂
z
ξ
)
(
∂
z
ζ
)
}
,
B
̄
ξ
=
J
-
1
{
(
∂
x
η
)
(
∂
x
ξ
)
+
(
∂
y
η
)
(
∂
y
ξ
)
+
(
∂
z
η
)
(
∂
z
ξ
)
}
,
B
̄
η
=
J
-
1
{
(
∂
x
η
)
(
∂
x
η
)
+
(
∂
y
η
)
(
∂
y
η
)
+
(
∂
z
η
)
(
∂
z
η
)
}
,
B
̄
ζ
=
J
-
1
{
(
∂
x
η
)
(
∂
x
ζ
)
+
(
∂
y
η
)
(
∂
y
ζ
)
+
(
∂
z
η
)
(
∂
z
ζ
)
}
,
C
̄
ξ
=
J
-
1
{
(
∂
x
ζ
)
(
∂
x
ξ
)
+
(
∂
y
ζ
)
(
∂
y
ξ
)
+
(
∂
z
ζ
)
(
∂
z
ξ
)
}
,
C
̄
η
=
J
-
1
{
(
∂
x
ζ
)
(
∂
x
η
)
+
(
∂
y
ζ
)
(
∂
y
η
)
+
(
∂
z
ζ
)
(
∂
z
η
)
}
,
C
̄
ζ
=
J
-
1
{
(
∂
x
ζ
)
(
∂
x
ζ
)
+
(
∂
y
ζ
)
(
∂
y
ζ
)
+
(
∂
z
ζ
)
(
∂
z
ζ
)
}
.
For later use, we also write the flux function in the form of
(13)
σ
̄
ξ
=
A
̄
ξ
∂
u
∂
ξ
+
A
̄
η
∂
u
∂
η
+
A
̄
ζ
∂
u
∂
ζ
(
≡
A
̄
·
∇
̄
u
)
,
σ
̄
η
=
B
̄
ξ
∂
u
∂
ξ
+
B
̄
η
∂
u
∂
η
+
B
̄
ζ
∂
u
∂
ζ
(
≡
B
̄
·
∇
̄
u
)
,
σ
̄
ζ
=
C
̄
ξ
∂
u
∂
ξ
+
C
̄
η
∂
u
∂
η
+
C
̄
ζ
∂
u
∂
ζ
(
≡
C
̄
·
∇
̄
u
)
.At first, we consider the BR2 formulation [8, 9] for a weak treatment of (10). Assuming that ψ
ξ represents a test function, we can obtain the following relation:
(14)
∫
Ω
̄
ψ
ξ
σ
̄
ξ
*
d
Ω
̄
=
∫
∂
Ω
̄
ψ
ξ
u
*
A
̄
·
n
̄
d
∂
Ω
̄
-
∫
Ω
̄
∇
̄
·
(
ψ
ξ
A
̄
)
u
d
Ω
̄
,
where ∂
Ω
̄ denotes the interface of computational cell Ω
̄ in the reference coordinate, σ
-
* the numerical flux, u
* the dependent variable at the interface, and n
̄ the unit outward normal vector of ∂
Ω
̄. In the BR2 formulation, u
* is given by
(15)
u
*
=
{
u
L
+
u
R
2
(
on
⁡
∂
Ω
̄
i
)
,
u
b
(
on
⁡
∂
Ω
̄
b
)
,
where the superscripts L and R denote the inside value of the cell interface and that at the opposite side of the cell interface, respectively. On the other hand, the subscripts i and b denote the cell interface inside of the computational domain and that on the domain boundary, respectively. Therefore, the interface value in (15) for interior interface is simply evaluated by taking an average of dependent variables of both sides, while it is given as the boundary condition on the domain boundary. Then, (14) becomes
(16)
∫
Ω
̄
ψ
ξ
σ
̄
ξ
*
d
Ω
̄
=
∫
∂
Ω
̄
ψ
ξ
(
u
*
-
u
L
)
A
̄
·
n
̄
d
∂
Ω
̄
+
∫
Ω
̄
ψ
ξ
σ
-
ξ
d
Ω
̄
.
Therefore, the numerical flux function for ξ component is weakly determined as
(17)
σ
̄
ξ
*
=
σ
-
ξ
+
δ
̄
ξ
,
where δ
-
ξ denotes the global lifting operator in ξ direction in reference coordinate given by
(18)
∫
Ω
̄
ψ
ξ
δ
̄
ξ
d
Ω
̄
=
∫
∂
Ω
̄
ψ
ξ
(
u
*
-
u
L
)
A
̄
·
n
̄
d
∂
Ω
̄
.
Similarly, the numerical flux functions for η and ζ component can be written as
(19)
σ
̄
η
*
=
σ
-
η
+
δ
̄
η
,
σ
̄
ζ
*
=
σ
-
ζ
+
δ
̄
ζ
,
where
(20)
∫
Ω
̄
ψ
η
δ
̄
η
d
Ω
̄
=
∫
∂
Ω
̄
ψ
η
(
u
*
-
u
L
)
B
̄
·
n
̄
d
∂
Ω
̄
,
∫
Ω
̄
ψ
ζ
δ
̄
ζ
d
Ω
̄
=
∫
∂
Ω
̄
ψ
ζ
(
u
*
-
u
L
)
C
̄
·
n
̄
d
∂
Ω
̄
.Next, we consider the weak formulation of (7). Multiplying (7) by the basis function ϕ
i as the test function and integrating over the computational cell, we have
(21)
∫
Ω
̄
ϕ
i
∂
u
̄
∂
t
d
Ω
̄
-
∫
∂
Ω
̄
ϕ
i
σ
̄
*
·
n
̄
d
∂
Ω
̄
+
∫
Ω
̄
∇
̄
ϕ
i
·
σ
̄
*
d
Ω
̄
=
0
,
which then yields
(22)
∫
Ω
-
ϕ
i
∂
u
-
∂
t
d
Ω
-
-
∫
∂
Ω
-
ϕ
i
{
σ
-
·
n
-
}
d
∂
Ω
-
+
∫
Ω
-
∇
-
ϕ
i
·
σ
-
d
Ω
-
-
η
e
∫
∂
Ω
-
ϕ
i
{
δ
-
f
·
n
-
}
d
∂
Ω
-
+
∫
Ω
-
∇
-
ϕ
i
·
δ
-
d
Ω
-
=
0
,
where {
·
} denotes the averaged value of those inside and outside of the cell interface and η
e the stabilizing coefficient [9]. The surface integral of the global lifting term in (21) is replaced by the projected local lifting term in (22). It is assumed that the projected local lifting term can be decomposed by the local orthogonal basis as
(23)
δ
-
f
·
n
-
=
δ
-
n
-
f
=
∑
j
ϕ
j
δ
-
n
-
,
j
f
.
Therefore, by multiplying the local basis function and integrating over the computational cell, we have
(24)
∫
Ω
-
ϕ
k
δ
-
n
-
f
d
Ω
-
=
∫
Ω
-
ϕ
k
(
∑
j
ϕ
j
δ
-
n
-
,
j
f
)
d
Ω
-
=
I
k
k
δ
-
n
-
,
k
f
,
where we utilize the orthogonal property of basis function denoted by
(25)
I
i
j
=
{
∫
Ω
-
ϕ
i
ϕ
j
d
Ω
-
(
i
=
j
)
,
0
(
i
≠
j
)
.
The coefficient in (23) is then obtained as
(26)
δ
-
n
-
,
k
f
=
1
I
k
k
∫
∂
Ω
-
f
ϕ
k
n
-
·
A
̄
n
-
(
u
*
-
u
L
)
d
∂
Ω
-
,
which gives
(27)
∫
∂
Ω
-
ϕ
i
{
δ
-
f
·
n
-
}
d
∂
Ω
-
=
∫
∂
Ω
-
ϕ
i
{
∑
j
ϕ
j
δ
-
n
-
,
j
f
}
d
∂
Ω
-
.We note here that taking an average value in (27) is not straightforward because the local lifting term is defined in the reference space where the relation for coordinate transformation and thus the metric terms are not the same for those inside and outside of the interface. Therefore, the average is taken in the physical space and then transformed back to the reference space as shown below. From (22), we can write
(28)
{
σ
-
*
·
n
-
}
=
{
(
σ
-
+
δ
-
f
)
·
n
-
}
=
{
P
x
(
σ
x
+
δ
x
f
)
+
P
y
(
σ
y
+
δ
y
f
)
+
P
z
(
σ
z
+
δ
z
f
)
}
,
where (
P
x
,
P
y
,
P
z
) can be found by substituting the following relations into (28) as
(29)
σ
-
ξ
+
δ
-
ξ
f
=
J
-
1
[
ξ
x
(
σ
x
+
δ
x
f
)
+
ξ
y
(
σ
y
+
δ
y
f
)
+
ξ
z
(
σ
z
+
δ
z
f
)
]
,
σ
-
η
+
δ
-
η
f
=
J
-
1
[
η
x
(
σ
x
+
δ
x
f
)
+
η
y
(
σ
y
+
δ
y
f
)
+
η
z
(
σ
z
+
δ
z
f
)
]
,
σ
-
ζ
+
δ
-
ζ
f
=
J
-
1
[
ζ
x
(
σ
x
+
δ
x
f
)
+
ζ
y
(
σ
y
+
δ
y
f
)
+
ζ
z
(
σ
z
+
δ
z
f
)
]
.
Then, (28) can be further rewritten as
(30)
{
σ
-
*
·
n
-
}
=
P
x
2
+
P
y
2
+
P
z
2
×
[
m
x
{
σ
x
+
δ
x
f
}
+
m
y
{
σ
y
+
δ
y
f
}
+
m
z
{
σ
z
+
δ
z
f
}
]
,
where
(31)
(
m
x
,
m
y
,
m
z
)
=
1
P
x
2
+
P
y
2
+
P
z
2
(
P
x
,
P
y
,
P
z
)
.
Note that (
σ
x
+
δ
x
f
,
σ
y
+
δ
y
f
,
σ
z
+
δ
z
f
) in (30) can be found either from (29) or by evaluating them directly in the physical space.Finally, we write the scalar variable as a sum of basis functions multiplied by the related DOFs as(32)
u
̄
=
∑
j
ϕ
j
u
-
j
.
Therefore, (22) can be read as
(33)
∑
j
d
u
-
j
d
t
I
i
j
-
∫
∂
Ω
̄
ϕ
i
{
σ
-
·
n
̄
}
d
∂
Ω
̄
+
∫
Ω
̄
∇
̄
ϕ
i
·
σ
-
d
Ω
̄
-
η
e
∫
∂
Ω
̄
ϕ
i
{
δ
̄
f
·
n
̄
}
d
∂
Ω
̄
+
∫
Ω
̄
∇
̄
ϕ
i
·
δ
̄
d
Ω
̄
=
0
.


## 2.4. Cellwise Relaxation Implicit Scheme

We first write the time linearization of the flux functionsσ
- in the reference space as
(34)
σ
-
n
+
1
=
σ
-
n
+
∂
σ
-
∂
t
Δ
t
=
σ
-
n
+
∂
σ
-
∂
∇
-
u
Δ
(
∇
-
u
)
=
σ
-
n
+
A
̄
∑
j
∇
-
ϕ
j
Δ
u
j
n
,
where superscript n denotes time step. Therefore, the implicit treatment of the second term in (33) is given by
(35)
∫
∂
Ω
-
ϕ
i
{
σ
-
·
n
-
}
n
+
1
d
∂
Ω
-
≃
∫
∂
Ω
-
ϕ
i
{
σ
-
·
n
-
}
n
d
∂
Ω
-
+
∑
j
∫
∂
Ω
-
ϕ
i
(
A
̄
∇
-
ϕ
j
·
n
-
)
Δ
u
j
n
d
∂
Ω
-
.
Similarly, the third term in (33) becomes
(36)
∫
Ω
-
∇
-
ϕ
i
·
σ
-
n
+
1
d
Ω
-
≃
∫
Ω
-
∇
-
ϕ
i
·
σ
-
n
d
Ω
-
+
∑
j
∫
Ω
-
∇
-
ϕ
i
·
(
A
̄
∇
-
ϕ
j
)
Δ
u
j
n
d
Ω
-
.
Next, the fourth term corresponding to the surface integral of lifting terms in (33) is approximated as
(37)
∫
∂
Ω
̄
ϕ
i
{
δ
̄
f
·
n
̄
}
n
+
1
d
∂
Ω
̄
≃
∫
∂
Ω
̄
ϕ
i
{
δ
̄
f
·
n
̄
}
n
d
∂
Ω
̄
+
∫
∂
Ω
̄
ϕ
i
(
∑
k
ϕ
k
∂
δ
̄
n
-
,
k
f
∂
t
Δ
t
)
d
∂
Ω
̄
=
∫
∂
Ω
̄
ϕ
i
{
δ
̄
f
·
n
̄
}
n
d
∂
Ω
̄
+
∑
j
∫
∂
Ω
̄
ϕ
i
(
∑
k
ϕ
k
∂
δ
̄
n
-
,
k
f
∂
u
̄
)
ϕ
j
J
-
1
Δ
u
j
n
d
∂
Ω
̄
,
where
(38)
∂
δ
̄
n
-
,
k
f
∂
u
̄
=
1
I
k
k
∫
∂
Ω
̄
f
ϕ
k
n
̄
·
A
̄
n
̄
(
-
1
2
)
J
d
∂
Ω
̄
f
.
In the above equation, the surface integration is taken only on the local interface to maintain the compactness. On the other hand, the fifth term corresponding to the volume integral of lifting terms in (33) is approximated as
(39)
∫
Ω
̄
∇
̄
ϕ
i
·
δ
̄
n
+
1
d
Ω
̄
≃
∫
Ω
̄
∇
̄
ϕ
i
·
δ
̄
n
d
Ω
̄
+
∫
∂
Ω
̄
∇
̄
ϕ
i
·
A
̄
n
̄
(
-
1
2
)
J
Δ
u
̄
d
∂
Ω
̄
=
∫
Ω
̄
∇
̄
ϕ
i
·
δ
̄
n
d
Ω
̄
+
∑
j
∫
∂
Ω
̄
∇
̄
ϕ
i
·
A
̄
n
̄
(
-
1
2
)
ϕ
j
Δ
u
j
n
d
∂
Ω
̄
.
Finally, we approximate the first term in (33) as
(40)
∑
j
d
u
̄
j
d
t
I
i
j
=
1
Δ
t
∑
j
I
i
j
J
-
1
Δ
u
j
n
.We now obtain an algebraic equation for temporal change of transformed DOFs,Δ
u
j
n, in each computational cell given by
(41)
∑
j
M
i
j
Δ
u
j
n
=
R
i
,
where
(42)
M
i
j
=
1
Δ
t
I
i
j
J
-
1
-
∫
∂
Ω
-
ϕ
i
(
A
̄
∇
-
ϕ
j
·
n
-
)
d
Ω
-
+
∫
Ω
-
∇
-
ϕ
i
·
(
A
̄
∇
-
ϕ
j
)
d
Ω
-
-
∫
∂
Ω
̄
ϕ
i
(
∑
k
ϕ
k
∂
δ
̄
n
-
,
k
f
∂
u
̄
)
ϕ
j
J
-
1
d
∂
Ω
̄
+
∫
∂
Ω
̄
∇
̄
ϕ
i
·
A
̄
n
̄
(
-
1
2
)
ϕ
j
d
∂
Ω
-
,
(43)
R
i
=
∫
∂
Ω
̄
ϕ
i
{
σ
-
·
n
̄
}
n
d
∂
Ω
̄
-
∫
Ω
̄
∇
̄
ϕ
i
·
σ
-
n
d
Ω
̄
+
η
e
∫
∂
Ω
̄
ϕ
i
{
δ
̄
f
·
n
̄
}
n
d
∂
Ω
̄
-
∫
Ω
̄
∇
̄
ϕ
i
·
δ
̄
n
d
Ω
̄
.
The size of matrix M
i
j depends on the number of DOFs. For example, the size becomes 4
×
4 for 3D second order case and 10
×
10 for 3D third order case.Here, we emphasize thatM
i
j in (41) only needs the information of current cell. Therefore, (41) can be calculated in each cell independently as if it were an explicit scheme. We also note that a conventional implicit scheme such as LU-SGS scheme [2] probably can converge faster than the present cellwise one because the information over the entire computational domain is used for every time step through the implicit matrix inversion. However, the present implicit scheme can possibly have higher efficiency of parallelization than other conventional implicit schemes. We would like to see the consequence of choosing the present cellwise approach for DG scheme.


## 3. Computed Results for Scalar Parabolic Equation

In this chapter, we first show the computed results for the scalar parabolic equation using the second, third, and fourth order accurate cellwise relaxation implicit DG schemes. Spatial accuracies will be examined by comparing with the exact solution. Convergence properties will also be indicated. Then, we consider approximated construction ofM
i
j in (41).


### 3.1. Numerical Conditions

We consider a scalar heat conduction equation. At first, a cubic domain is divided by Cartesian meshes having 5, 10, and 20 intervals along each coordinate line. The resulting hexahedral cell is further divided into 6 tetrahedral cells. Therefore, the total number of cells becomes 750, 6,000, and 48,000, respectively. We denote these unstructured meshes by Mesh-1a, -1b, and -1c. Then, these meshes are compressed in one coordinate direction until the cell aspect ratio becomes as large as 1,000. We denote the compressed unstructured meshes by Mesh-2a, -2b, and -2c. Figure2 shows Mesh-1c and Mesh-2c. The boundary condition assumed on all the boundary surfaces of computational domain is given by the following analytic solution for steady state of a scalar heat conduction equation:
(44)
u
=
(
x
-
0.5
)
2
+
(
y
-
0.5
)
2
-
2
(
z
-
0.5
)
2
+
∑
i
,
j
e
-
i
(
i
sin
⁡
j
-
j
cos
⁡
⁡
j
)
,
where (
i
,
j
) is cyclically taken as
(45)
(
i
,
j
)
=
(
x
,
y
)
,
(
y
,
z
)
,
(
z
,
x
)
.
The steady analytic solution for the entire computational domain is also given by (44). The initial condition is to assume u
=
0 for all computational cell. The time step is so determined that CFL number becomes 106 if a convection velocity of 1.0 is assumed.Unstructured meshes used for solving the heat conduction equation; (a) cell aspect ratio of 1 and (b) 1,000.
(a)
Mesh-1c
(b)
Mesh-2cThe stabilizing coefficientη
e is 1.0 for the case in which mesh aspect ratio is 1 and 1.5 for 1,000. All computations in this section are carried out using Intel(R) Core(TM) i7 CPU 3.47 GHz.


### 3.2. Computed Results

At first we examine the convergence characteristics and spatial accuracies of present schemes. In Table1, the number of time steps needed for machine zero convergence and the CPU time needed for advancing one time step are summarized. For all spatial accuracies, the present implicit scheme gives machine zero convergence. However, the convergence becomes slower due to larger stabilizing coefficient η
e when a cell aspect ratio of 1,000 is chosen. The computational cost of the fourth order scheme for advancing one time step is about 20 times higher than that for the second order scheme. In addition, because the convergence rate for the fourth order scheme is slower than that of the second order scheme, the computational cost of the fourth order scheme for attaining machine zero convergence is about 55 times higher than that of the second order scheme. The error norms obtained for converged solutions are also shown in Table 1. One can evaluate the actual spatial accuracy from the slope of fitted line for error norms with different cell intervals. The attained actual spatial accuracies are also shown in Table 1. The present second, third, and fourth order DG schemes will attain the formal spatial accuracy not only for a cell aspect ratio of 1 but also for 1,000.Table 1
Computed results for the parabolic equation using 2nd, 3rd, and 4th order schemes.
Cell aspect ratio is 1
Cell aspect ratio is 1000
Mesh-1a
Mesh-1b
Mesh-1c
Mesh-2a
Mesh-2b
Mesh-2c
Time steps needed for machine zero convergence
2nd order
3210
12320
46890
6110
22880
86260
3rd order
5990
22680
85880
11800
44650
168060
4th order
9430
35650
134830
17270
65340
247390
CPU time per one time step
2nd order
0.0099[s]
0.0527[s]
0.3961[s]
0.0104[s]
0.0528[s]
0.4005[s]
3rd order
0.0361[s]
0.2212[s]
1.8564[s]
0.0359[s]
0.2256[s]
1.8497[s]
4th order
0.1989[s]
1.3447[s]
10.520[s]
0.1962[s]
1.3376[s]
10.482[s]
Log10(Error) of converged solutions
2nd order
−2.5600
−4.8282
−6.2279
−2.7419
−4.7185
−7.0051
3rd order
−3.1516
−5.7300
−7.3960
−3.3393
−5.5940
−8.2653
4th order
−3.7487
−6.6345
−8.5852
−3.9279
−6.4839
−9.5030
Attained spatial accuracy
2nd order
1.96979
1.97443
3rd order
2.93233
3.00013
4th order
4.14892
3.91538Next, let us consider the possible reason why the second order cellwsie relaxation implicit DG scheme of Yasue et al. was numerically stable for solving the RANS equations while the third order scheme became unstable. In solving the RANS equations, Yasue et al. ignored the linearization of the derivative terms for conservative variables. Those second and third terms in (42) were not accounted for in their scheme. We denote the matrix where the second and third terms are ignored by reduction-matrix M
^
i
j while the matrix in (42) by the original-matrix M
i
j. In Figures 3 and 4, comparisons of the convergence histories utilizing M
^
i
j and M
i
j are shown. In all calculations, Mesh-2b is employed. For the second order case, the converging rate with the reduction-matrix M
^
i
j is almost the same as that with the original-matrix M
i
j, while the computational cost using M
^
i
j is reduced. However, for the third and fourth order cases, the computing with the reduction-matrix M
^
i
j becomes unstable.Convergence histories in terms of the number of iterations compared for original-matrix, reduction-matrix, and diagonal-matrix, for (a) 2nd order, (b) 3rd order, and (c) 4th order.
(a)
2nd order
(b)
3rd order
(c)
4th orderConvergence histories in terms of CPU time compared for original-matrix, reduction-matrix, and diagonal-matrix, for (a) 2nd order, (b) 3rd order, and (c) 4th order.
(a)
2nd order
(b)
3rd order
(c)
4th orderIt seems that the observed instability comes from loss of diagonal dominance of matrixM
^
i
j. In order to see whether it is the case or not, let us consider for a sake of simplicity a cubic domain divided by Cartesian meshes and then compress only in z direction to create a cuboid domain having hexahedral cells. Then, the matrix A
̄ in (11) has a diagonal form as
(46)
A
̄
=
(
A
̄
ξ
0
0
0
B
̄
η
0
0
0
C
̄
ζ
)
,
where C
̄
ζ can be much larger than A
̄
ξ and B
̄
η. When the second and third terms in (42) are ignored, the remaining terms containing C
̄
ζ become
(47)
-
∫
∂
Ω
-
ϕ
i
(
∑
k
ϕ
k
∫
∂
Ω
-
ϕ
k
C
̄
ζ
n
-
ζ
2
(
-
1
2
)
J
d
∂
Ω
-
)
ϕ
j
J
-
1
d
∂
Ω
-
+
∫
∂
Ω
-
∂
ϕ
i
∂
ζ
C
̄
ζ
n
-
ζ
(
-
1
2
)
ϕ
j
d
∂
Ω
-
.
Because the first term in the above equation contains n
-
ζ
2, the surface integration in the reference space becomes nonzero only on the interfaces ζ
=
-
1 and ζ
=
1. Furthermore, on these surfaces, ϕ
i
ϕ
j needs to be even function of ξ and η. Otherwise, the surface integral on these surfaces vanishes. Similarly, the second term in (47) contains n
-
ζ. Again, the surface integration can have a nonzero value only on the interfaces ζ
=
-
1 and ζ
=
1, where (
∂
ϕ
i
/
∂
ζ
)
ϕ
j needs to be even function of ξ and η. For the second order case, the bases functions for a hexahedron are given by
(48)
ϕ
1
=
1
,
ϕ
2
=
ξ
,
ϕ
3
=
η
,
ϕ
4
=
ζ
,
which are the first order polynomials. Because ϕ
i
ϕ
j cannot be an even function of ξ and η, except for ϕ
1
ϕ
4, the first term in (47) vanishes for i
≠
j. For ϕ
1
ϕ
4, the sum of surface integration on ζ
=
-
1 and ζ
=
1 vanishes. Similarly, the second term in (47) vanishes for i
≠
j except for (
∂
ϕ
4
/
∂
ζ
)
ϕ
1. For (
∂
ϕ
4
/
∂
ζ
)
ϕ
1, the sum of surface integration on ζ
=
-
1 and ζ
=
1 again vanishes. Therefore, the diagonal dominance is maintained for the second order case. For the third order case, the bases functions are given in addition to (48) as
(49)
ϕ
5
=
-
1
2
(
1
-
3
ξ
2
)
,
ϕ
6
=
ξ
η
,
ϕ
7
=
-
1
2
(
1
-
3
η
2
)
,
ϕ
8
=
η
ζ
,
ϕ
9
=
-
1
2
(
1
-
3
ζ
2
)
,
ϕ
10
=
ξ
ζ
,
which are the second order polynomials. For these bases functions, (47) can have a nonzero value when ϕ
i
ϕ
j or (
∂
ϕ
i
/
∂
ζ
)
ϕ
j become even functions of ξ and η. Although the diagonal term is also reinforced with these bases functions, we numerically observed that the resulting reduction-matrix M
^
i
j has no diagonal dominance. The situation is the same for the fourth order case. Although Yasue et al. employed the reduction-matrix M
^
i
j in their cellwise relaxation implicit DG scheme, the diagonal dominance was kept because the spatial accuracy of their code was second order.An easier approach to maintain the diagonal dominance of the reduction-matrixM
^
i
j is to remove all the off-diagonal terms. We denote this matrix by the diagonal-matrix M
~
i
j. The convergence histories for computing with M
~
i
j are also shown in Figures 3 and 4. For the third order case, the computing with M
~
i
j is found to be stable, but convergence is slower than that with the original-matrix M
i
j. On the other hand, for the fourth order case, the computing with M
~
i
j is unstable. Therefore, we should take into account the terms arising from the linearization of the derivative terms for conservative variables in the third and fourth order cellwise relaxation implicit DG scheme.Now that the linearization of the derivative terms for conservative variables should be included in implicit matrix for diagonal dominance; the computing cost to obtain the original-matrixM
i
j in each cell is very high. Therefore, it is favorable to examine a possibility of simplifying the original-matrix M
i
j in which some components of matrix M
i
j are removed for reducing computational cost while retaining the diagonal dominance. For the second order case, we employ the simplified form of M
i
j as
(50)
[
M
11
M
12
M
13
M
14
M
21
M
22
0
0
M
31
0
M
33
0
M
41
0
0
M
44
]
[
Δ
Q
1
Δ
Q
2
Δ
Q
3
Δ
Q
4
]
=
[
R
1
R
2
R
3
R
4
]
,
while, for the third order case,(51)
[
M
11
M
12
M
13
M
14
M
15
M
16
M
17
M
18
M
19
M
110
M
21
M
22
0
0
M
25
M
26
0
0
0
M
210
M
31
0
M
33
0
0
M
36
M
37
M
38
0
0
M
41
0
0
M
44
0
0
0
M
48
M
49
M
410
M
51
M
52
0
0
M
55
0
0
0
0
0
M
61
M
62
M
63
0
0
M
66
0
0
0
0
M
71
0
M
73
0
0
0
M
77
0
0
0
M
81
0
M
83
M
84
0
0
0
M
88
0
0
M
91
0
0
M
94
0
0
0
0
M
99
0
M
101
M
102
0
M
104
0
0
0
0
0
M
1010
]
[
Δ
Q
1
Δ
Q
2
Δ
Q
3
Δ
Q
4
Δ
Q
5
Δ
Q
6
Δ
Q
7
Δ
Q
8
Δ
Q
9
Δ
Q
10
]
=
[
R
1
R
2
R
3
R
4
R
5
R
6
R
7
R
8
R
9
R
10
]
.In (2), a set of (
l
,
m
,
n
) determines the basis function. The simplified matrices in the above equations are derived by considering the relation of l, m, and n. For example, assume that (
l
,
m
,
n
)
=
(
1,1
,
0
). Because the first order polynomials of ξ and η in the corresponding basis function can be derived from the combination of (
l
,
m
,
n
)
=
(
0,0
,
0
), (
1,0
,
0
), and (
0,1
,
0
), we should retain these components of M
61, M
62, M
63, and M
66, while we all ignore M
64, M
65, M
67, M
68, M
69, and M
610. Similarly, a simplified form of the original-matrix M
i
j for the fourth order case can be obtained. It is found that the present approach of simplifying the original-matrix M
i
j is quite effective in reducing computational cost particularly for the higher order cases. In addition, we apply the successive overrelaxation (SOR) method in solving (41) because the size of matrices for higher order cases becomes very large. In the present SOR method, we first prepare the initial guess for the second order components as
(52)
Δ
Q
1
=
ω
M
11
R
1
,
Δ
Q
2
=
ω
M
22
{
R
2
-
M
21
Δ
Q
1
}
,
Δ
Q
3
=
ω
M
33
{
R
3
-
M
31
Δ
Q
1
}
,
Δ
Q
4
=
ω
M
44
{
R
4
-
M
41
Δ
Q
1
}
.
Using the initial guess for the second order components, the forward sweep to obtain the third order components is carried out as
(53)
Δ
Q
5
=
(
1
-
ω
)
Δ
Q
5
+
ω
M
55
{
R
5
-
(
M
51
Δ
Q
1
+
M
52
Δ
Q
2
)
}
,
Δ
Q
6
=
(
1
-
ω
)
Δ
Q
6
+
ω
M
66
{
R
6
-
(
M
61
Δ
Q
1
+
M
62
Δ
Q
2
+
M
63
Δ
Q
3
)
}
,
Δ
Q
7
=
(
1
-
ω
)
Δ
Q
7
+
ω
M
77
{
R
7
-
(
M
71
Δ
Q
1
+
M
73
Δ
Q
3
)
}
,
Δ
Q
8
=
(
1
-
ω
)
Δ
Q
8
+
ω
M
88
{
R
8
-
(
M
81
Δ
Q
1
+
M
83
Δ
Q
3
+
M
84
Δ
Q
4
)
}
,
Δ
Q
9
=
(
1
-
ω
)
Δ
Q
9
+
ω
M
99
{
R
9
-
(
M
91
Δ
Q
1
+
M
94
Δ
Q
4
)
}
,
Δ
Q
10
=
(
1
-
ω
)
Δ
Q
10
+
ω
M
1010
×
{
R
10
-
(
M
101
Δ
Q
1
+
M
102
Δ
Q
2
+
M
104
Δ
Q
4
)
}
.
Then the backward sweep for improving the second order components is followed as
(54)
Δ
Q
4
=
(
1
-
ω
)
Δ
Q
4
+
ω
M
44
{
R
4
-
(
M
41
Δ
Q
1
+
M
48
Δ
Q
8
+
M
49
Δ
Q
9
+
M
410
Δ
Q
10
M
41
)
R
4
}
,
Δ
Q
3
=
(
1
-
ω
)
Δ
Q
3
+
ω
M
33
{
R
3
-
(
M
31
Δ
Q
1
+
M
36
Δ
Q
6
+
M
37
Δ
Q
7
+
M
38
Δ
Q
8
M
31
)
R
3
}
,
Δ
Q
2
=
(
1
-
ω
)
Δ
Q
2
+
ω
M
22
{
R
2
-
(
M
21
Δ
Q
1
+
M
25
Δ
Q
5
+
M
26
Δ
Q
6
+
M
210
Δ
Q
10
M
21
)
R
2
}
,
Δ
Q
1
=
(
1
-
ω
)
Δ
Q
1
+
ω
M
11
{
R
1
-
(
M
12
Δ
Q
2
+
M
13
Δ
Q
3
+
M
14
Δ
Q
4
+
M
15
Δ
Q
5
+
M
16
Δ
Q
6
+
M
17
Δ
Q
7
+
M
18
Δ
Q
8
+
M
19
Δ
Q
9
+
M
110
Δ
Q
10
M
12
)
R
1
}
.
In above equations, the relaxation coefficient is chosen as ω
=
1.3 which can give fast convergence while retaining numerical stability. Solutions are iteratively improved by repeating (53) and (54) for 3 times in the present study. In Figures 5 and 6, the convergence histories for computing with the original-matrix and the matrix-simplification and that with SOR method are shown. One can find that the matrix-simplification is quite effective in reducing computational cost without affecting converging rate. In addition, the computational cost is further reduced when SOR method is used. As a result, we can successfully reduce 5%, 22%, and 39% of the total CPU times for the second, third, and fourth order cases, respectively, when we employ the matrix-simplification with the SOR method. We emphasize that the matrix-simplification with SOR method is more effective in reducing computational cost as the spatial accuracy becomes higher.Convergence histories in terms of the number of iterations compared for the original-matrix, matrix-simplification, and matrix-simplification with SOR method, for (a) 2nd order, (b) 3rd order, and (c) 4th order.
(a)
2nd order
(b)
3rd order
(c)
4th orderConvergence histories in terms of CPU time compared for the original-matrix, matrix-simplification, and matrix-simplification with SOR method, for (a) 2nd order, (b) 3rd order, and (c) 4th order.
(a)
2nd order
(b)
3rd order
(c)
4th order


## 3.1. Numerical Conditions

We consider a scalar heat conduction equation. At first, a cubic domain is divided by Cartesian meshes having 5, 10, and 20 intervals along each coordinate line. The resulting hexahedral cell is further divided into 6 tetrahedral cells. Therefore, the total number of cells becomes 750, 6,000, and 48,000, respectively. We denote these unstructured meshes by Mesh-1a, -1b, and -1c. Then, these meshes are compressed in one coordinate direction until the cell aspect ratio becomes as large as 1,000. We denote the compressed unstructured meshes by Mesh-2a, -2b, and -2c. Figure2 shows Mesh-1c and Mesh-2c. The boundary condition assumed on all the boundary surfaces of computational domain is given by the following analytic solution for steady state of a scalar heat conduction equation:
(44)
u
=
(
x
-
0.5
)
2
+
(
y
-
0.5
)
2
-
2
(
z
-
0.5
)
2
+
∑
i
,
j
e
-
i
(
i
sin
⁡
j
-
j
cos
⁡
⁡
j
)
,
where (
i
,
j
) is cyclically taken as
(45)
(
i
,
j
)
=
(
x
,
y
)
,
(
y
,
z
)
,
(
z
,
x
)
.
The steady analytic solution for the entire computational domain is also given by (44). The initial condition is to assume u
=
0 for all computational cell. The time step is so determined that CFL number becomes 106 if a convection velocity of 1.0 is assumed.Unstructured meshes used for solving the heat conduction equation; (a) cell aspect ratio of 1 and (b) 1,000.
(a)
Mesh-1c
(b)
Mesh-2cThe stabilizing coefficientη
e is 1.0 for the case in which mesh aspect ratio is 1 and 1.5 for 1,000. All computations in this section are carried out using Intel(R) Core(TM) i7 CPU 3.47 GHz.


## 3.2. Computed Results

At first we examine the convergence characteristics and spatial accuracies of present schemes. In Table1, the number of time steps needed for machine zero convergence and the CPU time needed for advancing one time step are summarized. For all spatial accuracies, the present implicit scheme gives machine zero convergence. However, the convergence becomes slower due to larger stabilizing coefficient η
e when a cell aspect ratio of 1,000 is chosen. The computational cost of the fourth order scheme for advancing one time step is about 20 times higher than that for the second order scheme. In addition, because the convergence rate for the fourth order scheme is slower than that of the second order scheme, the computational cost of the fourth order scheme for attaining machine zero convergence is about 55 times higher than that of the second order scheme. The error norms obtained for converged solutions are also shown in Table 1. One can evaluate the actual spatial accuracy from the slope of fitted line for error norms with different cell intervals. The attained actual spatial accuracies are also shown in Table 1. The present second, third, and fourth order DG schemes will attain the formal spatial accuracy not only for a cell aspect ratio of 1 but also for 1,000.Table 1
Computed results for the parabolic equation using 2nd, 3rd, and 4th order schemes.
Cell aspect ratio is 1
Cell aspect ratio is 1000
Mesh-1a
Mesh-1b
Mesh-1c
Mesh-2a
Mesh-2b
Mesh-2c
Time steps needed for machine zero convergence
2nd order
3210
12320
46890
6110
22880
86260
3rd order
5990
22680
85880
11800
44650
168060
4th order
9430
35650
134830
17270
65340
247390
CPU time per one time step
2nd order
0.0099[s]
0.0527[s]
0.3961[s]
0.0104[s]
0.0528[s]
0.4005[s]
3rd order
0.0361[s]
0.2212[s]
1.8564[s]
0.0359[s]
0.2256[s]
1.8497[s]
4th order
0.1989[s]
1.3447[s]
10.520[s]
0.1962[s]
1.3376[s]
10.482[s]
Log10(Error) of converged solutions
2nd order
−2.5600
−4.8282
−6.2279
−2.7419
−4.7185
−7.0051
3rd order
−3.1516
−5.7300
−7.3960
−3.3393
−5.5940
−8.2653
4th order
−3.7487
−6.6345
−8.5852
−3.9279
−6.4839
−9.5030
Attained spatial accuracy
2nd order
1.96979
1.97443
3rd order
2.93233
3.00013
4th order
4.14892
3.91538Next, let us consider the possible reason why the second order cellwsie relaxation implicit DG scheme of Yasue et al. was numerically stable for solving the RANS equations while the third order scheme became unstable. In solving the RANS equations, Yasue et al. ignored the linearization of the derivative terms for conservative variables. Those second and third terms in (42) were not accounted for in their scheme. We denote the matrix where the second and third terms are ignored by reduction-matrix M
^
i
j while the matrix in (42) by the original-matrix M
i
j. In Figures 3 and 4, comparisons of the convergence histories utilizing M
^
i
j and M
i
j are shown. In all calculations, Mesh-2b is employed. For the second order case, the converging rate with the reduction-matrix M
^
i
j is almost the same as that with the original-matrix M
i
j, while the computational cost using M
^
i
j is reduced. However, for the third and fourth order cases, the computing with the reduction-matrix M
^
i
j becomes unstable.Convergence histories in terms of the number of iterations compared for original-matrix, reduction-matrix, and diagonal-matrix, for (a) 2nd order, (b) 3rd order, and (c) 4th order.
(a)
2nd order
(b)
3rd order
(c)
4th orderConvergence histories in terms of CPU time compared for original-matrix, reduction-matrix, and diagonal-matrix, for (a) 2nd order, (b) 3rd order, and (c) 4th order.
(a)
2nd order
(b)
3rd order
(c)
4th orderIt seems that the observed instability comes from loss of diagonal dominance of matrixM
^
i
j. In order to see whether it is the case or not, let us consider for a sake of simplicity a cubic domain divided by Cartesian meshes and then compress only in z direction to create a cuboid domain having hexahedral cells. Then, the matrix A
̄ in (11) has a diagonal form as
(46)
A
̄
=
(
A
̄
ξ
0
0
0
B
̄
η
0
0
0
C
̄
ζ
)
,
where C
̄
ζ can be much larger than A
̄
ξ and B
̄
η. When the second and third terms in (42) are ignored, the remaining terms containing C
̄
ζ become
(47)
-
∫
∂
Ω
-
ϕ
i
(
∑
k
ϕ
k
∫
∂
Ω
-
ϕ
k
C
̄
ζ
n
-
ζ
2
(
-
1
2
)
J
d
∂
Ω
-
)
ϕ
j
J
-
1
d
∂
Ω
-
+
∫
∂
Ω
-
∂
ϕ
i
∂
ζ
C
̄
ζ
n
-
ζ
(
-
1
2
)
ϕ
j
d
∂
Ω
-
.
Because the first term in the above equation contains n
-
ζ
2, the surface integration in the reference space becomes nonzero only on the interfaces ζ
=
-
1 and ζ
=
1. Furthermore, on these surfaces, ϕ
i
ϕ
j needs to be even function of ξ and η. Otherwise, the surface integral on these surfaces vanishes. Similarly, the second term in (47) contains n
-
ζ. Again, the surface integration can have a nonzero value only on the interfaces ζ
=
-
1 and ζ
=
1, where (
∂
ϕ
i
/
∂
ζ
)
ϕ
j needs to be even function of ξ and η. For the second order case, the bases functions for a hexahedron are given by
(48)
ϕ
1
=
1
,
ϕ
2
=
ξ
,
ϕ
3
=
η
,
ϕ
4
=
ζ
,
which are the first order polynomials. Because ϕ
i
ϕ
j cannot be an even function of ξ and η, except for ϕ
1
ϕ
4, the first term in (47) vanishes for i
≠
j. For ϕ
1
ϕ
4, the sum of surface integration on ζ
=
-
1 and ζ
=
1 vanishes. Similarly, the second term in (47) vanishes for i
≠
j except for (
∂
ϕ
4
/
∂
ζ
)
ϕ
1. For (
∂
ϕ
4
/
∂
ζ
)
ϕ
1, the sum of surface integration on ζ
=
-
1 and ζ
=
1 again vanishes. Therefore, the diagonal dominance is maintained for the second order case. For the third order case, the bases functions are given in addition to (48) as
(49)
ϕ
5
=
-
1
2
(
1
-
3
ξ
2
)
,
ϕ
6
=
ξ
η
,
ϕ
7
=
-
1
2
(
1
-
3
η
2
)
,
ϕ
8
=
η
ζ
,
ϕ
9
=
-
1
2
(
1
-
3
ζ
2
)
,
ϕ
10
=
ξ
ζ
,
which are the second order polynomials. For these bases functions, (47) can have a nonzero value when ϕ
i
ϕ
j or (
∂
ϕ
i
/
∂
ζ
)
ϕ
j become even functions of ξ and η. Although the diagonal term is also reinforced with these bases functions, we numerically observed that the resulting reduction-matrix M
^
i
j has no diagonal dominance. The situation is the same for the fourth order case. Although Yasue et al. employed the reduction-matrix M
^
i
j in their cellwise relaxation implicit DG scheme, the diagonal dominance was kept because the spatial accuracy of their code was second order.An easier approach to maintain the diagonal dominance of the reduction-matrixM
^
i
j is to remove all the off-diagonal terms. We denote this matrix by the diagonal-matrix M
~
i
j. The convergence histories for computing with M
~
i
j are also shown in Figures 3 and 4. For the third order case, the computing with M
~
i
j is found to be stable, but convergence is slower than that with the original-matrix M
i
j. On the other hand, for the fourth order case, the computing with M
~
i
j is unstable. Therefore, we should take into account the terms arising from the linearization of the derivative terms for conservative variables in the third and fourth order cellwise relaxation implicit DG scheme.Now that the linearization of the derivative terms for conservative variables should be included in implicit matrix for diagonal dominance; the computing cost to obtain the original-matrixM
i
j in each cell is very high. Therefore, it is favorable to examine a possibility of simplifying the original-matrix M
i
j in which some components of matrix M
i
j are removed for reducing computational cost while retaining the diagonal dominance. For the second order case, we employ the simplified form of M
i
j as
(50)
[
M
11
M
12
M
13
M
14
M
21
M
22
0
0
M
31
0
M
33
0
M
41
0
0
M
44
]
[
Δ
Q
1
Δ
Q
2
Δ
Q
3
Δ
Q
4
]
=
[
R
1
R
2
R
3
R
4
]
,
while, for the third order case,(51)
[
M
11
M
12
M
13
M
14
M
15
M
16
M
17
M
18
M
19
M
110
M
21
M
22
0
0
M
25
M
26
0
0
0
M
210
M
31
0
M
33
0
0
M
36
M
37
M
38
0
0
M
41
0
0
M
44
0
0
0
M
48
M
49
M
410
M
51
M
52
0
0
M
55
0
0
0
0
0
M
61
M
62
M
63
0
0
M
66
0
0
0
0
M
71
0
M
73
0
0
0
M
77
0
0
0
M
81
0
M
83
M
84
0
0
0
M
88
0
0
M
91
0
0
M
94
0
0
0
0
M
99
0
M
101
M
102
0
M
104
0
0
0
0
0
M
1010
]
[
Δ
Q
1
Δ
Q
2
Δ
Q
3
Δ
Q
4
Δ
Q
5
Δ
Q
6
Δ
Q
7
Δ
Q
8
Δ
Q
9
Δ
Q
10
]
=
[
R
1
R
2
R
3
R
4
R
5
R
6
R
7
R
8
R
9
R
10
]
.In (2), a set of (
l
,
m
,
n
) determines the basis function. The simplified matrices in the above equations are derived by considering the relation of l, m, and n. For example, assume that (
l
,
m
,
n
)
=
(
1,1
,
0
). Because the first order polynomials of ξ and η in the corresponding basis function can be derived from the combination of (
l
,
m
,
n
)
=
(
0,0
,
0
), (
1,0
,
0
), and (
0,1
,
0
), we should retain these components of M
61, M
62, M
63, and M
66, while we all ignore M
64, M
65, M
67, M
68, M
69, and M
610. Similarly, a simplified form of the original-matrix M
i
j for the fourth order case can be obtained. It is found that the present approach of simplifying the original-matrix M
i
j is quite effective in reducing computational cost particularly for the higher order cases. In addition, we apply the successive overrelaxation (SOR) method in solving (41) because the size of matrices for higher order cases becomes very large. In the present SOR method, we first prepare the initial guess for the second order components as
(52)
Δ
Q
1
=
ω
M
11
R
1
,
Δ
Q
2
=
ω
M
22
{
R
2
-
M
21
Δ
Q
1
}
,
Δ
Q
3
=
ω
M
33
{
R
3
-
M
31
Δ
Q
1
}
,
Δ
Q
4
=
ω
M
44
{
R
4
-
M
41
Δ
Q
1
}
.
Using the initial guess for the second order components, the forward sweep to obtain the third order components is carried out as
(53)
Δ
Q
5
=
(
1
-
ω
)
Δ
Q
5
+
ω
M
55
{
R
5
-
(
M
51
Δ
Q
1
+
M
52
Δ
Q
2
)
}
,
Δ
Q
6
=
(
1
-
ω
)
Δ
Q
6
+
ω
M
66
{
R
6
-
(
M
61
Δ
Q
1
+
M
62
Δ
Q
2
+
M
63
Δ
Q
3
)
}
,
Δ
Q
7
=
(
1
-
ω
)
Δ
Q
7
+
ω
M
77
{
R
7
-
(
M
71
Δ
Q
1
+
M
73
Δ
Q
3
)
}
,
Δ
Q
8
=
(
1
-
ω
)
Δ
Q
8
+
ω
M
88
{
R
8
-
(
M
81
Δ
Q
1
+
M
83
Δ
Q
3
+
M
84
Δ
Q
4
)
}
,
Δ
Q
9
=
(
1
-
ω
)
Δ
Q
9
+
ω
M
99
{
R
9
-
(
M
91
Δ
Q
1
+
M
94
Δ
Q
4
)
}
,
Δ
Q
10
=
(
1
-
ω
)
Δ
Q
10
+
ω
M
1010
×
{
R
10
-
(
M
101
Δ
Q
1
+
M
102
Δ
Q
2
+
M
104
Δ
Q
4
)
}
.
Then the backward sweep for improving the second order components is followed as
(54)
Δ
Q
4
=
(
1
-
ω
)
Δ
Q
4
+
ω
M
44
{
R
4
-
(
M
41
Δ
Q
1
+
M
48
Δ
Q
8
+
M
49
Δ
Q
9
+
M
410
Δ
Q
10
M
41
)
R
4
}
,
Δ
Q
3
=
(
1
-
ω
)
Δ
Q
3
+
ω
M
33
{
R
3
-
(
M
31
Δ
Q
1
+
M
36
Δ
Q
6
+
M
37
Δ
Q
7
+
M
38
Δ
Q
8
M
31
)
R
3
}
,
Δ
Q
2
=
(
1
-
ω
)
Δ
Q
2
+
ω
M
22
{
R
2
-
(
M
21
Δ
Q
1
+
M
25
Δ
Q
5
+
M
26
Δ
Q
6
+
M
210
Δ
Q
10
M
21
)
R
2
}
,
Δ
Q
1
=
(
1
-
ω
)
Δ
Q
1
+
ω
M
11
{
R
1
-
(
M
12
Δ
Q
2
+
M
13
Δ
Q
3
+
M
14
Δ
Q
4
+
M
15
Δ
Q
5
+
M
16
Δ
Q
6
+
M
17
Δ
Q
7
+
M
18
Δ
Q
8
+
M
19
Δ
Q
9
+
M
110
Δ
Q
10
M
12
)
R
1
}
.
In above equations, the relaxation coefficient is chosen as ω
=
1.3 which can give fast convergence while retaining numerical stability. Solutions are iteratively improved by repeating (53) and (54) for 3 times in the present study. In Figures 5 and 6, the convergence histories for computing with the original-matrix and the matrix-simplification and that with SOR method are shown. One can find that the matrix-simplification is quite effective in reducing computational cost without affecting converging rate. In addition, the computational cost is further reduced when SOR method is used. As a result, we can successfully reduce 5%, 22%, and 39% of the total CPU times for the second, third, and fourth order cases, respectively, when we employ the matrix-simplification with the SOR method. We emphasize that the matrix-simplification with SOR method is more effective in reducing computational cost as the spatial accuracy becomes higher.Convergence histories in terms of the number of iterations compared for the original-matrix, matrix-simplification, and matrix-simplification with SOR method, for (a) 2nd order, (b) 3rd order, and (c) 4th order.
(a)
2nd order
(b)
3rd order
(c)
4th orderConvergence histories in terms of CPU time compared for the original-matrix, matrix-simplification, and matrix-simplification with SOR method, for (a) 2nd order, (b) 3rd order, and (c) 4th order.
(a)
2nd order
(b)
3rd order
(c)
4th order


## 4. Computed Results for Navier-Stokes Equations or RANS Equations

In this section, we show the computed results for the Navier-Stokes equations using the second and third order accurate cellwise relaxation implicit DG schemes. The second order cellwise relaxation implicit DG scheme for RANS equations including the treatment of convection terms is thoroughly described in [3]. In this study, the second and third terms in (42) are included in the coefficient matrices, and those bases functions for high order terms, their associated DOFs, and sufficient number of Gaussian points are simply introduced to attain the third order spatial accuracy. In the following, we at first show the computed results for the laminar boundary layer flow and compare them with the Blasius solution. Then, we show the computed results for the turbulent boundary layer flow. Finally, the computed results for the vortical flowfield over a double-delta wing are shown.


### 4.1. Laminar Boundary Layer

The computational domain for the laminar boundary layer flow is set as(55)
-
2.0
≤
x
≤
1.0
,
0.0
≤
y
≤
5.0
,
0.0
≤
z
≤
0.05
.
A uniform inflow is set at the inlet boundary (
x
=
-
2.0
) and the outflow condition with a prescribed pressure is set at the outlet boundary (
x
=
1.0
) and at the top boundary (
y
=
2.0
). The symmetric boundary is assumed not only at the side boundaries (
z
=
0.0
,
z
=
0.05
) but also at the bottom boundary of upstream region (
-
2.0
≤
x
≤
0.0
). At the bottom boundary of downstream region (
0.0
≤
x
≤
1.0
), the nonslip boundary condition is set. A typical example of computational mesh is shown in Figure 7. The present computational mesh consists of 1,688 tetrahedral cells and 1,000 prismatic cells. The minimum gird spacing Δ
y
min
⁡ for the prismatic layer on the wall is set to be 3.0
×
10
-
4 and 10 layers with a growth rate of 1.3 are given in the boundary layer region. The free-stream Mach number is chosen to be 0.2 and the Reynolds number is 1.69
×
10
5 for a unit length. The computation is carried out by the cellwise relaxation implicit scheme in which the matrix-simplification with SOR method is employed. In the present case, we choose the relaxation coefficient in SOR method to be 0.9 and the number of iterations to be 10 in order to avoid emergence of numerical instability. A CFL number of 10
6 is assumed in the implicit time integration. The stabilizing coefficient is assumed as η
e
=
1.0. All computations in this subsection are carried out using Intel(R) Core(TM) i7 CPU 3.47 GHz.Figure 7
Unstructured hybrid mesh for computation of the laminar boundary layer over a flat plate. Those meshes in the prismatic layer are not shown.In Figures8 and 9, one can find that the computed velocity profiles obtained by the second and third order schemes agree well with Blasius solution at several streamwise locations. On the other hand, in Figures 10 and 11, the velocity profiles at x
=
0.9 are shown to duplicate each other for both the second and third order cases suggesting that the use of the matrix-simplification with/without SOR method does not alter the converged solutions. The convergence histories determined by density residuals are shown in Figure 12. It is evident that the use of the matrix-simplification with/without SOR method does not influence convergence property. In Table 2, the CPU time needed for advancing one time step is summarized. One can find that the use of the matrix-simplification reduces the needed CPU time by 6.75% and 35.58% for the second and third order schemes, respectively. When the matrix-simplification with SOR method is employed, the CPU time is further reduced by 9.65% and 42.51% for the second and third order schemes, respectively.Table 2
CPU time needed for advancing one time step for computing the laminar boundary layer flow.
Original-matrix
Matrix-simplification
Matrix-simplification with SOR
2nd order
0.311 [s]
0.290 [s]
0.281 [s]
3rd order
1.962 [s]
1.264 [s]
1.128 [s]Velocity profiles in the laminar boundary layer over a flat plate inx direction; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderVelocity profiles in the laminar boundary layer over a flat plate iny direction; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderInfluence of the matrix-simplification with/without SOR method for computing velocity profiles of the laminar boundary layer inx direction at x
=
0.9; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderInfluence of the matrix-simplification with/without SOR method for computing velocity profiles of the laminar boundary layer iny direction at x
=
0.9; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderConvergence histories for computing the laminar boundary layer; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd order


### 4.2. Turbulent Boundary Layer

Next, we consider the turbulent boundary layer flow over a flat plate. An example of the computational mesh is shown in Figure13. The computational domain is set as
(56)
-
2.0
≤
x
≤
1.0
,
0.0
≤
y
≤
2.0
,
0
≤
z
≤
0.05
.
The boundary conditions are the same for those used in the calculation of the laminar boundary layer flow. The computational mesh consists of 1,496 tetrahedral cells and 2,100 prismatic cells. The minimum grid spacing Δ
y
min
⁡ is set to be 4.0
×
10
-
6. As many as 15 prismatic layers are employed with a growth rate of 1.7 in the boundary layer region. The free-stream Mach number is 0.5, and the Reynolds number for a unit length is 1.05
×
10
7. The cellwise relaxation implicit DG scheme is applied for time integration. A CFL number of 10
6 is assumed. In order to reduce the computational cost, the matrix-simplification with SOR method is employed. The relaxation coefficient and the number of iterations are set to be 0.7 and 15 for this case. The stabilizing coefficient is assumed as η
e
=
1.0. All computations are carried out again using Intel(R) Core(TM) i7 CPU 3.47 GHz.Figure 13
Unstructured hybrid mesh for computation of the turbulent boundary layer over a flat plate. Those meshes in the prismatic layer are not drawn.The computed velocity profiles obtained by the second and third order schemes with asymptotic solutions ofu
+
=
y
+ and u
+
=
5.75
log
⁡
10
⁡
y
+
+
5.5 are shown in Figure 14. For both the second and third order schemes, good agreements with the asymptotic solutions are obtained. In Figure 15, the computed results at x
=
0.9 obtained by the second and third order schemes are shown. As in the laminar boundary layer case, use of the matrix-simplification with/without SOR method does not influence the converged solutions. Figure 16 shows the velocity profiles of the converged solutions at x
=
0.9 given by the second and third order scheme. The velocity profiles obtained by the third order scheme better agree with those asymptotic solutions. The convergence histories determined by the density residuals are shown in Figure 17. Again, the use of the matrix-simplification with/without SOR method does not alter the convergence properties, although the density residual fluctuates in a slightly different way particularly in the third order case. The CPU time needed for advancing one time step for both of the spatial accuracies is summarized in Table 3. The use of the matrix-simplification reduces the needed CPU time by 4.30% and 35.90% for the second and third order schemes, while the matrix-simplification with SOR method by 9.95% and 43.18% for the second and third order scheme, respectively.Table 3
CPU time needed for advancing one time step for computing the turbulent boundary layer flow.
Original-matrix
Matrix-simplification
Matrix-simplification with SOR
2nd order
0.442[s]
0.423[s]
0.398[s]
3rd order
2.925[s]
1.875[s]
1.662[s]Velocity profiles in the turbulent boundary layer over a flat plate; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderInfluence of the matrix-simplification with/without SOR method for computing velocity profiles of the turbulent boundary layer atx
=
0.9; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderFigure 16
Velocity profiles atx
=
0.9 obtained by the second and third order schemes.Convergence histories for computing the turbulent boundary layer flow; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd order


### 4.3. Vortical Flowfield over a Double-Delta Wing

Finally, the computed results for the flowfield over a double-delta wing are shown. The geometry of the double-delta wing is the same as the model used in the experiment conducted by Brennenstuhl and Hummel [10]. The root chord length is c
i
=
0.5 [m]. The kink location is assumed to be the middle of the root chord. The swept-back angles are 80 degree in the upstream region of the kink position and 60 degree in the downstream region, respectively. The strake and main wing are flat plates having a thickness of d
i
=
3.0
×
10
-
3 [m], while the leading edge is rounded by a radius of half wing thickness. An example of the computational mesh is shown in Figure 18. It has 305,619 tetrahedral cells, 343,469 prismatic cells, and 4,095 pyramidal cells. The minimum grid spacing is Δ
y
min
⁡
=
3.0
×
10
-
6 [m]. As many as 31 prismatic layers are employed with a growth rate of 1.25 in the boundary layer region. The outer boundary is assumed as a half sphere whose radius is 20 times of the root chord length. The free-stream Mach number is 0.3, and the Reynolds number is 1.3
×
10
-
6 defined by
(57)
Re
=
V
∞
c
i
ν
,
where V
∞ denotes the free-stream velocity and ν the kinematic viscosity. The angle of attack is 12.0 degree. The cellwise relaxation implicit DG scheme is employed. A CFL number of 10
3 is chosen with the local time stepping for a fast convergence. The stabilizing coefficient is assumed as η
e
=
1.0. For the present case, a parallel computation is performed using 16 processors of the Intel(R) Xeon(R) CPU 3.40 GHz. The METIS grid partitioning [11] and the Message Passing Interface (MPI) library are used in parallelization. In the third order computation, the converged solution of the second order scheme is used as the initial flowfield.Figure 18
Unstructured hybrid mesh for computation of a vortical flowfield over a double-delta wing.The total pressure contour plots in several streamwise cross sections obtained by the second and third order accurate schemes are shown in Figures19(a) and 19(b), respectively. In both results, two longitudinal vortices from the strake and the leading edge of the main wing are clearly captured which are almost merged at the downstream cross section. In addition, a secondary vortex can be found in this cross section. In Figures 20(a) and 20(b), the contour lines in 62.5% chordwise cross section computed by the second and third order accurate schemes, respectively, are compared. One can find that the outboard longitudinal vortex is better captured by the third order scheme. This is well indicated in the pressure coefficient distributions in 62.5% chordwise cross section shown in Figure 21. Apparently, two negative pressure peaks corresponding to these two longitudinal vortices are clearly observed in the third order computation resulting in better agreement with the experimental data.Total pressure contours plotted in streamwise cross section; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderTotal pressure contours plotted in 62.5% chordwise cross section; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderFigure 21
Pressure coefficient distributions in 62.5% chordwise cross section.In this case, the original-matrix is employed in the calculation. The CPU time needed for advancing one time step is 4.8 [s] and 32.3 [s] for the second and third order schemes, respectively, resulting in a ratio of 6.73. This value is close to the ratio of 6.62 obtained in the calculation of the turbulent boundary layer flow using the original-matrix without simplification. We expect to have a better computational efficiency when matrix-simplification and SOR method are employed in the simulation of vortical flowfield over the double-delta wing.


## 4.1. Laminar Boundary Layer

The computational domain for the laminar boundary layer flow is set as(55)
-
2.0
≤
x
≤
1.0
,
0.0
≤
y
≤
5.0
,
0.0
≤
z
≤
0.05
.
A uniform inflow is set at the inlet boundary (
x
=
-
2.0
) and the outflow condition with a prescribed pressure is set at the outlet boundary (
x
=
1.0
) and at the top boundary (
y
=
2.0
). The symmetric boundary is assumed not only at the side boundaries (
z
=
0.0
,
z
=
0.05
) but also at the bottom boundary of upstream region (
-
2.0
≤
x
≤
0.0
). At the bottom boundary of downstream region (
0.0
≤
x
≤
1.0
), the nonslip boundary condition is set. A typical example of computational mesh is shown in Figure 7. The present computational mesh consists of 1,688 tetrahedral cells and 1,000 prismatic cells. The minimum gird spacing Δ
y
min
⁡ for the prismatic layer on the wall is set to be 3.0
×
10
-
4 and 10 layers with a growth rate of 1.3 are given in the boundary layer region. The free-stream Mach number is chosen to be 0.2 and the Reynolds number is 1.69
×
10
5 for a unit length. The computation is carried out by the cellwise relaxation implicit scheme in which the matrix-simplification with SOR method is employed. In the present case, we choose the relaxation coefficient in SOR method to be 0.9 and the number of iterations to be 10 in order to avoid emergence of numerical instability. A CFL number of 10
6 is assumed in the implicit time integration. The stabilizing coefficient is assumed as η
e
=
1.0. All computations in this subsection are carried out using Intel(R) Core(TM) i7 CPU 3.47 GHz.Figure 7
Unstructured hybrid mesh for computation of the laminar boundary layer over a flat plate. Those meshes in the prismatic layer are not shown.In Figures8 and 9, one can find that the computed velocity profiles obtained by the second and third order schemes agree well with Blasius solution at several streamwise locations. On the other hand, in Figures 10 and 11, the velocity profiles at x
=
0.9 are shown to duplicate each other for both the second and third order cases suggesting that the use of the matrix-simplification with/without SOR method does not alter the converged solutions. The convergence histories determined by density residuals are shown in Figure 12. It is evident that the use of the matrix-simplification with/without SOR method does not influence convergence property. In Table 2, the CPU time needed for advancing one time step is summarized. One can find that the use of the matrix-simplification reduces the needed CPU time by 6.75% and 35.58% for the second and third order schemes, respectively. When the matrix-simplification with SOR method is employed, the CPU time is further reduced by 9.65% and 42.51% for the second and third order schemes, respectively.Table 2
CPU time needed for advancing one time step for computing the laminar boundary layer flow.
Original-matrix
Matrix-simplification
Matrix-simplification with SOR
2nd order
0.311 [s]
0.290 [s]
0.281 [s]
3rd order
1.962 [s]
1.264 [s]
1.128 [s]Velocity profiles in the laminar boundary layer over a flat plate inx direction; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderVelocity profiles in the laminar boundary layer over a flat plate iny direction; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderInfluence of the matrix-simplification with/without SOR method for computing velocity profiles of the laminar boundary layer inx direction at x
=
0.9; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderInfluence of the matrix-simplification with/without SOR method for computing velocity profiles of the laminar boundary layer iny direction at x
=
0.9; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderConvergence histories for computing the laminar boundary layer; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd order


## 4.2. Turbulent Boundary Layer

Next, we consider the turbulent boundary layer flow over a flat plate. An example of the computational mesh is shown in Figure13. The computational domain is set as
(56)
-
2.0
≤
x
≤
1.0
,
0.0
≤
y
≤
2.0
,
0
≤
z
≤
0.05
.
The boundary conditions are the same for those used in the calculation of the laminar boundary layer flow. The computational mesh consists of 1,496 tetrahedral cells and 2,100 prismatic cells. The minimum grid spacing Δ
y
min
⁡ is set to be 4.0
×
10
-
6. As many as 15 prismatic layers are employed with a growth rate of 1.7 in the boundary layer region. The free-stream Mach number is 0.5, and the Reynolds number for a unit length is 1.05
×
10
7. The cellwise relaxation implicit DG scheme is applied for time integration. A CFL number of 10
6 is assumed. In order to reduce the computational cost, the matrix-simplification with SOR method is employed. The relaxation coefficient and the number of iterations are set to be 0.7 and 15 for this case. The stabilizing coefficient is assumed as η
e
=
1.0. All computations are carried out again using Intel(R) Core(TM) i7 CPU 3.47 GHz.Figure 13
Unstructured hybrid mesh for computation of the turbulent boundary layer over a flat plate. Those meshes in the prismatic layer are not drawn.The computed velocity profiles obtained by the second and third order schemes with asymptotic solutions ofu
+
=
y
+ and u
+
=
5.75
log
⁡
10
⁡
y
+
+
5.5 are shown in Figure 14. For both the second and third order schemes, good agreements with the asymptotic solutions are obtained. In Figure 15, the computed results at x
=
0.9 obtained by the second and third order schemes are shown. As in the laminar boundary layer case, use of the matrix-simplification with/without SOR method does not influence the converged solutions. Figure 16 shows the velocity profiles of the converged solutions at x
=
0.9 given by the second and third order scheme. The velocity profiles obtained by the third order scheme better agree with those asymptotic solutions. The convergence histories determined by the density residuals are shown in Figure 17. Again, the use of the matrix-simplification with/without SOR method does not alter the convergence properties, although the density residual fluctuates in a slightly different way particularly in the third order case. The CPU time needed for advancing one time step for both of the spatial accuracies is summarized in Table 3. The use of the matrix-simplification reduces the needed CPU time by 4.30% and 35.90% for the second and third order schemes, while the matrix-simplification with SOR method by 9.95% and 43.18% for the second and third order scheme, respectively.Table 3
CPU time needed for advancing one time step for computing the turbulent boundary layer flow.
Original-matrix
Matrix-simplification
Matrix-simplification with SOR
2nd order
0.442[s]
0.423[s]
0.398[s]
3rd order
2.925[s]
1.875[s]
1.662[s]Velocity profiles in the turbulent boundary layer over a flat plate; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderInfluence of the matrix-simplification with/without SOR method for computing velocity profiles of the turbulent boundary layer atx
=
0.9; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderFigure 16
Velocity profiles atx
=
0.9 obtained by the second and third order schemes.Convergence histories for computing the turbulent boundary layer flow; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd order


## 4.3. Vortical Flowfield over a Double-Delta Wing

Finally, the computed results for the flowfield over a double-delta wing are shown. The geometry of the double-delta wing is the same as the model used in the experiment conducted by Brennenstuhl and Hummel [10]. The root chord length is c
i
=
0.5 [m]. The kink location is assumed to be the middle of the root chord. The swept-back angles are 80 degree in the upstream region of the kink position and 60 degree in the downstream region, respectively. The strake and main wing are flat plates having a thickness of d
i
=
3.0
×
10
-
3 [m], while the leading edge is rounded by a radius of half wing thickness. An example of the computational mesh is shown in Figure 18. It has 305,619 tetrahedral cells, 343,469 prismatic cells, and 4,095 pyramidal cells. The minimum grid spacing is Δ
y
min
⁡
=
3.0
×
10
-
6 [m]. As many as 31 prismatic layers are employed with a growth rate of 1.25 in the boundary layer region. The outer boundary is assumed as a half sphere whose radius is 20 times of the root chord length. The free-stream Mach number is 0.3, and the Reynolds number is 1.3
×
10
-
6 defined by
(57)
Re
=
V
∞
c
i
ν
,
where V
∞ denotes the free-stream velocity and ν the kinematic viscosity. The angle of attack is 12.0 degree. The cellwise relaxation implicit DG scheme is employed. A CFL number of 10
3 is chosen with the local time stepping for a fast convergence. The stabilizing coefficient is assumed as η
e
=
1.0. For the present case, a parallel computation is performed using 16 processors of the Intel(R) Xeon(R) CPU 3.40 GHz. The METIS grid partitioning [11] and the Message Passing Interface (MPI) library are used in parallelization. In the third order computation, the converged solution of the second order scheme is used as the initial flowfield.Figure 18
Unstructured hybrid mesh for computation of a vortical flowfield over a double-delta wing.The total pressure contour plots in several streamwise cross sections obtained by the second and third order accurate schemes are shown in Figures19(a) and 19(b), respectively. In both results, two longitudinal vortices from the strake and the leading edge of the main wing are clearly captured which are almost merged at the downstream cross section. In addition, a secondary vortex can be found in this cross section. In Figures 20(a) and 20(b), the contour lines in 62.5% chordwise cross section computed by the second and third order accurate schemes, respectively, are compared. One can find that the outboard longitudinal vortex is better captured by the third order scheme. This is well indicated in the pressure coefficient distributions in 62.5% chordwise cross section shown in Figure 21. Apparently, two negative pressure peaks corresponding to these two longitudinal vortices are clearly observed in the third order computation resulting in better agreement with the experimental data.Total pressure contours plotted in streamwise cross section; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderTotal pressure contours plotted in 62.5% chordwise cross section; (a) 2nd order and (b) 3rd order.
(a)
2nd order
(b)
3rd orderFigure 21
Pressure coefficient distributions in 62.5% chordwise cross section.In this case, the original-matrix is employed in the calculation. The CPU time needed for advancing one time step is 4.8 [s] and 32.3 [s] for the second and third order schemes, respectively, resulting in a ratio of 6.73. This value is close to the ratio of 6.62 obtained in the calculation of the turbulent boundary layer flow using the original-matrix without simplification. We expect to have a better computational efficiency when matrix-simplification and SOR method are employed in the simulation of vortical flowfield over the double-delta wing.


## 5. Conclusions

A third order accurate cellwise relaxation implicit DG scheme for RANS simulations using unstructured hybrid meshes is presented. In order to find a proper construction method of the implicit matrix for the viscous terms, we first consider a scalar parabolic equation. It is shown that those terms corresponding to linearization of the derivative terms for the conservative variables should be retained in the implicit matrix for the third and fourth order accurate cellwise relaxation implicit DG scheme. In addition, the matrix-simplification with SOR method is proposed to substantially reduce the computational cost. Utilizing the expertise learned in the study of solving the parabolic equation, the third order accurate cellwise relaxation implicit DG scheme for RANS equations is successfully developed. In the calculations of laminar and turbulent boundary layer flow and also vortical flowfield over a double-delta wing, not only the marked numerical stability but also the superior spatial accuracy of the present third order cellwise relaxation implicit DG scheme are well demonstrated.



---

*Source: 176752-2014-07-08.xml*