Next Article in Journal
Cubical Homology-Based Machine Learning: An Application in Image Classification
Next Article in Special Issue
Projective Integration for Hyperbolic Shallow Water Moment Equations
Previous Article in Journal
Multi-Point Boundary Value Problems for (k, ϕ)-Hilfer Fractional Differential Equations and Inclusions
Previous Article in Special Issue
Numerical Scheme Based on the Implicit Runge-Kutta Method and Spectral Method for Calculating Nonlinear Hyperbolic Evolution Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

High-Order Compact Difference Method for Solving Two- and Three-Dimensional Unsteady Convection Diffusion Reaction Equations

School of Mathematics and Statistics, Ningxia University, Yinchuan 750021, China
*
Author to whom correspondence should be addressed.
Axioms 2022, 11(3), 111; https://doi.org/10.3390/axioms11030111
Submission received: 17 January 2022 / Revised: 25 February 2022 / Accepted: 1 March 2022 / Published: 3 March 2022

Abstract

:
In this paper, a type of high-order compact (HOC) finite difference method is developed for solving two- and three-dimensional unsteady convection diffusion reaction (CDR) equations with variable coefficients. Firstly, an HOC difference scheme is derived to solve the two-dimensional (2D) unsteady CDR equation. Discretization in time is carried out by Taylor series expansion and correction of the truncation error remainder, while discretization in space is based on the fourth-order compact difference formulas. The scheme is second-order accuracy in time and fourth-order accuracy in space. The unconditional stability is obtained by the von Neumann analysis method. Then, this scheme is extended to solve the three-dimensional (3D) unsteady CDR equation. It needs only a five-point stencil for 2D problems and a seven-point stencil for 3D problems. Moreover, the present schemes can solve the nonlinear Burgers equation. Finally, numerical experiments are conducted to show the good performances of the new schemes.

1. Introduction

The CDR equation is a kind of basic mathematical physics equation, which is usually used to describe many physical and chemical processes. It has wide applications in ecological environment, fluid mechanics, biological mathematics, and other fields of natural science. For example, the CDR equation has been used to describe the following: the conduction of heat in the fluid [1], thermo-hygro transfer in porous media [2], predator–prey interactions in population densities [3], the transport of adsorbing contaminants and microbe–nutrient systems in groundwater [4], heat transfer in a draining film [5], etc. However, in most cases, similar to some other widely used mathematical models [6,7], the CDR equation cannot obtain exact solutions. So, how to get effective and accurate numerical solutions of this kind of equation is always a problem that researchers pay attention to.
For different model equations, researchers will use different numerical methods. For example, a local discrete exterior calculus discretization [8] of the convection diffusion equation for compressible and incompressible flow is proposed, and the discretization needs to be stabilized by introducing artificial diffusion. For the CDR equation, the numerical methods mainly include finite element method [9,10,11,12,13,14], integration factor method [15,16,17,18], meshless method [1,19], finite difference (FD) method [20,21,22,23,24,25,26,27,28], and so on. Among them, the FD method is a traditional numerical method, which has been widely used in solving various fluid dynamic equations for a long time [29]. In the past decades, the HOC FD method has been used and developed rapidly because of its various advantages, such as higher accuracy, smaller grid stencils, good stability, etc. For instance, through a new treatment for the reaction term, a high-accuracy FD scheme was given in [21] for solving the one-dimensional (1D) steady CDR problem with a small diffusivity ε ; then, the scheme was extended to the 2D problem with the alternating direction technique. Tong et al. [22] proposed two fourth-order methods by using a second-order scheme followed by the Richardson extrapolation and a direct fourth-order FD scheme for a steady CDR equation with variable coefficients. Jha and Singh [23] formulated an HOC scheme for the 3D steady CDR equation with variable coefficients, which exhibits third to fourth-order accuracy depending on exponential expanding and compact difference approximation. Blended compact FD schemes with fourth- and sixth-order accuracy were developed for solving the 3D CDR equation with mixed derivatives in [24], which require a 19-point compact stencil for the interior gird points. For unsteady case, an unconditionally stable compact method for solving the 1D equation was devised in [25], whose truncation error is O ( τ 2 + h 4 ) ( τ is the time step length and h is the space step length). In addition, for 1D problem, another scheme with fourth-order accuracy in both temporal and spatial directions was proposed in [26], which is transformed into a reaction diffusion equation and is unconditionally stable. In [27], Zhu and Rui presented an adaptive difference strategy with high accuracy for the 1D CDR equation, which explains the nonlinear singular quenching phenomena of the degradation. A local 1D scheme for solving a 2D CDR equation (the parabolic problem) has been presented in [28]. The scheme has second-order accuracy in time and fourth-order accuracy in space.
More HOC FD schemes have been used to solve unsteady convection diffusion equations. In [30], Noye and Tan established a five-point HOC FD scheme with a large stability region. The truncation error of the scheme is O ( τ 2 + h 3 ) . An HOC FD scheme [31] was devised for the 2D variable convection coefficients equation, which is fourth-order in space and not more than second-order in time according to weighted discretization. In addition, for the 2D problem, Karaa and Zhang [32] proposed a fourth-order alternating direction implicit (ADI) scheme, which produces an efficient solver by using 1D tridiagonal algorithm, and the unconditional stability is proved by discrete Fourier analysis. Tian and Ge [33] derived a compact ADI scheme by using a spatial discrete exponential fourth-order compact difference formula and the Crank–Nicolson (C-N) format for the time discretization. Tian [34] also proposed another unconditionally stable rational compact ADI difference method. This method is unconditionally stable too, and compared with [32], it has a smaller dissipation error and better resolution properties, while both schemes have the same order. Li et al. [4] formulated a fourth-order compact scheme of the 2D equation to solve groundwater pollution problems, which is also unconditionally stable. Sun and Lenard [35] proposed a six-order scheme by using a combined compact difference scheme for the spatial discretization and the C-N scheme for the temporal discretization. Although the scheme is sixth-order in space, it is only second-order in time, so to match the sixth-order accuracy in space, a very small time step-length must be adopted in the calculation. The schemes in [4,30,32,33,34,35] are only applicable to constant coefficients problems. For the 3D problem, Karaa [36] derived an HOC-ADI method, but the unconditional stability is only suitable for the diffusion case, while the stability of the convection diffusion case is conditionally stable. Another HOC-ADI method was given by Cao and Ge [37], which is also fourth order in space and second order in time, and this method is unconditionally stable. In addition, Ge et al. [38,39] presented an exponential high-order compact ADI method and a rational high-order compact ADI method, respectively, which have a 27-point stencil. These two methods have the same accuracy order and stability as the method in [37]. However, the above methods [36,37,38,39] are also only suitable for constant coefficients problems. From the above, we find that most of these HOC methods for 2D or 3D unsteady convection diffusion equations are only applicable to constant coefficients cases. This is also especially true for the CDR equation. So, the intention of this work is to develop an HOC method to solve the variable coefficients case, which is worthy of further study.
We attempt to develop a type of HOC difference method for two- and three-dimensional unsteady CDR equations with variable coefficients in this paper. The second-derivative terms in space are converted to the first-derivative terms by using the fourth-order compact difference approximations. The fourth-order Padé schemes are employed to explicitly compute the first derivatives. The truncation error remainder correction method is used to discretize the temporal derivative term. The derivation process is simple, and it does not require discrete convection terms as some previous works do. In this way, compact difference schemes with temporally second-order and spatially fourth-order accuracy can be obtained by using the minimum grid points. However, since the first-derivative terms need to be solved coupled with the unknown function, the computational cost is relatively high. The remainder of this study is arranged into four sections. In Section 2, an HOC difference scheme is proposed to solve the 2D CDR equation. The truncation error of this scheme is O ( τ 2 + h x 4 + h y 4 ) , and von Neumann linear stability analysis is also conducted in this part. Then, the scheme will be extended to the 3D CDR equation in Section 3. Numerical experiments are carried out to obtain approximate results in Section 4; at the same time, we will compare them with those in the literature to demonstrate the accuracy and stability. Finally, concluding remarks are given in Section 5.

2. 2D CDR Equation

Firstly, we consider the 2D unsteady CDR equation [14,18] with variable coefficients as follows:
u t + p ( x , y , t ) u x + q ( x , y , t ) u y + c ( x , y , t ) u = α ( u x x + u y y ) + f ( x , y , t ) , ( x , y ) Ω , t 0 ,
with initial and boundary conditions
u ( x , y , 0 ) = g ( x , y ) , ( x , y ) Ω ,
u ( x , y , t ) = s ( x , y , t ) , ( x , y ) Ω , t > 0 .
where Ω = { ( x , y ) : a 1 x b 1 , a 2 y b 2 } , a 1 , a 2 , b 1 , and b 2 are constants, Ω is the boundary of Ω . α is the constant diffusion coefficient ( α > 0 ); p ( x , y , t ) and q ( x , y , t ) are convection coefficients in x- and y- directions, respectively. c ( x , y , t ) is the reaction coefficient, which is non-negative. p, q, c and exterior force f are regular enough, and their required derivatives exist. We assume that g ( x , y ) and s ( x , y , t ) are known functions of sufficient smoothness and satisfy the compatibility condition s ( x , y , 0 ) = g ( x , y ) for ( x , y ) Ω such that the initial-boundary value problem (1)–(3) owns a unique solution.

