 Review
 Open Access
 Published:
Twostage fourth order: temporalspatial coupling in computational fluid dynamics (CFD)
Advances in Aerodynamics volume 1, Article number: 3 (2019)
Abstract
With increasing engineering demands, there need high order accurate schemes embedded with precise physical information in order to capture delicate small scale structures and strong waves with correct “physics”. There are two families of high order methods: One is the method of line, relying on the RungeKutta (RK) timestepping. The building block is the Riemann solution labeled as the solution element “1”. Each step in RK just has first order accuracy. In order to derive a fourth order accuracy scheme in time, one needs four stages labeled as “ 1⊙1⊙1⊙1=4”. The other is the onestage LaxWendroff (LW) type method, which is more compact but is complicated to design numerical fluxes and hard to use when applied to highly nonlinear problems. In recent years, the pair of solution element and dynamics element, labeled as “2”, are taken as the building block. The direct adoption of the dynamics implies the inherent temporalspatial coupling. With this type of building blocks, a family of twostage fourth order accurate schemes, labeled as “ 2⊙2=4”, are designed for the computation of compressible fluid flows. The resulting schemes are compact, robust and efficient. This paper contributes to elucidate how and why high order accurate schemes should be so designed. To some extent, the “ 2⊙2=4” algorithm extracts the advantages of the method of line and onestage LW method. As a core part, the pair “2” is expounded and LW solver is revisited. The generalized Riemann problem (GRP) solver, as the discontinuous and nonlinear version of LW flow solver, and the gas kinetic scheme (GKS) solver, the microscopic LW solver, are all reviewed. The compact Hermitetype data reconstruction and high order approximation of boundary conditions are proposed. Besides, the computational performance and prospective discussions are presented.
1 Introduction
In the simulation of compressible fluid flows or related problems, there are two families of commonlyused high order accurate numerical schemes: One is the family of methods of line, for which the fluid dynamical system is written in semidiscrete form and the RungeKutta (RK) temporal iteration is employed for the temporal discretization, such as RKWENO [1], RKDG [2] and their variants. The building blocks comprises of the solution element, the associated Riemann solution, which is labeled as “1” in order to be in contrast with the LaxWendroff (LW) type flow solvers. The fourth order RK temporal iteration is labeled as “ 1⊙1⊙1⊙1=4”. This family of schemes have very favorable properties such as simplicity in timestepping for complex engineering problems. The limitation is also obvious such as compactness, efficiency and fidelity. The other is the family of onestage LW type methods, the numerical realization of CauchyKowalevski (CK) approach [3] for the corresponding partial differential equations. This family of methods have the strong temporalspatial coupling property, leading to very compact numerical schemes. However, when applied to high nonlinear problems, the complex construction of numerical fluxes hampers to develop high (more than two) order accurate schemes. Particularly, as strong waves (discontinuities) are present in flows (solutions), the CK procedure loses its physical and mathematical meanings, exhibiting the instability of the resulting schemes near discontinuities.
Careful inspection of these two families of methods motivates to combine the merits of both methods: The simplicity of multistage RK methods and the temporalspatial coupling of LW type methods. This straightforward combination immediately yields a twostage fourth order accurate temporal discretization for the LW type flow solvers [4], which is labeled as “ 2⊙2=4”. Here “4” just represents “fourth” order accurate temporal discretization, but “2” has much deeper implications, some of which are enumerated below.

(i)
“2” represents a pair. Unlike the methods of line, this method adopts the pair, the conservative variables and their dynamics, e.g., the velocity and the acceleration, as the building block to design numerical schemes. In [4], we call this pair as the Riemann solver and the LW type solver.

(ii)
“2” implies the temporalspatial coupling. The LW flow solver implies the temporalspatial coupling property of resulting schemes. This is necessary to simulate the temporalspatial coherent structures of fluid flows.

(iii)
“2” stands for second order accuracy in time. Of course,“2” also symbolizes the temporal accuracy of resulting schemes and requires that at each of the two stages the above pair should be the building block.

(iv)
“2” indicates the exchange of kinematics and thermodynamics. The Gibbs relation plays a fundamental role in compressible fluid flows. In the dynamical process, there is always the interaction of kinematics and thermodynamics. The stronger nonlinear waves, e.g. shocks, exist in the fluid flows, the more fundamental role the thermodynamics plays.

(v)
“2” guarantees the compactness and efficiency. Since only two stages are taken to achieve fourth order temporal accuracy, half amount of spatial discretization treatments are saved and much smaller computational stencils are needed. Hence the resulting schemes are more compact and efficient.

(vi)
“2” reflects the consistency of mathematical and physical expressions of fluid dynamics. The fluid dynamical systems essentially consist of balance laws, which say the relation between the change rate of physical quantities and the associated fluxes. The form of balance laws always makes sense no matter whether there are discontinuities in the solution. The LaxWendroff type flow solvers inherently reflects the consistency between the physical implication of fluid dynamical systems and their mathematical formulation.
In this paper we will elucidate the idea of this new family of schemes by interpreting the philosophy from ordinary differential equations (ODEs) to fluid dynamical systems, reviewing the wellused GRP and GKS solvers as the representatives of the LaxWendroff type solvers, building high order temporalspatially coupled high order accurate schemes with favorable computational performance.
We organize this paper in the following sections. In Section 2, we propose this new family of methods and the corresponding “ 2⊙2” algorithm. In Section 3, we review the generalized Riemann problem (GRP) solver and in Section 4 continue to review a kinetic solver, the gas kinetic scheme (GKS) solver. In Section 5, we introduce the compact Hermitetype interpolation for the data reconstruction. In Section 6, we discuss the approximation of boundary conditions to suit for the 2⊙2 algorithm. In Section 7, we remark the computational performance of this approach in terms of computational efficiency, robustness and fidelity.
2 What is “ 2⊙2=4”?
This section serves to elucidate the meaning of “ 2⊙2=4” for hyperbolic problems and particularly compressible fluid flows, and review the twostage fourth order accurate schemes proposed in [4]. We remind that this strategy may not be suitable for incompressible flows or it needs some modifications but certainly awaits for further improvement.
2.1 Start with ODEs and philosophic thinking
Let’s recall the RungeKutta (RK) method for an ordinary differential equation
The RungeKutta method takes the iteration procedure
where h is the time increment, a_{ij}, b_{i} and c_{i} satisfy the Butcher tableau [5]. The building block of RK is the solution element y. In order to devise a sth order accurate scheme, one needs sstage iteration, which is parameterdependent. In this paper, we focus on fourth order accurate schemes and therefore label the fourth order RK schemes as 1⊙1⊙1⊙1=4. The notation “ ⊙” is an operation satisfying certain requirement such as stability.
The RK method lays the foundation of numerical approximations to ODEs. Note that this method only uses the solution element “y”, but ignores the dynamics element dy/dt. This sounds confusing, however, one may pay his attention to the role of the dynamics element if he is familiar with the symplectic algorithm for Hamitonian system [6] for which the pair of the position and momentum are together used for the computation in order to preserve the symplectic structure. The momentum can be regarded as the dynamics element of the position (solution element). The word “symplectic” itself has the meaning of “pair”.
With this philosophical thinking, it is reasonable to construct multistage multiderivative algorithms for dynamical systems (ODEs). Indeed, this was achieved in [7] with many subsequent works [8–11]. The building block is the pair, the solution element and the dynamics element (the derivatives). Specifically, a multistage twoderivative algorithm is written as
where we suppress the dependence of f on t for simplicity so that f=f(y), the coefficients a_{ij}, \(\hat {a}_{ij}\), b_{i}, and \(\hat {b}_{i}\) can be displayed in an extended Butcher tableau [7]. Here the function g(y)=f^{′}(y)f(y) is given using the chain rule
The dynamical element is implicitly used in the construction of algorithm (3). This is why this method is of multistage twoderivative type with the pair (y,dy/dt) as the building block. In particular, as s=2, we have the twostage fourth order accurate timestepping algorithm in the form
labelled as the “ 2⊙2=4” algorithm, which was independently derived in [4] for hyperbolic conservation laws. See the discussion in the subsequent sections. For (5), the first “2” represents the twostage approach, the second “2” means the pair of the solution element and the dynamics element, and “4” stands for the fourth order accurate approximation to (1). Certainly, the first “2” has more implications when applied to the fluid dynamical systems for compressible flows. Besides, the notation “ ⊙” is used here to symbolize the mathematical operation currently. Probably in the future, this notation could be replaced by a better one.
2.2 LaxWendroff flow solvers
The LaxWendroff method [12] plays a fundamental role in the development of high order accurate schemes for hyperbolic equations. The corresponding scheme is unique in the class of threepoint schemes of second order both in space and time. The feature of uniqueness implies that it is the reference of high order accurate schemes, and the threepoint stencil hints at the compactness. Here we are going to show more fundamentals of this method, which is taken as the building block or higher order accurate schemes. Moreover, we would like to present as many details as possible because it is unusual that it has not been received “enough” attention since its birth. Part of the reason may be the presence of oscillations near discontinuities when used to simulated compressible fluid flows although it was modified, e.g., the flux limiter methods in 1980s ([13] and its successors), to be suited for the capture of discontinuities; part of the reason is, more possibly, the seeming complexity compared to methods of line. Even more seriously, the misuse in various contexts, such as diffusion equations and (dispersive) KdV type equations, leads to many controversial issues.
2.3 The revisit of LaxWendroff method
Let us first recall the LaxWendroff method [12]. Consider the advection equation
where a is a constant. The boundary condition remains to be discussed in Section 6. We approximate (6) by assuming that the solution is sufficiently regular, and take the Taylor series expansion at any point (x,t) to obtain,
A key step is the temporalspatial coupling technique by taking use of (6) to quantify the differentiation relation between the change rate of u and the spatial variation,
Ignoring truncation errors of order more than three, the LaxWendroff scheme is derived as (cf. [12]),
where central difference approximations are made to guarantee the spatial accuracy, \(u_{j}^{n}\) represents the point value u(x_{j},t_{n}) at the grid point (x_{j},t_{n}), x_{j}=jΔx, t_{n}=nΔt, with the spatial and temporal increments Δx and Δt. The Taylor expansion process is the same as that in the CauchyKowaleveski approach (see [3]), and therefore (9) is regarded as the numerical realization of the CK approach. Note that this process determines the feature of this scheme, implying its application only in the range of hyperbolic problems (local behavior or finite propagation property). Any other extension needs serious and cautious treatments.
The Taylor expansion also relies on the smoothness of the solution. The successive differentiation (6) gives rise to the risk in the following sense.

