# New Immersed Boundary Method on the Adaptive Cartesian Grid Applied to the Local Discontinuous Galerkin Method

• Xu-Jiu Zhang
• Yong-Sheng Zhu
• Ke Yan
• You-Yun Zhang
Open Access
Original Article
Part of the following topical collections:
1. Intelligent Manufacturing Technology

## Abstract

Currently, many studies on the local discontinuous Galerkin method focus on the Cartesian grid with low computational efficiency and poor adaptability to complex shapes. A new immersed boundary method is presented, and this method employs the adaptive Cartesian grid to improve the adaptability to complex shapes and the immersed boundary to increase computational efficiency. The new immersed boundary method employs different boundary cells (the physical cell and ghost cell) to impose the boundary condition and the reconstruction algorithm of the ghost cell is the key for this method. The classical model elliptic equation is used to test the method. This method is tested and analyzed from the viewpoints of boundary cell type, error distribution and accuracy. The numerical result shows that the presented method has low error and a good rate of the convergence and works well in complex geometries. The method has good prospect for practical application research of the numerical calculation research.

## Keywords

Immersed boundary method Adaptive Cartesian grid Local discontinuous Galerkin method Reconstruction Heat transfer equation

## 1 Introduction

The immersed boundary method (IBM) is an effective method for studying complex boundary. Imposing a boundary condition is not straightforward. To solve this problem, different IBMs have been proposed in literature.

Generally, IBMs can be classified into two categories, i.e., the continuous force approach and discrete force approach [1]. The continuous force approach is not suitable for computing the high Reynolds number flows. Therefore, many researchers focus on the discrete force approach. Fadlun et al. [2] implemented the discrete-time forcing approach on a standard marker- and -cell (MAC) staggered grid. Tseng et al. [3] extended the idea of Verzicco et al. [4] and proposed the ghost-cell IBM (GCIBM) for simulating turbulent flows in complex geometries. Mittal et al. [5] used a sharp interface IBM to simulate incompressible viscous flows past three-dimensional immersed bodies. Using the ghost point treatment as a starting point, Gao et al. [6] improved the method of Tseng et al. [3]. The method effectively eliminates numerical instabilities caused by matrix inversion and flexibly. To improve the accuracy at the boundaries, Shinn et al. [7] implemented the immersed boundary method using the ghost cell approach, whereby the incompressible flows are solved on a staggered grid. To control the spurious force oscillations, Lee et al. [8] proposed a fully-implicit ghost-cell IBM for simulating flows over complex moving bodies on a Cartesian grid. The method is well capable of controlling the generation of spurious force oscillations on the surface of a moving body, thereby producing an accurate and stable solution. To simulate high-Reynolds number compressible viscous flows on adaptive Cartesian grids, Hu et al. [9] present a new ghost-cell turbulent wall boundary condition. In the frame of adaptive Cartesian grids, a cell-centered, second-order accurate finite volume solver has been developed for predicting turbulent flow fields. The robustness and accuracy of the methodology have been validated against well-documented turbulent flow test problems. Now, the IBM method is applied to many fluid dynamic problems such as heat transfer problems [10, 11, 12], fluid-solid interaction problems [13], complex/moving boundary problems [14], incompressible flows [15], and natural convection problems [16].

The above numerical calculation method adopts the finite difference method, the finite volume method or the finite element method. In this paper, a new IBM to solve the second-order partial equation applied to the local discontinuous Galerkin method (LDG) is presented and we analyzed the causes of error variation for the adaptive Cartesian grid. The LDG method [17, 18, 19, 20] means it easy to achieve high accuracy in space and time and provides useful mathematical properties with respect to conservation, stability, and super convergence. In particular, the LDG method can use the mesh with the hanging node [21, 22] for calculation, and it is convenient to apply the method for simulating flows in complex geometries. Therefore, the adaptive Cartesian grid is used for future easier engineering applications [23, 24, 25].

This paper organized as follows: In Section 2, we recall the LDG method. In Section 3, the presented IBM including the numerical procedure, definition of ghost flow nodes and the algorithm of reconstruction is described in detail. In Section 4, the results of testing for the accuracy, convergence rate, and effectiveness in complex geometries of the method are presented. Finally, the concluding remarks follows in Section 5.

## 2 Local Discontinuous Galerkin Method