2.1. HOC Difference Scheme

In order to establish HOC difference scheme of model Equation (1), we divide the domain Ω into uniform mesh. In the x- direction: a 1 = x 0 , x 1 , x 2 , , x N x = b 1 , in the y- direction: a 2 = y 0 , y 1 , y 2 , , y N y = b 2 , with the space step length h x = x i x i 1 , 1 i N x and h y = y j y j 1 , 1 j N y , τ represents the time step length, t n = n τ , 0 n M . The discretization of u ( x , y , t ) at point ( x i , y j , t n ) is expressed as u i , j n . Define the difference operators as follows:
δ x u i , j n = u i + 1 , j n u i 1 , j n 2 h x , δ x 2 u i , j n = u i + 1 , j n 2 u i , j n + u i 1 , j n h x 2 ,
δ y u i , j n = u i , j + 1 n u i , j 1 n 2 h y , δ y 2 u i , j n = u i , j + 1 n 2 u i , j n + u i , j 1 n h y 2 .
For Equation (1), take the value at the ( n ) th time level and adopt fourth-order Padé difference formulas [40] to calculate u x and u y as follows:
1 6 ( u x ) i 1 , j + 2 3 ( u x ) i , j + 1 6 ( u x ) i + 1 , j = u i + 1 , j u i 1 , j 2 h x + O ( h x 4 ) ,
1 6 ( u y ) i , j 1 + 2 3 ( u y ) i , j + 1 6 ( u y ) i , j + 1 = u i , j + 1 u i , j 1 2 h y + O ( h y 4 ) .
while u x x and u y y are approximated by the following fourth-order compact formulas:
( u x x ) i , j n = 2 δ x 2 u i , j n δ x ( u x ) i , j n + O ( h x 4 ) ,
( u y y ) i , j n = 2 δ y 2 u i , j n δ y ( u y ) i , j n + O ( h y 4 ) .
then Equation (1) is written as
( u t ) i , j n = 2 α δ x 2 u i , j n α δ x ( u x ) i , j n + 2 α δ y 2 u i , j n α δ y ( u y ) i , j n p i , j n ( u x ) i , j n q i , j n ( u y ) i , j n c i , j n u i , j n + f i , j n + O ( h x 4 + h y 4 ) .
Using the Taylor series expansion, we have
( u t ) i , j n = δ t + u i , j n τ 2 ( u t t ) i , j n + O ( τ 2 ) ,
in which, δ t + u i , j n = u i , j n + 1 u i , j n τ . To improve the accuracy in the time direction, u t t in Equation (11) needs to be processed. So, we take the derivative of both sides of Equation (1) for t to get
u t t = α ( u x x t + u y y t ) p t u x p u x t q t u y q u y t c t u c u t + f t .
Then, in Equation (12), we use the first-order forward difference to discretize the time derivative term and adopt Equations (6)–(9) to calculate the first and second-derivative terms in spatial direction, respectively, we have
( u t t ) i , j n = 2 α δ t + δ x 2 u i , j n α δ t + δ x ( u x ) i , j n + 2 α δ t + δ y 2 u i , j n α δ t + δ y ( u y ) i , j n δ t + p i , j n · ( u x ) i , j n p i , j n δ t + ( u x ) i , j n δ t + q i , j n · ( u y ) i , j n q i , j n δ t + ( u y ) i , j n δ t + c i , j n · u i , j n c i , j n δ t + u i , j n + δ t + f i , j n + O ( τ + h x 4 + h y 4 ) ,
we can get
( u t ) i , j n = δ t + u i , j n τ α δ t + δ x 2 u i , j n + τ α 2 δ t + δ x ( u x ) i , j n τ α δ t + δ y 2 u i , j n + τ α 2 δ t + δ y ( u y ) i , j n + τ 2 δ t + p i , j n · ( u x ) i , j n + τ 2 p i , j n δ t + ( u x ) i , j n + τ 2 δ t + q i , j n · ( u y ) i , j n + τ 2 q i , j n δ t + ( u y ) i , j n + τ 2 δ t + c i , j n · u i , j n + τ 2 c i , j n δ t + u i , j n τ 2 δ t + f i , j n + O ( τ 2 + τ h x 4 + τ h y 4 ) .
Finally, by substituting Equation (14) into Equation (10) and omitting the higher-order terms, we get
δ t + u i , j n τ α δ t + δ x 2 u i , j n + τ α 2 δ t + δ x ( u x ) i , j n τ α δ t + δ y 2 u i , j n + τ α 2 δ t + δ y ( u y ) i , j n + τ 2 δ t + p i , j n · ( u x ) i , j n + τ 2 p i , j n δ t + ( u x ) i , j n + τ 2 δ t + q i , j n · ( u y ) i , j n + τ 2 q i , j n δ t + ( u y ) i , j n + τ 2 δ t + c i , j n · u i , j n + τ 2 c i , j n δ t + u i , j n τ 2 δ t + f i , j n = 2 α δ x 2 u i , j n α δ x ( u x ) i , j n + 2 α δ y 2 u i , j n α δ y ( u y ) i , j n p i , j n ( u x ) i , j n q i , j n ( u y ) i , j n c i , j n u i , j n + f i , j n .
Equation (15) is the present HOC difference scheme for solving the 2D unsteady variable coefficient CDR Equation (1), in which we adopt consistent fourth-order formulas [41] to calculate the values at the boundary points of u x and u y
( u x ) 0 , j + 14 15 ( u x ) 1 , j = 1 h x ( 184 75 u 0 , j + 703 180 u 1 , j 89 30 u 2 , j + 67 30 u 3 , j 77 90 u 4 , j + 41 300 u 5 , j ) , ( j = 0 , 1 , N y ) ,
( u y ) i , 0 + 14 15 ( u y ) i , 1 = 1 h y ( 184 75 u i , 0 + 703 180 u i , 1 89 30 u i , 2 + 67 30 u i , 3 77 90 u i , 4 + 41 300 u i , 5 ) , ( i = 0 , 1 , , N x ) ,
( u x ) N x , j 14 15 ( u x ) N x 1 , j = 1 h x ( 52 25 u N x , j 1067 180 u N x 1 , j + 67 10 u N x 2 , j 41 10 u N x 3 , j + 133 90 u N x 4 , j 69 300 u N x 5 , j ) , ( j = 0 , 1 , N y ) ,
( u y ) i , N y 14 15 ( u y ) i , N y 1 = 1 h y ( 52 25 u i , N y 1067 180 u i , N y 1 + 67 10 u i , N y 2 41 10 u i , N y 3 + 133 90 u i , N y 4 69 300 u i , N y 5 ) , ( i = 0 , 1 , N x ) .
According to the derivation, the truncation error of scheme (15) is O ( τ 2 + h x 4 + h y 4 ) . We notice that scheme (15) is a two-level scheme and the calculation of each unknown time level only involves five grid points. Since the right hand of the scheme (15) contains unknown items ( u x ) i , j n + 1 and ( u y ) i , j n + 1 , so we use the successive over relaxation (SOR) method to iteratively solve it.

2.2. Stability Analysis

