Abstract
In this paper, we propose a new class of discontinuous Galerkin (DG) methods for solving 1D conservation laws on unfitted meshes. The standard DG method is used in the interior cells. For the small cut elements around the boundaries, we directly design approximation polynomials based on inverse Lax-Wendroff (ILW) principles for the inflow boundary conditions and introduce the post-processing to preserve the local conservation properties of the DG method. The theoretical analysis shows that our proposed methods have the same stability and numerical accuracy as the standard DG method in the inner region. An additional nonlinear limiter is designed to prevent spurious oscillations if a shock is near the boundary. Numerical results indicate that our methods achieve optimal numerical accuracy for smooth problems and do not introduce additional oscillations in discontinuous problems.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Many practical problems in computational fluid dynamics can be described by hyperbolic conservation laws on complex geometries. To avoid the difficulty in generating high-quality meshes in many problems, such as complex domains or moving interface problems, using unfitted meshes is a common approach. In this framework, the computational mesh is composed of the embedded Cartesian cells within the domain internally, and irregular “cut” cells are produced by the boundary interacting with each regular grid cell. Since the boundary of the computational area does not coincide with the physical boundary, boundary conditions on the computational domain must be carefully treated to obtain an optimal convergence rate. On the other hand, the irregular cut cells on the domain boundary may be arbitrarily small. It will bring the so-called “small-cell” problem, leading to a severe time step restriction for time-dependent problems. In this paper, we develop a high-order discontinuous Galerkin (DG) method for 1D hyperbolic conservation laws on unfitted meshes. In particular, a novel boundary treatment would be carefully designed to overcome the “small-cell” problem.
The DG method is a class of finite-element methods choosing a set of discontinuous basis functions. The DG method was first introduced by Reed and Hill [26]. Significant breakthroughs were gained by the so-called RKDG methods for solving hyperbolic conservation laws [5,6,7,8,9], in which the DG discretization is only used for the spatial variables, and the time discretization is achieved by the Runge-Kutta methods. DG methods offer numerous advantages compared to classical finite element methods and have found wide applications in various fields. For more details on DG, we refer to [28]. The DG methods on unfitted meshes have been addressed in the literature, and the small-cell problem can be avoided in distinct ways, such as the implicit time stepping [1], the cell merging or the cell agglomeration [24, 25, 27], the stabilization with ghost penalty [2, 11, 12, 14, 15, 30, 31], the state redistribution [13], and the shifted boundary method [29]. In this paper, we are going to give a novel boundary treatment based on the inverse Lax-Wendroff (ILW) principle for the DG method.
The ILW method was developed to give values of ghost points for high-order finite-difference methods on a Cartesian mesh. The first work for hyperbolic conservation law equations was introduced by Tan and Shu [32] and applied to inviscid compressible fluids. Given the inflow boundary conditions, they transformed the normal derivative into the time derivative and the tangential derivative via using the partial differential equation (PDE) repeatedly. Then, values at the ghost points near the boundary were obtained by a Taylor expansion with these normal derivatives. To avoid the heavy algebra of the ILW procedure for nonlinear systems, especially in the high-dimensional cases, the simplified ILW (SILW) method was proposed in Ref. [34], in which high-order derivatives are constructed by extrapolation directly. In Ref. [23], Lu et al. proposed an ILW method to deal with problems with changing wind direction on the boundary. The numerical fluxes near the boundary were suitably modified so that strict conservation of the total mass was achieved in Ref. [10]. In addition, the ILW method has been subsequently applied to various other time-dependent problems, including the advection equations and viscous compressible fluids [22], hyperbolic systems with source terms [36], and moving boundary problems [4, 20, 21, 33]. The linear stability of (S)ILW methods was studied in Refs. [16,17,18,19].
Owing to the advantages, including the ability to achieve arbitrary orders of accuracy and efficiently avoid the small-cell problem, extensive and in-depth research has been conducted on the ILW method within the context of finite-difference schemes. In this paper, we want to incorporate the ILW boundary treatment with DG methods, which could be beneficial for DG methods on unfitted meshes and complex boundary problems. As an initial step and a proof of concept, in this paper, we restrict our attention to 1D hyperbolic conservation laws on an unfitted mesh. The standard DG method would be used on the interior elements. Meanwhile, we treat these small boundary elements as special virtual elements and apply the principles of the (S)ILW treatment to design the numerical boundary conditions. This approach completely mitigates the issue of small time steps, ensuring that our method maintains the same explicit time step as the standard DG method. Moreover, we find that the boundary treatment will break the local conservative property on those virtual elements, leading to a significant impact on the magnitude of errors. An additional post-processing technique is proposed to preserve the local conservation. In the presence of shocks propagating from the inflow boundary, we develop an extra nonlinear limiter to prevent oscillations and maintain accuracy.
The rest of the paper is organized as follows. In Sect. 2, we develop the high-order boundary treatment based on (S)ILW principles for both scalar problems and linear systems. Theoretical analysis, including the stability analysis and error estimates, is presented in Sect. 3. Numerical examples are presented in Sect. 4 to demonstrate the effectiveness of our approach. Concluding remarks are given in Sect. 5.
2 (S)ILW Method for 1D Conservation Laws
We start our discussion with the 1D scalar hyperbolic conservation law on the physical domain \(\varOmega =[a,b]\),
We assume that \(f'(u(a,t))\geqslant \sigma >0\) and \(f'(u(b,t))\geqslant 0\) for \(t>0\). Under this assumption, the left boundary \(x=a\) is an inflow boundary where a Dirichlet boundary condition is imposed, and the right boundary \(x=b\) is an outflow boundary where no boundary condition is needed.
Here, we assume the domain is partitioned by the uniform mesh (see Fig. 1)
with the uniform mesh size \(h=(b-a-\delta _1-\delta _2)/N\), \(N \in \mathbb {N}\). Note that the physical boundary is allowed to be not coinciding with grid points, and the distance \(\delta _{1,2}\) can be any non-negative number between 0 and h. Let \(I_j = [x_{j-\frac{1}{2}}, x_{j+\frac{1}{2}}]\) denote an element with the length of h, \(j=1, \cdots , N\), and \(\widetilde{\varOmega } = [x_\frac{1}{2}, x_{N+\frac{1}{2}}] = \cup _{i=1}^{N} I_j\) is called the computational domain, in which the numerical solutions are computed via the standard DG method. The non-overlapping cut cells between \(\varOmega \) and \(\widetilde{\varOmega }\) are denoted by \(\tilde{I}_0 = [a,x_\frac{1}{2}]\) and \(\tilde{I}_{N+1}=[x_{N+\frac{1}{2}}, b]\).
Let \(P^k(I_{j})\) be the space of polynomials of degree at most \(k \geqslant 0\) on \(I_{j}\), and the DG finite-element space is defined as
The semi-discrete DG method for solving (1) is defined as follows: find the unique function \(u_h(\cdot ,t)\in V_h^k\) such that for all test functions \(v_h\in V_h^k\) and all \(1\leqslant j \leqslant N\), we have
Here, \(w\left( x_{j+\frac{1}{2}}^{-},t\right) \) and \(w\left( x_{j+\frac{1}{2}}^{+},t\right) \) are the left and right limits of the discontinuous solution w(x, t) at the interface \(x_{j+\frac{1}{2}}\), respectively. \(\hat{f}_{j+\frac{1}{2}} = \hat{f}\left( u_h\left( x_{j+\frac{1}{2}}^-,t\right) ,u_h\left( x_{j+\frac{1}{2}}^+,t\right) \right) \; ( j=1,2,\cdots ,N-1)\) is the monotone numerical flux as in the standard DG method, which satisfies the following conditions:
-
it is consistent with the flux f(u), i.e., \(\hat{f}(u,u) = f(u)\);
-
it is at least locally Lipschitz continuous with respect to both arguments;
-
it is a nondecreasing function of its first argument, and a nonincreasing function of its second argument.
In particular, the Lax-Friedrichs flux is one of the most commonly used monotone fluxes:
The semi-discrete DG scheme (3) can be rewritten as the first-order ordinary differential equation (ODE) system \(u_t=\mathcal {L}(u)\), where the operator \(\mathcal {L}(u)\) arises from the spatial discretization. The third-order TVD Runge-Kutta method is used for the time discretization:
It has been demonstrated in Ref. [7] that to ensure the stability of the RKDG method with \(P^k\) elements for problems with periodic boundary conditions, the time step \(\Delta t\) must satisfy the condition \(\Delta t \leqslant \frac{1}{2k+1}\frac{h}{\alpha }\). For the hyperbolic problem (1) with Dirichlet boundary conditions, Ref. [3] indicates that the following match of time is necessary to maintain the third-order accuracy of (5):
Note that the RKDG scheme can also be used to compute numerical solutions on two small cells \(\tilde{I}_0\) and \(\tilde{I}_{N+1}\). However, the time step \(\Delta t\) would then be restricted to be proportional to \(\min (\delta _1, \delta _2)\) to ensure the stability, which is referred to as the cut-cell problem. In this paper, we will employ the idea of the ILW method to construct values on \(\tilde{I}_0\) and \(\tilde{I}_{N+1}\) through the boundary treatment, and further define the numerical fluxes \(\hat{f}_{1/2}\) and \(\hat{f}_{N+1/2}\). Through this approach, the scheme can employ the time step as the standard DG method, meaning that \(\Delta t\) is only proportional to h and independent of \(\delta _{1,2}\).
2.1 (S)ILW Boundary Treatment at the Inflow Boundary
In this section, we focus on the inflow boundary \(x=a\) and the cell \(\tilde{I}_0=[a,a+\delta _1]\). A high-order ILW method is designed to construct a polynomial \(p(x,t)\in P^k(\tilde{I}_0)\). After that, we can set the numerical flux: \(\hat{f}_{\frac{1}{2}}=\hat{f}\left( p\left( x_{\frac{1}{2}},t\right) , u_h\left( x^{+}_{\frac{1}{2}}, t\right) \right) \).
Contrary to the idea of calculating the time derivatives with the space derivatives in the Lax-Wendroff scheme, the ILW method uses the differential equation to calculate space derivatives with time derivatives. Thus, we can obtain the spatial derivatives on the boundary \(x=a\) by employing the PDE and boundary conditions repeatedly. For example,
Then, we can obtain the polynomial p(x, t) with degree at most k by setting
In practice, the polynomial p(x, t) can be written in the form of the Taylor expansion:
This method can achieve arbitrary high-order accuracy. However, the formula may be very complicated for high-order spatial derivatives. To avoid the very heavy algebra of the above method, we employ the idea of an SILW method in which information from the interior interval would be used.
Denote the cell average of \(u_h\) on \(I_j\) by
and the cell averages of derivatives by
Then, we can construct the polynomial p(x) of degree \(k\geqslant 1\) with information on the boundary \(x=a\) and on the first element \(I_1\). Strategies for \(P^k\), \(k\leqslant 3\), are listed in Table 1. For example, SILW-1 means the unique polynomial \(p(x) \in P^k(\tilde{I}_{0})\) which satisfies
and SILW-2 gives the constraint equations
Remark 1
To construct a polynomial \(p(x,t) \in P^k\), we can select \(k+1\) constraints from two sets of information (boundary information and information from the first element \(I_1\)) to form a system of constraint equations. It is crucial to note that the selection of constraints should not be arbitrary. In our experiment, constraints from each set are progressively added from lower order to higher order.
Remark 2
Obviously, the less boundary information \(\partial _x^{(m)}u|_{x=a}\) is used, the more efficient the scheme is. However, it is essential to avoid utilizing too few constraints provided by the boundary information. For example, considering \(k=3\), if we employ three constraints from \(I_1\) and only take u(a, t) on boundary, i.e.,
the constraint equations will lead to singularity and no solution exists when \(\delta \) approaches 0. In addition, selecting too little boundary information will directly affect the stability of the scheme. The theoretical analysis of the SILW method for high-order finite-difference schemes was given in Refs. [16,17,18,19]. We will discuss the stability and accuracy of the SILW boundary treatment for the DG method in this paper later.
Numerical results show that the schemes can always achieve the \((k+1)\)th order accuracy. However, the magnitude of error is closely related to the parameter \(\delta _1/h\). For example, we use the RKDG method with \(P^k\) bases, \(k=0, 1, 2, 3\), to solve the following equation:
This example has the exact solution \(u(x,t) = \sin (t-x)\). We divide the domain with \(N=80\), \(\delta _2=0\), and varying \(\delta =\delta _1\in [0,h)\). Since the numerical flux \(\hat{u}_{i+1/2}=u_h|^-_{i+1/2}\), \(i=1, \cdots , N\), no additional processing is required for the outflow boundary \(x=b\). The proposed (S)ILW method is used for the inflow boundary condition. The \(L_2\) errors on the computational domain \({\tilde{\varOmega }}\) at the final time \(T=3\) are plotted in Fig. 2, showing that the error increases significantly when \(\delta /h\) approaches 1 with \(k\geqslant 1\).
We find that this phenomenon is caused by the loss of conservation of the reconstructed polynomials \(p(x,t)\in P^k(\tilde{I}_{0})\). To overcome this disadvantage, we propose a post-processing based on the local conservation in the following subsection.
2.2 Post-Processing Based on Local Conservation
One significant advantage of the DG method is that it can ensure the local conservation properties: taking the test function \(v_h=1\) in the classic DG scheme (3), we have
This tells us the local conservative of the DG scheme. Note that \(p(x,t) \in P^k(\tilde{I}_0)\) is constructed via the (S)ILW method, and the local conservative property fails on this cut cell,
where \(\hat{f}_\frac{1}{2} = \hat{f}\left( p(a+\delta _1,t), u_h\left( x_\frac{1}{2}^+\right) \right) \).
In the following, we introduce the post-processing based on the local conservation for \(k\geqslant 1\). We primarily focus on the treatment of inflow boundaries. The treatment of outflow boundaries will be addressed in the next subsection. For the inflow boundary, the numerical flux \(\hat{f}_{\frac{1}{2}}\) would be modified via the conservation
If \(p(x,t) \in P^k\) is obtained by the ILW method (8), then
Here, we define the notation \(\Pi _s^k[w](x)\) to represent the kth order Taylor polynomial of w(x)
Notice that the right-hand side of (15) is precisely the Taylor expansion of f(u),
This indicates that we actually use the Taylor expansion of the function f(u) at the physical boundary to approximate the numerical flux at the computational boundary, which provides another perspective on the validity of the ILW method.
If p(x, t) is obtained by the SILW method, the interior value would be used, whose time derivatives could be given via the DG scheme on \(I_1\). In particular, we can directly set \(v_h=1\) to get the time derivative of the cell average
Higher order information can be obtained by taking a special test function in the DG scheme. But the specific expression is dependent on the choice of DG basis functions and the degree k. For instance, let \(\phi _i\) denote the ith orthogonal Legendre polynomials basis function in \(I_1\),
Plugging them in the conservation form (14), we can get an algebraic equation of \(\hat{f}^c_{1/2}\). The numerical flux can be obtained by solving this equation.
Here, we give the details of the SILW-1 method as an example. Utilizing (9a), we know that \(p(x,t) \in P^k\) has the form
Plugging in (9b), we can have
Utilizing the expression (14) and (19)–(20), we can obtain the algebraic equations regarding the numerical flux,
Solve the above equation,
The spatial derivatives at \(x=a\) can be conversed to the mixed derivatives using the PDE,
After that, all terms including time derivatives can be obtained via the ILW procedure (7).
To illustrate the corrective impact of the post-processing on the numerical flux, we provide Fig. 3 as a comparison to Fig. 2. We can observe that after post-processing, the magnitude of the error no longer exhibits significant variations as \(\delta /h\) approaches 1.
2.3 Nonlinear Limiter for Shock Waves
Until this point, the numerical flux is designed with the assumption that u(x) is smooth enough. Significantly, the shock wave propagating from the inflow boundary will lead to numerical oscillations and disrupt the stability of the scheme. Therefore, a nonlinear limiter is required to prevent oscillations and ensure the stability in the presence of strong discontinuities in \(\tilde{I}_0\). Numerical experiments demonstrate that the first-order numerical flux \(\hat{f}_\frac{1}{2} = f(g(t))\) (this is the numerical flux of \(k=0\) without the conservative modification) always has a good performance in avoiding spurious oscillations. Thus, we design an extra limiting procedure as follows: to switch the high-order numerical flux \(\hat{f}^c_\frac{1}{2}\) to a first-order flux f(g(t)) when encountering such situations, while retaining the high-order accuracy in smooth regions.
We use the following notations to present the variations in \(\tilde{I}_0\) and \(I_1\):
Next, we define a discontinuous index \(\theta \in [0,1]\) as follows:
where \(\eta (x) = \frac{1}{2}(1+\tanh (20(x-1/2))\) and \(\varepsilon \) is a small number used to avoid the division by zero. We choose \(\varepsilon = 10^{-16}\) in practice. Finally, \(\hat{f}_\frac{1}{2}\) will be modified as a convex combination of \(\hat{f}^c_\frac{1}{2}\) and f(g(t)),
Such modification will lead to the following effects.
-
(i)
If f(u) is smooth, both \(\Delta _1\) and \(\Delta _2\) are about \(|f_x(u(x_\frac{1}{2},t))|\delta + \mathcal {O}(\delta ^2)\). Thus, \(\theta = \eta (\mathcal {O}(\delta ^4)) = \mathcal {O}(\delta ^4)\) approaches 0 and \(\hat{f}_\frac{1}{2}^\textrm{mod} = \hat{f}^c_\frac{1}{2}+\mathcal {O}(\delta ^4)\). Furthermore, the modification (24) can maintain the original order of accuracy for \(k\leqslant 3\).
-
(ii)
If a shock comes from the boundary, \(\Delta _1=\mathcal {O}(1)\). Consequently, \(\theta \approx \eta (1)\) and \(\hat{f}_\frac{1}{2}^\textrm{mod}\) would degenerate to f(g(t)), which could avoid the numerical oscillation around boundary.
It is remarkable that both \(\hat{f}^c_\frac{1}{2}\) and f(g(t)) give the result that the magnitude of the error does not depend on \(\delta /h\) significantly. This leads to the fact that the flux \(\hat{f}_\frac{1}{2}^\textrm{mod}\) has the same property.
2.4 Boundary Treatment at the Outflow Boundary
In this subsection, we are concerned about the treatment of outflow boundaries. Based on the characteristics of the conservation law, information on the downwind side should not affect the interior of the computational domain. Hence, for 1D scalar equations, we can directly compute the numerical flux using values on the interior side of the boundary \(\hat{f}_{N+1/2}=f(u_h(x^-_{N+1/2}),t)\), without considering the information at the physical boundary \(x=b\).
However, when solving systems of equations, inflow and outflow boundary conditions are often mixed at the boundary. The numbers of inflow boundary conditions and outflow boundary conditions depend on how many eigenvalues of the Jacobian at the boundary are positive and negative, respectively. Different components of the solution may interact at the physical boundary through boundary conditions. Therefore, it is necessary to obtain information about these outflow components at the physical boundary.
Let us consider the treatment of the outflow boundary \(x=b\). First, we take p(x, t) as the direct extension of the polynomial \(u_h\) on \(I_N\) to the virtual cell \(\tilde{I}_{N+1} = [x_{N+\frac{1}{2}},b]\):
Meanwhile, we still have \(\hat{f}_{N+1/2}=f(u_h(x^-_{N+1/2}),t)\). However, we face the problem of violating conservation properties once again,
In order to preserve the conservation on the cell \(\tilde{I}_{N+1}\), we modify the point value at \(x=b\) by adding a constant \(p^*(b,t)=p(b,t)+C\),
Ultimately, we obtain the information at the outflow physical boundary through the following expressions:
2.5 The (S)ILW Scheme for Linear Systems
Since a linear system can be decoupled into a group of independent scalar equations after characteristic decomposition, we could do the boundary treatment on each component of the characteristic variable. Hence, the designed (S)ILW methods can work on linear systems as well.
Consider the following system on the physical domain \(\varOmega =[a,b]\):
where \({{\textbf{F}}}({{\textbf{U}}})={{\textbf{A}}}{{\textbf{U}}}\) and \({{\textbf{A}}}\in {{\mathbb {R}}}^{n\times n}\) is a constant matrix. This system is hyperbolic meaning the matrix \({{\textbf{A}}}\) is diagonalizable with real eigenvalues. For problems involving systems of equations, the required boundary conditions at the boundaries are determined by the sign of eigenvalues. Assume the eigenvalues of \({{\textbf{A}}}\) have the property
then
with \({\mathbf \Lambda }^\mathrm{(L)}=\textrm{diag}(\lambda _1, \cdots , \lambda _{n_1})\) and \({\mathbf \Lambda }^\mathrm{(R)}=\textrm{diag}(\lambda _{n_1+1}, \cdots , \lambda _{n})\). In this case, we require \(n_2\) boundary conditions at the left boundary \(x = a\) and \(n_1\) conditions at the right boundary \(x = b\).
As an example, we are concerned with the left boundary \(x=a\) imposed with \(n_2\) Dirichlet boundary conditions,
Denoted \({{\textbf{V}}}\) as the characteristic variables \({{\textbf{V}}}= {{\textbf{P}}}{{\textbf{U}}}= ({{\textbf{V}}}^\mathrm{(L)}, {{\textbf{V}}}^\mathrm{(R)})^\textrm{T}\), where \({{\textbf{V}}}^\mathrm{(L)}\in {{\mathbb {R}}}^{n_1} \) and \({{\textbf{V}}}^\mathrm{(R)}\in {{\mathbb {R}}}^{n_2} \) are variables moving to the left and right, respectively. The proposed (S)ILW boundary treatment for scalar problems will be applied on each component of \({{\textbf{V}}}\) directly. Particularly, Dirichlet boundary conditions are imposed on conservative variables \({{\textbf{U}}}\) rather than the characteristic variables \({{\textbf{V}}}\). Hence, \({{\textbf{V}}}^\mathrm{(L)}\) and \({{\textbf{V}}}^\mathrm{(R)}\) will change information at \(x=a\), and they should be handled simultaneously.
To be more specific, the (S)ILW boundary treatment for systems is given as follows. Here, we use the superscript \(*\) to present values located at \(x = a\) to ease the notation.
-
(i)
First, we consider the outgoing characteristic components \({{\textbf{V}}}^\mathrm{(L)}\). The algorithm introduced in Sect. 2.4 should be applied on each component \(v_i\), \(i=1, \cdots , n_1\). Then, we obtain the values and spatial derivatives at \(x=a\),
$$\begin{aligned} {{\textbf{V}}}^\mathrm{(L),*}, {{\textbf{V}}}^\mathrm{(L),*}_x,{{\textbf{V}}}^\mathrm{(L),*}_{xx},\cdots . \end{aligned}$$Moreover, by utilizing the Lax-Wendroff procedure on each \(v_i\) with the equation \((v_i)_t +\lambda _i (v_i)_x=0\), we can also obtain time derivatives at the boundary
$$\begin{aligned} {{\textbf{V}}}^\mathrm{(L),*}_t,{{\textbf{V}}}^\mathrm{(L),*}_{tt},\cdots . \end{aligned}$$ -
(ii)
Through the following system of equations:
$$\begin{aligned} {{\textbf{P}}}^{(1)} \begin{pmatrix} {{\textbf{V}}}^\mathrm{(L),*} \\ {{\textbf{V}}}^\mathrm{(R),*} \end{pmatrix}&= {{\textbf{U}}}^{(1),*} = {{\textbf{G}}}(t), \end{aligned}$$(29)where \({{\textbf{P}}}^{(1)}\) is a matrix formed by the first \(n_2\) rows of the matrix \({{\textbf{P}}}\), we can get the values of the inflow variable by solving the above system. Similarly, we can obtain higher order time derivatives from the system as well:
$$\begin{aligned} {{\textbf{P}}}^{(1)} \begin{pmatrix} \partial _t^{m}{{\textbf{V}}}^{\mathrm{(L)},*} \\ \partial _t^{m}{{\textbf{V}}}^{\mathrm{(R)},*} \end{pmatrix}&= \partial _t^{m}{{\textbf{U}}}^{(1),*} = {{\textbf{G}}}^{(m)}(t). \end{aligned}$$ -
(iii)
We construct numerical fluxes for each inflow component, which is the same as those for the scalar equations.
We would like to remark that this method can provide the desired high-order accuracy. However, numerical experiments indicate that the errors grow as \(\delta /h\) increases. Based on the results of scalar problems, we suspect that this should be caused by the outflow boundary treatment, even though the errors may have been reduced to a certain extent by the conservative modification. Further improvement of the outflow boundary treatment will be considered in the future.
We would want to point out that the proposed methods can also be extended to nonlinear systems. However, the algorithm becomes more complicated, especially for the SILW method with the conservative modification. Since the numerical fluxes are generally not one-sided fluxes, outflow variables and inflow variables are coupled more tightly. To do the conservative modification on the outgoing variables, the numerical flux \({\hat{{{\textbf{F}}}}}_{1/2}\) is needed, which also depends on the inflow values on \(\tilde{I}\). Hence, solving a complex nonlinear system appears necessary. To address this problem, we have to design a new conservative modification, which is left as future work.
3 Theoretical Analysis
In this section, the theoretical analysis, including the stability analysis and error estimates, will be provided for the 1D linear initial-boundary value problem,
In this case, the left boundary \(x = a\) is always an inflow boundary and the right boundary \(x = b\) is an outflow boundary. Here, we only need to consider the effect of treatment of the inflow boundary. Again the domain is divided by the following uniform mesh with the mesh size \(h=x_{j+1/2}-x_{j-1/2}\) for \(j=1,\cdots ,N\), and \(\delta \in [0,h]\):
For simplicity, we assume \(a=0\) and the prescribed condition \(g(t)=0.\)
In the following, DG schemes with \(P^k\) bases are considered, \(k=1, 2, 3\). The simple upwind numerical flux is used for the interior elements, i.e., \(\hat{u}_{j+1/2} = u_h|^-_{j+1/2}\), \(j=1, \cdots , N\). The flux \(\hat{u}_{1/2}\) can be obtained by the proposed SILW strategies with or without the conservative modification. First, we will prove the linear stability of all these schemes for both semi-discrete and fully discrete cases. This can be achieved via the eigenvalue spectrum visualization [35]. Specially, the energy stability analysis and error estimates for SILW-1 with the conservative modification will be discussed in Sects. 3.2 and 3.3.
3.1 Eigenvalue Spectrum Visualization
In this subsection, we present the stability analysis by visualizing the eigenspectrum of the discretized operators. For the kth order schemes, we set \(k+1\) equally spaced points in \(I_j\),
After picking a local Lagrange basis, the standard semi-discrete DG scheme (3) for the linear advection equation with upwind flux in inner cells can be written as
where \(\textbf{U}_j\) is a vector of length \(k+1\) containing the coefficients of the solution \(u_h\) corresponding to the local basis inside \(I_j\), which also represents the values of \(u_h\) at the nodes \(\{\hat{x}^{(i)}_j\}_ {i=0}^{k}\). \(\textbf{A}\) and \(\textbf{B}\) are \((k+1)\times (k+1)\) constant matrices.
On the other hand, the numerical flux \(\hat{u}_\frac{1}{2}\) can be presented with \(u_h\) in \(I_1\), and the boundary information (which is always 0) and the DG semi-discrete scheme (3) on \(I_1\) can be sorted as follows:
Here, \(\textbf{C}\) is a \((k+1)\times (k+1)\) constant matrix.
Finally, the semi-discrete scheme yields a linear system expressed in a matrix-vector form as
where \({\textbf {U}}\) is the vector representing the values of the solution at all nodes \(\{\hat{x}^{(i)}_j, \, j=1, \cdots , N, i=0,\cdots , k\}\),
and
This system contains the chosen inner scheme as well as the inflow boundary treatments.
We apply the normal mode analysis to (32) to get the eigenvalue problem. Assuming a solution of the form \(u(x,t)=\textrm{e}^{st}u_0(x)\) and \(\tilde{s}=hs\), the semi-discrete scheme (32) yields
with \(\tilde{s}\) being the eigenvalue. The semi-discretization provided with the considered boundary conditions is stable if the whole eigenvalue spectrum of the coefficient matrix \({\textbf {Q}}\) lies in the left half-plane, i.e., \(\textrm{Re}\,\!(\tilde{s})\leqslant 0\). Note that eigenvalues of \(\textbf{Q}\) (33) are composed of the eigenvalues of \(\textbf{B}\) and \(\textbf{C}\), denoted by \(\kappa ^B\) and \(\kappa ^C\), respectively. It is easy to verify that \(\kappa ^B\) satisfies the condition. Therefore, we only need to focus on \(\kappa ^C\) in the following.
For example, considering the semi-discrete DG scheme with \(P^1\) basis and SILW-1 boundary treatment, \(\hat{u}_\frac{1}{2}\) and the coefficient matrix \(\textbf{C}\) have the forms as follows:
Denote \(\mu =\frac{\delta }{h}\in [0,1)\). We can analytically calculate the eigenvalues of \(\textbf{C}\),
It can be verified that \(\textrm{Re}\,\!(\kappa ^C_{1,2})<0\) for all \(\mu \in [0,1)\), indicating that the semi-discrete scheme is stable. Moreover, if we construct \(\hat{u}_\frac{1}{2}\) with the conservative modification, i.e., \(\hat{u}_\frac{1}{2}^c\),
In this case, we have the eigenvalues of \(\textbf{C}\) as
and \(\textrm{Re}\,\!(\kappa ^C_{1,2})<0\) also holds for all \(\mu \in [0,1)\).
For the semi-discrete scheme with \(k=2, 3\), the results are displayed in Fig. 4 due to the complexity of analytic eigenvalue expressions. We plot the maximum of \(\textrm{Re}\,\!(\kappa ^c)\) for different \(\delta /h\). It is observed that these semi-discrete schemes are stable since the real parts of the eigenvalues are all negative.
We can also prove the stability of the full-discrete scheme with the third-order RK time discretization (5). The full-discrete scheme yields a linear system expressed in a matrix-vector form as
where \(g({\textbf {X}})\) is a matrix function
and \(\lambda = \frac{\Delta t}{h} = \frac{1}{2k+1}\) is the CFL number. The full-discrete scheme is stable if the whole eigenvalue spectrum of \(g({\textbf {Q}})\) is contained within the unit disk, i.e., \(\rho (g({\textbf {Q}})) \leqslant 1\). It is obvious that the eigenvalues of \(g(\textbf{Q})\) are composed of the eigenvalues of \(g(\textbf{B})\) and \(g(\textbf{C})\). Similarly, we only need to focus on the part corresponding to the boundaries, i.e., the eigenvalues of \(g(\textbf{C})\).
For \(k=1, 2, 3\), we plot the \(\rho (g(\textbf{C}))\) for different \(\delta /h\) in Fig. 5. The results indicate that the full-discrete schemes are stable when an appropriate time discretization is employed.
3.2 Energy Stability
In this subsection, we establish the energy stability of the semi-discrete DG scheme with the SILW-1 boundary treatment.
Proposition 1
For the linear equation (30) with the homogeneous inflow boundary conditions, if we employ the upwind numerical flux internally and conservative SILW-1 flux near the inflow boundary, the corresponding semi-discrete DG scheme (3) with \(k\geqslant 1\) is energy stable
with the discrete energy defined as
Proof
Let \(v_h=u_h\) and use the upwind numerical flux in (3), we have
Summing over \(j\geqslant 2\), we can obtain that
Combining the homogeneous boundary condition \(g(t)=0\), the conservative SILW-1 fluxes (22) for general \(k\geqslant 1\) are in the same form,
Taking \(v_h=u_h\) in the first item \(I_1\), we have
Using weighted summation over all cells with a constant \(W = \left( 1- \frac{1}{2^{2k+2}}\right) ^{-1}\), we can get
Hence, the energy stability is proved.
When employing the ILW boundary treatment for the linear function with homogeneous Dirichlet boundary conditions, the numerical flux \(\hat{u}_{1/2} =0\). In this case, the energy stability can be easily proven in the same way.
Proposition 2
For the linear equation (30) with the homogeneous inflow boundary condition, if we use the upwind numerical flux internally and the ILW flux at the inflow boundary, the corresponding semi-discrete DG scheme (3) with \(k\geqslant 0\) is stable in the \(L^2\) norm
Remark 3
Unfortunately, those conclusions cannot be directly extended to nonlinear equations. For linear equations, \(\hat{f}_{1/2}u^{+}_{1/2}\) can be bounded by the expression consisting of point values \((u^+_{1/2})^2\) and \((u^{-}_{3/2})^2\), and further be canceled by those terms generated from \(\int _{I_1}f(u)u_x\textrm{d}x\). However, for nonlinear problems, \(\int _{I_j}f(u)u_x\textrm{d}x\) and \(\hat{f}_{j+1/2}u^{\pm }_{j+1/2}\) have different forms. Moreover, the terms derived from the boundary treatment are more complex and could not be canceled or merged with the inner schemes, making the analysis inapplicable.
3.3 Error Estimate
In this section, we will establish the error estimates of the semi-discrete scheme for the linear advection equation with the conservative SILW-1 flux.
Suppose that u(x) is sufficiently smooth, we have the Taylor formula with the Peano form of the remainder
Note that the explicit expression of the conservative SILW-1 flux (22) for the linear equation (30) degenerates to
Hence,
Next, we introduce the Gauss-Radau projection \(P_-\) and \(L^2\) projection P into \(V^k_h\). For a given function w, the projection \(P_-w\in V_h\) satisfies
And the projection \(Pw\in V_h\) satisfies
Moreover, the projection \(P_*\), which can be \(P_-\) or P, has the properties
for any \(u\in C^{k+1}(I_j)\). Here, \(C>0\) is some constant that is independent of \(h=|I_j|\) and u.
Proposition 3
Consider the linear equation (30) with the homogeneous Dirichlet boundary condition. Suppose the exact solution u is smooth. We consider the semi-discrete DG scheme (3) with the upwind numerical flux internally and the conservative SILW-1 flux at the inflow boundary, then the numerical solution \(u_h\) satisfies the following error estimate:
where \(C>0\) depends on u and its derivatives but is independent of h and \(\delta \).
Proof
We decompose the error into two parts
Note that the scheme (3) in the cell \(I_j\), \(j\geqslant 2\), is the same as the standard DG method. Hence, we can get the following inequality from the error estimate of the standard DG method [28]:
Next, we focus on the special treatment for the inflow boundary cell \(I_1\). For any \(v_h\in V_h\),
Subtracting these two equations, we obtain the error equation
Specially, take \(v_h = \xi \in V_h\),
Employing the equivalent formula of \(\hat{u}^c_\frac{1}{2}\) (42), we have
where \(|\beta (u,\delta ,h)| \leqslant C h^{k+2}\). Therefore,
We now take \(\alpha = \frac{\delta ^{k+1}}{(\delta +h)^{k+1}}< \left( \frac{1}{2}\right) ^{k+1} < 1\). Since
we can obtain that
The last inequality holds when u is smooth enough. If we take the initial value \(u_h = P u\) where P is a standard \(L^2\) projection, we can get the following estimate using Gronwall’s inequality:
According to the inverse inequality, there exists a constant C related to u and t such that
Plugging (51) into (49), we can obtain
Now, we combine the estimates (48) and (52), and have
Using Gronwall’s inequality, we can obtain
Noting that for the initial value,
we can get the \(L^2\) estimate of \(\xi \)
which gives us the final conclusion
4 Numerical Examples
In this section, we present some numerical examples to demonstrate the performance of our proposed scheme. For the scalar case, both linear and nonlinear equations are considered. We also employ this method to solve linear systems.
In all our computations, we test the DG method with \(V^k_h\) (\(k=1, 2, 3\)) coupling with the conservative SILW-k boundary treatment. Without special declaration, the domain is divided uniformly with a cut element sized \(\delta \) at the left boundary. And we choose two extreme values \(\delta /h = 0.01, 0.99\), to show their influence on the numerical performance. The third-order Runge-Kutta method (5) is used for the time discretization with the time step \(\Delta t = \lambda h\) for \(k \leqslant 2\) and \(\Delta t = \lambda h^{\frac{k+1}{3}}\) for \(k=3\). The CFL number \(\lambda = \frac{1}{(2k+1)\alpha }\) is the same as that used in the standard RKDG method.
4.1 Accuracy Test for the Linear Scalar Equation
In this example, we consider the initial-boundary value problem of the linear advection equation
The exact solution is \(u(x,t)=\sin (t-x)\). In this case, the left boundary \(x = 0\) is an inflow boundary all the time and the right boundary \(x = \textrm{2}\uppi \) is an outflow boundary. Errors are calculated on the computational domain \({\tilde{\varOmega }}\). The \(L^2\) errors and \(L^\infty \) errors at time \(t=3\) are shown in Table 2. We can see that for all cases, the schemes are stable and can achieve the optimal \((k+1)\)th order. Moreover, with the help of the conservative modification, errors with different \(\delta \) have no significant difference.
4.2 Linear Scalar Equation with Non-smooth Boundary
Next, we consider the linear problem with non-smooth inflow boundary data:
where
We can see that discontinuities enter the computational domain from the inflow boundary. To control oscillations, the TVD limiter is applied on the interior cells and the modification mentioned in Sect. 2.3 is used on \(\hat{f}_\frac{1}{2}\). Numerical results with SILW-1 and SILW-2 are shown in Figs. 6 and 7, respectively, demonstrating that our algorithm does not introduce additional numerical oscillations when handling strong discontinuities near cut cells.
4.3 Nonlinear Burgers’ Equation
In this example, we apply the scheme to Burgers’ equation:
We take the boundary condition \(g(t)=w(-\uppi ,t)\), where w(x, t) is the exact solution of the initial value problem on \((-\uppi , \uppi )\) with periodic boundary conditions and can be obtained by Newton’s method. For all time, the left boundary \(x = -\uppi \) is an inflow boundary and the right boundary \(x =\uppi \) is an outflow boundary. To verify the performance of the nonlinear limiter on the boundary treatment, we always use the modified numerical flux (24) in this example.
When \(t=0.3\), the exact solution is still smooth. Errors are shown in Table 3. It is observed that the scheme can always achieve the optimal \((k+1)\)th order accuracy and the ratio \(\delta /h\) does not effect the magnitude of errors significantly, demonstrating the limiters do not destroy the accuracy of smooth solutions.
At \(t=0.5\), a shock is fully developed in the interior of the computational domain. Moreover, a shock enters the inflow boundary at \(t = 2\uppi \) and moves to \(x=0\) at \(t = 3\uppi \). In order to capture the shock and avoid numerical oscillations, the TVD limiter is applied on the interior cells. Figures 8 and 9 indicate that the shock is well captured by our method.
4.4 Linear System
Finally, we consider the linear system,
We fix the coefficient \(c=1.5\) and choose the corresponding initial value to match the exact solution
Since the eigenvalues of the coefficient matrix are \(\pm c\), one boundary condition is needed at each boundary. Here, we take the boundary condition
The computational errors of all components, as shown in Table 4, indicate that our method still maintains the optimal convergence rate. However, in comparison to the scalar case, the impact of the ratio \(\delta /h\) is shown, leading to different magnitudes of errors. This is due to the outflow boundary treatment for the system. Even though the conservative modification has reduced the influence of the ratio \(\delta /h\), errors of the outflow variable are transmitted into the inflow variable through the boundary treatment, and further affect the internal solutions.
5 Conclusion
In this paper, we design high-order DG methods to solve hyperbolic conservation laws on unfitted meshes. The standard RKDG method is employed on the interior cells. On the small cut cells near physical boundaries, we apply the idea of the ILW method to construct approximation polynomials. Moreover, the post-processing is given in order to preserve the local conservation properties of the DG solution. The eigenvalue spectrum visualization method is used to analyze the stability of the boundary treatment for both the semi-discrete and fully discrete cases. The energy stability and error analysis are given for a specific boundary treatment. Numerical results demonstrate that our methods can achieve the optimal convergence rate and completely avoid the typical issue of small time steps. In addition, an extra nonlinear limiter is provided to prevent oscillations if a shock is close to the boundary. Numerical examples illustrate that our method has the capacity to treat shocks going through the boundaries.
We note that the treatment for the outflow boundary can give high-order accuracy. However, the ratio \(\delta /h\) has a significant impact on the magnitude of errors, and the same is true for systems. We would like to improve this algorithm in the future. Moreover, boundary treatments for nonlinear systems and high-dimensional problems are subject to future research.
References
Bastian, P., Engwer, C., Fahlke, J., Ippisch, O.: An unfitted discontinuous Galerkin method for pore-scale simulations of solute transport. Math. Comput. Simul. 81(10), 2051–2061 (2011)
Burman, Erik, Hansbo, P.: Fictitious domain finite element methods using cut elements: II. A stabilized Nitsche method. Appl. Numer. Math. 62(4), 328–341 (2012)
Carpenter, M.H., Gottlieb, D., Abarbanel, S., Don, W.-S.: The theoretical accuracy of Runge-Kutta time discretizations for the initial boundary value problem: a study of the boundary error. SIAM J. Sci. Comput. 16(6), 1241–1252 (1995)
Cheng, Z., Liu, S., Jiang, Y., Lu, J., Zhang, M., Zhang, S.: A high order boundary scheme to simulate complex moving rigid body under impingement of shock wave. Appl. Math. Mech. 42(6), 841–854 (2021)
Cockburn, B., Hou, S., Shu, C.-W.: The Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws. IV. The multidimensional case. Math. Comput. 54(190), 545–581 (1990)
Cockburn, B., Lin, S.-Y., Shu, C.-W.: TVB Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws III: one-dimensional systems. J. Comput. Phys. 84(1), 90–113 (1989)
Cockburn, B., Shu, C.-W.: TVB Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws. II. General framework. Math. Comput. 52(186), 411–435 (1989)
Cockburn, B., Shu, C.-W.: The Runge-Kutta local projection-discontinuous-Galerkin finite element method for scalar conservation laws. ESAIM Math. Model. Numer. Anal. 25(3), 337–361 (1991)
Cockburn, B., Shu, C.-W.: The Runge-Kutta discontinuous Galerkin method for conservation laws V: multidimensional systems. J. Comput. Phys. 141(2), 199–224 (1998)
Ding, S., Shu, C.-W., Zhang, M.: On the conservation of finite difference WENO schemes in non-rectangular domains using the inverse Lax-Wendroff boundary treatments. J. Comput. Phys. 415, 109516 (2020)
Fu, P., Frachon, T., Kreiss, G., Zahedi, S.: High order discontinuous cut finite element methods for linear hyperbolic conservation laws with an interface. J. Sci. Comput. 90(3), 84 (2022)
Fu, P., Kreiss, G.: High order cut discontinuous Galerkin methods for hyperbolic conservation laws in one space dimension. SIAM J. Sci. Comput. 43(4), A2404–A2424 (2021)
Giuliani, A.: A two-dimensional stabilized discontinuous Galerkin method on curvilinear embedded boundary grids. SIAM J. Sci. Comput. 44(1), A389–A415 (2022)
Gurkan, C., Sticko, S., Massing, A.: Stabilized cut discontinuous Galerkin methods for advection-reaction problems. SIAM J. Sci. Comput. 42(5), A2620–A2654 (2020)
Hansbo, P., Larson, M.G., Zahedi, S.: A cut finite element method for a Stokes interface problem. Appl. Numer. Math. 85, 90–114 (2014)
Li, T., Lu, J., Shu, C.-W.: Stability analysis of inverse Lax-Wendroff boundary treatment of high order compact difference schemes for parabolic equations. J. Comput. Appl. Math. 400, 113711 (2022)
Li, T., Lu, J., Wang, P.: Stability analysis of inverse Lax-Wendroff procedure for a high order compact finite difference schemes. Commun. Appl. Math. Comput. 6(1), 142–189 (2024)
Li, T., Shu, C.-W., Zhang, M.: Stability analysis of the inverse Lax-Wendroff boundary treatment for high order upwind-biased finite difference schemes. J. Comput. Appl. Math. 299, 140–158 (2016)
Li, T., Shu, C.-W., Zhang, M.: Stability analysis of the inverse Lax-Wendroff boundary treatment for high order central difference schemes for diffusion equations. J. Sci. Comput. 70, 576–607 (2017)
Liu, S., Cheng, Z., Jiang, Y., Lu, J., Zhang, M., Zhang, S.: Numerical simulation of a complex moving rigid body under the impingement of a shock wave in 3D. Adv. Aerodyn. 4(1), 1–29 (2022)
Liu, S., Jiang, Y., Shu, C.-W., Zhang, M., Zhang, S.: A high order moving boundary treatment for convection-diffusion equations. J. Comput. Phys. 473, 111752 (2023)
Lu, J., Fang, J., Tan, S., Shu, C.-W., Zhang, M.: Inverse Lax-Wendroff procedure for numerical boundary conditions of convection-diffusion equations. J. Comput. Phys. 317, 276–300 (2016)
Lu, J., Shu, C.-W., Tan, S., Zhang, M.: An inverse Lax-Wendroff procedure for hyperbolic conservation laws with changing wind direction on the boundary. J. Comput. Phys. 426, 109940 (2021)
Müller, B., Krämer-Eis, S., Kummer, F., Oberlack, M.: A high-order discontinuous Galerkin method for compressible flows with immersed boundaries. Int. J. Numer. Methods Eng. 110(1), 3–30 (2017)
Qin, R., Krivodonova, L.: A discontinuous Galerkin method for solutions of the Euler equations on Cartesian grids with embedded geometries. J. Comput. Sci. 4(1/2), 24–35 (2013)
Reed, W.H., Hill, T.R.: Triangular mesh methods for the neutron transport equation. Technical report, Los Alamos Scientific Lab., N. Mex. (USA) (1973)
Schoeder, S., Sticko, S., Kreiss, G., Kronbichler, M.: High-order cut discontinuous Galerkin methods with local time stepping for acoustics. Int. J. Numer. Methods Eng. 121(13), 2979–3003 (2020)
Shu, C.-W.: Discontinuous Galerkin methods: general approach and stability. In: Bertoluzza, S., Falletta, S., Russo, G., Shu, C.-W. (eds.) Numerical Solutions of Partial Differential Equations. Advanced Courses in Mathematics-CRM Barcelona, pp. 149–201. Birkhäuser, Basel (2009)
Song, T., Main, A., Scovazzi, G., Ricchiuto, M.: The shifted boundary method for hyperbolic systems: embedded domain computations of linear waves and shallow water flows. J. Comput. Phys. 369, 45–79 (2018)
Sticko, S., Kreiss, G.: A stabilized Nitsche cut element method for the wave equation. Comput. Methods Appl. Mech. Eng. 309, 364–387 (2016)
Sticko, S., Kreiss, G.: Higher order cut finite elements for the wave equation. J. Sci. Comput. 80, 1867–1887 (2019)
Tan, S., Shu, C.-W.: Inverse Lax-Wendroff procedure for numerical boundary conditions of conservation laws. J. Comput. Phys. 229(21), 8144–8166 (2010)
Tan, S., Shu, C.-W.: A high order moving boundary treatment for compressible inviscid flows. J. Comput. Phys. 230(15), 6023–6036 (2011)
Tan, S., Shu, C.-W.: Inverse Lax-Wendroff procedure for numerical boundary conditions of hyperbolic equations: survey and new developments. In: Melnik, R., Kotsireas, I. (eds.) Advances in Applied Mathematics, Modeling and Computational Science. Fields Institute Communications, vol. 66, pp. 41–63. Springer, New York (2013)
Vilar, F., Shu, C.-W.: Development and stability analysis of the inverse Lax-Wendroff boundary treatment for central compact schemes. ESAIM Math. Model. Numer. Anal. 49(1), c115 (2014)
Zhao, W., Huang, J., Ruuth, S.J.: Boundary treatment of high order Runge-Kutta methods for hyperbolic conservation laws. J. Comput. Phys. 421, 109697 (2020)
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interest
On behalf of all the authors, the corresponding author states that there is no conflict of interest.
Additional information
This paper is dedicated to the memory of Professor Zhong-Ci Shi.
Research is supported in part by the NSFC Grant 12271499 and the Cyrus Tang Foundation. Research is supported in part by the NSF Grant DMS-2309249. Research is supported in part by the NSFC Grant 12126604.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Yang, L., Li, S., Jiang, Y. et al. Inverse Lax-Wendroff Boundary Treatment of Discontinuous Galerkin Method for 1D Conservation Laws. Commun. Appl. Math. Comput. (2024). https://doi.org/10.1007/s42967-024-00391-0
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s42967-024-00391-0
Keywords
- Discontinuous Galerkin (DG) method
- Hyperbolic conservation laws
- Numerical boundary conditions
- Inverse Lax-Wendroff (ILW) method
- High-order accuracy
- Stability analysis