(i)
Once Eq. 6 admits discontinuities in the solution, the manipulation for (8) does not make any sense. This is the main reason that (9) produces oscillations near discontinuities [12].

(ii)
As this method is applied to highly nonlinear dynamical systems, this manipulation becomes horrible and hampers to develop higher order accurate schemes, due to the successive differentiations.
We will comment on this manipulation appropriately at later sections. Rather now, we reinspect (6) and (7) from another point of view (after ignoring high order truncation errors), actually in the finite volume framework,
where the differentiation relation \(\frac {\partial }{\partial t} =a\frac {\partial }{\partial x}\) is applied. We immediately realize that for any (x,t)
as long as the solution is smooth in t (temporal direction or flow direction). Viewing (10) in the finite volume framework, we obtain over the control volume \(\left [x_{j\frac 12}, x_{j+\frac 12}\right ]\times [t_{n},t_{n+1})\), \(x_{j+\frac 12}=\frac 12\left (x_{j}+ x_{j+1}\right)\),
The prediction of the value \(u_{j+\frac 12}^{*}\) depends on the approximations to \(u\left (x_{j+\frac 12},t_{n}\right)\) and \(\frac {\partial u}{\partial t}\left (x_{j+\frac 12},t_{n}\right)\). This is achieved by the LaxWendroff solver.
LaxWendroff solver.A LaxWendroff solver for (6) is the numerical algorithm approximating the values
for the given initial data at t=t_{n}for (6).
This pair of values actually provide all quite detailed information along the interface \(x=x_{j+\frac 12}\) of control volume and also the flux
The two formulae (9) and (12) are equivalent for smooth flows. However, the new formulation (12) is fundamentally different from (9) in the following sense.

(i)
The formulae (12) is actually the finite volume formulation for (6). The formulation is more straightforward for fluid dynamical systems than other formulations because it is just the numerical version of balance laws and allows discontinuities as its solution.

(ii)
The manipulation (11) is legal because the flow should be smooth in time (but not in space), unlike the difference approximation for LW approach.

(iii)
The temporalspatial coupling feature again plays an important role, e.g.,
$$ \frac{\partial u}{\partial t}\left(x_{j+\frac 12},t_{n}\right) =a\frac{\partial u}{\partial x}\left(x_{j+\frac 12}, t_{n}\right). $$(15)This feature is crucial for a numerical scheme to preserve the fluid dynamical properties such as the Galilean invariance.

(iv)
The successive differentiation (8) can be avoided, which is extremely important for nonlinear problems when discontinuities are involved because the manipulation (8) makes no sense both mathematically and physically.
For (6), we label “2” for the pair \(\left (u, \frac {\partial u}{\partial t}\right)\) in the LaxWendroff solver (13), which is the building block, as we see, in the LaxWendorff scheme. It is interesting to observe that (13) can be approximated in an upwind or central way. The upwind approximation can avoid superfluous information in the scheme.
2.4 LaxWendroff flow solvers for nonlinear hyperbolic balance laws
We consider hyperbolic conservation laws
where the vector u is the conservative variable. The natural formulation of (16) is in the finite volume framework, the balance law over any interval \(I_{j}=\left (x_{j\frac 12},x_{j+\frac 12}\right)\),
or the control volume \(\left (x_{j\frac 12},x_{j+\frac 12}\right)\times \left (t_{n},t_{n+1}\right)\),
with
If one would prefer to other formulations, such as the discontinuous Galerkin method [2], the following statements still hold.
We shift (x_{j},t_{n}) to (0,0) due to the invariance of (16) with respect to the translation of coordinates. In order to proceed in one of those frameworks, we have to solve (16) approximately subject to the initial data
where P_{±}(x) are smooth functions, typically polynomials, with a jump at x=0. The same as in the linear case (13), a LaxWendroff flow solver for such a problem is an algorithm approximating
In general, we consider hyperbolic balance laws in multidimensions,
where h is the source term resulting from physics or geometry, x=(x,y,z) is the spatial coordinate. The initial data for (22) is set to be
where μ is the unit normal of a line or plane L:μ·x=0 pointing from the negative side to the positive side, corresponding to the outer normal of interfaces of computational volume. The LaxWendroff solver for (22) is to find the pair of values with the same form as in (21),
where the limit is taken along the spatialtemporal interface L×(0,Δt).
We want to remark here that the pair (u_{L,0},(∂u/∂t)_{L,0}) can be modulated to any direction in order to suit for an arbitrary LagrangianEulerian (ALE) method.
2.5 Rough comments on the correlation between LW solver and temporalspatial coupling
The instantaneous temporal derivatives in (21) and (24) can be roughly using the LaxWendroff approach
and then −∇·F(u) and h are approximated using certain technologies such as WENO etc. The same as in (15), the coherent relation of spatial and temporal variations is rooted in this formula.
The intuitive outcome of this coupling is the following.

(i)
The multidimensional effect, in particular the transversal effect, is input into the flux directly. Thinking of a single advection problem
$$ u_{t} + {au}_{x} +{bu}_{y}=0, $$(26)where a,b are constants. For an interface with the normal in the xdirection, the transversal effect, expressed in the ydirection, is ignored for the standard Riemann solver. This is further verified for the wave system
$$ p_{t}+c_{0}u_{x}+c_{0}v_{y}=0, \ \ \ u_{t} +c_{0}p_{x} =0, \ \ \ v_{t} +c_{0}p_{y}=0, $$(27)where c_{0} is a constant. In Table 1, we use three methods to simulate the periodic wave problem. It is observed that even with the same convergence rate, the RK method produces also ten times of errors than what the second order GRP does for which the transversal effect is included. The solution cannot even converge with the refinement of meshes if only normal flux is used but the transversal effect is not included. See [14].

(ii)
The source effect h is also reflected through such a process. It is simple to see that
$$ \frac{\partial u}{\partial t} =\frac{\partial f(u)}{\partial x}+h(u,x), $$(28)for hyperbolic balance law
$$ \frac{\partial u}{\partial t} +\frac{\partial f(u)}{\partial x}=h(u,x). $$(29)This input is essential and indispensable for the wellbalancedness, as verified for the shallow water equations [15].
There are more fundamentals, such as the thermodynamical effect [16], resulting from the temporalspatial coupling.
2.6 2⊙2=4: Twostage fourth order accurate schemes
In [4], the fourth order accurate method is developed for hyperbolic conservation laws. We start with the review of the dynamical system
where \(\mathcal {L}\) is a linear or nonlinear operator of w. Then we have the following twostage algorithm for (30).

