# Simple and High-Accurate Schemes for Hyperbolic Conservation Laws

Authors: Renzhong Feng; Zheng Wang
Journal: Journal of Applied Mathematics
 (2014)

---

## Abstract

The paper constructs a class of simple high-accurate schemes (SHA schemes) with third order approximation accuracy in both space and time to solve linear hyperbolic equations, using linear data reconstruction and Lax-Wendroff scheme. The schemes can be made even fourth order accurate with special choice of parameter. In order to avoid spurious oscillations in the vicinity of strong gradients, we make the SHA schemes total variation diminishing ones (TVD schemes for short) by setting flux limiter in their numerical fluxes and then extend these schemes to solve nonlinear Burgers’ equation and Euler equations. The numerical examples show that these schemes give high order of accuracy and high resolution results. The advantages of these schemes are their simplicity and high order of accuracy.


---

## Body

## 1. Introduction

In designing numerical schemes of very high order of accuracy for solving hyperbolic conservation laws one faces at least three major difficulties. One of them concerns the preservation of high accuracy in both space and time for multidimensional problems. Another one concerns conservation; this is mandatory in the presence of shock waves. The other very important issue relates to the generation of spurious oscillations in the vicinity of strong gradients. According to Godunov’s theorem [1] these are unavoidable by linear schemes of accuracy greater than one. Each one of these difficulties is in itself not easy to resolve; the simultaneous resolution of all three difficulties above represents a formidable task in the numerical analysis of hyperbolic conservation laws. At present, there are various approaches for constructing numerical schemes that attempt to overcome the above difficulties. State-of-the-art very high order methods (at least third order) for hyperbolic conservation laws include the class of ENO/WENO schemes [2–4], Spectral Method [5], the class of Compact Difference Methods [6], Discontinuous Galerkin Finite Element Methods [7], and ADER Methods [8]. These schemes meet the requirement of very high order spatial accuracy; matching time accuracy to space accuracy, however, remains an issue in all of the above approaches. As regards the ENO/WENO/MPWENO approach, the most accurate scheme reported so far uses 9th order spatial discretisation with Runge-Kutta methods for time evolution. To avoid spurious oscillations these Runge-Kutta methods must be TVD. This leads to accuracy barriers: the accuracy of such methods cannot be higher than fifth. Moreover, fourth and fifth order methods are quite complicated and have reduced stability range. In most practical implementation reported, when the solution is not smooth, a third order TVD Runge-Kutta method has been used, for example, [2]. Although increased order of spatial discretization improves accuracy for some problems, such schemes converge with third order only when the mesh is refined. Therefore when numerical simulation of compressible turbulence and wave propagation problems involves long-time evolution, it would be beneficial to use schemes which are simple and efficient and converge with higher order both in time and space.How to construct simple and high-accurate schemes in both space and time by simple approach is an interesting work. There are various ways to construct high order numerical schemes for conservation laws. One of them is the MUSCL (Monotone Upstream-Centred Scheme for Conservation Laws) [9–11] approach which is a very popular and simple one to construct explicit, fully discrete schemes that lies on the solution of Riemann problem and could be extended to nonlinear systems. The MUSCL-type methods based on piecewise linear, local reconstruction of data are 2nd order of accuracy and their available highest order is 3rd for linear advection equation. In this paper, we generalize the MUSCL approach by modifying the piecewise linear reconstruction with a gradual slope, solving a Riemann problem at each interface and using Lax-Wendroff approach to compute the numerical flux. The new schemes constructed can reach 3rd order of accuracy in time and space, and its available highest order of accuracy is 4th. The flux limiter approach is used to obtain TVD version of the new schemes to avoid unphysical oscillations in the vicinity of large gradients.The rest of the paper is organized as follows. In Section2 we describe the construction of the class of schemes SHA for linear advection equation and prove its convergent order; next we set the limiter to the fluxes of these schemes to make them TVD ones in Section 3 and carry out some numerical examples in Section 4 and then extend them to solve nonlinear Burgers' equation in Section 5 and carry out some numerical examples in Section 6 and finally apply the schemes to solve one-dimensional Euler equations in Section 7. The conclusions are drawn in Section 8.


## 2. The Construction of Simple High-Accurate Schemes (SHA Schemes) for Advection Equations