In this study, we tested the method applied to the LDG method on adaptive Cartesian grids for the following classical model elliptic problem:
$$- \Delta u = f , \quad {\text{in}}\;{\varOmega },$$
(1)
$$u = {\text{g}}_{D} , \quad {\text{in}}\;\; {\varGamma }_{D} ,$$
(2)
$$\nabla u \cdot {\user2{n}} = {\text{g}}_{N} \cdot {\user2{n}}, \quad {\text{in}}\;{\varGamma }_{N} .$$
(3)
where Ω is a bounded domain of, $${\mathbb{R}}^{d} ,\,\,d = 2,3$$, and n is the outward unit normal to its boundary $${\varGamma}={\varGamma}_{D} \cup {\varGamma}_{N}$$.
To construct the LDG formulation, we rewrite our elliptic model problem as the following system of first-order equation:
$${\user2{q}} = \nabla u, \quad {\text{in}}\;{\varOmega },$$
(4)
$$- \nabla \cdot {\user2{q}} = f , \quad {\text{in}}\;{\varOmega },$$
(5)
$$u = g_{D} , \quad {\text{in}}\;{\varGamma }_{D} ,$$
(6)
$${\user2{q}} \cdot {\user2{n}} = {\user2{g}}_{N} \cdot {\user2{n}}, \quad {\text{in}}\;{\varGamma }_{N} .$$
(7)
Let us multiply Eqs. (4) and (5) by arbitrary smooth test function v and r, respectively, integrate them over an arbitrary element Ω, and apply Green’s theorem to write
$$\int_{{{\Upomega }}} {{\user2{q}} \cdot {\user2{r}}{\text{d}}x{\text{d}}y} = \oint_{{\varGamma }} u{\user2{r}} \cdot {\user2{n}} {\text{d}}s - \int_{{{\Upomega }}} {u\nabla \cdot {\user2{r}}{\text{d}}x{\text{d}}y} ,$$
(8)
$$\int_{{{\Upomega }}} {{\user2{q}} \cdot \nabla v {\text{d}}x{\text{d}}y} = \oint_{{\varGamma }} v{\user2{q}} \cdot {\user2{n}}{\text{d}}s + \int_{{{\Upomega }}} {{f} v {\text{d}}x{\text{d}}y} .$$
(9)
Then we replace the exact solution $$({\user2{q}},u)$$ by its approximation $$({\user2{q}}_{{\user2{N}}} ,u_{N} )$$ in the element space $${M}_{N} \times {V}_{N}$$, where
$${M}_{\text{N}} : = \left\{ {{\user2{q}} \in \left( {{\text{L}}^{ 2} \left({\varOmega}\right)} \right)^{d} :{\user2{q}} |_{k} \in {S}\left( {K} \right)^{d} ,\forall {K} \in {\varGamma}} \right\},$$
(10)
$${V}_{\text{N}} : = \left\{ {u \in \left( {{\text{L}}^{ 2} \left( {\varOmega } \right)} \right)^{{d}} :u|_{k} \in {S}\left( {K} \right),\forall {K} \in{\varGamma}} \right\},$$
(11)
$${S}\left( {K} \right): = \left\{ {{\text{polynomials}}\;{\text{of}}\;{\text{degree}}\;{\text{at}}\;{\text{most}}\;{k}\;{\text{in}}} \right.\;\left. {{\text{each}}\;{\text{variables}}\;{\text{on}}\;{K}} \right\}.$$
(12)
The method involves finding $$({\user2{q}}_{{\user2{N}}} ,u_{N} ) \in (M_{N} \times V_{N} )$$ such that
$$\int_{\varOmega } {{\user2{q}}_{{\user2{N}}} \cdot {\user2{r}}{\text{d}}x{\text{d}}y} = {\oint }_{\varGamma } \hat{u}_{N} {\user2{r}} \cdot {\user2{n}}_{\text{K}} {\text{d}}s - \int_{\varOmega } {u_{N} \nabla \cdot {\user2{r}}{\text{d}}x{\text{d}}y} ,$$
(13)
$$\int_{{\varOmega }} {{\user2{q}}_{{\user2{N}}} \cdot \nabla v{\text{d}}x{\text{d}}y} = {\oint }_{\varGamma } v{\hat{\user2{q}}}_{{\user2{N}}} \cdot {\user2{n}}_{\text{K}} {\text{d}}s + \int_{{\varOmega }} {{f} v{\text{d}}x{\text{d}}y} .$$
(14)
To complete the definition of the LDG method, we need to introduce some notations. Here, n K denotes the unit outward normal to $$\partial {K}$$. The functions $$\hat{u}_{N}$$ and $${\hat{\user2{q}}}_{{\user2{N}}}$$ are the numerical fluxes. Let $${K}^{ + }$$ and $$K^{ - }$$ be two adjacent element of Γ; Let x be an arbitrary point of the (d–1) dimension face $$e = {K}^{ + } \cap {K}^{ - } ,$$ let $${\user2{n}}^{ + }$$ and $${\user2{n}}^{ - }$$ be corresponding outward unit normals at that point. Let $$({\user2{q}},u)$$ on e be the interior of $${K}^{ \pm }$$. The mean values $$\left\{ {\left\{ \cdot \right\}} \right\}$$ and jump $$[\kern-0.15em[ \cdot ]\kern-0.15em]$$ of a function u and a vector q at (x, y) on an edge Γ are defined as
$$\left\{ {\left\{ u \right\}} \right\} = \left( {u^{ + } + u^{ - } } \right)/2,\;\;\;\;\;\left\{ {\left\{ {\user2{q}} \right\}} \right\} = \left( {{\user2{q}}^{{{ + }}} + {\user2{q}}^{ - } } \right)/2,$$
(15)
$$[\kern-0.15em[ u ]\kern-0.15em] = \left( {u^{ + } \cdot {\user2{n}}^{{{ + }}} + u^{ - } \cdot {\user2{n}}^{ - } } \right)/2,\;\;\; [\kern-0.15em[ {\user2{q}} ]\kern-0.15em] = \left( {{\user2{q}}^{{{ + }}} \cdot {\user2{n}}^{{{ + }}} + {\user2{q}}^{ - } \cdot {\user2{n}}^{ - } } \right)/2.$$
(16)
We are now ready to introduce the expressions that define the numerical fluxes. If $$e$$ is inside domain $${\varOmega}$$, we take
$$\begin{array}{*{20}c} {{\hat{\user2{q}}}: = \left\{ {\left\{ {\user2{q}} \right\}} \right\} - C_{ 1 1} [\kern-0.15em[ u ]\kern-0.15em] - {\user2{C}}_{ 1 2} \cdot [\kern-0.15em[ {\user2{q}} ]\kern-0.15em] ,} \\ {\hat{u}: = \left\{ {\left\{ u \right\}} \right\} + {\user2{C}}_{ 1 2} \cdot [\kern-0.15em[ u ]\kern-0.15em] .} \\ \end{array}$$
(17)
Further, if e lies on the boundary of $${\varOmega}$$,
$${\hat{\user2{q}}}: = \left\{ {\begin{array}{*{20}l} {{\user2{q}}^{{\user2{ + }}} - C_{ 1 1} \left( {u^{ + } - g_{N} } \right){\user2{n}},\quad {\text{on}}\;{\varGamma}_{D} ,} \hfill \\ {{\user2{g}}_{N} ,\quad {\text{on}}\;{\varGamma}_{N} ,} \hfill \\ \end{array} } \right.$$
(18)
$$\hat{u}: = \left\{ {\begin{array}{*{20}l} {g_{D}, \quad {\text{on}}\;{\varGamma}_{D} ,} \hfill \\ {u^{ + }, \quad {\text{on}}\;{\varGamma}_{N} .} \hfill \\ \end{array} } \right.$$
(19)
In the LDG method, stabilization parameter C11 and auxiliary parameter C12 are defined on each face e as follows:
$$C_{ 1 1} = \left( {\frac{ 1}{h}} \right)^{\alpha } ,\;\;\;{\user2{C}}_{ 1 2} \cdot {\user2{n}} = {\text{sign}}\left( {{\user2{v}} \cdot {\user2{n}}} \right)/2,$$
(20)
where v is an arbitrary but fixed vector with nonzero components.
We also define the artificial outflow boundary as
$$\partial{\varOmega}^{ + } = \left\{ {\left( {x,y} \right) \in \partial{\varOmega}\left| {{\user2{v}} \cdot {\user2{n}}} \right. \ge 0} \right\}.$$
(21)
Then the artificial inflow can be expressed as
$$\partial{\varOmega}^{ - } = \partial{\varOmega}\backslash \partial{\varOmega}^{ + } .$$
(22)

The addition of the artificial outflow boundary $$\partial{\varOmega}^{ + }$$ and artificial inflow boundary $$\partial{\varOmega}^{ - }$$ equals the total boundary $$\partial{\varOmega}$$. In this paper, $$v = (1,1)^{t} ,$$ and then, the east boundary and the north boundary form the artificial outflow boundary.

In numerical calculation, numerical polynomial solution U in each element is approximated using different elements as
$$U_{h} = \mathop \sum \limits_{i = 1}^{N} U_{\rm i} \left( t \right)B_{\rm i} \left( x \right).$$
(23)

## 3 New Immersed Boundary Method

The numerical procedure we use is as follows:
1. 1.

Detect the boundary and determine boundary cells. Record intersection of the boundary and the cells.

2. 2.

Detect the ghost cells in the boundary cells, and record the type of the boundary.

3. 3.

Restructure the ghost cells to impose the boundary condition implicitly.

4. 4.

Solve the equations iteratively using the successive substitution method.

5. 5.

Repeat step (3) and step (4) until the convergence is achieved.

Here, the boundary cell is the cell cut by the boundary and recording the coordinates of the intersection aids preparing for the following reconstruction. All cells are divided into two categories: physical cells and ghost cells. The cell is a ghost cell when the cell center is outside the calculation domain, and when the cell center is within the domain, it is a physical cell. The cell categories are shown in Figure 1.

The cell is a physical cell when the volume fraction out of the calculation domain ranges from 0% to 50%. Cell A is the cell whose the volume fraction equals 0%, and the edge of the cell coincide with the boundary. Therefore, cell A has the smallest error. Cell B is a cell whose the volume fraction is from 0% to 50%. Although the boundary also is imposed on the cell, the edge of the cell does not coincide with the boundary. Cells A and B belong to the physical cell category, and the other three cells are the ghost cells. Cell E is the ghost cell whose the volume fraction equals 100% and this type of cell only has one intersection with the boundary. The neighbor cell of Cell E has no physical cell, and so, cell E has no influence on the calculation. Cell C is the ghost cell that the volume fraction equals to 50% and has biggest influence on calculation domain. Therefore, cell C has the biggest error. Cell D is the ghost cell that the volume fraction is from 50% to 100%. After the above analysis, the arrows in Figure 1 denote the directions of increasing error

In our procedure, calculation occurs in the physical cell when updating the data and the ghost cell is only used for imposing the boundary conditions through the reconstruction. Therefore before updating the data, we must reconstruct the ghost cell.

We employ the information of the ghost node in the ghost cell to restructure the numerical polynomial solution of the LDG method. The procedure of reconstruction involves two steps: identifying the information of the ghost cell and reconstruction

### 3.1 Identify the Information of the Ghost Cell

The method is depicted in Figure 2. To reconstruct the numerical polynomial solution in the ghost cell, we need information of boundary node X and flow node G. To avoid the numerical instability, the boundary node is chosen. Now, we identify flow node G.

We first determine the position of the ghost node. The outward normal vector on boundary node X should be specified, and then the vector is rotated α° clockwise and then α° anticlockwise. When α° is a different value, there are different odd directions. Then, the positions of the ghost nodes are ascertained at a distance R from boundary node X in the different directions. To minimize the property of numerical instability, the ghost node is chosen symmetrically.

Second, we locate the image of the node inside the flow domain using the boundary and intersection of the boundary. Nodes $$G^{\prime}_{0}$$, $$G^{\prime}_{1}$$, $$G_{2}^{\prime }$$ are the images of ghost nodes $$G^{\prime}_{0}$$, $$G^{\prime}_{1}$$, $$G_{2}^{\prime }$$, and nodes M1, $$X$$, $$M_{2}$$ are the boundary intersection as shown in Figure 2. Flow variables $$\varphi^{\prime}$$ of nodes $$G^{\prime}_{0}$$, $$G^{\prime}_{1}$$, $$G_{2}^{\prime }$$ are evaluated using Eq. (3), and the value $$\varphi_{0}$$ of the intersection ($$G^{\prime}_{0}$$, $$G^{\prime}_{1}$$, $$G_{2}^{\prime }$$) is evaluated using boundary condition. The value at the ghost node is then $$\varphi_{G} = 2\varphi_{0} - \varphi^{\prime}$$.

After the information of ghost cell and boundary node is obtained, we can start the reconstruction of the numerical polynomial solution.

### 3.2 Reconstruction

The reconstruction is decided by the shape function of the LDG method
$$U_{h} = {\user2{UB}}$$
(24)
where $${\user2{U}} = \left( {u_{0} ,u_{1} , \ldots ,u_{N} } \right)^{\text{T}}$$ and $${\user2{B}} = \left( {B_{1} ,B_{2} , \ldots ,B_{N} } \right)^{\text{T}} .$$
The coefficients can be expressed in terms of the nodal values:
$${\user2{U}} = {\user2{A}}^{ - 1} {\user2{U}}_{h} ,\;\;\;\;{\user2{U}}_{h} = \left( {U_{ 0} ,U_{ 1} , \ldots ,U_{N} } \right)^{\text{T}} ,$$
(25)
where $${\user2{U}}_{h}$$ is the vector of three values, and for linear interpolation, A is an $$N \times N$$ matrix whose elements can be computed from the coordinates of the three nodes, when the velocity at the boundary is specified.
$${\user2{A}} = \left[ {\begin{array}{*{20}c} {B_{1}^{1} (x_{1} ,y_{1} )} & {B_{2}^{1} (x_{1} ,y_{1} )} & \ldots & {B_{N}^{1} (x_{1} ,y_{1} )} \\ {B_{1}^{2} (x_{2} ,y_{2} )} & {B_{2}^{2} (x_{2} ,y_{2} )} & \ldots & {B_{N}^{2} (x_{2} ,y_{2} )} \\ \vdots & \vdots & \vdots & \vdots \\ {B_{1}^{N} (x_{N} ,y_{N} )} & {B_{2}^{N} (x_{N} ,y_{N} )} & \ldots & {B_{N}^{N} (x_{N} ,y_{N} )} \\ \end{array} } \right].$$
(26)
where $$(x_{1} ,y_{1} )$$, $$(x_{2} ,y_{2} )$$ and $$(x_{N} ,y_{N} )$$ are the coordinates of the boundary node or the ghost nodes. To minimize the property of the numerical instability, the ghost nodes should be chosen symmetrically.

## 4 Numerical Example

In the numerical experiment, the shape function is the first-order Legendre shape function and multi-dimensional polynomials are formed by “tensor-product” approximations to preserve the orthogonal property for mass matrices. All the meshes are generated by the same code of the adaptive Cartesian grid. The interested reader can refer to the books of Samet for more details.

We compute the $${\text{L}}^{2}$$-norm error, $${\text{L}}^{\infty }$$-norm error and the order of convergence.

The $${\text{L}}^{2}$$-norm error measure is given by
$$\left\| {e\left( x \right)} \right\|_{{{\text{L}}^{2} }} = \left\| {u\left( x \right) - u_{\rm h} \left( x \right)} \right\|_{{{\text{L}}^{2} }} = \left( {\mathop \int \limits_{{\varOmega}} \left| {u\left( x \right) - u_{\rm h} \left( x \right)} \right|^{2} {\text{d}}v} \right)^{{\frac{1}{2}}}$$
(27)
The L-norm error measure is given by
$$\left\| {e(x)} \right\|_{{({\text{L}}^{\infty } )}} = \left\| {u(x) - u_{\rm h} (x)} \right\|_{{({\text{L}}^{\infty } )}} = \hbox{max} |u(x) - u_{\rm h} (x)|.$$
(28)
We consider the linear diffusion problem
$$- \Delta u = \text{f} \left( {x ,\;y} \right) ,\left( {x ,\;y} \right) \in{\varOmega}= \left( {0 ,0.32} \right)^{2} ,$$
(29)
and select the boundary condition and $${f} \left( {x ,\;y} \right)$$, such that the true solution is
$$u\left( {x,y} \right) = e^{x + y} .$$
(30)

The gradient is defined as $${\user2{q}} = (q_{1} ,q_{2} )$$. Because of the symmetry of the problem, the orders and error of convergence are same for q1 and q2. In the table, we show only the error and orders of q1. $$N_{B}$$ denotes the number of boundary cells: $$N_{S}$$ denotes the number of starting cells, $$N_{G}$$ denotes the number of ghost cells, and $$N_{T}$$ denotes the number of the total cells.

### 4.1 Boundary Condition is Imposed Through Numerical Fluxes

In this example, the boundary cell and boundary are as shown in Figures 3(a) and 3(b), and the numbers of the different types of cells are presented in Table 1. We can see that there is no ghost cell in the boundary cell and cell A is only the ghost cell. Figures 3(c) and 3(d) show the distribution of the error and u. There is the maximum error in the artificial outflow boundary. The type of the boundary cell is presented in Table 1. There is no ghost cell and all boundary cells are cell A. It does not need reconstruction and the boundary condition is imposed through numerical fluxes.
Table 1

Numbers of cells with different starting cells

i

N s

N B

N G

N T

1

20 × 20

316

0

2740

2

30 × 30

476

0

4560

3

40 × 40

636

0

6580

4

50 × 50

796

0

8800

5

60 × 60

950

0

11220

6

80 × 80

1276

0

16660

The error and convergence rate are presented in Table 2. We observe that L and L2 in q achieve 3.5th and 2.0th order super convergence and that L and L2 in u all achieve 1.5th order super convergence.
Table 2

Errors and orders of convergence on different cells

i

q 1

u

L

Order

L2

Order

L

Order

L2

Order

1

2.55 × 10−5

8.79 × 10−5

4.63 × 10−3

7.17 × 10−4

2

1.05 × 10−5

3.48

4.72 × 10−5

2.44

3.10 × 10−3

1.58

4.81 × 10−4

1.57

3

5.51 × 10−6

3.51

3.05 × 10−5

2.39

2.32 × 10−3

1.56

3.63 × 10−4

1.54

4

3.30 × 10−6

3.53

2.17 × 10−5

2.33

1.87 × 10−3

1.53

2.91 × 10−4

1.51

5

2.14 × 10−6

3.57

1.65 × 10−5

2.28

1.56 × 10−3

1.49

2.43 × 10−4

1.48

6

1.04 × 10−6

3.66

1.07 × 10−5

2.20

1.17 × 10−3

1.45

1.83 × 10−4

1.44

### 4.2 Boundary Condition is Imposed Through Reconstruction

In this example, Figures 4(a) and 4(b) show the boundary cell and boundary. The boundary cell includes three categories: Cells A, C and E. Cells A and E are the ghost cells and Cell C is the physical cell. Cells A and E have no influence on imposing the boundary condition. The boundary condition is imposed through reconstruction in Cell C. The numbers of the different type cell is listed in Table 3. There are more boundary cells and total cells than those in Section 4.1 and the boundary is more complicated. From Figure 4(c), we can see that the maximum error is in the artificial outflow boundary. From Figure 4(d), we can see that there is a smooth curve in distribution in u instead of linear distribution described in Section 4.1. This shows that the error is larger.
Table 3

Numbers of cells with different starting cells

i

N s

N B

N G

N T

1

20 × 20

472

316

1804

2

30 × 30

712

476

3020

3

40 × 40

952

636

4300

4

50 × 50

1192

796

5680

5

60 × 60

1432

956

7160

6

80 × 80

1912

1276

10420

The error and order of convergence are listed in Table 4, and we observe that the convergence order of L and L2 in u is the 1.5th order, and it is equal to that described in the Section 4.1. The convergence order of L and L2 in q reach 1.5th and 2.0th order super convergence and the values are is lower than the case described in Section 4.1.
Table 4

Errors and orders of convergence on different cells

i

q 1

u

L

Order

L2

Order

L

Order

L2

Order

1

1.59 × 10−4

2.21 × 10−4

3.85 × 10−2

5.10 × 10−3

2

9.94 × 10−5

1.84

1.21 × 10−4

2.35

2.63 × 10−2

1.49

3.48 × 10−3

1.50

3

7.23 × 10−5

1.75

7.89 × 10−5

2.35

2.00 × 10−2

1.50

2.64 × 10−3

1.51

4

5.68 × 10−5

1.68

5.66 × 10−5

2.31

1.61 × 10−2

1.49

2.13 × 10−3

1.50

5

4.68 × 10−5

1.62

4.31 × 10−5

2.28

1.35 × 10−2

1.47

1.78 × 10−3

1.47

6

3.46 × 10−5

1.56

2.80 × 10−5

2.22

1.02 × 10−2

1.44

1.35 × 10−3

1.44

### 4.3 Boundary Condition is Imposed Hybrid

In this example, the boundary is a curve, and the category of the boundary cell is generated automatically according to the generation algorithm of the adaptive Cartesian grid. It tests the error and super convergence at the arbitrary boundary and here we hope to find the impact factors of error change. The manner of imposing the boundary condition depends on the type of the boundary.

A circular boundary is chosen because the slope varies from − ∞ to + ∞. Magnified views are shown in Figures 5(a) and 5(b). There are all types of boundary cells, and it difficult to distinguish every cell. The number of cells is listed in Table 5. The numbers of the boundary cell, ghost cell and total cell in this example lie between the corresponding numbers for the examples in Sections 4.1 and 4.2.
Table 5

Numbers of the cells for different starting cell

i

N s

N B

N G

N T

1

20 × 20

324

156

2072

2

30 × 30

484

220

3352

3

40 × 40

644

288

4808

4

50 × 50

811

383

6587

5

60 × 60

964

456

8760

6

80 × 80

1284

572

12124

In Figure 5(c), there is the maximum error in boundary, but it is more complicated than in the previous two examples. From Figure 5(d), it is clear that the distribution in u is better than that in Section 4.2.

The error and convergence order are listed in Tables 6 and 7. It is obvious than the error lies between the error in the two example above. Good convergence rate is achieved. The error decreases with the increase of grid number, but it is abnormal that the order of the convergence oscillates. We need to analyze the reason for this oscillation.
Table 6

Errors and orders of convergence on the different cell with the Dirichlet boundary

i

q 1

u

L

Order

L2

Order

L

Order

L2

Order

1

1.05 × 10−4

1.27 × 10−4

8.39 × 10−3

6.75 × 10−4

2

3.63 × 10−4

− 5.05

6.83 × 10−5

2.52

5.31 × 10−3

1.86

3.34 × 10−4

2.87

3

8.76 × 10−5

7.48

4.59 × 10−5

2.09

4.93 × 10−3

0.39

2.61 × 10−4

1.29

4

4.82 × 10−5

3.94

3.27 × 10−5

2.22

5.21 × 10−3

− 0.36

2.18 × 10−4

1.20

5

1.22 × 10−5

9.44

2.51 × 10−5

1.83

4.85 × 10−3

0.48

1.71 × 10−4

1.67

1.22 × 10−5

0.00

1.62 × 10−5

2.65

3.15 × 10−3

2.62

1.02 × 10−4

3.15

Table 7

Errors and orders of convergence on the different cell with the Neumann boundary

i

q 1

u

L

Order

L2

Order

L

Order

L2

Order

1

1.25 × 10−4

1.25 × 10−4

8.65 × 10−3

7.06 × 10−4

2

3.59 × 10−4

− 4.33

6.72 × 10−5

2.48

5.32 × 10−3

1.99

3.56 × 10−4

3.05

3

5.80 × 10−5

9.60

4.51 × 10−5

2.10

5.22 × 10−3

0.10

2.83 × 10−4

1.20

4

4.51 × 10−5

1.66

3.22 × 10−5

2.23

5.70 × 10−3

− 0.57

2.33 × 10−4

1.26

5

2.92 × 10−5

2.99

2.48 × 10−5

1.79

5.30 × 10−3

0.50

1.86 × 10−4

1.58

6

2.77 × 10−7

28.21

1.59 × 10−5

2.69

3.23 × 10−3

3.00

1.11 × 10−4

3.10

In Figure 4(b), the boundary cell includes a variety of cells, and it is obvious that Cells B and D form the large majority. According to the algorithm of the adaptive Cartesian grid, the number of every cell is out of control. If the total number of the cell is increasing, all physical cells infinitely approach Cell A, and the error of all ghost cell must be lower than that of cell.

The percentage of ghost cells decreases with an increase in the starting cell as shown in Figure 6, and the error decreases with increase in the total number of cells as shown in Figure 7. It is clear that the error in the complex geometries is close to that in the case that the grid comprise only all physical cells.

The conclusion is derived that the algorithm works well in complex geometries and that the change in the percentage of different cells is the main cause of the oscillation of the order of convergence.

## 5 Conclusions

1. 1.

The traditional IBM applied to the numerical construction of discrete points is developed for the new IBM applied to the reconstruction of the distribution function in LDG method.

2. 2.

The numerical performance of the LDG method is studied in the grid with a hanging node (the adaptive Cartesian grid). The numerical result shows that the method works well.

3. 3.

The boundary condition is imposed through a combination of the numerical flow and reconstruction of distribution function in LDG method. When the boundary condition is imposed through numerical fluxes, the error is minimum. When the boundary condition is imposed through reconstruction, the error is maximum.

4. 4.

From error distribution, the maximum error of the variable always exists at the boundary. Neither reconstruction nor numerical fluxes is directly imposed on the condition in a finite volume method or a finite element method. This is the main reason for the difference in error distribution compared with the classical numerical methods.

5. 5.

The presented method works well in complex geometries. The error and convergence rate are adopted for evaluating the accuracy. The error depends on the number and type of the cell and is always near the physical cell.

## Notes

### Authors’ Contributions

Y-YZ and X-JZ was in charge of the whole trial; X-JZ wrote the manuscript; X-JZ, Y-SZ and KY assisted with sampling and laboratory analyses. All authors read and approved the final manuscript.

## Authors’ Information

Xu-Jiu Zhang, born in 1980, is currently a PhD candidate at Key Laboratory of Education Ministry for Modern Design and Rotor-bearing System, Xi’an Jiaotong University, China. His research interest is mechanical calculation of the fluid. E-mail: zhangxuj@stu.xjtu.edu.cn.

Yong-Sheng Zhu, born in 1973, is currently a professor at Key Laboratory of Education Ministry for Modern Design and Rotor-bearing System, Xi’an Jiaotong University, China. His main research interests include bearing, rotor bearing system theoretical calculation and operation of the status of monitoring and other aspects of the study. E-mail: yszhu@mail.xjtu.edu.cn.

Ke Yan, born in 1984, is currently associate professor at Key Laboratory of Education Ministry for Modern Design and Rotor-bearing System, Xi’an Jiaotong University, China. His main research interests include the rolling bearing and rotor shaft thermal characteristic design, lubrication mechanism and the realization technology. E-mail: yanke@mail.xjtu.edu.cn.

You-Yun Zhang, born in 1947, is currently an associate professor at Key Laboratory of Education Ministry for Modern Design and Rotor-bearing System, Xi’an Jiaotong University, China. Her main research interests include equipment condition monitoring and fault diagnosis and bearing rotor dynamics. E-mail: yyzhang1@mail.xjtu.edu.cn.

## Competing Interests

The authors declare no competing financial interests.

Not applicable.

## Funding

Supported by National Natural Science Foundation of China (Grant No. 51405375) and National Key Basic Research and Development Program of China (973 Program, Grant No. 2011CB706606).

## Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## References

1. 1.
T Kajishima, K Taira. Immersed boundary methods. Computational Fluid Dynamics, Springer International Publishing, 2017.
2. 2.
E A Fadlun, R Verzicco, P Orlandi, et al. Combined immersed –boundary finite difference methods for three–dimensional complex flow simulation. Journal of Computational Physics, 2000, 161(1): 35-60.
3. 3.
Y H Tseng, J H Ferziger. A ghost-cell immersed boundary method forflow in complex geometry. Journal of Computational Physics, 2003,192(2): 593-623.
4. 4.
R Verzicco, M Fatica, G Iaccarino, et al. Flow in an impeller-stirred tank using an immersed-boundary method. Aiche Journal, 2004, 50(6): 1109-1118.
5. 5.
R Mittal, H Dong, M Bozkurttas, et al. A versatile sharp interface immersed boundary method for incompressible flows with complex boundaries. Journal of Computational Physics, 2008, 227(10): 4825- 4852.
6. 6.
T Gao, Y H Tseng, X Y Lu. An improved hybrid Cartesian/immersed boundary method for fluid–solid flows. International Journal for Numerical Methods in Fluids, 2007, 55(12): 1189-1211.
7. 7.
A F Shinn, M A Goodwin, S P Vanka. Immersed boundary computations of shear- and buoyancy-driven flows in complex enclosures. International Journal of Heat and Mass Transfer, 2009, 52(17-18): 4082-4089.
8. 8.
J Lee, D You. An implicit ghost-cell immersed boundary method for simulations of moving body problems with control of spurious force oscillations. Journal of Computational Physics, 2013, 233: 295-314.
9. 9.
O Hu, N Zhao, J M Liu. A ghost cell method for turbulent compressible viscous flows on adaptive Cartesian grids. Procedia Engineering, 2013, 67: 241-249.
10. 10.
J X Jun, K Luo, J R Fan. A ghost- cell based high- order immersed boundary method for inter-phase heat transfer simulation. International Journal of Heat and Mass Transfer, 2014, 75: 302-312.
11. 11.
K Luo, C Mao, Z Zhuang, et al. A ghost-cell immersed boundary method for the simulations of heat transfer incompressible flows under different boundary conditions Part-II: Complex geometries. International Journal of Heat & Mass Transfer, 2017, 104: 98-111.
12. 12.
K Luo, Z Zhuang, J Fan, et al. A ghost-cell immersed boundary method for simulations of heat transfer in compressible flows under different boundary conditions. International Journal of Heat & Mass Transfer, 2016, 92: 708-717.
13. 13.
M Wang, Y T Feng, G N Pande, et al. Numerical modelling of fluid-induced soil erosion in granular filters using a coupled bonded particle lattice Boltzmann method. Computers & Geotechnics, 2017, 82: 134-143.
14. 14.
R Y Li, C M Xie, Huang W X, et al. An efficient immersed boundary projection method for flow over complex/moving boundaries. Computers & Fluids, 2016,140: 122-135.
15. 15.
C Zhu, H Luo, G Li. High-order immersed-boundary method for incompressible flows. AIAA Journal, 2016: 1-8.Google Scholar
16. 16.
M Kumar, S Roy. Immersed boundary method simulation of natural convection over fixed and oscillating cylinders in square enclosure. International Journal of Heat & Fluid Flow, 2016, 61: 407-424.
17. 17.
B Cockburn, G Kanschat, I Perugia, et al. Super convergence of the local discontinuous Galerkin method for elliptic problems on Cartesian grids. SIAM J. NUMER. ANAL, 1998, 39(1): 264-285.Google Scholar
18. 18.
S Adjerid, M Baccouch. A superconvergent local discontinuous Galerkin method for elliptic problems. J. Sci. Comput., 2012, 52: 113-152.
19. 19.
M Bacouch, S Adjerid. A posteriori LDG error estimation for two dimensional convection - diffusion problems. Journal of Scientific Computing, 2015, 62(2): 399-430.
20. 20.
Z Zhang, Z Xie, Z Zhang. Super convergence of discontinuous Galerkin methods for convection-diffusion problems. Journal of Scientific Computing, 2009, 41(1): 70-93.
21. 21.
T P Fries, A Byfut A Alizada. Hanging nodes and XFEM. International Journal for Numerical Methods in Engineering, 2011, 86(4-5): 404-430.
22. 22.
A R Owens, J A Welch J Kópházi. Discontinuous isogeometric analysis methods for the first-order form of the neutron transport equation with discrete ordinate (SN) angular discretisation. Computer Methods in Applied Mechanics & Engineering, 2016, 315: 501-535.
23. 23.
Q Liang. A simplified adaptive Cartesian grid system for solving the 2D shallow water equations. International Journal for Numerical Methods in Fluids, 2012, 69(2): 442–458.
24. 24.
D G Dommermuth, M Sussman, R F Beck, et al. The numerical simulation of ship waves using Cartesian grid methods with adaptive mesh refinement. Physics, 2014, 18(5): 597-605.Google Scholar
25. 25.
C Min, F Gibou. A second order accurate projection method for the incompressible Navier-Stokes equations on non-graded adaptive grids. J. Compute. Phys, 2006, 219: 912-929.

## Authors and Affiliations

1. 1.Key Laboratory of Education Ministry for Modern Design & Rotor-Bearing SystemXi’an Jiaotong UniversityXi’anChina