Now, we discuss the stability of the present HOC scheme by the von Neumann analysis method. To make it easier, in Equation (1), we assume that the coefficients of convection terms and reaction term are constants, which are p ¯ , q ¯ and c ¯ ( c ¯ is non-negative), respectively, then Equation (1) can be written as
u t + p ¯ u x + q ¯ u y + c ¯ u = α ( u x x + u y y ) + f ( x , y , t ) .
Then, assuming f ( x , y , t ) 0 , we get the error equation of Equation (15)
δ t + ε i , j n τ α δ t + δ x 2 ε i , j n + τ α 2 δ t + δ x ( ε x ) i , j n τ α δ t + δ y 2 ε i , j n + τ α 2 δ t + δ y ( ε y ) i , j n + τ 2 p ¯ δ t + ( ε x ) i , j n + τ 2 q ¯ δ t + ( ε y ) i , j n + τ 2 c ¯ δ t + ε i , j n = 2 α δ x 2 ε i , j n α δ x ( ε x ) i , j n + 2 α δ y 2 ε i , j n α δ y ( ε y ) i , j n p ¯ ( ε x ) i , j n q ¯ ( ε y ) i , j n c ¯ ε i , j n .
in which ε i , j n represents the error generated by the numerical solution u i , j n . Use ( ε x ) i , j n and ( ε y ) i , j n to express the errors generated by the numerical solutions ( u x ) i , j n and ( u y ) i , j n , respectively. At the grid node ( x i , y j , t n ) , let
ε i , j n = ξ n e I θ x i e I θ y j ,
( ε x ) i , j n = ( η x ) n e I θ x i e I θ y j ,
( ε y ) i , j n = ( η y ) n e I θ x i e I θ y j ,
where I = 1 , ξ n , ( η x ) n , and ( η y ) n are the amplitudes at the (n)th time level, while θ x = 2 π h x λ 1 and θ y = 2 π h y λ 2 are the phase angles in two spatial directions, respectively, in which λ 1 and λ 2 are the wavelengths, respectively. Substituting Equations (22)–(24) into Equation (21), and eliminating e I θ x i e I θ y j , we can get
( 1 τ + 2 α h x 2 + 2 α h y 2 + c ¯ 2 ) ξ n + 1 α h x 2 ( e I θ x + e I θ x ) ξ n + 1 α h y 2 ( e I θ y + e I θ y ) ξ n + 1 + α 4 h x ( e I θ x e I θ x ) ( η x ) n + 1 + p ¯ 2 ( η x ) n + 1 + α 4 h y ( e I θ y e I θ y ) ( η y ) n + 1 + q ¯ 2 ( η y ) n + 1 = ( 1 τ 2 α h x 2 2 α h y 2 c ¯ 2 ) ξ n + α h x 2 ( e I θ x + e I θ x ) ξ n + α h y 2 ( e I θ y + e I θ y ) ξ n α 4 h x ( e I θ x e I θ x ) ( η x ) n p ¯ 2 ( η x ) n α 4 h y ( e I θ y e I θ y ) ( η y ) n q ¯ 2 ( η y ) n .
According to Equations (6) and (7), we have
( η x ) n = 3 ( e I θ x e I θ x ) h x ( e I θ x + 4 + e I θ x ) ξ n ,
( η y ) n = 3 ( e I θ y e I θ y ) h y ( e I θ y + 4 + e I θ y ) ξ n .
Substitute Equations (26) and (27) into Equation (25), then after simplification and rearrangement, we have
{ 1 + τ c ¯ 2 2 τ α ( cos θ x 1 h x 2 + cos θ y 1 h y 2 ) τ α 2 [ 3 sin 2 θ x h x 2 ( 2 + cos θ x ) + 3 sin 2 θ y h y 2 ( 2 + cos θ y ) ] + 3 τ 2 [ p ¯ sin θ x h x ( 2 + cos θ x ) + q ¯ sin θ y h y ( 2 + cos θ y ) ] I } ξ n + 1 = { 1 τ c ¯ 2 + 2 τ α ( cos θ x 1 h x 2 + cos θ y 1 h y 2 ) + τ α 2 [ 3 sin 2 θ x h x 2 ( 2 + cos θ x ) + 3 sin 2 θ y h y 2 ( 2 + cos θ y ) ] 3 τ 2 [ p ¯ sin θ x h x ( 2 + cos θ x ) + q ¯ sin θ y h y ( 2 + cos θ y ) ] I } ξ n .
then the error amplification factor can be taken as
G = ξ n + 1 ξ n = 1 A B I 1 + A + B I ,
where
A = τ c ¯ 2 τ α 2 [ ( cos θ x 1 ) ( cos θ x + 5 ) h x 2 ( 2 + cos θ x ) + ( cos θ y 1 ) ( cos θ y + 5 ) h y 2 ( 2 + cos θ y ) ] ,
B = 3 τ 2 [ p ¯ sin θ x h x ( 2 + cos θ x ) + q ¯ sin θ y h y ( 2 + cos θ y ) ] .
From Equation (30), we find that A 0 , so G 2 = ( 1 A ) 2 + B 2 ( 1 + A ) 2 + B 2 1 . Therefore, we can conclude that the present HOC scheme Equation (15) is unconditionally stable.

3. Extension to 3D

Next, we pay attention to the 3D unsteady CDR equation with variable coefficients as follows:
u t + p ( x , y , z , t ) u x + q ( x , y , z , t ) u y + r ( x , y , z , t ) u z + c ( x , y , z , t ) u = α ( u x x + u y y + u z z ) + f ( x , y , z , t ) , ( x , y , z ) Ω , t 0 ,
with initial condition
u ( x , y , z , 0 ) = g ( x , y , z ) , ( x , y , z ) Ω ,
and boundary condition
u ( x , y , z , t ) = s ( x , y , z , t ) , ( x , y , z ) Ω , t > 0 .
where Ω = { ( x , y , z ) : a 1 x b 1 , a 2 y b 2 , a 3 z b 3 } , a 1 , a 2 , a 3 , b 1 , b 2 , and b 3 are constants, Ω is the boundary of Ω , α is the constant diffusion coefficient ( α > 0 ), p ( x , y , z , t ) , q ( x , y , z , t ) and r ( x , y , z , t ) are convection coefficients in the x-, y-, and z- directions, respectively, c ( x , y , z , t ) is the reaction coefficient, and it is non-negative. p, q, r, c and exterior force f are regular enough and their required derivatives exist. We assume that g ( x , y , z ) and s ( x , y , z , t ) are known functions of sufficient smoothness and satisfy the compatibility condition s ( x , y , z , 0 ) = g ( x , y , z ) for ( x , y , z ) Ω such that the initial-boundary value Problem (32)–(34) owns a unique solution.
In order to establish HOC difference scheme of model Equation (32), we divide the domain Ω into uniform mesh. In the x- direction: a 1 = x 0 , x 1 , x 2 , , x N x = b 1 , in the y- direction: a 2 = y 0 , y 1 , y 2 , , y N y = b 2 , in the z- direction: a 3 = z 0 , z 1 , z 2 , , z N z = b 3 , with the space step length h x = x i x i 1 , 1 i N x , h y = y j y j 1 , 1 j N y and h z = z k z k 1 , 1 k N z , τ represents the time step length, t n = n τ , 0 n M . The discretization of u ( x , y , z , t ) at point ( x i , y j , z k , t n ) is expressed as u i , j , k n . Define the difference operators in three spatial directions as follows:
δ x u i , j , k n = u i + 1 , j , k n u i 1 , j , k n 2 h x , δ x 2 u i , j , k n = u i + 1 , j , k n 2 u i , j , k n + u i 1 , j , k n h x 2 ,
δ y u i , j , k n = u i , j + 1 , k n u i , j 1 , k n 2 h y , δ y 2 u i , j , k n = u i , j + 1 , k n 2 u i , j , k n + u i , j 1 , k n h y 2 ,
δ z u i , j , k n = u i , j , k + 1 n u i , j , k 1 n 2 h z , δ z 2 u i , j , k n = u i , j , k + 1 n 2 u i , j , k n + u i , j , k 1 n h z 2 .
By a similar derivation, we can get the HOC difference scheme for the 3D unsteady CDR Equation (32) as following
δ t + u i , j , k n τ α δ t + δ x 2 u i , j , k n + τ α 2 δ t + δ x ( u x ) i , j , k n τ α δ t + δ y 2 u i , j , k n + τ α 2 δ t + δ y ( u y ) i , j , k n τ α δ t + δ z 2 u i , j , k n + τ α 2 δ t + δ z ( u z ) i , j , k n + τ 2 δ t + p i , j , k n · ( u x ) i , j , k n + τ 2 p i , j , k n δ t + ( u x ) i , j , k n + τ 2 δ t + q i , j , k n · ( u y ) i , j , k n + τ 2 q i , j , k n δ t + ( u y ) i , j , k n + τ 2 δ t + r i , j , k n · ( u z ) i , j , k n + τ 2 r i , j , k n δ t + ( u z ) i , j , k n + τ 2 δ t + c i , j , k n · u i , j , k n + τ 2 c i , j , k n δ t + u i , j , k n τ 2 δ t + f i , j , k n = 2 α δ x 2 u i , j , k n α δ x ( u x ) i , j , k n + 2 α δ y 2 u i , j , k n α δ y ( u y ) i , j , k n + 2 α δ z 2 u i , j , k n α δ z ( u z ) i , j , k n p i , j , k n ( u x ) i , j , k n q i , j , k n ( u y ) i , j , k n r i , j , k n ( u z ) i , j , k n c i , j , k n u i , j , k n + f i , j , k n .
where δ t + represents the forward difference operator of the first derivative in the time direction.
In Equation (38), u x , u y , and u z are calculated by the fourth-order Padé difference formulas [40], while u x x , u y y , and u z z are discretized by fourth-order compact difference formulas (see Appendix A). In addition, we adopt consistent fourth-order formulas [41] to calculate the values at the boundary points of u x , u y , and u z (also see Appendix A).
Equation (38) is the HOC difference scheme for the 3D unsteady variable coefficients CDR equation. The calculation of each unknown time level only involves seven grid points. The truncation error is O ( τ 2 + h x 4 + h y 4 + h z 4 ) . The right hand of the scheme (38) contains unknown items ( u x ) i , j , k n + 1 , ( u y ) i , j , k n + 1 and ( u z ) i , j , k n + 1 , so we use the SOR method to solve it. In addition, we should mention that the stability analysis of the 3D case is the same as that of the 2D case (see Appendix B). So, the scheme (38) is still unconditionally stable.

4. Numerical Experiments