In this section we consider the Initial Boundary Value Problem (IBVP) for the linear advection equation in the domain[0,L]×[0,T] on the x-t plane. This consists of a PDE together with initial condition (IC) and boundary conditions (BCs); namely,
(1)ut+(au)x=0,x∈(0,L),u(x,0)=u0(x),x∈(0,L),
with suitable boundary conditions.A mesh for discretizing the domain is a regular grid of dimensionΔx (spacing of grid points in the x-direction) by Δt (spacing in the t-direction). We suppose that [0,L] is discretized by M+1 equally spaced grid points. Then
(2)Δx=LM.
The mesh points of the mesh are positioned at (iΔx,nΔt) on the x-t plane, with i=0,1,…,M and n=0,1,…. We will use the notation xi=iΔx, tn=nΔt. The discrete values of the function u(x,t) at (iΔx,nΔt) will be denoted by
(3)uin≡u(iΔx,nΔt)≡u(xi,tn).
We will also use the symbol uin to denote an approximation to the exact mesh value u(iΔx,nΔt). The distinction will be made at appropriate places.We could construct a class of simple high-accurate schemes (SHA schemes) for advection equation as follows.Step 1.
Data reconstruction with boundary extrapolated values(4)ui(x)=uin+23x-xiΔxΔi,x∈[xi-1/2,xi+1/2].
We choose uiL=uin-(1/3)Δi, uiR=uin+(1/3)Δi, where
(5)Δi=12(1+ω)Δui-1/2+12(1-ω)Δui+1/2,ω∈[-1,1],Δui+1/2=ui+1n-uin.Step 2.
Consider evolution ofuiL, uiR by a time (1/2)Δt according to
(6)u-iL=uiL+12ΔtΔx[f(uiL)-f(uiR)],u-iR=uiR+12ΔtΔx[f(uiL)-f(uiR)].Step 3.
Solution of piecewise constant data Riemann problem(7)ut+f(u)x=0,u(x,0)={u-iRx-xi+1/2<0,u-i+1Lx-xi+1/2>0.
This step solves the conventional Riemann problem at the interface xi+1/2 with data
(8)(u-iR,u-i+1L),
the solution of which for linear advection equation (1) is
(9)ui+1/2((x-xi+1/2)(t-tn))={u-iR=uin+13(1-c)Δiif(x-xi+1/2)(t-tn)<a,u-i+1L=ui+1n-13(1+c)Δi+1if(x-xi+1/2)(t-tn)>a,
where c=a(Δt/Δx). Then applying the solution (9) to the Lax-Wendroff flux for linear advection equation
(10)fi+1/2L-W=12(1+c)f(uin)+12(1-c)f(ui+1n),
we get a new flux
(11)fi+1/2SHA=12(1+c)f(u-iR)+12(1-c)f(u-i+1L).
After some algebra operations, fi+1/2SHA becomes
(12)fi+1/2SHA=12(1+c)(auin)+12(1-c)(aui+1n)+a6(1-c2)(Δi-Δi+1)=fi+1/2L-W+a6(1-c2)(Δi-Δi+1).
Also, we can substitute (9), the solution of (7), into the following type of L-W flux;(13a)fi+1/2L-W=f(ui+1/2n+1/2),ui+1/2n+1/2=1Δx∫-(1/2)Δx(1/2)Δx‍ui+1/2(x,12Δt)dx
or two-step Richtmyer type flux of L-W method
(13b)fi+1/2L-W=f(ui+1/2n+1/2),ui+1/2n+1/2=12(u-iR+u-i+1L)+12ΔtΔx(fin-fi+1n)to get the flux as (12), where fin=f(u-iR), fi+1n=f(u-i+1L).Conservative Scheme. Substitution of fi+1/2SHA as numerical flux into conservative method gives a new scheme:
(14)uin+1=uin+ΔtΔx(fi-1/2SHA-fi+1/2SHA),
where
(15)fi+1/2SHA=12(1+c)f(u-iR)+12(1-c)f(u-i+1L).
As for linear advection equation f(u)=au, we have
(16)uin+1=uin+ΔtΔx(fi-1/2L-W-fi+1/2L-W)+c6(1-c2)(Δi-1-2Δi+Δi+1).The following introduces a theorem on how to verify the accuracy of a linear scheme:(17)uin+1=∑k=-kLkR‍bkui+kn.Theorem 1 (Roe [12]).
A scheme of the form (17) is pth(p≥0) order accurate in space and time if and only if
(18)∑k=-kLkR‍kqbk=(-c)q,0≤q≤p.According to Roe’s theorem, it is easy to verify that scheme (16) is third order accurate in space and time for any value ω∈[-1,1] and the scheme is fourth order accurate when ω=c/2.


## 3. TVD Version of SHA Scheme

According to Godunov’s Theorem [1] there are no monotone, linear schemes (17) of second or higher order of accuracy. This means that any linear scheme of second or higher is nonmonotone and there will be spurious oscillation in the vicinity of high gradients. The scheme must be modified in order to avoid spurious oscillation near the high gradients. Harten [13] proposed the TVD property of conservation schemes. The numerical solutions will be free from spurious oscillations if the scheme has the TVD property. Now we will modify the SHA method above to a scheme with the TVD property according to Harten’s Theorem.Considering the class of nonlinear schemes(19)uin+1=uin-Ci-1/2Δui-1/2+Di+1/2Δui+1/2,
where Δui+1/2=ui+1-ui and the coefficients Ci-1/2, Di+1/2 are in general assumed to be functions of the data {uin}, Harten had proved the following important result.Theorem 2 (Harten [13]).
For any scheme of the form (19) to solve (1), a sufficient condition for the scheme to be TVD is that the coefficients satisfy
(20)Ci-1/2≥0,Di+1/2≥0,0≤Ci+1/2+Di+1/2≤1.The conservative scheme SHA can be written as follows when applied to linear advection equation:(21)uin+1=uin+ΔtΔx(fi-1/2SHA-fi+1/2SHA),
where
(22)fi+1/2SHA=∑k=-12‍βk(aui+kn),β-1=-112(1-c)(1+c)(1+ω),β0=1+c2(1+13(1-c)ω)+112(1-c)(1+c)(1+ω),β1=112(1-c)(1+c)(1-ω)+1-c2(1-13(1+c)ω),β2=-112(1-c)(1+c)(1-ω).
Thus we obtain
(23)uin+1=uin+ΔtΔx(∑k=-12‍βk(aui-1+kn)-∑k=-12‍βk(aui+kn))=uin-c(β-1Δui-3/2+β0Δui-1/2+β1Δui+1/2+β2Δui+3/2)=uin-c(β-1Δui-3/2Δui-1/2+β0+β1Δui+1/2Δui-1/2+β2Δui+3/2Δui-1/2)Δui-1/2
or
(24)=uin+(-c)(β-1Δui-3/2Δui+1/2+β0Δui-1/2Δui+1/2+β1+β2Δui+3/2Δui+1/2)×Δui+1/2.
Let
(25)Ci-1/2=c(β-1Δui-3/2Δui-1/2+β0Δui-1/2Δui+1/2+β1+β2Δui+3/2Δui+1/2)
or
(26)Di+1/2=-c(β-1Δui-3/2Δui+1/2+β0+β1Δui+1/2Δui-1/2+β2Δui+3/2Δui-1/2).
Then we could modify (23) as(27a)uin+1=uin-L(Ci-1/2)Δui-1/2
or
(27b)uin+1=uin+L(Di+1/2)Δui+1/2,where L is a function
(28)L(z)=max⁡(0,min⁡(1,z)).
Obviously L(Ci-1/2)(orL(Di+1/2))∈[0,1]; schemes (27a) and (27b) modified above are TVD according to Harten’s result. In addition formula (27a) can be rewritten into
(29)uin+1=uin-ΔtΔx(L(Ci-1/2)ΔxΔtuin-L(Ci-1/2)ΔxΔtui-1n).
Formula (27b) also can be done similarly. So it can be seen that the conservativity of the TVD schemes (27a) and (27b) is not destroyed.


## 4. Numerical Experiments for Linear Advection Equation

### 4.1. Accuracy Test for SHA Scheme

In the subsection we first test the order of accuracy of scheme SHA (16). Let us consider the linear equation subject to periodic initial data:
(30)ut+ux=0,u(x,0)=sinπx,x∈[0,1].
This problem admits the global smooth solution that was computed at time t=1 with the varying number of grid points M. In Table 1 the accuracy of the scheme is shown. The table lists the errors at t=1 unit using the fourth order scheme SHA (16) (ω=c/2); notice that we have the full order of accuracy, 4, in both L1 and L∞ norms.Table 1
Initial value problem (30) and L1 and L∞ norms of the errors.
M
L
1-error
Order
L
∞-error
Order
10
1.203897900384131
e
-
002
—
1.860124553555120
e
-
002
—
20
7.747165606962370
e
-
004
3.957
1.216839281057258
e
-
003
3.934
40
4.892558239899294
e
-
005
3.985
7.685201177864975
e
-
005
3.984
80
3.065750738086813
e
-
006
3.996
4.815669996355299
e
-
006
3.996
160
1.917328754602903
e
-
007
3.999
3.011732963263680
e
-
007
3.999


### 4.2. Numerical Experiment I

Next we will use the fourth order scheme SHA (16) (ω=c/2) and TVD schemes (27a) and (27b) to compute the continuous initial value test problem (31) and discontinuous initial value test problem (32) for the linear advection (1). Computed results are shown, respectively, in Figures 1, 3, and 5 and Figures 2, 4, and 6. The first test problem to be solved is
(31)ut+(f(u))x=0,u(x,0)=e-32x2,x∈[-0.5,0.5],
where f(u)=u.Figure 1
SHA method applied to linear advection equation with a continuous initial value; numerical (symbols) and exact (line) solutions are compared att=9 units.Figure 2
SHA method applied to linear advection equation for a square wave; numerical (symbols) and exact (line) solutions are compared att=2 units.Figure 3
SHA method with TVD (27a) applied to linear advection equation with a continuous initial value; numerical (symbols) and exact (line) solutions are compared at t=9 units.Figure 4
SHA method with TVD (27a) applied to linear advection equation for a square wave; numerical (symbols) and exact (line) solutions are compared at t=2 units.Figure 5
SHA method with TVD (27b) applied to linear advection equation with a continuous initial value; numerical (symbols) and exact (line) solutions are compared at t=9 units.Figure 6
SHA method with TVD (27b) applied to linear advection equation for a square wave; numerical (symbols) and exact (line) solutions are compared at t=2 units.In this experiment the Courant numberCFL is c=0.9. Figure 1 shows the excellent behavior of scheme (16) after long time. Figures 3 and 5 show the results computed by scheme (27a) and scheme (27b), respectively, at t=9 units and reveal that schemes ((27a)-(27b)) also have high approximate accuracy to smooth initial problem.


### 4.3. Numerical Experiment II

We solve the same problem as in experiment I, except that we replace the smooth initial condition with a discontinuous initial condition:(32)ut+(f(u))x=0,u(x,0)={0,x≤-0.2,1,-0.2<x<0.2,0,x≥0.2,
where f(u)=u.In experiment II theCFL is still 0.9 and Δx=1/80. Figure 2 shows the result computed by the 4th order scheme SHA (16) (ω=c/2) at t=2 units and reveals the 4th order scheme SHA without TVD products spurious oscillation in the vicinity of discontinuity. Figure 4 shows the result computed by the scheme SHA with TVD (27a) at t=2 units and Figure 6 shows the result computed by scheme (27b) at t=2 units. From the results shown by Figures 4 and 6 we see that schemes (27a) and (27b) both control the spurious oscillation, but the comparison of Figures 4 and 6 reveals that scheme (27b) has better resolution to discontinuous initial problem. The period boundary conditions are used in both experiments I and II.


## 4.1. Accuracy Test for SHA Scheme

In the subsection we first test the order of accuracy of scheme SHA (16). Let us consider the linear equation subject to periodic initial data:
(30)ut+ux=0,u(x,0)=sinπx,x∈[0,1].
This problem admits the global smooth solution that was computed at time t=1 with the varying number of grid points M. In Table 1 the accuracy of the scheme is shown. The table lists the errors at t=1 unit using the fourth order scheme SHA (16) (ω=c/2); notice that we have the full order of accuracy, 4, in both L1 and L∞ norms.Table 1
Initial value problem (30) and L1 and L∞ norms of the errors.
M
L
1-error
Order
L
∞-error
Order
10
1.203897900384131
e
-
002
—
1.860124553555120
e
-
002
—
20
7.747165606962370
e
-
004
3.957
1.216839281057258
e
-
003
3.934
40
4.892558239899294
e
-
005
3.985
7.685201177864975
e
-
005
3.984
80
3.065750738086813
e
-
006
3.996
4.815669996355299
e
-
006
3.996
160
1.917328754602903
e
-
007
3.999
3.011732963263680
e
-
007
3.999


## 4.2. Numerical Experiment I

Next we will use the fourth order scheme SHA (16) (ω=c/2) and TVD schemes (27a) and (27b) to compute the continuous initial value test problem (31) and discontinuous initial value test problem (32) for the linear advection (1). Computed results are shown, respectively, in Figures 1, 3, and 5 and Figures 2, 4, and 6. The first test problem to be solved is
(31)ut+(f(u))x=0,u(x,0)=e-32x2,x∈[-0.5,0.5],
where f(u)=u.Figure 1
SHA method applied to linear advection equation with a continuous initial value; numerical (symbols) and exact (line) solutions are compared att=9 units.Figure 2
SHA method applied to linear advection equation for a square wave; numerical (symbols) and exact (line) solutions are compared att=2 units.Figure 3
SHA method with TVD (27a) applied to linear advection equation with a continuous initial value; numerical (symbols) and exact (line) solutions are compared at t=9 units.Figure 4
SHA method with TVD (27a) applied to linear advection equation for a square wave; numerical (symbols) and exact (line) solutions are compared at t=2 units.Figure 5
SHA method with TVD (27b) applied to linear advection equation with a continuous initial value; numerical (symbols) and exact (line) solutions are compared at t=9 units.Figure 6
SHA method with TVD (27b) applied to linear advection equation for a square wave; numerical (symbols) and exact (line) solutions are compared at t=2 units.In this experiment the Courant numberCFL is c=0.9. Figure 1 shows the excellent behavior of scheme (16) after long time. Figures 3 and 5 show the results computed by scheme (27a) and scheme (27b), respectively, at t=9 units and reveal that schemes ((27a)-(27b)) also have high approximate accuracy to smooth initial problem.


## 4.3. Numerical Experiment II

We solve the same problem as in experiment I, except that we replace the smooth initial condition with a discontinuous initial condition:(32)ut+(f(u))x=0,u(x,0)={0,x≤-0.2,1,-0.2<x<0.2,0,x≥0.2,
where f(u)=u.In experiment II theCFL is still 0.9 and Δx=1/80. Figure 2 shows the result computed by the 4th order scheme SHA (16) (ω=c/2) at t=2 units and reveals the 4th order scheme SHA without TVD products spurious oscillation in the vicinity of discontinuity. Figure 4 shows the result computed by the scheme SHA with TVD (27a) at t=2 units and Figure 6 shows the result computed by scheme (27b) at t=2 units. From the results shown by Figures 4 and 6 we see that schemes (27a) and (27b) both control the spurious oscillation, but the comparison of Figures 4 and 6 reveals that scheme (27b) has better resolution to discontinuous initial problem. The period boundary conditions are used in both experiments I and II.


## 5. The Application of SHA Scheme to Burgers’ Equation

We can see the SHA schemes perform well in solving linear advection equation from the numerical results above. It can reach fourth order accuracy in space and time where the solution is smooth enough and the implementation of the scheme is so easy that the method can be extended to nonlinear conservative laws conveniently.In the following we will extend the schemes to inviscid Burgers’ equation(33)ut+(u22)x=0,x∈(a,b),u(x,0)=u0(x),x∈(a,b),
with suitable boundary conditions.


### 5.1.CFL Number and Numerical Boundary Conditions

Assume that the space[a,b] is divided into M cells Ii=[xi-1/2,xi+1/2]; the spacing of grid points Δx is xi+1/2-xi-1/2, which is L/M. The full discrete conservative formula for the above equation is
(34)uin+1=uin+ΔtΔx(fi-1/2-fi+1/2).
In the application of SHA scheme to the inviscid Burgers’ equation we use the following transmissive boundary conditions:
(35)u0n=u1n,u-1n=u2n,uM+1n=uMn,uM+2n=uM-1n,
to provide numerical fluxes f1/2, fM+1/2. Denoting by Smax⁡n the maximum wave speed throughout the domain at time level n we define the maximum Courant number Ccfl:
(36)Ccfl=ΔtSmax⁡nΔx,
where Δt is such that
(37)0<Ccfl≤1.
The time step Δt follows as
(38)Δt=CcflΔxSmax⁡n,
where
(39)Smax⁡n=max⁡i{Si+1/2n},Si+1/2n={12|uin+ui+1n|,ifuin>ui+1n,(shock)max⁡(|uin|,|ui+1n|),ifuin<ui+1n,(rarefaction).
The calculation of the max wave speed value in (39) needs to use all of the speed values in the cells, including the boundary cells.The Riemann problem for Burgers’ equation is(40)ut+(u22)x=0,u(x,0)={uL,x<0,uR,x>0.
Its exact solution is
(41)ifuL>uR,thenu(x,t)={uL,ifx-St<0,uR,ifx-St>0,whereS=(1/2)(uL+uR);(thespeedofshock)ifuL≤uR,thenu(x,t)={uL,ifxt≤uL,xt,ifuL<xt<uR,uR,ifxt≥uR.


### 5.2. SHA Schemes for Solving Nonlinear Scalar Equation

The high order scheme is constructed as follows.Step 1.
Data reconstruction(42)ui(x)=uin+23x-xiΔxΔi,x∈[xi-1/2,xi+1/2].Δi is the slope on cell i for ui(x), and
(43)Δi=12(1+ω)Δui-1/2+12(1-ω)Δui+1/2,ω∈[-1,1],Δui+1/2=ui+1n-uin.
Then we get the values on the interface of cells:
(44)uiL=ui-13Δi,uiR=ui+13Δi.Step 2.
Consider evolution ofuiL, uiR by a time (1/2)Δt according to
(45)u-iL=uiL+12ΔtΔx[f(uiL)-f(uiR)],u-iR=uiR+12ΔtΔx[f(uiL)-f(uiR)].Step 3.
Solution of piecewise constant data Riemann problem(46)ut+f(u)x=0,u(x,0)={u-iRx-xi+1/2<0,u-i+1Lx-xi+1/2>0.Step 4.
Compute the integral(47)ui+1/2n+1/2=1Δx∫-(1/2)Δx(1/2)Δx‍ui+1/2(x,12Δt)dx.
Then the numerical flux is computed by fi+1/2SHA=f(ui+1/2n+1/2).Theui+1/2n+1/2 is required for computing the numerical flux fi+1/2SHA; that means the integral of the Riemann solution needs to be calculated. The following gives the exact integral with exact Riemann solution of inviscid Burgers’ equation. There are two cases.Case 1.
See Figure7, u-iR>u-i+1L; the shock wave is formed; the exact solution for Riemann problem is
(48)u(x,t)={u-iRifx-St<0,u-i+1Lifx-St>0,
where S=(1/2)(u-iR+u-i+1L). Substitute (48) into (47); then
(49)ui+1/2n+1/2=1Δx∫-(1/2)Δx(1/2)Δx‍ui+1/2(x,12Δt)dx=1Δx(∫-(1/2)ΔxxB‍ui+1/2(x,12Δt)dx+∫xB(1/2)Δx‍ui+1/2(x,12Δt)dx)=1Δx(u-iRlAB+u-i+1LlBC)=1Δx(u-iR(Δx2+Δt2S)+u-i+1L(Δx2-Δt2S))=12(u-iR+u-i+1L)+12ΔtΔx(12(u-iR)2-12(u-i+1L)2).Figure 7
u
-
i
R
>
u
-
i
+
1
L shock wave.Case 2.
See Figure8, u-iR≤u-i+1L, and the solution is a centred rarefaction wave; the exact solution for Riemann problem is
(50)u(x,t)={u-iRifxt≤u-iR,xtifu-iR<xt<u-i+1L,u-i+1Lifxt≥u-i+1L.
Substitute the above solution (50) into (47), then
(51)ui+1/2n+1/2=1Δx∫-(1/2)Δx(1/2)Δx‍ui+1/2(x,12Δt)dx=1Δx(∫xC(12)Δx‍ui+12(x,12Δt)∫-(1/2)ΔxxB‍ui+1/2(x,12Δt)dx+∫xBxC‍ui+1/2(x,12Δt)dx+∫xC(1/2)Δx‍ui+1/2(x,12Δt)dx∫xC(12)Δx‍ui+12(x,12Δt)∫-(12)ΔxxB‍ui+12(x,12Δt))=1Δx(u-iRlAB+u-i+1LlCD+∫xBxC‍x(1/2)Δtdx)=1Δx((12(Δt2u-iR)2-12(Δt2u-i+1L)2)u-iR(Δx2+Δt2u-iR)+u-i+1L(Δx2-Δt2u-i+1L)+2Δt(12(Δt2u-iR)2-12(Δt2u-i+1L)2))=12(u-iR+u-i+1L)+12ΔtΔx(12(u-iR)2-12(u-i+1L)2).
We can get the numerical flux fi+1/2SHA=f(ui+1/2n+1/2) at ith cell interface. As we can see, the flux is the same as two-step Richtmyer flux versions (13a) and (13b). Then we can give the conservative formula for solving Burgers’ equation:
(52)uin+1=uin+ΔtΔx(fi-1/2SHA-fi+1/2SHA).Figure 8
u
-
i
R
≤
u
-
i
+
1
L rarefaction wave.


### 5.3. TVD Version of SHA for Burgers’ Equation

In this section we will construct the TVD version of SHA (52) by the combination of a low order monotone flux fi+1/2LO and a high order flux fi+1/2HI as
(53)fi+1/2=fi+1/2LO+ϕi+1/2[fi+1/2HI-fi+1/2LO],
where ϕi+1/2 is a flux limiter. Here a specific Flux Limiter Centred scheme is constructed by taking
(54)fi+1/2LO=fi+1/2force,fi+1/2HI=fi+1/2SHA,
where fi+1/2force is a First Order Centred scheme and is given as follows for nonlinear systems.A classical scheme of first order accuracy to solve hyperbolic conservation laws is that of Lax-Friedrichs, whose numerical flux at the interface of two statesul, ur is
(55)fi+1/2LF=fi+1/2LF(ul,ur)=12[f(ul)+f(ur)]+12ΔxΔt[ul-ur].
A second order accurate scheme Richtmyer scheme is given by computing a numerical flux
(56)fi+1/2RI=f(ui+1/2RI),
where the intermediate state
(57)ui+1/2RI=ui+1/2RI(ul,ur)=12(ul+ur)+12ΔtΔx[f(ul)-f(ur)].
Hence fi+1/2force is given as
(58)fi+1/2force=fi+1/2force(ul,ur)=12[fi+1/2LF(ul,ur)+fi+1/2RI(ul,ur)].
As we know in [14], the relationship between conventional upwind flux limiters ψ(r) and centred flux limiters ϕ(r) is
(59)ϕ(r)=ϕ^g+(1-ϕ^g)ψ(r),
with
(60)ϕ^g={0,r≤1,ϕg≡(1-Ccfl)(1+Ccfl),r≥1,
where Ccfl is the maximum Courant number. By choosing the upwind flux limiters SUPERBEE [15], VANLEER [16], VANALBADA [17], and MINBEE [15] we can obtain corresponding centred flux limiters. Here we recommend the use of the SUPERBEE flux limiter ψsb to obtain a centred flux limiter:
(61)ϕsb(r)={0,r≤0,2r,0≤r≤12,1,12≤r≤1,min⁡{2,ϕg+(1-ϕg)r},r>1.
Set
(62)ri+1/2L=Δui-1/2Δui+1/2,ri+1/2R=Δui+3/2Δui+1/2.
A single flux limiter is computed as
(63)ϕLR=min⁡{ϕsb(ri+1/2L),ϕsb(ri+1/2R)}.
Here ϕsb is the limiter function (61), and we will apply ϕLR to the flux in (53). As we see, the method can be easily extended to a system of conserved variables; we just need to apply (62)-(63) to every component uk and obtain a corresponding limiter ϕkLR, k=1,…,m. Then, one can select the final limiter as
(64)ϕLR=min⁡k{ϕkLR},k=1,…,m.In next section, we present some numerical results for above methods.


## 5.1.CFL Number and Numerical Boundary Conditions

Assume that the space[a,b] is divided into M cells Ii=[xi-1/2,xi+1/2]; the spacing of grid points Δx is xi+1/2-xi-1/2, which is L/M. The full discrete conservative formula for the above equation is
(34)uin+1=uin+ΔtΔx(fi-1/2-fi+1/2).
In the application of SHA scheme to the inviscid Burgers’ equation we use the following transmissive boundary conditions:
(35)u0n=u1n,u-1n=u2n,uM+1n=uMn,uM+2n=uM-1n,
to provide numerical fluxes f1/2, fM+1/2. Denoting by Smax⁡n the maximum wave speed throughout the domain at time level n we define the maximum Courant number Ccfl:
(36)Ccfl=ΔtSmax⁡nΔx,
where Δt is such that
(37)0<Ccfl≤1.
The time step Δt follows as
(38)Δt=CcflΔxSmax⁡n,
where
(39)Smax⁡n=max⁡i{Si+1/2n},Si+1/2n={12|uin+ui+1n|,ifuin>ui+1n,(shock)max⁡(|uin|,|ui+1n|),ifuin<ui+1n,(rarefaction).
The calculation of the max wave speed value in (39) needs to use all of the speed values in the cells, including the boundary cells.The Riemann problem for Burgers’ equation is(40)ut+(u22)x=0,u(x,0)={uL,x<0,uR,x>0.
Its exact solution is
(41)ifuL>uR,thenu(x,t)={uL,ifx-St<0,uR,ifx-St>0,whereS=(1/2)(uL+uR);(thespeedofshock)ifuL≤uR,thenu(x,t)={uL,ifxt≤uL,xt,ifuL<xt<uR,uR,ifxt≥uR.


## 5.2. SHA Schemes for Solving Nonlinear Scalar Equation

The high order scheme is constructed as follows.Step 1.
Data reconstruction(42)ui(x)=uin+23x-xiΔxΔi,x∈[xi-1/2,xi+1/2].Δi is the slope on cell i for ui(x), and
(43)Δi=12(1+ω)Δui-1/2+12(1-ω)Δui+1/2,ω∈[-1,1],Δui+1/2=ui+1n-uin.
Then we get the values on the interface of cells:
(44)uiL=ui-13Δi,uiR=ui+13Δi.Step 2.
Consider evolution ofuiL, uiR by a time (1/2)Δt according to
(45)u-iL=uiL+12ΔtΔx[f(uiL)-f(uiR)],u-iR=uiR+12ΔtΔx[f(uiL)-f(uiR)].Step 3.
Solution of piecewise constant data Riemann problem(46)ut+f(u)x=0,u(x,0)={u-iRx-xi+1/2<0,u-i+1Lx-xi+1/2>0.Step 4.
Compute the integral(47)ui+1/2n+1/2=1Δx∫-(1/2)Δx(1/2)Δx‍ui+1/2(x,12Δt)dx.
Then the numerical flux is computed by fi+1/2SHA=f(ui+1/2n+1/2).Theui+1/2n+1/2 is required for computing the numerical flux fi+1/2SHA; that means the integral of the Riemann solution needs to be calculated. The following gives the exact integral with exact Riemann solution of inviscid Burgers’ equation. There are two cases.Case 1.
See Figure7, u-iR>u-i+1L; the shock wave is formed; the exact solution for Riemann problem is
(48)u(x,t)={u-iRifx-St<0,u-i+1Lifx-St>0,
where S=(1/2)(u-iR+u-i+1L). Substitute (48) into (47); then
(49)ui+1/2n+1/2=1Δx∫-(1/2)Δx(1/2)Δx‍ui+1/2(x,12Δt)dx=1Δx(∫-(1/2)ΔxxB‍ui+1/2(x,12Δt)dx+∫xB(1/2)Δx‍ui+1/2(x,12Δt)dx)=1Δx(u-iRlAB+u-i+1LlBC)=1Δx(u-iR(Δx2+Δt2S)+u-i+1L(Δx2-Δt2S))=12(u-iR+u-i+1L)+12ΔtΔx(12(u-iR)2-12(u-i+1L)2).Figure 7
u
-
i
R
>
u
-
i
+
1
L shock wave.Case 2.
See Figure8, u-iR≤u-i+1L, and the solution is a centred rarefaction wave; the exact solution for Riemann problem is
(50)u(x,t)={u-iRifxt≤u-iR,xtifu-iR<xt<u-i+1L,u-i+1Lifxt≥u-i+1L.
Substitute the above solution (50) into (47), then
(51)ui+1/2n+1/2=1Δx∫-(1/2)Δx(1/2)Δx‍ui+1/2(x,12Δt)dx=1Δx(∫xC(12)Δx‍ui+12(x,12Δt)∫-(1/2)ΔxxB‍ui+1/2(x,12Δt)dx+∫xBxC‍ui+1/2(x,12Δt)dx+∫xC(1/2)Δx‍ui+1/2(x,12Δt)dx∫xC(12)Δx‍ui+12(x,12Δt)∫-(12)ΔxxB‍ui+12(x,12Δt))=1Δx(u-iRlAB+u-i+1LlCD+∫xBxC‍x(1/2)Δtdx)=1Δx((12(Δt2u-iR)2-12(Δt2u-i+1L)2)u-iR(Δx2+Δt2u-iR)+u-i+1L(Δx2-Δt2u-i+1L)+2Δt(12(Δt2u-iR)2-12(Δt2u-i+1L)2))=12(u-iR+u-i+1L)+12ΔtΔx(12(u-iR)2-12(u-i+1L)2).
We can get the numerical flux fi+1/2SHA=f(ui+1/2n+1/2) at ith cell interface. As we can see, the flux is the same as two-step Richtmyer flux versions (13a) and (13b). Then we can give the conservative formula for solving Burgers’ equation:
(52)uin+1=uin+ΔtΔx(fi-1/2SHA-fi+1/2SHA).Figure 8
u
-
i
R
≤
u
-
i
+
1
L rarefaction wave.


## 5.3. TVD Version of SHA for Burgers’ Equation

In this section we will construct the TVD version of SHA (52) by the combination of a low order monotone flux fi+1/2LO and a high order flux fi+1/2HI as
(53)fi+1/2=fi+1/2LO+ϕi+1/2[fi+1/2HI-fi+1/2LO],
where ϕi+1/2 is a flux limiter. Here a specific Flux Limiter Centred scheme is constructed by taking
(54)fi+1/2LO=fi+1/2force,fi+1/2HI=fi+1/2SHA,
where fi+1/2force is a First Order Centred scheme and is given as follows for nonlinear systems.A classical scheme of first order accuracy to solve hyperbolic conservation laws is that of Lax-Friedrichs, whose numerical flux at the interface of two statesul, ur is
(55)fi+1/2LF=fi+1/2LF(ul,ur)=12[f(ul)+f(ur)]+12ΔxΔt[ul-ur].
A second order accurate scheme Richtmyer scheme is given by computing a numerical flux
(56)fi+1/2RI=f(ui+1/2RI),
where the intermediate state
(57)ui+1/2RI=ui+1/2RI(ul,ur)=12(ul+ur)+12ΔtΔx[f(ul)-f(ur)].
Hence fi+1/2force is given as
(58)fi+1/2force=fi+1/2force(ul,ur)=12[fi+1/2LF(ul,ur)+fi+1/2RI(ul,ur)].
As we know in [14], the relationship between conventional upwind flux limiters ψ(r) and centred flux limiters ϕ(r) is
(59)ϕ(r)=ϕ^g+(1-ϕ^g)ψ(r),
with
(60)ϕ^g={0,r≤1,ϕg≡(1-Ccfl)(1+Ccfl),r≥1,
where Ccfl is the maximum Courant number. By choosing the upwind flux limiters SUPERBEE [15], VANLEER [16], VANALBADA [17], and MINBEE [15] we can obtain corresponding centred flux limiters. Here we recommend the use of the SUPERBEE flux limiter ψsb to obtain a centred flux limiter:
(61)ϕsb(r)={0,r≤0,2r,0≤r≤12,1,12≤r≤1,min⁡{2,ϕg+(1-ϕg)r},r>1.
Set
(62)ri+1/2L=Δui-1/2Δui+1/2,ri+1/2R=Δui+3/2Δui+1/2.
A single flux limiter is computed as
(63)ϕLR=min⁡{ϕsb(ri+1/2L),ϕsb(ri+1/2R)}.
Here ϕsb is the limiter function (61), and we will apply ϕLR to the flux in (53). As we see, the method can be easily extended to a system of conserved variables; we just need to apply (62)-(63) to every component uk and obtain a corresponding limiter ϕkLR, k=1,…,m. Then, one can select the final limiter as
(64)ϕLR=min⁡k{ϕkLR},k=1,…,m.In next section, we present some numerical results for above methods.


## 6. Numerical Experiment for Inviscid Burgers’ Equation

Apply the SHA scheme (52) to the inviscid Burgers’ equation as follows:
(65)ut+(u22)x=0,x∈(0,2),u(x,0)=sin(πx),x∈(0,2),
the exact solution of which is u=sinπ(x-ut).Firstly, we test the accuracy of the scheme when the solution is still continuous.L1 and L∞ errors are listed in Table 2 using SHA scheme (52) at t=0.1 units. We have the order of accuracy, 2, in both L1 and L∞ norms.Table 2
Initial value problem (65) and L1 and L∞ norms of the errors.
M
L
1-error
Order
L
∞-error
Order
10
1.271602441600013
e
-
003
—
4.379023250708602
e
-
003
—
20
3.014198107186672
e
-
004
2.076
1.184828766909840
e
-
003
1.885
40
8.022589039827272
e
-
005
1.909
3.326609280748238
e
-
004
1.836
80
1.970290376099131
e
-
005
2.025
8.196194678489199
e
-
005
2.021
160
4.901628379673853
e
-
006
2.007
2.022463637441074
e
-
005
2.001Next we compute the shock by SHA scheme (52) with CFL=0.8 and Δx=0.01. The comparison of exact solution and numerical solution for initial value problem (65) is given in Figure 9. Then we use the SHA scheme (53) with the limiter ϕLR(r) in (63) to solve the initial value problem (65). The comparison is shown in Figure 10. From Figures 9 and 10 we can see that SHA scheme gives satisfactory solution when shock develops at t=0.4.Figure 9
SHA method applied to inviscid Burgers’ equation for continuous initial value; numerical (symbols) and exact (line) solutions are compared att=0.4 units.Figure 10
SHA method with TVD applied to inviscid Burgers’ equation for continuous initial value; numerical (symbols) and exact (line) solutions are compared att=0.4 units.Considering the discontinuous initial value problem for Burgers’ equation(66)ut+(u22)x=0,u(x,0)={-0.50<x<13,113≤x≤23,023<x<1.
The comparison of exact solution and numerical solution for initial value problem (66) computed by SHA scheme (52) is given in Figure 11; then we use the SHA scheme (53) with TVD to solve the initial value problem (66); the comparison is shown in Figure 12. From Figures 11 and 12 we see that SHA scheme (52) cannot control the spurious oscillation, but SHA scheme (53) not only can control the spurious oscillation but also has better resolution to discontinuity.Figure 11
SHA method applied to inviscid Burgers’ equation for discontinuous initial value; numerical (symbols) and exact (line) solutions are compared att=0.15 units.Figure 12
SHA method with TVD applied to inviscid Burgers’ equation for continuous initial value; numerical (symbols) and exact (line) solutions are compared att=0.15 units.


## 7. The Application of SHA Scheme to Euler Equations

We have presented every procedure of SHA scheme applying to Burgers’ equation; now we will turn our focus on the application of SHA scheme to the following Euler equations:(67)∂U∂t+∂F∂x=0
with
(68)U=[ρρuE],F=[ρuρu2+pu(E+p)],
where
(69)E=ρe+12ρu2,e=pρ(γ-1)
and U is conservative variable, F is vector of convective flux, e is specific internal energy, E is total energy, and γ is ratio of specific heats, the value of which is 1.4 for ideal gas.The process of applying SHA to Euler equations is similar to that of Burgers’ equation. The time step is determined by(70)Δt=CcflΔxSmax⁡n,
where Smax⁡n is the maximum wave speed at the time tn. A practical choice of Smax⁡n is
(71)Smax⁡n=max⁡i(|uin|+ain),
where ain is the sound speed, for ideal gas ain=γpin/ρin.The data reconstruction and evolution part is the same as Burgers’ equation. When we obtain theU-iL and U-iR at each interface, there are two ways to construct the flux fi+1/2SHA for each interface.The Riemann solver free way is to use two-step Richtmyer version of Lax-Wendroff method to obtain the SHA numerical flux:(72)Ui+1/2n+1/2=12(U-iR+U-i+1L)+ΔtΔx(Fin-Fi+1n),Fi+1/2SHA=F(Ui+1/2n+1/2),
where Fin=F(U-iR), Fi+1n=F(U-i+1L). Then (53) can be used to construct TVD scheme for the Euler equations which is similar to the procedure for Burgers’ equation.The other way to obtain the flux at the cell is according to (13a); for the Euler equations, the flux is given as
(73)Fi+1/2SHA=F(Ui+1/2n+1/2),Ui+1/2n+1/2=1Δx∫-(1/2)Δx(1/2)Δx‍Ui+1/2(x,12Δt)dx,
where Ui+1/2(x,t) is the solution of the Riemann problem with piecewise constant data U-iR, U-i+1L. And approximate Riemann solvers may be applied to get the solution of the Riemann problem. Assume the four constant states of the solution are U(1), U(2), U(3), U(4) in order; in that way, the integral in (73) becomes [14]
(74)Ui+1/2n+1/2=12(Uin+Ui+1n)-12∑k=14‍ck(Ui+1/2(k+1)-Ui+1/2(k)),
where Ui+1/2(k) is the value of Ui+1/2(x,t) in region k and ck=ΔtSk/Δx is the Courant number for wave k of speed Sk. And then the flux is obtained from (73). The TVD version of the flux of the scheme is constructed as follows:
(75)Ui+1/2n+1/2=12(Uin+Ui+1n)-12∑k=14‍sign⁡(ck)ϕk(Ui+1/2(k+1)-Ui+1/2(k)),
where ϕk=ϕ(r(k),c), and r(k)=Δqi-1/2(k)/Δqi+1/2(k), for ck>0; r(k)=Δqi+3/2(k)/Δqi+1/2(k), for ck<0. The quantity q is known to change across each wave family in the solution of the Riemann problem. For the Euler equations the choice q≡ρ (density) gives very satisfactory results. And a recommended limiter can be found in [14]:
(76)ϕ(r,c)={1,r≤0,1-2r(1-|c|)2r,0≤r≤12,|c|,12≤r≤1,1-(1-|c|)r,12≤r≤2,2|c|-1,r>2.
Finally, the TVD flux is Fi+1/2SHA=F(Ui+1/2n+1/2).In order to test the effectiveness of the scheme, we apply the TVD schemes (72) and (53) (denoted as SHA_1) and the TVD schemes (73), (75), and (76) (denoted as SHA_2) for Euler equations to Sod's tube problem and Lax problem [18, 19]. HLLC approximate Riemann solver [20] is used to obtain the solution of the Riemann problem at the interface. At the same time, the MUSCL-Hancock scheme [21], WEN (3rd order) [22, 23], and RKDG (3rd order) [24] are also applied for comparison.Sod’s Tube Problem. The initial value consists of two constant states:
(77)W={WL=(ρL,uL,pL)T=(1.0,0.0,1.0)Tx<0.5,WR=(ρR,uR,pR)T=(0.125,0.0,0.1)Tx>0.5.This is a very common test for numerical scheme and its solution consists of a left rarefaction, a contact, and a right shock. The mesh used isΔx=0.005 and the Courant number is 0.9. The comparisons between the numerical solution obtained by the five schemes and the exact solution are shown in Figures 13, 14, and 15. We can see that both kinds of SHA schemes with TVD give satisfactory results. The numerical results from the SHA_1 without Riemann solver are similar to that of MUSCL-Hancock methods, and both methods give more dissipation than the other three methods, and SHA_2 with Riemann Solver scheme gives least dissipation at the contact wave and shock wave.Figure 13
Density comparison of schemes at time 0.2 units for Sod’s tube problem.Figure 14
Velocity comparison of schemes at time 0.2 units for Sod’s tube problem.Figure 15
Pressure comparison of schemes at time 0.2 units for Sod’s tube problem.Lax Problem. The initial states are given by
(78)W={WL=(ρL,uL,pL)T=(0.445,0.698,3.528)Tx<0.5,WR=(ρR,uR,pR)T=(0.5,0.0,0.571)Tx>0.5.This is a tough test for numerical schemes. The Courant number in this test is still 0.9 andΔx=0.005. The numerical results computed by the five schemes are shown in Figures 16, 17, and 18 comparing with the exact solution. We can see that the numerical results from both SHA schemes are good, the results of SHA_2 are comparable with results obtained by WENO or DG, but SHA_2 is more simple and requires less computational cost. These show the effectiveness of our method.Figure 16
Density comparison of schemes at time 0.16 units for Lax problem.Figure 17
Velocity comparison of schemes at time 0.16 units for Lax problem.Figure 18
Pressure comparison of schemes at time 0.16 units for Lax problem.


## 8. Conclusion

This paper introduces a class of SHA schemes with 3rd order approximation accuracy only for linear advection equation by linear data reconstruction, solving Riemann problem and using Lax-Wendroff flux, and its available highest order is 4th. The general flux limiter approach is used to make the SHA schemes TVD in order to avoid spurious oscillations in the vicinity of strong gradients for nonlinear equations and systems. The numerical results show that these schemes can solve hyperbolic conservation laws with high order of accuracy, high resolution, and less computational cost. The next work is to extend SHA schemes to high-dimensional hyperbolic equations and apply them to compute some practical flows, for example, around an airfoil and wing.



---

*Source: 275425-2014-03-02.xml*