Stage 1. Define intermediate values
$$ \begin{array}{l} \mathbf{w}^{*} = \mathbf{w}^{n} +\frac 12\Delta t \mathcal{L}\left(\mathbf{w}^{n}\right) +\frac{1}{8} \Delta t^{2} \frac{\partial}{\partial t}\mathcal{L}\left(\mathbf{w}^{n}\right),\\ \frac{\partial}{\partial t}\mathcal{L}\left(\mathbf{w}^{*}\right) =\frac{\partial}{\partial \mathbf{u}}\mathcal{L}\left(\mathbf{w}^{*}\right) \mathcal{L}\left(\mathbf{w}^{*}\right), \end{array} $$(31)where the second equation follows from (30), using the chain rule.

Stage 2. Advance the solution using the formula
$$ \mathbf{w}^{n+1} =\mathbf{w}^{n} + \Delta t \mathcal{L}\left(\mathbf{w}^{n}\right) + \frac{1}{6} \Delta t^{2} \left(\frac{\partial}{\partial t}\mathcal{L}\left(\mathbf{w}^{n}\right)+2\frac{\partial}{\partial t}\mathcal{L}\left(\mathbf{w}^{*}\right)\right). $$(32)
This algorithm provides a fourth order accurate approximation to w. Originally, this algorithm was proposed in [7, 17], and independently in [4] based on LaxWendroff flow solvers. Along this direction, one can derive as high order accurate approximations as what he likes [7, 18].
When applied to hyperbolic problems (16) and (22), one can formulate them in any appropriate framework such as finite volume framework [4] or discontinuous Galerkin (DG) framework [19]. Hence we assume that the computational domain Ω is meshed as \(\Omega = \cup _{j\in \mathcal {J}} \Omega _{j}\) and formulate the problem in the form
Thus, this problem boils down to the dynamical system in the form (30). Then we have a twostage fourth order timestepping method, now symbolized as the “ 2⊙2=4” method. The intuitive meaning is that we adopt the second order flow solvers as building blocks and use a twostage timestepping to achieve fourth order accurate numerical methods for hyperbolic problems or convectiondominated problems. We make a diagram in the following.
Careful readers may observe the validity of (33) when the above twostage algorithm applies to the current case, which is why we have to develop the LaxWendroff type flow solvers based on hyperbolic balance laws rather than the formal partial differential equations (BenArtzi, M, Li, J: On the consistency and convergence of finite volume approximations to hyperbolic balance laws, submitted). There are at least two points that we should concern: (i) System (33) is indexdependent and therefore each equation for fixedjis related to the neighboring equations; (ii) the continuity of\(\mathcal {L}_{j}\)is crucial when applying the above twostage algorithm. It is at these points that (30) is substantially different from (1). Therefore, the regularity of flux is a key factor to guarantee the validity of this algorithm. Physically speaking, this regularity is natural by recalling the Lagrangian form of fluid dynamical systems [20]. Hence in the computation of instantaneous values (21) or (24), we must be aware of the regularity of the flux that will be further emphasized in the next section about the GRP solver.
3 The GRP solver: a discontinuous and nonlinear LW flow solver
As is wellknown, and also pointed out in the last section, the standard LaxWendroff solver results in an algorithm that producing oscillatory solutions if discontinuities are present. The GRP solver, the abbreviation of the generalized Riemann problem (GRP) solver, can be regarded as the discontinuous and nonlinear version of the LaxWendroff solver. This solver was originally proposed in [21] for compressible fluid flows and related problems. See [22] for the comprehensive summary of works before 2003. Later on a direct Eulerian version of GRP solver was derived in [23] and further extended to general hyperbolic conservation laws [24, 25]. The presentation below will follow the direct Eulerian GRP. The application to nonconservative systems is referred to [26].
3.1 1D GRP solver
We first review onedimensional GRP solver for hyperbolic balance laws
subject to the initial data of form (20). An important prototype is the compressible Euler equations with cross section,
where the variables ρ, u, p and E are the density, velocity, pressure and the total specific energy. The total specific energy consists of two parts \(E=\frac {u^{2}}2+e\), e is the internal specific energy. The function A(x) is the area of the duct. When A(x)≡1, the system (35) represents the planar compressible Euler equations. Let T be the temperature. Then the entropy S can be defined, as usual, by Gibbs relation of thermodynamics,
The local sound speed c is defined as
We will distinguish the linear (acoustic) and nonlinear GRP solvers. Both are related. However, as strong waves are involved, the nonlinear GRP solver becomes crucial. Details can be found first in [27] and later in [24, 25] for general versions.
We denote
(I) Linear GRP solver. Linear hyperbolic equations describe the propagation of waves linearly. For the single linear case (6),
with a damping constant α, we have obviously
For the linear or semilinear system case
we need to diagonalize the system and pursue the characteristic decomposition. Denote by λ_{1},⋯,λ_{m} the eigenvalues of A, Λ=diag(λ_{1},⋯,λ_{m}), and Λ=diag(λ_{1},⋯,λ_{m}). Then we decompose A as A=RΛR^{−1}, and denote again A=RΛR^{−1}. It turns out that the instantaneous values take
Therefore, the GRP solver for the linear system case is substantially the same as that for the single equation case.
(II) Acoustic Approximation
For nonlinear cases, if u_{ℓ}=u_{r}, but \(\\mathbf {u}_{\ell }^{\prime }\mathbf {u}_{r}^{\prime }\ \neq 0\), only linear waves emanate from the singularity point (0,0). Then we can linearize the system (34), at the value u_{0}=u_{ℓ}=u_{r}, as
where A(u_{0}) is the Jacobian f^{′}(u_{0}). Note that
Immediately we have
We can proceed to obtain any higher temporal derivatives (∂^{m}u/∂t^{m})_{0}, abbreviated as ADER in [28]. However, in the framework of 2⊙2=4, we are satisfied with the first order temporal variation in (45).
As ∥u_{ℓ}−u_{r}∥≪1, weakly nonlinear waves emanate from (0,0). Then we can carry out the socalled acoustic approximation. To be precise, we can use either exact or approximate Riemann solvers to obtain the intermediate state u_{0} and linearize the system (34) to be in the form (43) so that the temporal derivative (∂u/∂t)_{0} is calculated as in (45).
For the Euler Eq. 35, the acoustic approximation is the following.

(i)
As u_{0}−c_{0}>0 or u_{0}+c_{0}<0, the acoustic waves moves to one side of the taxis. Then (∂u/∂t)_{0} is taken upwind.