Now, five examples are conducted to verify the effectiveness and validity of the new HOC difference schemes. We will compare the numerical results computed by the present HOC schemes with those derived by the methods in the existing literature. We note that for the methods in [42,43], we use PHOEBESolver software (http://www.phoebesolver.com/webpde/main/index) (accessed on 2 Feburary 2022) to calculate. For all calculations, an equal mesh size step is used in the spatial directions. We use the maximum absolute error L and the L 2 norm error to measure the accuracy of the new HOC schemes. The definitions of the two errors for 2D cases are:
L = M a x i , j u i , j e x a c t u i , j n u m , L 2 = h 2 i j u i , j e x a c t u i , j n u m 2 ,
and the definitions for 3D cases are:
L = M a x i , j , k u i , j , k e x a c t u i , j , k n u m , L 2 = h 3 i j k u i , j , k e x a c t u i , j , k n u m 2 ,
The definition of convergence rate is:
R a t e = log ( E 1 / E 2 ) log ( h 1 / h 2 ) .
in which E 1 and E 2 represent the errors corresponding to the different spatial step-lengths h 1 and h 2 , respectively.
Problem 1.
Firstly, we pay attention to the 2D Burgers equation [42,44,45]:
u t + u ( u x + u y ) = α ( u x x + u y y ) , ( x , y ) [ 0 , 1 ] 2 , t ( 0 , T ] .
the initial and boundary conditions can be taken directly from the analytical solution u ( x , y , t ) = 1 / ( 1 + e x + y t 2 α ) .
Problem 1 has nonlinear terms, which can still be approximated by the skill of solving linear problems in this study. In Table 1, the diffusion coefficient α is assigned to different values when τ = h 2 15 α , T = 1 15 . We find that the scheme in Ref. [42] is fourth order in space, and the schemes in Ref. [44] are fourth and sixth order, respectively. We can see from the data that when α = 0.1 in the present scheme, the fourth-order scheme in Ref. [44] and the scheme in Ref. [42] all achieve theoretical accuracy. At the same time, the sixth-order scheme in Ref. [44] obtains sixth-order accuracy. However, the L error calculated by the sixth-order scheme in Ref. [44] is larger than that in Ref. [42] and the present scheme. When α = 0.01 , the L error of the new scheme has the same order of magnitude as that of the scheme in Ref. [42], which is three to four orders lower than the fourth-order scheme in Ref. [44] and two orders lower than the sixth-order scheme in Ref. [44]. With the increase of mesh number, the present scheme makes the numerical approximation more accurate than Ref. [42]. When N = 7 , τ = 0.01 and α = 1 , the absolute error of different time is given in Table 2. It shows that the numerical results of the present scheme are six orders of magnitude lower than those in Ref. [45] and more accurate than those in Ref. [42]. The absolute errors when h = 0.05 , τ = 0.001 and α = 0.05 of the present method and the HOC scheme in Ref. [42] are shown in Figure 1. By comparison, we can see that the absolute errors of the two schemes have the same order of magnitude when T = 1 , while when T = 2 , the absolute error of the present scheme is smaller. Figure 2 shows the numerical solutions of this problem for different times. We find that with the increase of time, the solution tends to a fixed value.
Problem 2.
Next, we consider a 2D problem with exponential and characteristic boundary layers [12,20]:
u t + p u x + q u y = α ( u x x + u y y ) + f ( x , y , t ) , ( x , y ) [ 0 , 1 ] 2 , t ( 0 , T ]
with p = 1 , q = 0 , α = 0.0001 , f ( x , y , t ) = 1 . Homogeneous Dirichlet boundary conditions are applied for this problem, and the initial condition is given as u ( x , y , 0 ) = 0 .
The CDR equation consists of three parts: convection refers to the movement of molecules from one region to another because of velocity, while diffusion means the spread of particles through random motion from a region with high concentration to a low concentration region. Finally, reaction is due to the adsorption or chemical reaction of a substance with another component. For Problem 2, convection is dominated. While q = 0 means that the flow is only in the x-direction, thus forming an outflow boundary at x = 1 . In fact, Problem 2 is an experiment with one exponential boundary layer and two characteristic boundary layers, which was studied in Refs. [12,20]. An exponential boundary layer appears at the outflow boundary x = 1 . Meanwhile, y = 0 and y = 1 are the tangential boundaries, and characteristic or parabolic boundary layers develop there. There is no analytical solution for this problem. Take time step-length τ = 0.001 and 120 × 120 grid nodes are used in the present scheme for numerical approximation. Figure 3 shows the numerical results of this problem at time T = 0.3 , T = 0.6 , T = 0.9 , and T = 1.2 . As time increases, this problem forms a slope in the calculation region from the entrance to the exit over time gradually. An adaptive mesh finite element method in Ref. [12] and an unstructured mesh difference method in Ref. [20] were used to carry out numerical simulation for this question, respectively, when T = 0.6 and T = 1.2 . Comparing Figure 3b and Figure 3d with the figures in Refs. [12,20], it can be seen that both the present HOC difference scheme and the above two schemes can accurately simulate this flow problem, which means that there is no numerical oscillation at the boundary layers.
Problem 3.
Afterward, we consider the 2D inhomogeneous CDR equations:
u t + a 2 ( u x + u y ) = d 2 ( u x x + u y y ) b u + v v t + a 2 ( v x + v y ) = d 2 ( v x x + v y y ) s v ( x , y ) [ 0 , 2 π ] 2 , t ( 0 , T ] .
This problem has the following analytical solution:
u ( x , y , t ) = ( e ( b + d ) t + e ( s + d ) t ) cos ( x + y a t ) v ( x , y , t ) = ( b s ) e ( s + d ) t cos ( x + y a t ) .
The initial and boundary conditions are taken by the analytical solution.
For Problem 3, three cases with different coefficients are considered respectively when τ = h 2 , T = 1 , which are reaction dominance, convection dominance, and diffusion dominance, accordingly. In Table 3, two norm errors and the convergence rates are shown when a = d = s = 1 , b = 100 . In this case, the governing equation is reaction dominated. We can see from the data that the convergence rates of variables u and v are both the fourth order in space. We notice that when the grid number takes 20, the calculation results are not very accurate; it is caused by too few grids or too few time advance steps. With the increase of grid number, the accuracy will be stabilized at the fourth order. The equation is convection dominated when a = 1 , b = 0.01 , s = 0.1 , d = 0.001 . Table 4 shows the errors and the convergence rate in this case. We can see that both the L and L 2 errors for u and v reach the fourth-order accuracy. When a = s = 0.01 , b = 0.1 , d = 10 , the equation is diffusion dominated. In Table 5, we notice that the convergence rate of the two norm errors are still fourth order, which fully verifies the accuracy of the present scheme.
Problem 4.
Now, we focus on a 3D CDR equation:
u t + t ( x + y + z ) u x + t 2 x y z u y + sin [ π ( x + y + z + t ) ] u z + t x y z u = u x x + u y y + u z z + f ( x , y , z , t ) , ( x , y , z ) [ 0 , 1 ] 3 , t ( 0 , T ]
The analytical solution is u ( x , y , z , t ) = e t sin ( π x ) sin ( π y ) sin ( π z ) , which gives the right hand term f ( x , y , z , t ) and the initial and boundary conditions.
Problem 4 is an inhomogeneous variable coefficient equation. When τ = h 2 , T = 0.25 , the two norm errors and convergence rate of different space step-length are shown in Table 6. We find that the present scheme obtains fourth-order accuracy in space, while the C-N scheme and backward for time and central for space (BTCS) scheme only achieve second-order accuracy. When T = 0.5 , h = 0.03125 , the L error, L 2 error and convergence rate of different time step-length τ are shown in Table 7. From the numerical results, we can get that the new HOC scheme obtains second-order accuracy in time. Table 8 displays the maximum absolute error L and L 2 error of different mesh ratios λ when T = 1 , h = 1 32 . It is easy to see that the present scheme is still convergent when λ > 1 just like the C-N scheme and BTCS scheme. Therefore, the present HOC scheme for the 3D problem is unconditionally stable.
Problem 5.
Finally, we solve a 3D Burgers equation [43]:
u t + u u x + v u y + w u z = α ( u x x + u y y + u z z ) , ( x , y , z ) [ 0 , 1 ] 3 , t ( 0 , T ]
in which
v ( x , y , z , t ) = 2 α [ a 2 e γ α t n y π sin ( n x π x ) cos ( n y π y ) sin ( n z π z ) ] d 0 w ( x , y , z , t ) = 2 α [ a 2 e γ α t n z π sin ( n x π x ) sin ( n y π y ) cos ( n z π z ) ] d 0 .
and γ = π 2 ( n x 2 + n y 2 + n z 2 ) , d 0 = 1 1 [ a 1 + a 2 e γ α t sin ( n x π x ) sin ( n y π y ) sin ( n z π z ) ] [ a 1 + a 2 e γ α t sin ( n x π x ) sin ( n y π y ) sin ( n z π z ) ] are two parameters. The initial and boundary conditions can be taken from the analytical solution u ( x , y , z , t ) = 2 α [ a 2 e γ α t n x π cos ( n x π x ) sin ( n y π y ) sin ( n z π z ) ] d 0 .
Problem 5 is a 3D nonlinear convection diffusion case. We take n x = n y = n z = 3 , a 1 = 1 , a 2 = 0.1 in the calculation. Table 9 shows the L error and convergence rate of the new scheme and the DHOC scheme [43] with different spatial grid numbers. The DHOC scheme is conditionally stable with the truncation error O ( τ 2 + h x 4 + h y 4 + h z 4 ) . We find that both the two schemes obtain fourth-order accuracy in space when τ = h 2 . Table 10 shows the comparison of the maximum absolute error when τ = 0.001 , T = 0.1 with different α . We can see that the L error of the new HOC scheme has the same order of magnitude as that of the DHOC scheme, but the numerical results of the present scheme are more accurate. Table 11 displays the L error and the L 2 error of different mesh ratio λ when h = 0.0625 , α = 0.1 , T = 2 . With the increase of λ , the present scheme is still convergent, that is, unconditionally stable, while the DHOC scheme is divergent, that is, conditionally stable, which is consistent with the theoretical analysis and fully verifies the robustness of the new scheme.

5. Conclusions

In this study, an HOC method is introduced, and two HOC difference schemes are formulated to solve 2D and 3D unsteady CDR equations with variable coefficients. They have second-order temporal accuracy and fourth-order spatial accuracy. The stability of these two schemes are proven by using the von Neumann linear stability analysis method. For solving the linear algebraic systems generated by the HOC difference schemes at each time level, the SOR method is used. Numerical studies are carried out to validate the effectiveness and dependability of the novel schemes. We can see that the proposed schemes have high accuracy and very good stability. In addition, the present schemes have several obvious advantages as follows:
(1) The present difference scheme for the 2D case involves only five grid points, while the scheme in Ref. [32] has a nine-point stencil. Similarly, our scheme for the 3D case involves only seven grid points, while that in Ref. [24] has a 19-point stencil and those in Refs. [38,39] have 27-point stencils. So, the present HOC schemes make it easy to program and save storage space.
(2) Although the equation models are used to describe linear problems, the present schemes are also suitable for solving the Burgers equations with nonlinear terms and produce more accurate numerical results than those in the literature.
(3) The present schemes are unconditionally stable, which is uncommon for many HOC schemes for solving variable coefficients problems, especially for 3D cases. As we mentioned earlier, the methods in Refs. [36,37,38,39] are only suitable for solving 3D constant coefficients problems; at the same time, the method in Ref. [36] is conditionally stable.
As we know, chemotaxis models in biomathematics can be described by unsteady nonlinear convection diffusion reaction equations. Some researchers have used the finite difference method to study chemotaxis models. For instance, Chertock et al. [46] formulated a high-order finite volume-finite difference scheme for solving the Patlak–Keller–Segel chemotaxis model. The scheme has fourth-order accuracy but is conditionally stable. Later, Chertock et al. [47] generalized this method and proposed an adaptive mesh algorithm to simulate the blow-up phenomena of the chemotaxis model. Up to now, there have been few HOC difference methods to solve chemotaxis models. Although the present method cannot solve the complete nonlinear problems, we are planning to extend it to the fully nonlinear CDR equation and to solve chemotaxis models in our future work.

Author Contributions

J.W., methodology, software, validation, writing; Y.G., conceptualization, Funding acquisition, supervision; Y.W., Investigation, project administration. All authors have read and agreed to the published version of the manuscript.

Funding

This work is partially supported by the National Natural Science Foundation of China (12161067, 11961054, 11902170), the Key Research and Development Program of Ningxia (2018BEE03007), National Youth Top-notch Talent Support Program of Ningxia, and the First Class Discipline Construction Project in Ningxia Universities: Mathematics.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

The first-derivative terms in the spatial direction in Equation (38) are calculated by the following fourth-order Padé approximation [40]
1 6 ( u x ) i 1 , j , k + 2 3 ( u x ) i , j , k + 1 6 ( u x ) i + 1 , j , k = u i + 1 , j , k u i 1 , j , k 2 h x + O ( h x 4 ) ,
1 6 ( u y ) i , j 1 , k + 2 3 ( u y ) i , j , k + 1 6 ( u y ) i , j + 1 , k = u i , j + 1 , k u i , j 1 , k 2 h y + O ( h y 4 ) ,
1 6 ( u z ) i , j , k 1 + 2 3 ( u z ) i , j , k + 1 6 ( u z ) i , j , k + 1 = u i , j , k + 1 u i , j , k 1 2 h z + O ( h z 4 ) .
The second-derivative terms in Equation (38) are calculated by the following fourth-order compact formulas
( u d d ) i , j , k n = 2 δ d 2 u i , j , k n δ d ( u d ) i , j , k n + O ( h d 4 ) ,
in which d presents x , y , and z. The boundaries of the first derivatives in Equation (38) are calculated by the following consistent fourth-order scheme [41]
( u x ) 0 , j , k + 14 15 ( u x ) 1 , j , k = 1 h x ( 184 75 u 0 , j , k + 703 180 u 1 , j , k 89 30 u 2 , j , k + 67 30 u 3 , j , k 77 90 u 4 , j , k + 41 300 u 5 , j , k ) ( j = 0 , 1 , N y ; k = 0 , 1 , N z ) ,
( u y ) i , 0 , k + 14 15 ( u y ) i , 1 , k = 1 h y ( 184 75 u i , 0 , k + 703 180 u i , 1 , k 89 30 u i , 2 , k + 67 30 u i , 3 , k 77 90 u i , 4 , k + 41 300 u i , 5 , k ) ( i = 0 , 1 , , N x ; k = 0 , 1 , , N z ) ,
( u z ) i , j , 0 + 14 15 ( u z ) i , j , 1 = 1 h z ( 184 75 u i , j , 0 + 703 180 u i , j , 1 89 30 u i , j , 2 + 67 30 u i , j , 3 77 90 u i , j , 4 + 41 300 u i , j , 5 ) ( i = 0 , 1 , N x ; j = 0 , 1 , N y ) ,
( u x ) N x , j , k 14 15 ( u x ) N x 1 , j , k = 1 h x ( 52 25 u N x , j , k 1067 180 u N x 1 , j , k + 67 10 u N x 2 , j , k 41 10 u N x 3 , j , k + 133 90 u N x 4 , j , k 69 300 u N x 5 , j , k ) ( j = 0 , 1 , N y ; k = 0 , 1 , N z ) ,
( u y ) i , N y , k 14 15 ( u y ) i , N y 1 , k = 1 h y ( 52 25 u i , N y , k 1067 180 u i , N y 1 , k + 67 10 u i , N y 2 , k 41 10 u i , N y 3 , k + 133 90 u i , N y 4 , k 69 300 u i , N y 5 , k ) , ( i = 0 , 1 , N x ; k = 0 , 1 , N z ) ,
( u z ) i , j , N z 14 15 ( u z ) i , j , N z 1 = 1 h z ( 52 25 u i , j , N z 1067 180 u i , j , N z 1 + 67 10 u i , j , N z 2 41 10 u i , j , N z 3 + 133 90 u i , j , N z 4 69 300 u i , j , N z 5 ) , ( i = 0 , 1 , N x ; j = 0 , 1 , N y ) .

Appendix B

In Equation (32), we assume that the convection coefficients and reaction coefficient are constants, which are p ¯ , q ¯ , r ¯ and c ¯ ( c ¯ is non-negative), respectively. At the same time, assuming f ( x , y , z , t ) 0 , we obtain the error equation of Equation (38)
δ t + ε i , j , k n τ α δ t + δ x 2 ε i , j , k n + τ α 2 δ t + δ x ( ε x ) i , j , k n τ α δ t + δ y 2 ε i , j , k n + τ α 2 δ t + δ y ( ε y ) i , j , k n τ α δ t + δ z 2 ε i , j , k n + τ α 2 δ t + δ z ( ε z ) i , j , k n + τ 2 p ¯ δ t + ( ε x ) i , j , k n + τ 2 q ¯ δ t + ( ε y ) i , j , k n + τ 2 r ¯ δ t + ( ε z ) i , j , k n + τ 2 c ¯ δ t + ε i , j , k n = 2 α δ x 2 ε i , j , k n α δ x ( ε x ) i , j , k n + 2 α δ y 2 ε i , j , k n α δ y ( ε y ) i , j , k n + 2 α δ z 2 ε i , j , k n α δ z ( ε z ) i , j , k n p ¯ ( ε x ) i , j , k n q ¯ ( ε y ) i , j , k n r ¯ ( ε z ) i , j , k n c ¯ ε i , j , k n .
in which ε i , j , k n represents the error generated by the numerical solution u i , j , k n . Use ( ε x ) i , j , k n , ( ε y ) i , j , k n and ( ε z ) i , j , k n to express the errors generated by the numerical solution ( u x ) i , j , k n , ( u y ) i , j , k n and ( u z ) i , j , k n , respectively.
At the grid ( x i , y j , z k , t n ) node, let
ε i , j , k n = ξ n e I θ x i e I θ y j e I θ z k ,
( ε x ) i , j , k n = ( η x ) n e I θ x i e I θ y j e I θ z k , ( ε y ) i , j , k n = ( η y ) n e I θ x i e I θ y j e I θ z k , ( ε z ) i , j , k n = ( η z ) n e I θ x i e I θ y j e I θ z k .
where I = 1 , ξ n , ( η x ) n , ( η y ) n and ( η z ) n are the amplitudes at the ( n ) th time level, and θ x = 2 π h x λ 1 , θ y = 2 π h y λ 2 and θ z = 2 π h z λ 3 are the phase angles in three spatial directions, respectively, in which λ 1 , λ 2 and λ 3 represent the wavelengths.
Substituting Equations (A12) and (A13) into Equation (A11), and eliminating e I θ x i e I θ y j e I θ z k on both sides of the equation, we can get
( 1 τ + 2 α h x 2 + 2 α h y 2 + 2 α h z 2 + c ¯ 2 ) ξ n + 1 α h x 2 ( e I θ x + e I θ x ) ξ n + 1 α h y 2 ( e I θ y + e I θ y ) ξ n + 1 α h z 2 ( e I θ z + e I θ z ) ξ n + 1 + α 4 h x ( e I θ x e I θ x ) η x n + 1 + p ¯ 2 η x n + 1 + α 4 h y ( e I θ y e I θ y ) η y n + 1 + q ¯ 2 η y n + 1 + α 4 h z ( e I θ z e I θ z ) η z n + 1 + r ¯ 2 η z n + 1 = ( 1 τ 2 α h x 2 2 α h y 2 2 α h z 2 c ¯ 2 ) ξ n + α h x 2 ( e I θ x + e I θ x ) ξ n + α h y 2 ( e I θ y + e I θ y ) ξ n + α h z 2 ( e I θ z + e I θ z ) ξ n α 4 h x ( e I θ x e I θ x ) η x n p ¯ 2 η x n α 4 h y ( e I θ y e I θ y ) η y n q ¯ 2 η y n α 4 h z ( e I θ z e I θ z ) η z n r ¯ 2 η z n .
According to Equations (A1)–(A3), we have
( η x ) n = 3 ( e I θ x e I θ x ) h x ( e I θ x + 4 + e I θ x ) ξ n ,
( η y ) n = 3 ( e I θ y e I θ y ) h y ( e I θ y + 4 + e I θ y ) ξ n ,
( η z ) n = 3 ( e I θ z e I θ z ) h z ( e I θ z + 4 + e I θ z ) ξ n .
Substituting Equations (A15)–(A17) into Equation (A14), then, after simplification and rearrangement, we have
{ 1 + τ c ¯ 2 2 τ α ( cos θ x 1 h x 2 + cos θ y 1 h y 2 + cos θ z 1 h z 2 ) τ α 2 [ 3 sin 2 θ x h x 2 ( 2 + cos θ x ) + 3 sin 2 θ y h y 2 ( 2 + cos θ y ) + 3 sin 2 θ z h z 2 ( 2 + cos θ z ) ] + 3 τ 2 [ p ¯ sin θ x h x ( 2 + cos θ x ) + q ¯ sin θ y h y ( 2 + cos θ y ) + r ¯ sin θ z h z ( 2 + cos θ z ) ] I } ξ n + 1 = { 1 τ c ¯ 2 + 2 τ α ( cos θ x 1 h x 2 + cos θ y 1 h y 2 + cos θ z 1 h z 2 ) + τ α 2 [ 3 sin 2 θ x h x 2 ( 2 + cos θ x ) + 3 sin 2 θ y h y 2 ( 2 + cos θ y ) + 3 sin 2 θ z h z 2 ( 2 + cos θ z ) ] 3 τ 2 [ p ¯ sin θ x h x ( 2 + cos θ x ) + q ¯ sin θ y h y ( 2 + cos θ y ) + r ¯ sin θ z h z ( 2 + cos θ z ) ] I } ξ n .
The amplification factor is taken to be
G = ξ n + 1 ξ n = 1 A B I 1 + A + B I ,
where
A = τ c ¯ 2 τ α 2 [ ( cos θ x 1 ) ( cos θ x + 5 ) h x 2 ( 2 + cos θ x ) + ( cos θ y 1 ) ( cos θ y + 5 ) h y 2 ( 2 + cos θ y ) + ( cos θ z 1 ) ( cos θ z + 5 ) h z 2 ( 2 + cos θ z ) ] ,
B = 3 τ 2 [ p ¯ sin θ x h x ( 2 + cos θ x ) + q ¯ sin θ y h y ( 2 + cos θ y ) + r ¯ sin θ z h z ( 2 + cos θ z ) ] .
From Equation (A20), we find that A 0 , so G 2 = ( 1 A ) 2 + B 2 ( 1 + A ) 2 + B 2 1 . Therefore, we conclude that the present HOC Formula (38) is unconditionally stable.

References

  1. Li, J.W.; Feng, X.L.; He, Y.N. RBF-based meshless local Petrov Galerkin method for the multi-dimensional convection-diffusion-reaction equation. Eng. Anal. Bound. Elem. 2019, 98, 46–53. [Google Scholar] [CrossRef]
  2. Fu, Z.J.; Tang, Z.C.; Zhao, H.T.; Li, P.W.; Rabczuk, T. Numerical solutions of the coupled unsteady nonlinear convection-diffusion equations based on generalized finite difference method. Eur. Phys. J. Plus 2019, 134, 272. [Google Scholar] [CrossRef]
  3. Sheshachala, S.K.; Codina, R. Finite element modeling of nonlinear reaction-diffusion-advection systems of equation. Int. J. Numer. Methods Heat Fluid Flow 2018, 280, 2688–2715. [Google Scholar] [CrossRef]
  4. Li, L.Y.; Jiang, Z.W.; Yin, Z. Fourth-order compact finite difference method for solving two-dimensional convection-diffusion equation. Adv. Differ. Equ. 2018, 234, 234. [Google Scholar] [CrossRef]
  5. Isenberg, J.; Gutfinger, C. Heat transfer to a draining film. Int. J. Heat Mass Transf. 1973, 16, 505–512. [Google Scholar] [CrossRef]
  6. Brkié, D.; Stajié, Z. Excel VBA-based user defined functions for highly precise Colebrook’s pipe flow friction approximations: A comparative overview. Facta Univ. Ser. Mech. Eng. 2021, 19, 253–269. [Google Scholar] [CrossRef]
  7. Feijó, B.C.; Pavlovic, A.; Rocha, L.A.O.; Isoldi, L.A.; Lorente, S.; dos Santos, E.D. Geometrical investigation of microchannel with two trapezoidal blocks subjected to laminar convective flows with and without boiling. Rep. Mech. Eng. 2022, 3, 20–36. [Google Scholar] [CrossRef]
  8. Noguez, M.A.; Botello, S.; Herrera, R.; Esqueda, H. Discretization of the 2D convection-diffusion equation using discrete exterior calculus. J. Appl. Comput. Mech. 2020, 6, 1348–1363. [Google Scholar]
  9. Codina, R. Comparison of some finite element methods for solving the diffusion convection reaction equation. Comput. Methods Appl. Mech. Eng. 1998, 156, 185–210. [Google Scholar] [CrossRef]
  10. Sinha, R.K.; Geiser, J. Error estimates for finite volume element methods for convection diffusion reaction equations. Appl. Numer. Math. 2007, 57, 59–72. [Google Scholar] [CrossRef]
  11. John, V.; Schmeyer, E. Finite element methods for time dependent convection diffusion reaction equations with small diffusion. Comput. Methods Appl. Mech. Eng. 2008, 198, 475–494. [Google Scholar] [CrossRef]
  12. De Frutos, J.; Garcĺa-Archilla, B.; John, V.; Novo, J. An adaptive SUPG method for evolutionary convection-diffusion equations. Comput. Methods Appl. Mech. Eng. 2014, 273, 219–237. [Google Scholar] [CrossRef]
  13. Sun, T. A second order characteristic mixed finite element method for convection diffusion reaction equations. J. Appl. Math. Phys. 2017, 5, 1301–1319. [Google Scholar] [CrossRef] [Green Version]
  14. Qian, L.; Cai, H.; Guo, R.; Feng, X. The characteristic variational multiscale method for convection-dominated convection-diffusion-reaction problems. Int. J. Heat Mass Transf. 2014, 72, 461–469. [Google Scholar] [CrossRef]
  15. Nie, Q.; Wan, F.; Zhang, Y.T.; Liu, X.F. Compact integration factor methods in high spatial dimensions. J. Comput. Phys. 2008, 227, 5238–5255. [Google Scholar] [CrossRef] [Green Version]
  16. Zhao, S.; Ovadia, J.; Liu, X.F.; Zhang, Y.T.; Nie, Q. Operator splitting implicit integration factor methods for stiff reaction-diffusion-advection systems. J. Comput. Phys. 2011, 230, 5996–6009. [Google Scholar] [CrossRef] [Green Version]
  17. Jiang, T.; Zhang, Y.T. Krylov single-step implicit integration factor WENO methods for advection diffusion reaction equations. J. Comput. Phys. 2016, 311, 22–44. [Google Scholar] [CrossRef]
  18. Wei, T.; Xu, M. An integral equation approach to the unsteady convection-diffusion equations. Appl. Math. Comput. 2016, 274, 55–64. [Google Scholar] [CrossRef]
  19. Lin, J.; Reutskiy, S.Y. An accurate meshless formulation for the simulation of linear and fully nonlinear advection diffusion reaction problems. Adv. Eng. Softw. 2018, 126, 127–146. [Google Scholar] [CrossRef]
  20. Kaya, A. Finite difference approximations of multidimensional unsteady convection diffusion reaction equations. J. Comput. Phys. 2015, 285, 331–349. [Google Scholar] [CrossRef] [Green Version]
  21. Hsieh, P.W.; Yang, S.Y.; You, C.S. A high-accuracy finite difference scheme for solving reaction-convection-diffusion problems with a small diffusivity. Adv. Appl. Math. Mech. 2014, 6, 637–662. [Google Scholar] [CrossRef]
  22. Tong, F.H.; Feng, X.L.; Li, Z.L. Fourth order compact FD methods for convection diffusion equations with variable coefficients. Appl. Math. Lett. 2021, 121, 107413. [Google Scholar] [CrossRef]
  23. Jha, N.; Singh, B. Exponential basis and exponential expanding grids third (fourth)-order compact schemes for nonlinear three-dimensional convection-diffusion-reaction equation. Adv. Differ. Equ. 2019, 339, 1–27. [Google Scholar] [CrossRef] [Green Version]
  24. Ma, T.; Ge, Y. High-order blended compact difference schemes for the 3D elliptic partial equation with mixed derivatives and variable coefficients. Adv. Differ. Equ. 2020, 2020, 525. [Google Scholar] [CrossRef]
  25. Biazar, J.; Mehrlatifan, M.B. A compact finite difference scheme for reaction convection diffusion equation. Chiang Mai J. Sci. 2018, 45, 1559–1568. [Google Scholar]
  26. Liao, W. A compact high-order finite difference method for unsteady convection diffusion equation. Int. J. Comput. Methods Eng. Sci. Mech. 2012, 13, 135–145. [Google Scholar] [CrossRef]
  27. Zhu, X.; Rui, H. High-order compact difference scheme of 1D nonlinear degenerate convection-reaction-diffusion equation with adaptive algorithm. Numer. Heat Transf. Part B Fundam. 2019, 75, 43–66. [Google Scholar] [CrossRef]
  28. Karaa, S. An accurate LOD scheme for two-dimensional parabolic problems. Appl. Math. Comput. 2005, 170, 886–894. [Google Scholar] [CrossRef]
  29. Courant, R.; Isaacson, E.; Rees, M. On the solution of nonlinear hyperbolic differential equations by finite differences. Commun. Pure Appl. Math. 1952, 5, 243–255. [Google Scholar] [CrossRef]
  30. Noye, B.J.; Tan, H.H. A third-order semi-implicit finite difference method for solving the one-dimensional convection-diffusion equation. Int. J. Numer. Methods Eng. 1988, 26, 1615–1629. [Google Scholar] [CrossRef]
  31. Kalita, J.C.; Dalal, D.C.; Dass, A.K. A class of higher order compact scheme for the unsteady two-dimensional convection-diffusion equation with variable convection coefficients. Int. J. Numer. Methods Fluids 2002, 38, 1111–1131. [Google Scholar] [CrossRef]
  32. Karaa, S.; Zhang, J. High order ADI method for solving unsteady convection diffusion problems. J. Comput. Phys. 2004, 198, 1–9. [Google Scholar] [CrossRef]
  33. Tian, Z.F.; Ge, Y. A fourth order compact ADI method for solving two dimensional unsteady convection diffusion problems. J. Comput. Appl. Math. 2007, 198, 268–286. [Google Scholar] [CrossRef] [Green Version]
  34. Tian, Z.F. A rational high-order compact ADI method for unsteady convection diffusion equations. Comput. Phys. Commun. 2011, 182, 649–662. [Google Scholar] [CrossRef]
  35. Sun, H.W.; Li, L. A CCD-ADI method for unsteady convection-diffusion equations. Comput. Phys. Commun. 2014, 185, 790–797. [Google Scholar] [CrossRef]
  36. Karaa, S. A high-order compact ADI method for solving three-dimensional unsteady convection-diffusion problems. Numer. Methods Partial Differ. Equ. 2006, 22, 983–993. [Google Scholar] [CrossRef]
  37. Cao, F.; Ge, Y. A high-order compact ADI scheme for the 3D unsteady convection diffusion equation. In Proceedings of the 2011 International Conference on Computational and Information Sciences, Chengdu, China, 21–23 October 2011; pp. 1087–1090. [Google Scholar]
  38. Ge, Y.; Tian, Z.F.; Zhang, J. An exponential high order compact ADI method for 3D unsteady convection-diffusion problems. Numer. Methods Partial Differ. Equ. 2013, 29, 186–205. [Google Scholar] [CrossRef]
  39. Ge, Y.; Zhao, F.; Wei, J. A high order compact ADI method for solving the 3D unsteady convection diffusion problems. Appl. Comput. Math. 2018, 7, 1–10. [Google Scholar] [CrossRef]
  40. Lele, S.K. Compact finite difference schemes with spectral-like resolution. J. Comput. Phys. 1992, 103, 16–42. [Google Scholar] [CrossRef]
  41. Wang, T.; Liu, T. A consistent fourth-order compact finite difference scheme for solving vorticity-stream function form of incompressible Navier-Stokes equations. Numer. Math. Theory Methods Appl. 2019, 12, 312–330. [Google Scholar]
  42. Yang, X.; Ge, Y.; Zhang, L. A class of high-order compact difference schemes for solving the Burgers’ equations. Appl. Math. Comput. 2019, 358, 394–417. [Google Scholar] [CrossRef]
  43. Yang, X.; Ge, Y.; Lan, B. A class of compact finite difference schemes for solving the 2D and 3D Burgers’ equations. Math. Comput. Simul. 2021, 185, 510–534. [Google Scholar] [CrossRef]
  44. Zhanlav, T.; Chuluunbaatar, O.; Ulziibayar, V. Higher-order accurate numerical solution of unsteady Burgers’ equation. Appl. Math. Comput. 2015, 250, 701–707. [Google Scholar] [CrossRef]
  45. Hammad, D.A.; El-Azab, M.S. 2N order compact finite difference scheme with collocation method for solving the generalized Burger’s-Huxley and Burger’s-Fisher equations. Appl. Math. Comput. 2015, 258, 296–311. [Google Scholar] [CrossRef]
  46. Chertock, A.; Epshteyn, Y.; Hu, H.; Kurganov, A. High-order positivity-preserving hybrid finite-volume-finite-difference methods for chemotaxis systems. Adv. Comput. Math. 2018, 44, 327–350. [Google Scholar] [CrossRef]
  47. Chertock, A.; Kurganov, A.; Ricchiuto, M.; Wu, T. Adaptive moving mesh upwind scheme for the two-species chemotaxis model. Comput. Math. Appl. Math. 2019, 77, 3172–3185. [Google Scholar] [CrossRef] [Green Version]
Figure 1. The absolute error when h = 0.05 , τ = 0.001 and α = 0.05 for Problem 1. Top pictures: T = 1 ; under pictures: T = 2 ; left pictures: present scheme; right pictures: HOC scheme [42].
Figure 1. The absolute error when h = 0.05 , τ = 0.001 and α = 0.05 for Problem 1. Top pictures: T = 1 ; under pictures: T = 2 ; left pictures: present scheme; right pictures: HOC scheme [42].
Axioms 11 00111 g001
Figure 2. The numerical solution when h = 0.05 , τ = 0.001 and α = 0.05 for problem 1. left: T = 1 ; middle: T = 2 ; right: T = 4 .
Figure 2. The numerical solution when h = 0.05 , τ = 0.001 and α = 0.05 for problem 1. left: T = 1 ; middle: T = 2 ; right: T = 4 .
Axioms 11 00111 g002
Figure 3. Numerical solutions of the present HOC scheme for Problem 2 when h = 1 120 , τ = 0.001 , (a) T = 0.3 ; (b) T = 0.6 ; (c) T = 0.9 ; (d) T = 1.2 .
Figure 3. Numerical solutions of the present HOC scheme for Problem 2 when h = 1 120 , τ = 0.001 , (a) T = 0.3 ; (b) T = 0.6 ; (c) T = 0.9 ; (d) T = 1.2 .
Axioms 11 00111 g003
Table 1. The L error and convergence rate when τ = h 2 15 α , T = 1 15 for Problem 1.
Table 1. The L error and convergence rate when τ = h 2 15 α , T = 1 15 for Problem 1.
4-Order [44]6-Order [44]Ref. [42]Present Scheme
h L Rate L Rate L Rate L Rate
α = 0.1 1/204.099 (−3) 4.227 (−4) 1.209 (−5) 7.599 (−6)
1/404.031 (−4)3.351.333 (−5)4.997.552 (−7)3.916.056 (−7)3.65
1/803.156 (−5)3.672.948 (−7)5.504.726 (−8)4.004.002 (−8)3.92
1/1602.207 (−6)3.845.479 (−9)5.752.954 (−9)4.002.537 (−9)3.98
α = 0.01 1/40 2.954 (−2) 3.067 (−2)
1/801.732 (−3)4.091.673 (−3)4.20
1/801.921 (−1)2.937 (−2)1.032 (−4)4.071.019 (−4)4.04
1/3201.854 (−2)3.649.644 (−4)4.936.370 (−6)4.026.349 (−6)4.00
1/6401.468 (−3)3.372.236 (−5)5.433.987 (−7)4.003.972 (−7)4.00
Table 2. The absolute error when N = 7 , τ = 0.01 , α = 1 for Problem 1.
Table 2. The absolute error when N = 7 , τ = 0.01 , α = 1 for Problem 1.
xy T = 15 T = 20
Ref. [42]Ref. [45]Present SchemeRef. [42]Ref. [45]Present Scheme
1/71/72.513 (−11)1.696 (−5)9.053 (−12)2.083 (−12)1.395 (−6)3.380 (−13)
3/7 5.018 (−11)3.241 (−5)2.104 (−11)4.161 (−12)2.667 (−6)1.616 (−12)
5/7 5.041 (−11)3.037 (−5)1.926 (−11)4.083 (−12)2.499 (−6)1.537 (−12)
1/73/75.072 (−11)3.241 (−5)2.104 (−11)4.161 (−12)2.667 (−6)1.616 (−12)
3/7 1.076 (−10)6.488 (−5)4.623 (−11)8.925 (−12)5.340 (−6)3.774 (−12)
5/7 1.059 (−10)5.937 (−5)4.147 (−11)8.795 (−12)4.883 (−6)3.303 (−12)
1/75/75.041 (−11)3.037 (−5)1.926 (−11)4.183 (−12)2.499 (−6)1.537 (−12)
3/7 1.059 (−10)5.933 (−5)4.147 (−11)8.795 (−12)4.883 (−6)3.303 (−12)
5/7 1.041 (−10)5.511 (−5)3.717 (−11)8.722 (−12)4.573 (−6)2.930 (−12)
Table 3. The L error, L 2 error and convergence rate when a = d = s = 1 , b = 100 for Problem 3.
Table 3. The L error, L 2 error and convergence rate when a = d = s = 1 , b = 100 for Problem 3.
huv
L Rate L 2 Rate L Rate L 2 Rate
1/202.096 (−2) 7.027 (−2) 1.240 (−1) 4.345 (−1)
1/407.634 (−5)8.102.665 (−4)8.047.558 (−3)4.042.638 (−2)4.04
1/804.827 (−6)3.981.687 (−5)3.984.779 (−4)3.981.670 (−3)3.98
1/1603.018 (−7)4.001.054 (−6)4.002.987 (−5)4.001.043 (−5)4.00
Table 4. The L error, L 2 error and convergence rate when a = 1 , b = 0.01 , s = 0.1 , d = 0.001 for Problem 3.
Table 4. The L error, L 2 error and convergence rate when a = 1 , b = 0.01 , s = 0.1 , d = 0.001 for Problem 3.
huv
L Rate L 2 Rate L Rate L 2 Rate
1/201.728 (−3) 6.564 (−3) 7.351 (−5) 2.862 (−4)
1/401.116 (−4)3.954.283 (−4)3.944.883 (−6)3.911.866 (−5)4.01
1/806.837 (−6)4.032.167 (−5)4.302.999 (−7)4.031.163 (−6)4.00
1/1604.220 (−7)4.021.673 (−6)3.701.860 (−8)4.017.293 (−8)4.00
Table 5. The L error, L 2 error and convergence rate when a = s = 0.01 , b = 0.1 , d = 10 for Problem 3.
Table 5. The L error, L 2 error and convergence rate when a = s = 0.01 , b = 0.1 , d = 10 for Problem 3.
huv
L Rate L 2 Rate L Rate L 2 Rate
1/203.198 (−3) 9.985 (−3) 1.484 (−4) 4.633 (−4)
1/401.879 (−4)4.095.871 (−4)4.098.726 (−6)4.092.727 (−5)4.09
1/801.213 (−5)3.953.788 (−5)3.955.629 (−7)3.951.758 (−6)3.96
1/1607.571 (−7)4.002.366 (−6)4.003.515 (−8)4.001.098 (−7)4.00
Table 6. The L error, L 2 error and convergence rate when τ = h 2 , T = 0.25 for Problem 4.
Table 6. The L error, L 2 error and convergence rate when τ = h 2 , T = 0.25 for Problem 4.
hC-N SchemeBTCS SchemePresent Scheme
L Rate L 2 Rate L Rate L 2 Rate L Rate L 2 Rate
1/81.58 (−2) 5.55 (−3) 1.62 (−2) 5.66 (−3) 2.83 (−4) 1.70 (−4)
1/163.94 (−3)2.001.38 (−3)2.014.02 (−3)2.011.41 (−3)2.018.48 (−6)5.064.10 (−6)5.37
1/329.83 (−4)2.003.44 (−4)2.001.00 (−3)2.013.52 (−4)2.004.30 (−7)4.301.76 (−7)4.54
1/642.46 (−4)2.008.61 (−5)2.002.51 (−4)1.998.79 (−5)2.002.52 (−8)4.099.75 (−9)4.17
Table 7. The L error, L 2 error and convergence rate when h = 0.03125 , T = 0.5 for Problem 4.
Table 7. The L error, L 2 error and convergence rate when h = 0.03125 , T = 0.5 for Problem 4.
τ L Rate L 2 Rate
0.18.220 (−4) 2.528 (−4)
0.052.017 (−4)2.03 6.189 (−5)2.03
0.0255.056 (−5)2.00 1.550 (−5)2.00
0.01251.292 (−5)1.97 3.920 (−6)1.98
0.006253.519 (−6)1.88 1.039 (−6)1.92
Table 8. The L error and L 2 error when h = 1 32 , T = 1 with different mesh ratio λ = τ h 2 for Problem 4.
Table 8. The L error and L 2 error when h = 1 32 , T = 1 with different mesh ratio λ = τ h 2 for Problem 4.
λ Steps in the Time DirectionC-N SchemeBTCS SchemePresent Scheme
L L 2 L L 2 L L 2
0.812802.110 (−3)7.362 (−4)2.144 (−3)7.458 (−4)7.827 (−7)3.002 (−7)
1.66402.110 (−3)7.362 (−4)2.178 (−3)7.608 (−4)7.906 (−7)2.496 (−7)
3.23202.110 (−3)7.364 (−4)2.246 (−3)7.854 (−4)1.381 (−6)4.394 (−7)
6.41602.112 (−3)7.371 (−4)2.383 (−3)8.345 (−4)6.839 (−6)2.142 (−6)
Table 9. The L error and convergence rate when τ = h 2 , α = 0.1 , T = 0.5 for Problem 5.
Table 9. The L error and convergence rate when τ = h 2 , α = 0.1 , T = 0.5 for Problem 5.
h DHOC [43]Present Scheme
L L 2 L L 2
1/89.079 (−5) 5.848 (−5)
1/162.555 (−6)5.158.617 (−7)6.08
1/322.267 (−8)6.824.164 (−8)4.37
Table 10. The L error when τ = 0.001 , T = 0.1 with different α for Problem 5.
Table 10. The L error when τ = 0.001 , T = 0.1 with different α for Problem 5.
α h = 0.1 h = 0.0625
DHOC [43]Present SchemeDHOC [43]Present Scheme
10 1 4.764 (−4)6.692 (−4)7.195 (−5)1.070 (−4)
10 2 1.264 (−4)1.195 (−4)3.955 (−5)2.632 (−5)
10 3 1.914 (−6)1.875 (−6)6.366 (−7)4.645 (−7)
10 4 1.996 (−8)1.963 (−8)6.670 (−9)4.937 (−9)
10 5 2.004 (−10)1.972 (−10)6.701 (−11)4.967 (−11)
10 6 2.005 (−12)1.973 (−12)6.704 (−13)4.970 (−13)
Table 11. The L error and L 2 error when h = 1 16 , α = 0.1 , T = 2 for different mesh ratio λ = τ h 2 for Problem 5.
Table 11. The L error and L 2 error when h = 1 16 , α = 0.1 , T = 2 for different mesh ratio λ = τ h 2 for Problem 5.
λ DHOC [43]Present Scheme
L L 2 L L 2
14.782 (−10)1.400 (−10)7.213 (−10)2.469 (−10)
25.190 (−10)1.519 (−10)7.231 (−10)2.477 (−10)
44.547 (−7)1.143 (−7)7.255 (−10)2.490 (−10)
61.212 (+0)2.945 (−1)7.468 (−10)2.567 (−10)
81.093 (+1)2.322 (+0)7.326 (−10)2.529 (−10)
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Wei, J.; Ge, Y.; Wang, Y. High-Order Compact Difference Method for Solving Two- and Three-Dimensional Unsteady Convection Diffusion Reaction Equations. Axioms 2022, 11, 111. https://doi.org/10.3390/axioms11030111

AMA Style

Wei J, Ge Y, Wang Y. High-Order Compact Difference Method for Solving Two- and Three-Dimensional Unsteady Convection Diffusion Reaction Equations. Axioms. 2022; 11(3):111. https://doi.org/10.3390/axioms11030111

Chicago/Turabian Style

Wei, Jianying, Yongbin Ge, and Yan Wang. 2022. "High-Order Compact Difference Method for Solving Two- and Three-Dimensional Unsteady Convection Diffusion Reaction Equations" Axioms 11, no. 3: 111. https://doi.org/10.3390/axioms11030111

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop