Applications in Science and Engineering for Modelling, Analysis and Control of ChaosView this Special Issue
Research Article | Open Access
Rongsan Chen, "Entropy Schemes for One-Dimensional Convection-Diffusion Equations", Complexity, vol. 2020, Article ID 3435018, 5 pages, 2020. https://doi.org/10.1155/2020/3435018
Entropy Schemes for One-Dimensional Convection-Diffusion Equations
In this paper, we extend the entropy scheme for hyperbolic conservation laws to one-dimensional convection-diffusion equation. The operator splitting method is used to solve the convection-diffusion equation that is divided into conservation and diffusion parts, in which the first-order accurate entropy scheme is applied to solve the conservation part and the second accurate central difference scheme is applied to solve the diffusion part. Numerical tests show that the error achieves about second-order accuracy, but the error reaches about forth-order accuracy.
In this paper, we consider the convection-diffusion equation:where . Many researchers have developed numerical methods for the convection-diffusion equation and have obtained some superconvergence results [1, 2].
In , Li has developed the entropy scheme which contains numerical solution and numerical entropy to compute the linear advection equation. The numerical tests showed that it can achieve very good accuracy and is suitable for long-time computation of smooth solutions. Yanfen and De-Kang investigated the truncation error for the entropy scheme and showed the entropy scheme has superconvergent property in . However, when computing discontinuous solutions, spurious oscillations occurred in the vicinity of the discontinuities. In order to eliminate the spurious oscillations, an entropy-ultra-bee scheme was presented by Li and Mao for computing the linear advection equation. In essence, entropy-ultra-bee scheme is a combination of the entropy scheme and the ultra-bee scheme which can obtain good resolution in smooth regions and sharpen the discontinuity. In , Chen and Mao extended the entropy scheme to the nonlinear scalar conservation laws and presented the entropy-TVD scheme. In , Cui and Mao extended the entropy scheme to the KdV equation. The scheme is second-order, but the numerical results showed that the scheme has a third-order convergence rate away from extrema. Furthermore, the scheme suits for long-time numerical computing. Chen et al. generalize the entropy-TVD scheme for the one-dimensional shallow water equations in . The entropy scheme was extended to the Euler system in [8, 9].
The significance of the entropy scheme is in methodology. The original Godunov scheme is first-order accurate . Traditional ways to extend it to high-order schemes are to use high-order interpolations in the solution reconstruction in each cell, assuming that the solution is smooth [11–19]. The schemes so developed are no more local as the original Godunov scheme. Different limiting technologies, such as TVD, ENO, and WENO, are then used to eliminate numerical oscillations caused by the presence of discontinuities. Different from the above approach, our scheme numerically computes more physical quantities, which are algebraically related with one another in each cell. The scheme then uses them to reconstruct the solution in the cell by enforcing the algebraic relations among them, with certain TVD limiting to maintain the stability. In doing so, the smooth assumption on the solution is not necessary. With the solution reconstructed in this way, the numerical errors accumulate in the fashion that the local truncation errors in two successive time steps cancel each other, and this leads to the second-order accuracy of the scheme.
With the entropy scheme designed in this way, it maintains to be local as the original Godunov scheme. Since all the principle and augmented quantities have solid physical meanings and the reconstruction satisfies all the physical algebraic relations among them, the reconstructed solution in each cell physically well simulates the exact solution, even the latter is not smooth in the cell. Important physical properties such as the entropy condition and nonnegativity of mass and pressure are maintained in the scheme. Moreover, the numerical dissipations are quantitatively controlled in that they are used only near discontinuities and extremes of the solution.
In this paper, we mainly introduce the idea, and we choose a kind of convection-diffusion equation in one dimension with the convection part as for simplicity. We do not consider the other kinds of convection-diffusion equation and high order in this paper. In order to extend to high order, we need to replace the step reconstruction with a higher order polynomial and solve generalized Riemann problems, and the algorithm may be very complicated. We use as the entropy function in this paper, but the scheme can also be executed in other entropy function, such as .
In this paper, we follow  and extend the entropy scheme to a kind of convection-diffusion equation in one dimension. The operator splitting method is used to solve the convection-diffusion equation that is divided into conservation and diffusion parts, in which the first-order accurate entropy scheme is applied to solve the conservation part and the second accurate central difference scheme is applied to solve the diffusion part. Numerical tests show that the convergence rate approaches the second order and the convergence rate approaches the forth order along with the mesh refinement.
The outline of the paper is as follows: in Section 2, we give a description for the scheme in detail; in Section 3, the numerical results that show the convergence rate are provided; and finally, Section 4 is the conclusion.
2. Description of the Scheme
We consider the following initial value problem for the convection-diffusion equation:where . Suppose a pair of scalar function such that
For simplicity, we use uniform cells with the cell size , and we denote the cells centre by and the cells by . refers to time increment. We use and to represent a cell-average approximation to the true solution and a cell-average approximation to the entropy of the true solution, respectively. and are defined as
In this way, the solution to equation (2) and its respective numerical solution are both made up of two entities.
2.1. Operator Splitting
As in , we use the operator splitting method to solve equation (2). At first, we divide equation (2) into two parts: the conservation part and the diffusion part. Then, we alternately solve the corresponding conservation part and diffusion part. The conservation and diffusion parts of equation (2) are defined, respectively, as
2.2. Numerical Scheme for Equation (6)
2.2.1. Step Reconstruction
A piecewise constant function with a half step is used to reconstruct the solution in each cell:with the half step (HS) of the reconstruction. The reconstruction (8) satisfies
In order to compute the HS , we requirei.e., the entropy cell-average of the reconstructed solution is equal to the numerical entropy in each cell. We can compute from equation (10).
Solve the initial value problem (IVP) as follows:
2.2.3. Cell Averaging
Compute and as in the following:
In practice, we compute and in the following flux forms:where the numerical flux and .
2.3. Numerical Scheme for Equation (7)
We use central difference to approximate the second derivatives and use the Euler forward time discretization for equation (7). The final scheme has the following form:
We use the operator splitting method so that the initial problem (2) with initial data and is split into two subproblems. One proceeds as follows:(a)Solve the conservation part of equation (2) with and to obtain a provisional solution and for the next time level.(b)Solve the diffusion part of equation (2) by using and as initial condition.
Remark 1. The entropy scheme described in Section 2.2 for equation (6) is first-order accurate away from extrema , and the difference scheme in Section 2.3 for equation (7) is second-order away from extrema.
3. Numerical Experiments
In this section, we use the entropy scheme to compute one-dimensional convection-diffusion equation. In the following, two examples come from  and the CFL number is taken to be 0.2.
Example 1. Consider the following initial value problem:The exact solution to this problem isWe take as 1 and 0.01, respectively. We conduct the computation with 20, 40, 80, 160, 320, and 640 cells, respectively; the computational time is t = 1.0; and we present the and errors and orders of convergence of in Table 1. We observe that the orders of convergence approach the second order and the orders of convergence approach the forth order along with the mesh refinement. We present the and errors and orders of convergence of in Table 2. We can see from Table 2 that the orders of convergence of error are greater than 2, and the orders of convergence of error are greater than 4.
Example 2. Consider the following initial value problem.where . The exact solution to this problem isEquation (20) is a convection-diffusion equation with a nonlinear convective term. We conduct the computation with 20, 40, 80, 160, 320, and 640 cells, respectively; the computational time is t = 1.0; and we present the and errors and orders of convergence in Table 3. We can see from Table 3 that the orders of convergence approach the second order and the orders of convergence approach the forth order along with the mesh refinement.
In this paper, the entropy scheme is extended to one-dimensional of convection-diffusion equation. We divide the convection-diffusion equation into two parts and use the operator splitting method to solve it. The first-order accurate entropy scheme is applied to solve the conservation part, and the second accurate central difference scheme is applied to solve the diffusion part. We have presented two numerical examples, and the numerical results show that the orders of convergence approach the second order and the orders of convergence approach the forth order along with the mesh refinement. As for other kinds of convection-diffusion equation, only minor modifications need to be made to the algorithm. The extension to two dimensions is our future work.
The data used to support the findings of this study are available from the corresponding author upon request.
Conflicts of Interest
The author declares that there are no conflicts of interest.
The research was supported by the National Natural Science Foundation of China (no. 11201436) and Fundamental Research Funds for the Central Universities, China University of Geosciences (Wuhan).
- Y. Cheng and C.-W. Shu, “Superconvergence of local discontinuous galerkin methods for one-dimensional convection-diffusion equations,” Computers & Structures, vol. 87, no. 11-12, pp. 630–641, 2009.
- X. Zhang, Y. Liu, and C.-W. Shu, “Maximum-principle-satisfying high order finite volume weighted essentially nonoscillatory schemes for convection-diffusion equations,” SIAM Journal on Scientific Computing, vol. 34, no. 2, pp. A627–A658, 2012.
- H. Li, “Second-order entropy dissipation scheme for scalar conservation laws in one space dimension,” Shanghai University, Shanghai, China, 2002, Master’s thesis.
- C. Yanfen and M. De-Kang, “Error self-canceling of a difference scheme maintaining two conservation laws for linear advection equation,” Mathematics of Computation, vol. 81, no. 278, pp. 715–741, 2011.
- R. Chen and D.-K. Mao, “Entropy-TVD scheme for nonlinear scalar conservation laws,” Journal of Scientific Computing, vol. 47, no. 2, pp. 150–169, 2011.
- Y. Cui and D.-K. Mao, “Numerical method satisfying the first two conservation laws for the Korteweg-de Vries equation,” Journal of Computational Physics, vol. 227, no. 1, pp. 376–399, 2007.
- R. Chen, M. Zou, and L. Xiao, “Entropy-TVD scheme for the shallow water equations in one dimension,” Journal of Scientific Computing, vol. 71, no. 2, pp. 822–838, 2017.
- H. Li, Z. Wang, and D.-K. Mao, “Numerically neither dissipative nor compressive scheme for linear advection equation and its application to the Euler system,” Journal of Scientific Computing, vol. 36, no. 3, pp. 285–331, 2008.
- R. Chen and D. Mao, “Improved entropy-ultra-bee scheme for the Euler system of gas dynamics,” Journal of Computational Mathematics, vol. 35, no. 2, pp. 213–243, 2017.
- S. K. Godunov, “A finite difference method for computation of discontinuous solutions of the equations of fluid dynamics,” Matematicheskii Sbornik, vol. 47, pp. 357–393, 1959.
- P. Colella, “A direct Eulerian MUSCL scheme for gas dynamics,” SIAM Journal on Scientific and Statistical Computing, vol. 6, no. 1, pp. 104–117, 1985.
- P. Colella and P. Woodward, “The numerical simulation of two-dimensional fluid flow with strong shocks,” Journal of Computational Physics, vol. 54, no. 1, pp. 115–173, 1984.
- P. Colella and P. R. Woodward, “The piecewise parabolic method (PPM) for gas-dynamical simulations,” Journal of Computational Physics, vol. 54, no. 1, pp. 174–201, 1984.
- A. Harten, S. Osher, B. Engquist, and S. R. Chakravarthy, “Some results on uniformly high-order accurate essentially nonoscillatory schemes,” Applied Numerical Mathematics, vol. 2, no. 3–5, pp. 347–377, 1986.
- A. Harten, B. Engquist, S. Osher, and S. R. Chakravarthy, “Uniformly high order accurate essentially non-oscillatory schemes, III,” Journal of Computational Physics, vol. 71, no. 2, pp. 231–303, 1987.
- A. Harten and S. Osher, “Uniformly high-order accurate nonoscillatory schemes. I,” SIAM Journal on Numerical Analysis, vol. 24, no. 2, pp. 279–309, 1987.
- G.-S. Jiang and C.-W. Shu, “Efficient implementation of weighted ENO schemes,” Journal of Computational Physics, vol. 126, no. 1, pp. 202–228, 1996.
- R. J. LeVeque, Finite Volume Methods for Hyperbolic Problems, Cambridge University Press, Cambridge, UK, 2002.
- C.-W. Shu and S. Osher, “Efficient implementation of essentially non-oscillatory shock-capturing schemes, II,” Journal of Computational Physics, vol. 83, no. 1, pp. 32–78, 1989.
Copyright © 2020 Rongsan Chen. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.