(ii)
As u_{0}−c_{0}<0<u_{0}+c_{0}, the taxis is located between two acoustic waves. Then we have
$$ \begin{array}{ll} \left(\frac{\partial u}{\partial t}\right)_{0}=& \frac{1}{2} \left[(u_{0}+c_{0})\left(u_{\ell}^{\prime}+\frac{p_{\ell}^{\prime}}{\rho_{0} c_{0}}\right) +(u_{0}c_{0}) \left(u_{r}^{\prime}\frac{p_{r}^{\prime}}{\rho_{0} c_{0}} \right)\right],\\ \left(\frac{\partial p}{\partial t}\right)_{0}=& \frac{\rho_{0}c_{0}}{2} \left[(u_{0}+c_{0})\left(u_{\ell}^{\prime}+\frac{p_{\ell}^{\prime}}{\rho_{0} c_{0}}\right) (u_{0}c_{0}) \left(u_{r}^{\prime}\frac{p_{r}^{\prime}}{\rho_{0} c_{0}} \right)\right]\\ & \frac{A^{\prime}(0)}{A(0)} \rho_{0} c_{0}^{2} u_{0}.\\ \end{array} $$(46)The quantity (∂ρ/∂t)_{0} is solved according to the direction of the contact discontinuity,
$$ \left(\frac{\partial \rho}{\partial t}\right)_{0}= \frac{1}{c_{0}^{2}} \left[ \left(\frac{\partial p}{\partial t}\right)_{0} +u_{0} \left(p_{\ell}^{\prime}c_{0}^{2}\rho_{\ell}^{\prime} \right) \right] $$(47)if u_{0}=u_{ℓ}=u_{r}>0; and
$$ \left(\frac{\partial \rho}{\partial t}\right)_{0}= \frac{1}{c_{0}^{2}} \left[ \left(\frac{\partial p}{\partial t}\right)_{0} +u_{0} \left(p_{r}^{\prime}c_{0}^{2}\rho_{r}^{\prime} \right) \right] $$(48)if u_{0}=u_{ℓ}=u_{r}<0.
For “cheap” engineering applications, one can use the local Riemann solution u_{0} to linearize the nonlinear system and obtain a “linear” system so that the above acoustic approximation strategy can be adopted.
(III) Nonlinear GRP solver
As ∥u_{ℓ}−u_{r}∥≫1, nonlinear waves emanate from the singularity point (0,0). The larger the difference between u_{ℓ} and u_{r} is, the stronger the strength of the waves is. In Fig. 1 we use the acoustic GRP solver to simulate the big density ratio problem and observe that the numerical solution has large disparity from the exact solution. In Fig. 2, we use the nonlinear GRP solver that will be described below, and see that the numerical solution is improved prominently [16]. Hence it is essential to develop the nonlinear GRP solver as long as strong waves need resolving. We just illustrate the nonlinear GRP solver for Euler equations with cross section (35). For general hyperbolic balance laws, readers are referred to [24, 25].
We just need to assume a typical case, as shown in Fig. 3, that a rarefaction wave moves to the left, a shock moves to the right and a contact discontinuity lies in the middle. When the waves move to one side of taxis, i.e., u_{ℓ}−c_{ℓ}>0 or u_{r}+c_{r}<0, it is treated as the acoustic case that (∂u/∂t)_{0} is obtained upwind.
We rewrite (35) in terms of (ρ,u,S),
where p is regarded as a function of ρ and S. In terms of ρ, u and p, the third equation of (49) can be replaced by,
In order to resolve strong rarefaction waves, it is particularly essential to introduce the socalled generalized Riemann invariants, as in [24],
Together with the entropy variable S, system (35) becomes
where \(B_{1}= T\frac {\partial S}{\partial x}+\frac {A^{\prime }(x)}{A(x)} cu\), \(B_{2}=T\frac {\partial S}{\partial x}\frac {A^{\prime }(x)}{A(x)} cu\). Here it is easily seen that the variable section A(x) acts on the dynamical behavior of ϕ and ψ, and thus on that of (ρ,u,p). The severe change of entropy inevitably leads to the variation of other physical variables. The GRP solver that we will derive tells precisely how the entropy and the cross section affect the dynamics.
The most important ingredient is the application of nonlinear geometric optics for the local expanding of rarefaction waves using local characteristic coordinates (α,β), as shown in Fig. 3. With that, we can obtain the instantaneous temporal derivatives ∂S/∂t and ∂ψ/∂t as (restricted to polytropic gases),
where \(T_{\ell } S_{\ell }^{\prime }\) is defined through the Gibbs relation,
and G_{1}, G_{2} are given by,
For general cases, please refer to [29].
Several remarks are in order about the role of entropy variation and the cross section on the dynamics.

(i)
The source term reflecting geometric variation always plays an important role in the dynamics of flows. Inherently, the critical gas indices are clearly exhibited in (55), which cannot be illustrated in other flow solvers. This is just an evidence that only GRP solver can distinguish different gases.

(ii)
The entropy change rate is essential and acts on other flow variables as its initial variation is severe. This tells why the GRP solver is indispensable when strong waves are simulated. As the involved waves are weak or \(T \frac {\partial S}{\partial x}\) is small, \(\frac {\partial S}{\partial t}\) is negligible and many approximations such as linearization are acceptable.
The shock is resolved by tracking its trajectory described by the RankineHugoniot relation,
where (ρ,u,p) and \((\overline \rho, \overline u,\overline p)\) are the states ahead and behind the shock, respectively, and
for polytropic gases.
For the contact discontinuity x=x(t), we make use of the continuity property of pressure and velocity on both sides of the trajectory,
Then the differentiation along the contact discontinuity gives
where D/Dt=∂/∂t+u∂/∂x is the material derivative. This relation bridges the rarefaction wave and the shock, just like that for the Riemann solver. We just remind that the density and entropy undergo jump across this contact discontinuity.
Thus we come to the nonlinear GRP solver that are distinguished as nonsonic and sonic cases.
Proposition 1
(Nonsonic case.) Assume a typical wave configuration for the generalized Riemann problem for (35) as shown in Fig. 3 that the taxis is located in the intermediate region. Then (∂u/∂t)_{0} and (∂p/∂t)_{0} satisfies the following pair of linear equations,
where a_{ℓ}, b_{ℓ}, d_{ℓ} and a_{r}, b_{r}, d_{r} are specified below. Also the computation of (∂ρ/∂t)_{0} are computed by the following two cases.
(i) If u_{0}>0, the contact discontinuity moves to the right and separates two states (ρ_{0ℓ},u_{0},p_{0}), (ρ_{0r},u_{0},p_{0}). The coefficients a_{ℓ}, b_{ℓ} and d_{ℓ} are given as,
The coefficients a_{r}, b_{r} and d_{r} are given by
The value (∂ρ/∂t)_{0} is computed from the rarefaction side,
by using the state equation p=p(ρ,S).
(ii) If u_{0}<0, the contact discontinuity moves to the left. The coefficients a_{r}, b_{r} and d_{r} are given as,
While the coefficients a_{ℓ}, b_{ℓ} and d_{ℓ} are computed by
The value (∂ρ/∂t)_{0} is computed from the shock side,
where \(g_{\rho }^{R}\), \(g_{p}^{R}\), \(g_{u}^{R}\) and f_{r} are constant, explicitly given in the following,
and H_{1}, H_{2} and H_{3} are expressed by
The other coefficients \(\left (\tilde {a}_{\ell }, \tilde {b}_{\ell }, \tilde {d}_{\ell }\right)\) and \(\left (\tilde {a}_{r}, \tilde {b}_{r}, \tilde {d}_{r}\right)\) are
and
where we use notations
Proposition 2
(Sonic case). Assume that the taxis is located inside the rarefaction wave associated with u−c. Then we have
where \(\tilde {d}_{\ell }\) is given in (69), with θ=c_{0}/c_{ℓ}, and (u_{0},ρ_{0},c_{0}) is the limiting value of (u,ρ,c)along the taxis so that u_{0}−c_{0}=0. Then density change rate is given as in (63).
The above formulae look complicated, but seem irreplaceable. We can go to [24] for technical derivation of them.
3.2 Temporalspatial coupling and thermodynamical effect
Thermodynamics distinguishes compressible fluid flows from incompressible ones, and the Mach number can be regarded as a parameter of the compressibility. The entropy dissipation is a necessary condition guaranteeing the stability of numerical schemes. Let’s consider the compressible Euler equations with uniform cross section (A(x)≡constant in (35)). The entropy inequality says
However, it is a wellknown open problem whether this inequality is satisfied at discrete level, particularly for high order accurate schemes. There are two origins of discrete errors: the data projection and the flux approximation. In a general setting of finite volume framework, given the initial data \(\mathbf {u}_{n}(x) \in \mathcal {P}_{k}\) at t=t_{n}, we have to find the solution u_{n+1}(x) at next time level t=t_{n+1}, satisfying
where \((\rho uS)_{j+\frac 12}^{approx}\) is the numerical entropy flux, and Tol(Δx,Δt) is the entropy production that has the maximum tolerance of order three, \(Tol(\Delta x,\Delta t)=\mathcal {O}\left (\Delta t^{3}+\Delta x^{3}\right)\). We comment on how to achieve this inequality at the discrete level in the following.

(i)
The persistence space \(\mathcal {P}_{k}\) often consists of piecewise polynomials of degree k. Given the initial data \(\mathbf {u}_{n}(x)\in \mathcal {P}_{k}\), we solve (35) and obtain the (analytic) entropy solution u(x,t) for t_{n}<t<t_{n+1}, satisfying
$$ \begin{array}{rl} & {\int\nolimits}_{x_{j\frac 12}}^{x_{j+\frac 12}}\rho S\left(\mathbf{u}\left(x,t_{n+1}\right)\right)dx \geq {\int\nolimits}_{x_{j\frac 12}}^{x_{j+\frac 12}}\rho S\left(\mathbf{u}_{n}(x)\right)dx\\ & \left[{\int\nolimits}_{t_{n}}^{t_{n+1}}\rho u S\left(x_{j+\frac 12},t\right)dt{\int\nolimits}_{t_{n}}^{t_{n+1}}\rho u S\left(x_{j\frac 12},t\right)dt\right]. \end{array} $$(75) 
(ii)
The projection of u(x,t) onto \(\mathcal {P}_{k}\) (reconstruction procedure) is required to satisfy
$$ {\int\nolimits}_{x_{j\frac 12}}^{x_{j+\frac 12}}\rho S\left(\mathbf{u}_{n+1} (x)\right)dx \geq {\int\nolimits}_{x_{j\frac 12}}^{x_{j+\frac 12}}\rho S\left(\mathbf{u}\left(x,t_{n+1}\right)\right)dx+\mathcal{O}\left(\Delta x^{3}\right). $$(76)This is an extremely difficult step. For scalar conservation laws, there was a nice discussion on MUSCLtype linear reconstruction [30]. In general, the Jensen inequality tells that
$$ \begin{array}{l} \rho S\left(\bar{\mathbf{u}}_{j}^{n+1}\right) \geq \frac{1}{\Delta x} {\int\nolimits}_{x_{j\frac 12}}^{x_{j+\frac 12}}\rho S\left(x,t_{n+1}\right)dx, \\ \bar{\mathbf{u}}_{j}^{n+1} =\frac{1}{\Delta x} {\int\nolimits}_{x_{j\frac 12}}^{x_{j+\frac 12}}\mathbf{u}\left(x,t_{n+1}\right)dx. \end{array} $$(77)Hence, there is still some room to make (76) hold, which remains an open problem.
Open problem on data projection: Find an optimal reconstruction strategy so that (76) holds.

(iii)
Assume that (76) holds for certain data projection. As shown above, we approximate the interface value in the following way
$$ \mathbf{u}(x_{j+\frac 12},t) = \mathbf{u}_{j+\frac 12}^{n} +\left(\frac{\partial \mathbf{u}}{\partial t}\right)_{j+\frac 12}^{n}(tt_{n}) +\mathcal{O}((tt_{n})^{2}), \ \ \ t_{n}< t< t_{n+1}. $$(78)In particular, we make use of the entropy information. It turns out that
$$ (\rho u S)_{j+\frac 12}^{approx} : = (\rho u S)(x_{j+\frac 12},t_{n+\frac 12})= \frac{1}{\Delta t} \int_{t_{n}}^{t_{n+1}} \rho u S(x_{j+\frac 12},t)dt+\mathcal{O}(\Delta t^{2}). $$(79)Summarizing all together yields (74).
It is observed that the precise calculation of entropy in (53) is a direct way to achieve (79). Other ways may at most lead to
The error of \(\mathcal {O}\left (\\mathbf {u}\^{2}\right)\) is not tolerated unless for scalar cases or smooth flows, since this type of errors violate the entropy inequality in the limit.
It is no doubt that the achievement of (79) is the outcome of the direct use of the entropy equation in (49), which is actually the LaxWendroff procedure, a temporalspatial coupling procedure.
3.3 MD GRP solver and transversal effects
When computing multidimensional (MD) problems, MD GRP solver is necessary to reflect the transversal effect, which is impossible using the exact or approximate normal Riemann solvers. We restrict to twodimensional hyperbolic balance laws
where f and g are flux functions. 3D GRP solver is straightforward. The initial data takes the form
where u_{±}(x,y) are two polynomials of degree k. The xdirection is the normal and the ydirection is the transversal. A particular case is
The MD GRP solver can be classified as MD linear GRP solver, acoustic GRP solver, nonlinear normal GRP solver with transversal perturbation, and genuinely nonlinear MD GRP solver.
(I) MD linear GRP solver. We consider the linear case
where A and B are constant matrices, and both of them have their respective real eigenvalues and the complete sets of eigenvectors. We first assume that (84) is subject to the initial data (83). Note that ∇u satisfies the same form of (84),
but subject to the initial data
This boils down to the standard Riemann problem for ∇u. Therefore, the gradient ∇u has an explicit expression,
where the notations L(x,t) is the maximum value of ℓ such that x−λ^{ℓ}t>0, λ^{ℓ} is the eigenvalue of A and r^{ℓ} is the associated eigenvector, v is so defined that
See [31]. In particular, we have
Then we immediately obtain
As far as the more general initial data (82) is concerned, the solution u consists of piecewise polynomials of the same degree as the initial data since (84) is a linear system. Here we are satisfied with the second order GRP solver and solve (84) at any point (0,y_{0},0) to obtain
where ∇u(0,y_{0},0^{+}) are calculated as the same procedure as above.
(II) MD acoustic GRP solver.
For nonlinear cases (81), if the initial data (82) is continuous but discontinuous in its derivatives, acoustic waves emanate from the interface x=0, just as onedimensional case. For this case, we might as well take the initial data (83) and assume that u_{−}=u_{+} but ∥∇u_{0,−}−∇u_{0,+}∥≠0. Then we linearize (81) around the state u_{0}=u_{−}=u_{+} to obtain
Then we can exactly follow the linear case to calculate (∂u/∂t)_{0}.
The acoustic approximation applies for the case ∥u_{−}−u_{+}∥≪1. We linearize (81) around the intermediate state u_{0} resulting from the associated Riemann problem. Then the linear GRP solver applies for this case.
(III) MD genuinely nonlinear GRP solver with transversal description.
As ∥u_{−}−u_{+}∥≫1, we have to deal with genuinely nonlinear GRP. Thinking of the initial value problem for (81) subject to the initial data (83), the solution is the envelope of Riemann solution along x=0 locally at t=0. Hence along x=0, the associated Riemann solution is known. For example, at two points (0,y_{1},0) and (0,y_{2},0), we solve the Riemann problem locally for the normal conservation law, respectively,
and obtain the local intermediate values u(0,y_{1},0^{+}) and u(0,y_{2},0^{+}). Then for any point (0,y,0), y_{1}<y<y_{2}, we can approximate \(\frac {\partial \mathbf {u}}{\partial y}(0,y,0^{+})\). Particularly, we approximate
Then we regard the transversal term g(u)_{y} and h(x,y,u) as a perturbation locally, and solve the following problem,
This boils down to the onedimensional planar problem locally, for which the GRP solver was proposed in [24]. Detailed and complete MD GRP solver is proposed in [32].
3.4 Transversal effects for genuinely MD schemes
For multidimensional (MD) problems, the balance law can be always written in the form,
where Ω is the control volume, ∂Ω is the boundary and n is the outer unit normal. We ignore the external force just for the clarity of presentation.
Thanks to the Galilean invariance, we always assume that (1,0) (the direction xaxis) is the normal direction, and (0,1) (the direction of yaxis) is the transversal direction. The standard Riemann solver just reflects the normal effect. In contrast, the LW procedure can describe the transversal effect precisely. Consider a linear advection problem
Then we use the temporalspatial coupling property to obtain
where \((\frac {\partial u}{\partial x})_{\partial \Omega }\) and \((\frac {\partial u}{\partial y})_{\partial \Omega }\) can be obtained by solving the associated Riemann problem. Also as remarked in Section 2 for the linear wave system, the transversal effect is substantial even though the convergence rate is formally the same.
4 The kinetic LW flow solver
The fluid dynamics can be described in various viewpoints, such as the kinetic description. The governing equation is the Boltzmanntype equation
where f=f(t,x,ξ) is the density distribution, ξ is the velocity of molecules (particle), and B(f,f) is the collision term, ε is the Knusner number. Ideally, for a given initial distribution, we solve (99) to obtain the solution \(f\left (t,x_{j+\frac 12}, \xi \right)\) and define the numerical flux
where ψ=(1,ξ,ξ^{2})^{⊤} is the invariant, and the average of macroscopic variables is
In general, it is difficult to solve the Eq. 99 analytically. To understand the relation of macroscopic equations (Euler and NavierStokes equations) and the kinetic equation, we first take the socalled railroad method in [33] as an example to illustrate how to devise kinetic schemes.
4.1 Railroad method
Consider the linear advection equation
Introduce a distribution function f(t,x,ξ) and define the macroscopic variable u(x,t) as a moment of f,
If we choose f to take the form,
then f(t,x,ξ) satisfies
subject to initial data
The initial value problem (102) and the problem (103)(106) are equivalent: If one solution is known, then the other is defined. We write the solution of (105)(106) as
Then the solution u(x,Δt) is given as
Note that the LW approach for (107) yields
Therefore we have
which yields a second order approximation to the exact solution u(x,t).
The numerical solution is
where
We assume the initial data for (102) is piecewise smooth with possible discontinuity at \(x=x_{j+\frac 12}\). Correspondingly, the initial data (106) for (105) consists of two parts. It turns out that the numerical flux \(F_{j+\frac 12}\) in (111) becomes
where \(F_{j+\frac 12}^{\pm }\) consist of three parts, respectively,
As the solution is smooth, the scheme (111) becomes the LW approach immediately. See [33] for details.
4.2 The LW type solver for gas kinetic schemes
Let’s now work on a simplified model, the BhatnagarGrossKrook (BGK) model [34],
where ε is the collision time, and g is the equilibrium state, approached by f as ε goes to zero,
where m and k are constant, ρ and T are density and temperature, respectively. Indeed, all macroscopic variables ρ, u and E are defined as
The validity of BGKmodel is clearly explained in [34].
Starting with (114), Xu and his collaborators successfully developed gas kinetic scheme (GKS) solver [35–39]. A key ingredient is that the explicit solution formula for (114) is used for the numerical flux approximation,
subject to the initial data f_{0}(x,ξ), where \(x^{\prime }=x_{j+\frac 12}\xi (tt^{\prime })\). Here just the case of onedimension is described. The full information contained in (117) provides “exact” expression of flux across the interface \(x=x_{j+\frac 12}\), which is of course consistent with the LW flow solver. We can go to [38] for comprehensive description of the GKS solver. For the gaskinetic scheme, the gas evolution is a relaxation process from kinetic to hydrodynamic scale through the exponential function, and the corresponding flux is a complicated function of time.
In order to obtain the time derivatives of the flux function at t_{n} and t_{∗}=t_{n}+Δt/2 with the correct physics, the flux function should be approximated as a linear function of time within a time interval. Let’s first introduce the following notation,
In the time interval [t_{n},t_{n}+Δt], the flux is expanded as the following linear form
The coefficients \(F_{j+1/2}^{n}\) and \(\partial _{t}F_{j+1/2}^{n}\) can be determined as follows,
By solving the linear system, we have
Similarly, F_{i+1/2}(W^{∗},t_{∗}),∂_{t}F_{i+1/2}(W^{∗},t_{∗}) for the intermediate state can be constructed. For the twodimensional computation, the corresponding fluxes in the ydirection can be obtained as well. Readers are referred to [18].
There are huge numbers of references about kinetic solvers, which are beyond the scope of the current paper. We stop to discuss further.
5 Compact reconstruction using the Hermite interpolation
The compactness is a key factor in the design of high order schemes, determining the dissipation of the schemes near discontinuities and the numerical treatment of boundary conditions. With the increase of timestepping, the width of computational stencils is inevitably expanded for multistage methods. Hence it is very important to construct the data in a compact way.
Unlike WENO using the Lagrangian interpolation, we adopt the Hermitetype interpolation using both the average values of physical (conservative or primitive) variables, and the approximate gradient of the solution. Going back to the original GRP, we construct the data over the computation cell \(\left (x_{j\frac 12},x_{j+\frac 12}\right)\) as
where the gradient is chosen through the procedure,
Usually, α is chosen to be as large as possible. As α∈(1,2), u_{n}(x) behaves as sawtooth and implies that \(\sigma _{j}^{n}\) take mostly
This is a natural approximation to the gradient. The boundary value \(u_{j+\frac 12}^{n,}\), as a strong solution along the cell interface \(x=x_{j+\frac 12}\), is calculated from the history,
where \(u_{j+\frac 12}^{n1}\) and \(\left (\frac {\partial u}{\partial t}\right)_{j+\frac 12}^{n1}\) are obtained already from the GRP solver, and no extra efforts need making.
Some remarks on (121) are made here, and they can be applied for later high order data interpolations.

(i)
Compared to the classical limiter algorithm, (121) takes (122) in smooth regions, and limit the gradient near discontinuities in order to suppress possible oscillations. This sawtoothtype reconstruction can produce sharper profiles of discontinuities.

(ii)
The piecewise linear data (120) is the embryonic form of Hermite polynomials for high order schemes. Since all values are already given using the GRP solver, no extra effort is made on the calculation of the gradient, unlike in DG methods or other Hermite interpolation [40]. If one might argue the freedom of solution elements, he could regard the current treatment as the Lagrangian interpolation using five points values.

(iii)
For the data (120), five points values are used for the data reconstruction. Essentially, these values are defined in three computational cells, rather than in five cell, so that computational stencils are almost half saved. This is one of key factors achieving compactness.
Now we extend this to the twostage fourth order method, by reviewing the result in [41]. Given the average \(\bar {u}_{j}\) and the derivative Δu_{j} of the function u(x) over the cell I_{j},
we want to construct a polynomial p(x) such that \(u_{j+\frac 12,}\) is its left limiting values at \(x=x_{j+\frac 12}\). Choose three stencils
On stencil S^{(0)}, \( \bar {u}_{j1} \), \( \bar {u}_{j} \) and \( \bar {u}_{j+1} \) are used to construct a polynomial p^{(0)} for the interpolation. Hence at \( x_{j+\frac 12} \), we have
Similarly, p^{(−1)} and p^{(1)} are constructed by using \( \bar {u}_{j} \), \( \bar {u}_{j1} \), Δu_{j−1} on S^{(−1)} and by using \( \bar {u}_{j} \), \( \bar {u}_{j+1} \), Δu_{j+1} on S^{(1)}, respectively,
If the solution is smooth on the large stencil I_{−1}∪I_{0}∪I_{1}, we have
Thus the linear weights of the three stencils are
which ensure
The smoothness indicators are defined by
in the same way as in the WENO reconstructions where p^{(r)}(x) is the interpolation polynomial on stencil S^{(r)}. Their explicit expressions are
Then we compute the nonlinear weights in the same way as the WENOZ method does
where τ^{z}=β^{(1)}−β^{(−1)} and ε is a small parameter in order to avoid a zero denominator. Finally we have
The right interface value \( \mathbf {u}_{j\frac 12, +} \) can be reconstructed in a similar way by mirroring the above procedure with respect to \( x_{j} = \frac {1}{2}\left (x_{j\frac 12} + x_{j+\frac 12}\right) \).
Since the GRP solver has to use the spatial derivative \((\partial u/\partial x)_{j+\frac 12,\pm }\), we approximate them using the interpolation,
It is observed in this interpolation does not need the WENOtype stencil selection procedure.
We define this procedure as HWENO, terming a Hermite type interpolation using the WENO interpolation strategy. GRP4HWENO5 refers to the twostage fourth order scheme based on this Hermite type interpolation using the GRP solver.
For twodimensional cases, we can develop the similar approach over rectangular meshes. See [41, 42]. As far as unstructured meshes are concerned, there still remains space to explore.
Here we give an example to demonstrate how important the compactness is. We provide an example of twodimensional Riemann problem taken from [43] involving the interactions of vortex sheets with rarefaction waves. The computation is implemented over the domain [0,1]×[0,1].
The output time is 0.3. The contours of the density and their local enlargements are shown in Fig. 4. We can see that the scheme with the Hermite type reconstruction can resolve more small structures along the vortex sheet.
6 High order boundary conditions
Approximation to boundary conditions may be one of the most challenging issues in CFD. On one hand, mathematical modelings of fluid flows near physical boundaries are diverse. On the other hand, highly nonlinear behaviors and complex boundaries make the approximation notoriously involved.
We briefly illustrate their idea in the finite difference framework by considering the initial boundary value problem (IBVP) for a scalar conservation law
Assume that f^{′}(u)>0 for all \( u\in \mathfrak {R} \) so that x=0 is an inflow boundary and x=1 is an outflow boundary. We equally distribute M+1 points {x_{j}=(j+1/2)h:j=0,1,…,M} in the computational domain (0,1), as shown in Fig. 5. We use u_{j} to denote the value of u at x=x_{j} and suppress the index for the time levels. Obviously at the inflow boundary, the solution value at the ghost point x_{−1} is required in order to perform a secondorder finite difference at x_{0}. For this purpose, a polynomial is constructed in the region around the inflow boundary by using pointwise values u_{−1}, u_{0} and u_{1},
from which we want to find the value u_{−1}. The Lagrangian interpolation tells that
Then u_{−1} can be obtained by solving the linear equation u(0,t)=L(0) where u(0,t)=g(t). At the outflow boundary x=1, we simply use the extrapolation
to obtain the value u_{M+1} since the signal goes out of the computational domain at this end.
The extension to high order is highly nontrivial. Let’s review the approach developed in [44]. The same as other multistage methods (e.g. in [45]), the current twostage fourth order method needs careful treatment at the intermediate stage for the approximation in order to preserve the accuracy. There are two key points: The construction at ghosts points and the approximation of boundary conditions. The inverse LW approach is applied here [46], but the current treatment is much simpler and easier to be implemented since no higher derivatives need calculating.
6.1 Ghost values
We still consider IBVP (136). Then the values \( \bar {u}_{1} \), \( \bar {u}_{2} \), Δu_{−1} and Δu_{−2}, defined over I_{−1}=(−h,0) and I_{−2}=(−2h,−h), ghost cells, are needed in the reconstruction procedure for the values indexed by j=0 and j=1. To obtain the values mentioned above, a cubic polynomial,
is constructed over I_{−2}∪I_{−1}∪I_{0}∪I_{1}=(−2h,2h) to interpolate the solution u(x,t^{n}) such that
With the constraints (141) into (140), we determine the coefficients α_{0}, α_{1}, α_{2} and α_{3} as
in which \( \bar {u}_{1} \) and \( \bar {u}_{2} \) are yet to be determined and they are obtained by evaluating p(0) and p^{′}(0) at the boundary x=0,
Solving (143) in terms of \(\bar {u}_{1}\) and \(\bar {u}_{2}\) yields (by ignoring high order terms)
Substituting (144) into (142), in turn, gives us the explicit expressions of α_{i}, i=0,…,3, and then the expression of p(x). Therefore we have (by ignoring high order terms)
Thus (144) and (145) together provide the values in the ghost cells I_{−1} and I_{−2}. Not that in (143) the inverse LW approach is used,
As there are discontinuities close to the inflow boundary, a WENOtype stencil selecting procedure can be applied. Assume that there is a discontinuity in either I_{0} or I_{1}, we shorten the stencil cell by cell. Denote the stencils by
Denote by p^{(r)}(x) the interpolation polynomial on S^{(r)}, r=0,1,2, just as the polynomial p(x) constructed before. Then define
The expressions of \( \bar { u}_{1}^{(r)} \), \( \bar { u}_{2}^{(r)} \), \( \Delta u^{(r)}_{1} \) and \( \Delta u^{(r)}_{2} \) for r=0,1,2 will be listed in 9.1.
The smoothness indicators are defined in the same way as for the classical WENO interpolation, and the values are given
where the linear weights of each stencil are
6.2 Inflow boundary condition treatment at intermediate stages
The same as in other multistage temporal discretization [47, 48], the direct use of exact boundary conditions at intermediate stages in the process of multistage approaches will cause the lose of the numerical accuracy. In order to offset such a defect, our strategy is made as follows. We first focus on the leftmost control volume I_{0} and write out the solution advancing formula,
Using the governing Eq. 136 to replace the temporal derivatives by the corresponding spatial ones, we obtain
The difficulty results from the presence of \( ({\partial u/\partial x})^{n+\frac 12}_{\frac 12} \) and \( ({\partial u/\partial x})^{n+\frac 12}_{\frac 12} \) evaluated at the intermediate stage \(t=t^{n+\frac 12}\). In order to restore the fourthorder accuracy of the twostage fourthorder scheme, we use
where the exact boundary values \(g\left (t^{n+\frac 12}\right)\) and \(g^{\prime }\left (t^{n+\frac 12}\right)\) are replaced by
The detailed analysis is given in [44].
6.3 Outflow boundary condition
We set \( x_{M+\frac 12}=1 \) as an outflow boundary, at which no boundary condition is prescribed theoretically. Numerically, we have to set required values \( \bar {u}_{M+1} \), \( \bar {u}_{M+2} \), Δu_{M+1} and Δu_{M+2} in ghost cells. Since the signal propagates out of the computational domain through the boundary x=1, the extrapolation can be used to construct the data in the ghost cells I_{M+1} and I_{M+2}. A cubic polynomial is constructed in order to achieve the fourthorder accuracy,
This gives the values
If there is a discontinuity in either I_{M−3}, I_{M−2}, I_{M−1} or I_{M}, a WENOtype stencil selection can be applied.
6.4 Hyperbolic systems
At moment, the boundary treatment for systems of hyperbolic balance laws is basically achieved through the diagonalization process. Then we distinguish various cases such as the solid boundary condition, inflow and outflow boundary conditions for practical applications. Details can be found in [44].
7 Computational performance
In our series of papers, we have demonstrated the performance of current temporalspatially coupled algorithms through many challenging benchmark problems, particularly in [49] using the GKS solver. Here I would like to give some remarks in terms of computational efficiency, robustness and fidelity.
7.1 Computational efficiency
Computational efficiency is always an important issue for practical engineering problems. We have tested and compared the efficiency with the popular WENO algorithm in [18] and with DG in [19].
Specifically, in [18] we evaluate the computational costs of the WENOtype reconstruction and the flux evaluation quantitatively. The time for each reconstruction is denoted by T_{R}, the time for secondorder gaskinetic solver is T_{2nd}, and the time for thirdorder flux solver is T_{3rd}. According to the data provided in ([18], Table 1, Page 203) we can estimate the time used for the computations of flux and reconstruction with the following relations,
where the estimation is based on the characteristic variable reconstruction and each flux is shared by two cells. Thus, the time for reconstruction is T_{R}=0.71289s, the time for secondorder gaskinetic flux solver is T_{2nd}=0.06499s and the time for thirdorder gaskinetic flux solver is T_{3rd}=0.33445s. For classical fourthorder RungeKutta schemes, the computational time for four spatial reconstruction alone will become much higher than the fourthorder gaskinetic scheme for the update of each cell averaged values
Similar estimation can be done for the conservative variables reconstruction. Even without counting on the cost of the flux evaluation in the traditional fourthorder RungeKutta method, such as those commonly used with the LaxFriedrichs flux, the current fourthorder time stepping method is still more efficient than the classical methods.
The efficiency is mainly attributed to the half of reconstruction steps compared to that for the same order of other line methods. This is further verified in the framework of DG methods [19]. In Table 2 and Fig. 6 through simulating shockvortex interaction problem, demonstrating that nearly 55% CPU time can be saved using the GRPDG(s2p3) method compared to the same order SSP RKDG(s5p3) method. This result meets the expectation well as compared to the RKDG(s5p3) method which needs five stages of evaluating DoFs and performing reconstruction to achieve fourth order, while the GRPDG(s2p3) method only takes two stages to provide totally comparable results.
7.2 Robustness
The robustness is always an important indicator for a practical numerical method. In the framework of multistage multiderivative algorithm, the strong stability preserving (SSP) property was taken over to show the stability [9]. However, SSP seems not work when the LaxWendorff type flow solvers are taken as the building block. Therefore new stability framework is worth exploring in the future.
Nevertheless, in practice, the current twostage fourth order accurate algorithm has the same stability as the second order version: the Courant number is taken above 0.5 except extreme cases such as the large density ration problem. Empirically, the current “ 2⊙2” algorithm is more robust than other multistage methods.
7.3 Fidelity
In the community of CFD, the fidelity is termed for a numerical simulation of very complex problems using a specific algorithm. Since there is no reliable mathematical theory in general supporting the current CFD simulation, the verification of high fidelity appears very valuable. We pursue such studies in the whole process of the current algorithm. For example, we resolve the associated GRP analytically and use the GRP solution for Hermitetype data reconstruction. In [16] we elaborate the socalled large density ratio problem [50] using the GRP solver. When the current “ 2⊙2” algorithm is adopted, quite few grids are needed to obtain satisfactory results, as shown in Fig. 7.
Also readers are recommended to test the benchmark problems in [49], for which all simulations are made in the “ 2⊙2” framework using the GKS solver.
8 Conclusion with prospective discussions
It is natural to require the temporalspatial coupling of a numerical method when simulating compressible fluid flows, for which the GRP solver and the GKS solver are reviewed briefly as the representatives of LaxWendroff type flow solvers. The direct embedding into any numerical frameworks, such as the finite volume/DG framework, already results in favorable second order numerical schemes. Interested readers can refer to papers by Jiequan Li and his collaborators for GRP methods (www.ams.org/mathscinet, scholar.google.com or researchgate.net).
As to the “ 2⊙2” algorithm itself, it is just at the beginning stage, and many issues are awaiting for our study. Below are some immediate doable problems.

P_{1} What is a good framework for stability analysis?

P_{2} It is valuable to compare and develop multistage twoderivative algorithms with arbitrary order of accuracy.

P_{3} Develop implicit “ 2⊙2” algorithm with various applications such as detonation simulation.

P_{4} Apply this algorithm for the simulation of turbulence flows and other engineering problems.
You are welcome to join this new branch of high order numerical methods for CFD.
9 The interpolation results in subsection 5
This appendix is dedicated to list the interpolation results in Section 5. Recall that we assume x=0 and x=1 are the inflow and outflow boundaries for the IBVP (136) of the onedimensional scalar conservation laws, respectively. The stencils are denoted in (146).
9.1 Cell averages and cell differences
The reconstructed average of u in I_{−1} and I_{−2} on those stencils are:
The reconstructed xdifference of u in I_{−1} and I_{−2} on those stencils are:
9.2 Smoothness indicators
The smoothness indicators on these stencils are listed as follows,
References
Jiang GS, Shu CW (1996) Efficient implementation of weighted ENO schemes. J Comput Phys 126:202–228.
Cockburn B, Shu CW (1989) TVB RungeKutta local projection discontinuous Galerkin finite element method for conservation laws. II. general framework. Math Comput 52:411–435.
Evans L (2002) Partial Differential Equations. Graduate Studies in Mathematics, 19, AMS.
Li J, Du Z (2016) A twostage fourth order temporal discretization for on the LaxWendroff type flow solvers, I. hyperbolic conservation laws. SIAM J Sci Comput 38:A3046–A3069.
Butcher JC (1964) On RungeKutta processes of high order. J Aust Math Soc 4:179–194.
Feng K, Qin M (2010) Symplectic Geometric Algorithms for Hamiltonian Systems. Springer, Springer.
Chan PK, Tsai R (2010) On explicit twoderivative RungeKutta methods. Numer Algoritm 53:171–194.
Christlieb AJ, Gottlieb S, Grant Z, Seal DC (2016) Explicit strong stability preserving multistage twoderivative timestepping schemes. J Sci Comput 68:914–942.
Grant Z, Gottlieb S, Seal DC (2018) A strong stability preserving analysis for multistage twoderivative timestepping schemes based on Taylor series conditions. arXiv:1804.10526.
Seal DC, Guclu Y, Christlieb AJ (2014) Highorder multiderivative time integrators for hyperbolic conservation laws. J Sci Comput 60:101–140.
Tsai AYJ, Chan RPK, Wang S (2014) Twoderivative RungeKutta methods for PDEs using a novel discretization approach. Numer Algoritm 65:687–703.
Lax P, Wendroff B (1960) Systems of conservation laws. Commun Pur Appl Math XIII:217–237.
Harten A (1983) High resolution schemes for hyperbolic conservation laws. J Comput Phys 49:357–393.
Lei X, Li J (2019) Transversal effects and genuine multidimensionality of high order numerical schemes for compressible fluid flows. accepted.
Li J, Chen G (2006) The generalized Riemann problem method for the shallow water equations with bottom topography. Int J Numer Methods Eng 65:834–862.
Li J, Wang Y (2017) Thermodynamical effects and high resolution methods for compressible fluid flows. J Comput Phys 343:340–354.
Christlieb AJ, Gottlieb S, Grant Z, Seal DC (2016) Explicit strong stability preserving multistage twoderivative timestepping schemes. J Sci Comput 68:914–942.
Pan L, Xu K, Li Q, Li J (2017) An efficient and accurate twostage fourthorder gaskinetic scheme for the Euler and NavierStokes equations. J Comput Phys 326:197–221.
Cheng J, Du Z, Lei X, Wang Y, Li J (2019) A twostage fourthorder discontinuous Galerkin method based on the GRP solver for the compressible Euler equations. Computer and Fluids in revision. https://doi.org/10.1016/j.compfluid.2019.01.025.
Landau L, Lifshitz E (1987) Fluid Dynamics: Course of Theoretical Physics, Vol. 6. A Division of Reed Educational and Professional Publishing Ltd, ButterworthHeinemann.
BenArtzi M, Falcovitz J (1984) A secondorder Godunovtype scheme for compressible fluid dynamics. J Comput Phys 55:1–32.
BenArtzi M, Falcovitz J (2003) Generalized Riemann Problems in Computational Fluid Dynamics. Cambridge University Press, Cambridge.
BenArtzi M, Li J, Warnecke G (2006) A direct Eulerian GRP scheme for compressible fluid flows. J Comput Phys 218:19–43.
BenArtzi M, Li J (2007) Hyperbolic conservation laws: Riemann invariants and the generalized Riemann problem. Numer Math 106:369–425.
Qian J, Li J, Wang S (2014) The generalized Riemann problems for compressible fluid flows: Towards high order. J Comput Phys 259:358–389.
Balsara DS, Li J, Montecinos GI (2018) An efficient, second order accurate, universal generalized Riemann problem solver based on the HLLI Riemann solver. J Comput Phys 375:1238–1269.
BenArtzi M, Falcovitz J (1986) An upwind secondorder scheme for compressible duct flows. SIAM J Sci Stat Comput 7:744–768.
Titarev VA, Toro EF (2002) ADER: Arbitrary high order Godunov approach. J Sci Comput 17:609–618.
Li J, Wang Y (2018) The GRP scheme for real materials. Preprint.
Bouchut F, Bourdarias Ch, Perthame B (1996) A MUSCL method satisfying all the numerical entropy inequalities. Math Comput 65:1439–1461.
LeVeque RJ (2002) Finite Volume Methods for Hyperbolic Problems. Cambridge University Press.
Qi J (2017) The numerical modeling and applications of generalized Riemann problem for twodimensional Euler equations. PhD Thesis, Beijing Normal University.
Ohwada T (2002) On the construction of kinetic schemes. J Comput Phys 177:156–175.
Bhatnagar PL, Gross EP, Krook M (1954) A model for collision processes in gases I: Small amplitude processes in charged and neutral onecomponent systems. Phys Rev 94:55.
Prendergast KH, Xu K (1993) Numerical hydrodynamics from gaskinetic theory. J Comput Phys 109:53–66.
Xu K (2001) A gaskinetic BGK scheme for the NavierStokes equations and its connection with artificial dissipation and Godunov method. J Comput Phys 171:289–335.
Xu K (2010) A unified gaskinetic scheme for continuum and rarefied flows. J Comput Phys 229:7747–7764.
Xu K (2015) Direct Modeling for Computational Fluid Dynamics construction and application of unified gaskinetic schemes. World Scientific.
Xu K, Prendergast K (1994) Numerical NavierStokes solutions from gas kinetic theory. J Comput Phys 114:9–17.
Qiu J, Shu CW (2004) Hermite weno schemes and their application as limiters for RungeKutta discontinuous Galerkin method: onedimensional case. J Comput Phys 193:115–135.
Du Z, Li J (2018) A Hermite weno reconstruction for fourth order temporal accurate schemes based on the GRP solver for hyperbolic conservation laws. J Comput Phys 355:385–396.
Ji X, Pan L, Shyy W, Xu K (2018) A compact fourthorder gaskinetic scheme for the Euler and NavierStokes equations. J Comput Phys 372:446–472.
Han E, Li J, Tang H (2011) Accuracy of the adaptive GRP scheme and the simulation of 2d Riemann problems for compressible Euler equations. Commun Comput Phys 10:577–609.
Du Z, Li J (2018) A twostage fourth order timeaccurate discretization for Lax–Wendroff type flow solvers II. high order numerical boundary conditions. J Comput Phys 369:125–147.
Carpenter M, Gottlieb D, Abarbanel S, Don WS (1995) The theoretical accuracy of RungeKutta time discretizations for the initial boundary value problem: a study of the boundary error. SIAM J Sci Comput 16:1241–1252.
Tan S, Shu CW (2010) Inverse LaxWendroff procedure for numerical boundary conditions of conservation laws. J Comput Phys 229:8144–8166.
Carpenter M, Gottlieb D, Abarbanel S, Don WS (1989) The theoretical accuracy of RungeKutta time discretizations for the initial boundary value problem: a study of the boundary error. Math Computat 52:411–435.
Pathria D (1997) The correct formulation of intermediate boundary conditions for RungeKutta time integration of initial boundary value problems. SIAM J Sci Comput 18:1255–1266.
Pan L, Li J, Xu K (2017) A few benchmark test cases for higherorder Euler solvers. Numer Math Theory Methods Appl 10:711–736.
Tang H, Liu T (2006) Note on the conservative schemes for the Euler equations. J Comput Phys 218:451–459.
Acknowledgements
This review paper is based on the joint works with Matania BenArtzi, Jian Cheng, Zhifang Du, Xin Lei, Liang Pan, Jin Qi, Yue Wang and Kun Xu, to whom the author expresses his deep thanks.
Funding
This work is supported by NSFC (nos. 11771054, 91852207) and Foundation of LCP.
Availability of data and materials
All data and materials are available from Jiequan Li’s research.
Author information
Authors and Affiliations
Contributions
This is a single author work. The author read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The author declares that he/she has no competing interests.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Li, J. Twostage fourth order: temporalspatial coupling in computational fluid dynamics (CFD). Adv. Aerodyn. 1, 3 (2019). https://doi.org/10.1186/s4277401900049
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s4277401900049
Keywords
 Compressible fluid dynamics
 Hyperbolic balance laws
 High order methods
 Temporalspatial coupling
 Multistage twoderivative methods
 LaxWendroff type flow solvers
 GRP solver