Next Article in Journal
Fractional Cumulative Residual Mean Relative Entropy and Its Application in an Aeroengine Gas Path System
Previous Article in Journal
An Application of the Distributed-Order Time- and Space-Fractional Diffusion-Wave Equation for Studying Anomalous Transport in Comb Structures
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Linearized Crank–Nicolson Scheme for the Two-Dimensional Nonlinear Riesz Space-Fractional Convection–Diffusion Equation

1
School of Mathematics and Statistics, HNP-LAMA, Central South University, Changsha 410083, China
2
Department of Mathematics and Computer, College of science, Ibb University, Ibb 70279, Yemen
3
School of Physics and Microelectronics, Hunan University, Changsha 410082, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2023, 7(3), 240; https://doi.org/10.3390/fractalfract7030240
Submission received: 21 December 2022 / Revised: 6 February 2023 / Accepted: 1 March 2023 / Published: 7 March 2023

Abstract

:
In this paper, we study the nonlinear Riesz space-fractional convection–diffusion equation over a finite domain in two dimensions with a reaction term. The Crank–Nicolson difference method for the temporal and the weighted–shifted Grünwald–Letnikov difference method for the spatial discretization are proposed to achieve a second-order convergence in time and space. The D’Yakonov alternating–direction implicit technique, which is effective in two–dimensional problems, is applied to find the solution alternatively and reduce the computational cost. The unconditional stability and convergence analyses are proved theoretically. Numerical experiments with their known exact solutions are conducted to illustrate our theoretical investigation. The numerical results perfectly confirm the effectiveness and computational accuracy of the proposed method.

1. Introduction

Recently, fractional partial differential equations (FPDEs) were used to describe and model the dynamic transport of particles in porous media. Meanwhile, fractional ordinary and partial differential equations (FODEs and FPDEs) are increasingly applied in numerous fields of engineering and science, such as biology, physics, finance, chemistry, colored noise, control theory, signal processing, and so on (see the details in [1,2,3,4,5,6,7,8]). Most of the problems described by FPDEs cannot be solved analytically, so numerical approximations are becoming more important and suitable to solve these problems, such as finite volume methods [9,10], finite element methods [11,12], finite difference methods [13,14,15,16,17], spectral methods [18,19], and Galerkin methods [20,21]. The fractional space derivatives defined in the dynamical transport phenomena are commonly utilized to model the convection–diffusion equation because the particle flow distributes more rapidly than in the classical models. Moreover, the Riesz space–fractional convection–diffusion equations (RSFCDEs) have attracted increasing interest and are applied to model a wide range of real-life phenomena. As a result, the development of efficient and robust numerical techniques for RSFCDEs is an important task. Various one-dimensional RSFCDEs are solved with different numerical methods, see [15,22,23,24,25].
As we know, two–dimensional space–fractional convection–diffusion equations (2DSFCDEs) with the complexity of mathematical modeling are more challenging to find the numerical solution; therefore, the development of a simple and efficient numerical method requires more effort. Borhanifar et al. [26] combined the centered difference method with the alternating-direction implicit (ADI) finite difference scheme and derived a mixed difference approach to treat the 2DSFCD problem. Then, the convergence of the provided numerical scheme was discussed using the Lax theorem and the Lax equivalence theorem. The 2DSFCDE was solved using the ADI scheme in Chen and Deng [27] and the authors proved that the proposed finite difference method is unconditionally von Neumann stable and convergent with second order in both the time and space directions. The weighted and shifted Lubich difference operators were first introduced by Chen and Deng in [28] and then used for solving fractional diffusion equations in one- and two-dimensional space with variable coefficients. Then, the global convergence of the truncation error and unconditional stability were theoretically justified and numerically supported. A Müntz spectral technique was constructed in Hou et al. [29] for solving a class of 2DRSFCD problems and the error estimates were developed. An implicit difference method was presented in Zhou et al. [30] to find the approximation solution for the class of a two-dimensional time–space FCDE. Bi and Jiang [31] applied the finite volume element scheme with the Crank–Nicolson difference approximation to analyze the approximate solution of the 2DRSFCDE and presented their error analysis. To verify the validity of their theoretical analysis, they investigated the properties of Toplitz matrices and solved the numerical examples using the FAST–BICGSTAB algorithm.
Due to the importance of the nonlinear space-fractional convection–diffusion equations in real-world applications, some authors have developed various numerical methods to obtain the appropriate solutions. Liu et al. [32] applied the ADI approach to obtain an approximation of the solution to a two–dimensional RSFDE with homogeneous Dirichlet boundary conditions and a nonlinear source term. This numerical method was then used to simulate the 2D Riesz space–fractional Fitzhugh–Nagumo model. Zeng et al. [33] used the ADI Galerkin–Legendre spectral approach to simulate the 2DRSFDE with a nonlinear source term and extended it to treat the fractional FitzHugh–Nagumo model. Zhu et al. [34] developed the finite element algorithm that analyzes the approximate solution with the nonlinear 2D space Fisher equation such that the space derivative is based on the fractional Riesz derivative. Yang [35] investigated the numerical approximation for the RSFDE in two and three dimensions with delay and the nonlinear reaction source term using the ADI method. Then, the author developed the convergence order for the provided scheme using the Richardson extrapolation technique.
We study the following two-dimensional nonlinear Riesz space-fractional convection–diffusion equation (2DNRSFCDE):
u ( p , q , t ) t = a p u ( p , q , t ) p a q u ( p , q , t ) q + b p η u ( p , q , t ) | p | η + b q σ u ( p , q , t ) | q | σ + f ( u , p , q , t ) , ( p , q , t ) Ω × [ 0 , T ] , u ( p , q , 0 ) = g ( p , q ) , ( p , q ) Ω , u ( p l , q , t ) = 0 , u ( p r , q , t ) = 0 , ( q , t ) [ q l , q r ] × [ 0 , T ] , u ( p , q l , t ) = 0 , u ( p , q r , t ) = 0 , ( p , t ) [ p l , p r ] × [ 0 , T ] ,
where u ( p , q , t ) is the contaminant concentration, 1 < η , σ 2 , Ω = [ p l , p r ] × [ q l , q r ] , a p , a q 0 , and b p , b q > 0 , represent velocity parameters and positive diffusion coefficients, respectively. f is a nonlinear function which satisfies the Lipschitz condition
f ( u 1 , p , q , t ) f ( u 2 , p , q , t ) K | u 1 u 2 | u 1 , u 2 R ,
where K is a Lipschitz constant.
Two–dimensional fractional PDEs are very useful to model the real-world phenomena. Therefore, the governing of a numerical solution with accurate and consistent numerical methods is necessary to make the physical meaning clear for understanding. A two–dimensional two–sided space–fractional convection–diffusion equation without a nonlinear reaction term is solved in [27] by applying the second–order accuracy alternative direction implicit (in both space and time) finite difference method. The numerical solution of the two-dimensional Riesz space–fractional nonlinear reaction–diffusion equation was considered by [33] using the Crank–Nicolson ADI Galerkin–Legendre spectral method. The proposed method is conditionally stable with the convergence of second order in time and an optimal error estimate in space. The numerical approximate solution of the nonlinear space-fractional reaction–diffusion equation was constructed by [32]. They used the alternative direction implicit finite difference method combined with the shifted Grünwald–Letnikov difference scheme to produce the first order in both space and time. In this paper, the theoretical analysis and numerical computation of the two–dimensional nonlinear Risez space–fractional convection–diffusion equation on a finite domain are considered. We propose a second order in time Crank–Nicolson ADI difference method combined with a second order in space weighted–shifted Grünwald–Letnikov difference (WSGD) technique to find the numerical solution of the problem in two dimensions which improve the spatial and temporal accuracy with the presence of a nonlinear term. Because using a fixed-point iteration method to obtain an approximation solution of a nonlinear system of equations for each of the time steps requires a lot of computing power, we have linearized our problem. The Lipschitz condition is satisfied by the nonlinear function, and the theoretical examination of the stability and convergence analysis demonstrates that the CNADI–WSGD method is unconditionally stable and convergent in time and space with second-order accuracy.
The remaining sections of the paper are organized as follows: Section 2 presents some basic definitions and preliminary lemmas. The CNADI–WSGD scheme is proposed and formulated in Section 3 for the two–dimensional nonlinear Riesz space–fractional convection–diffusion problem (1). The stability and consistency analysis of the problem is discussed theoretically in Section 4. In Section 5, we perform the numerical experiments with exact solutions that confirm the theoretical analysis of the implemented problem. In Section 6, a conclusion is drawn based on the obtained results.

2. Preliminaries

We give in this section important key concepts, lemmas, and notations that will be useful as the work develops.
Definition 1 
([36]). The fractional derivatives of Riesz with orders η , σ ( m 1 < η , σ m ) of the function u ( p , q , t ) in a finite domain [ p l , p r ] × [ q l , q r ] are defined as
η u ( p , q , t ) | p | η = κ η { p l D p η u ( p , q , t ) + p D p r η u ( p , q , t ) } ,
σ u ( p , q , t ) | p | σ = κ σ { q l D q σ u ( p , q , t ) + q D q r σ u ( p , q , t ) } ,
where κ η = 1 2 c o s π η 2 , κ σ = 1 2 c o s π σ 2 , η , σ 1 .
Definition 2 
([37]). For a smooth function u ( p , q , t ) , the left–sided and right–sided Riemann–Liouville (RL) space-fractional derivatives with orders η , σ ( m 1 < η , σ m ) on the finite domain [ p l , p r ] × [ q l , q r ] are defined, respectively, as
p l D p η u ( p , q , t ) = 1 Γ ( m η ) d m d p m p l p u ( ϑ , q , t ) ( u ϑ ) η m + 1 d ϑ ,
p D p r η u ( p , q , t ) = ( 1 ) m Γ ( m η ) d m d p m p p r u ( ϑ , q , t ) ( ϑ u ) η m + 1 d ϑ ,
in which Γ ( . ) denotes the Euler gamma function.
The left–sided and right-sided Riemann–Liouville fractional derivatives in q–direction can be defined similarly.
Definition 3 
([38]). The Grünwald–Letnikov (GL) formula for the left-sided and right-sided fractional derivatives on the finite domain [ p l , p r ] × [ q l , q r ] are, respectively, given by
p l D p η u ( p , q ) = lim h p 0 + 1 h p η θ = 0 ( p p l ) h ( 1 ) θ η θ u ( p θ h p , q ) ,
p D p r η u ( p , q ) = lim h p 0 + 1 h p η θ = 0 ( p r p ) h ( 1 ) θ η θ u ( p + θ h p , q ) .
Similarly, the (GL) formula for the left-sided and right-sided fractional derivatives with respect to q -direction on the finite interval [ q l , q r ] is defined as
q l D q σ u ( p , q ) = lim h q 0 + 1 h q σ θ = 0 ( q q l ) h ( 1 ) θ σ θ u ( p , q θ h q ) ,
q D q r σ u ( p , q ) = lim h q 0 + 1 h q σ θ = 0 ( q r q ) h ( 1 ) θ σ θ u ( p , q + θ h q ) .
If u ( p , q ) is defined on the finite interval [ p l , p r ] × [ q l , q r ] and u ( p l , q ) = u ( p r , q ) = u ( p , q l ) = u ( p , q r ) = 0 , then the function u ( p , q ) can be zero-extended for p < p l , q < q l or p > p r , q > q r . Let us suppose that the function u ( p , q ) is m 1 -continuously differentiable in the intervals [ p l , p r ] , [ q l , q r ] and that u ( m ) ( p , q ) is integrable in [ p l , p r ] , [ q l , q r ] . Then, for every η , σ ( 0 m 1 η , σ m ) , the RL fractional derivative exists and coincides with the GL fractional derivative [39]. The GL and the RL derivatives are equivalent for a sufficiently smooth function, as showed in [40]. The GL approximation is frequently applied to numerically estimate the RL derivative and was the first approach to arise for approximating fractional derivatives. In particular, the shifted Grünwald difference operator is given as [41]
A + p , r η u ( p , q ) = 1 h p η θ = 0 g θ ( η ) u ( p ( θ r ) h p , q ) , B p , r η u ( p , q ) = 1 h p η θ = 0 g θ ( η ) u ( p + ( θ r ) h p , q ) ,
A + q , r σ u ( p , q ) = 1 h q σ θ = 0 g θ ( σ ) u ( p , q ( θ r ) h q ) , B q , r σ u ( p , q ) = 1 h q σ θ = 0 g θ ( σ ) u ( p , q + ( θ r ) h q ) ,
approximating both the left and right RL fractional derivatives which give first–order convergence, i.e.,
A + p , r η u ( p , q ) = D p η u ( p , q ) + O ( h p ) , B p , r η u ( p , q ) = p D + η u ( p , q ) + O ( h p ) ,
A + q , r σ u ( p , q ) = D q σ u ( p , q ) + O ( h q ) , B q , r σ u ( p , q ) = q D + σ u ( p , q ) + O ( h q ) ,
where r is a positive integer and g θ ( η ) = ( 1 ) θ η θ are the power series coefficients for the generating function ( 1 z ) η ,
( 1 z ) η = θ = 0 ( 1 ) θ η θ z θ = θ = 0 g θ ( η ) z θ ,
for all | z | 1 , and they can be derived successively:
g 0 ( η ) = 1 , g θ ( η ) = 1 η + 1 θ g θ 1 ( η ) , θ = 1 , 2 , .
Lemma 1 
([42]). For the fractional order 1 < η 2 , the coefficients in Equation (4) satisfy the properties shown below.
g 0 ( η ) = 1 , g 1 ( η ) = η < 0 , 1 g 2 ( η ) g 3 ( η ) 0 , θ = 0 g θ ( η ) = 0 , θ = 0 N p g θ ( η ) < 0 , N p 1 .
The left and right RL fractional derivatives for the continuous function u ( p , q ) at every point p ν , q υ , ν = 1 , 2 , . . . , N p , υ = 1 , 2 , . . . , N q on a finite interval [ p l , p r ] , [ q l , q r ] , which is using the weighted and shifted GL formula, can be written as follows:
p l D p η u ( p ν , q υ ) = 1 h p η θ = 0 ν + 1 ω θ η u ( ν θ + 1 , υ ) + O ( h p 2 ) , p D p r η u ( p ν , q υ ) = 1 h p η θ = 0 N p ν + 1 ω θ η u ( ν + θ 1 , υ ) + O ( h p 2 ) ,
in which
ω 0 ( η ) = η 2 g 0 ( η ) , ω θ ( η ) = η 2 g θ ( η ) + 2 η 2 g θ 1 ( η ) for θ 1 .
The definition of the weighted and shifted GL formula for the q -direction is the same as Equation (10).
Lemma 2 
([41]). For the fractional order 1 < η 2 , the coefficients in (10) satisfy the following properties:
ω 0 ( η ) = η 2 > 0 , ω 1 ( η ) = 2 η η 2 2 < 0 , ω 2 ( η ) = η ( η 2 + η 4 ) 4 , 1 ω 0 ( η ) ω 3 ( η ) ω 4 ( η ) 0 , θ = 0 ω θ ( η ) = 0 , θ = 0 N p ω θ ( η ) < 0 , N p 2 .

3. CNADI-WSGD Method

In this part, we show an approximate numerical solution to problem (1). Let Ω = [ p l , p r ] × [ q l , q r ] be a finite domain, and let h p = ( p r p l ) / N p with p ν = p l + ν h p for ν = 0 , 1 , 2 , . . . , N p , h q = ( q r q l ) / N q with q υ = q l + υ h q for υ = 0 , 1 , 2 , . . . , N q are the spatial grid size in the x–direction and the spatial grid size in the y–direction, respectively. Let τ = T / N t be the time step with partition t n = n τ , for n = 0 , 1 , 2 , . . . , N t , where N p , N q , N t are nonnegative integers. The Crank–Nicolson scheme and the WSGD formula are used for the temporal and spatial discretizations, respectively. The convection term in (1) is also approximated by the central finite difference method. Define u ν , υ n as the numerical approximation to u ( p ν , q υ , t n ) , t n + 1 2 = ( t n + t n + 1 ) 2 , f ( u n + 1 2 ) = f ( u ν , υ n + 1 2 , p ν , q υ , t n + 1 2 ) . For the uniform time step τ and the space steps h p , h q , the resulting discretization of (1) can be formulated as
u ν , υ n + 1 u ν , υ n τ = a p 2 u ν + 1 , υ n + 1 u ν 1 , υ n + 1 + u ν + 1 , υ n u ν 1 , υ n 2 h p + a q 2 u ν , υ + 1 n + 1 u ν , υ 1 n + 1 + u ν , υ + 1 n u ν , υ 1 n 2 h q κ η b p 2 h p η θ = 0 ν + 1 ω θ ( η ) u ν θ + 1 , υ n + 1 + θ = 0 N p ν + 1 ω θ ( η ) u ν + θ 1 , υ n + 1 + θ = 0 ν + 1 ω θ ( η ) u ν θ + 1 , υ n + θ = 0 N p ν + 1 ω θ ( η ) u ν + θ 1 , υ n κ σ b q 2 h q σ θ = 0 υ + 1 ω θ ( σ ) u ν , υ θ + 1 n + 1 + θ = 0 N q υ + 1 ω θ ( σ ) u ν , υ + θ 1 n + 1 + θ = 0 υ + 1 ω θ ( σ ) u ν , υ θ + 1 n + θ = 0 N q υ + 1 ω θ ( σ ) u ν , υ + θ 1 n + f ( u ν , υ n + 1 2 , p ν , q υ , t n + 1 2 ) ,
where κ η = 1 2 c o s ( π η / 2 ) , κ σ = 1 2 c o s ( π σ / 2 ) . Thus, the weighted–shifted Grünwald difference method with Crank–Nicolson finite difference for problem (1) is expressed as
u ν , υ n + 1 + a ¯ p 2 u ν + 1 , υ n + 1 u ν 1 , υ n + 1 + a ¯ q 2 u ν , υ + 1 n + 1 u ν , υ 1 n + 1 + b ¯ p 2 θ = 0 ν + 1 ω θ ( η ) u ν θ + 1 , υ n + 1 + θ = 0 N p ν + 1 ω θ ( η ) u ν + θ 1 , υ n + 1 + b ¯ q 2 θ = 0 υ + 1 ω θ ( σ ) u ν , υ θ + 1 n + 1 + θ = 0 N q ν + 1 ω θ ( σ ) u ν , υ + θ 1 n + 1 = u ν , υ n a ¯ p 2 u ν 1 , υ n u ν + 1 , υ n + a ¯ q 2 u ν , υ 1 n u ν , υ + 1 n b ¯ p 2 θ = 0 ν + 1 ω θ ( η ) u ν θ + 1 , υ n + θ = 0 N p ν + 1 ω θ ( η ) u ν + θ 1 , υ n b ¯ q 2 θ = 0 υ + 1 ω θ ( σ ) u ν , υ θ + 1 n + θ = 0 N q υ + 1 ω θ ( σ ) u ν , υ + θ 1 n + τ f ( u ν , υ n + 1 2 , p ν , q υ , t n + 1 2 ) ,
where a ¯ p = τ a p 2 h p , b ¯ p = τ κ η b p h p η , a ¯ q = τ a q 2 h q , b ¯ q = τ κ σ b q h q σ . Define the following operators to simplify our formulation
δ p u ν , υ n = a p ( u ν + 1 , υ n u ν 1 , υ n ) 2 h p , δ q u ν , υ n = a q ( u ν , υ + 1 n u ν , υ 1 n ) 2 h q , δ p η u ν , υ n = κ η b p h p η θ = 0 ν + 1 ω θ ( η ) u ν θ + 1 , υ n + θ = 0 N p ν + 1 ω θ ( η ) u ν + θ 1 , υ n + O ( h p 2 ) , δ q σ u ν , υ n = κ σ b q h q σ θ = 0 υ + 1 ω θ ( σ ) u ν , υ θ + 1 n + θ = 0 N q υ + 1 ω θ ( σ ) u ν , υ + θ 1 n + O ( h q 2 ) .
Thanks to operators definitions (14), the numerical approximation (12) can be represented as
1 τ 2 δ p + δ p η τ 2 δ q + δ q σ u ν , υ n + 1 = 1 + τ 2 δ p + δ p η + τ 2 δ q + δ q σ u ν , υ n + τ f ( u n + 1 2 ) + τ R ν , υ n + 1 2 ,
where R ν , υ n + 1 2 is the truncation error which satisfies | R ν , υ n + 1 2 | C 0 ( τ 2 + h p 2 + h q 2 ) .
Let us define the operators
δ p = δ p + δ p η ,
δ q = δ q + δ q σ .
Based on these operator definitions, we write the CN–WSGD scheme for the two-dimensional nonlinear Risez space–fractional convection–diffusion equation as operator form
1 τ 2 δ p τ 2 δ q u ν , υ n + 1 = 1 + τ 2 δ p + τ 2 δ q u ν , υ n + τ f ( u n + 1 2 ) .
The finite difference scheme (16) can be expressed by the following directional splitting factorization form
1 τ 2 δ p 1 τ 2 δ q u ν , υ n + 1 = 1 + τ 2 δ p 1 + τ 2 δ q u ν , υ n + τ f ( u n + 1 2 ) ,
which introduces an additional perturbation error of τ 2 4 δ p δ q u ν , υ n + 1 u ν , υ n with Taylor expansion
τ 2 4 δ p δ q u ν , υ n + 1 u ν , υ n = τ 3 4 δ p + δ p η δ q + δ q σ u t ν , υ n + 1 2 + τ 3 O ( τ 2 + h p 2 + h q 2 ) .
The additional perturbation errors are insignificant compared to the approximation errors and the finite difference scheme described in Equation (15) has second-order accuracy in both time and space, expressed as O ( τ 2 + h p 2 + h q 2 ) . The equation defined by (17) is derived by the following D’Yakonov ADI scheme [43]
1 τ 2 δ p u ν , υ = 1 + τ 2 δ p 1 + τ 2 δ q u ν , υ n + τ f ( u n + 1 2 ) ,
1 τ 2 δ q u ν , υ n + 1 = u ν , υ ,
where u ν , υ is an intermediate solution.
In order to solve (19)–(20), we can use the following algorithm:
(1)
To obtain the intermediate solution u ν , υ , we solve a set of N p 1 equations that define by (19) for every fixed q υ at every mesh point p ν ( ν = 1 , 2 , . . . , N p 1 ) .
(2)
To find the numerical solution u ν , υ n + 1 , we solve a set of N q 1 equations that define by (20) for each fixed p ν at the points q υ ( υ = 1 , 2 , . . . , N q 1 ) by alternating the spatial direction.
(3)
The homogeneous Dirichlet boundary conditions are used as the following:
u 0 , υ n = u ( p l , q υ , t n ) = 0 , u N p , υ n = u ( p r , q υ , t n ) = 0 ,
u ν , 0 n = u ( p ν , q l , t n ) = 0 , u ν , N q n = u ( p ν , q r , t n ) = 0 .
As a result, we now calculate the initial boundary conditions for the intermediate solution u ν , υ in order to ensure consistency, which can be set from Equation (20). The function B ( p , q , t ) on the boundary of the region p l p p r , q l q q r is defined as Dirichlet boundary conditions. Then, we compute the boundary values for u ν , υ as
u 0 , υ = 1 τ 2 δ q B 0 , υ n + 1 , u N p , υ = 1 τ 2 δ q B N p , υ n + 1 .
The finite difference algorithm (17) can be described by the following matrix form
( I A ) ( I B ) u n + 1 = ( I + A ) ( I + B ) u n + τ F n + 1 2 ,
where I is an identity matrix,
u n = [ u 1 , 1 n , u 2 , 1 n , , u N p 1 , 1 n , u 1 , 2 n , u 2 , 2 n , , u 1 , N q 1 n , u 2 , N q 1 n , , u N p 1 , N q 1 n ] T ,
F n + 1 2 = [ f 1 , 1 n + 1 2 , f 2 , 1 n + 1 2 , , f N p 1 , 1 n + 1 2 , f 1 , 2 n + 1 2 , f 2 , 2 n + 1 2 , , f 1 , N q 1 n + 1 2 , f 2 , N q 1 n + 1 2 , , f N p 1 , N q 1 n + 1 2 ] T .
The matrix entries A = ( a ν , υ ) ( N p 1 ) × ( N p 1 ) are defined by
a ν , υ = b ¯ p 2 ω ν υ + 1 ( η ) , υ < ν 1 , a ¯ p 2 + b ¯ p 2 ω 0 ( η ) + ω 2 ( η ) , υ = ν 1 , b ¯ p ω 1 ( η ) , υ = ν , a ¯ p 2 + b ¯ p 2 ω 0 ( η ) + ω 2 ( η ) , υ = ν + 1 , b ¯ p 2 ω υ ν + 1 ( η ) , υ > ν + 1 ,
and the matrix entries B = ( b ν , υ ) ( N q 1 ) × ( N q 1 ) are defined by
b ν , υ = b ¯ q 2 ω υ ν + 1 ( σ ) , υ < ν 1 , a ¯ q 2 + b ¯ q 2 ω 0 ( σ ) + ω 2 ( σ ) , υ = ν 1 , b ¯ q ω 1 ( σ ) , υ = ν , a ¯ q 2 + b ¯ q 2 ω 0 ( σ ) + ω 2 ( σ ) , υ = ν + 1 , b ¯ q 2 ω ν υ + 1 ( σ ) , υ > ν + 1 .

4. Theoretical Analysis of the CNADI–WSGD Scheme

In this part, the discussion and analysis of the stability and convergence of the proposed CNADI–WSGD method (16) with the 2–DNRSFCDE (1) will be discussed and analyzed. First, we introduce the important lemmas, which are listed below.
Lemma 3. 
Let us assume that 1 < η , σ 2 , A , B are defined in (21), (23), respectively. The matrices A and B are then said to be strictly diagonally dominant.
Proof. 
First, we prove strict diagonal dominant of the matrix A. We have a ¯ p > 0 , κ η = 1 2 c o s ( π η / 2 ) < 0 for 1 < η 2 which implies that b ¯ p < 0 . For a ν , ν + 1 and a ν , ν 1 , we have
a ν , ν + 1 = a ¯ p 2 + b ¯ p 2 ( ω 0 ( η ) + ω 2 ( η ) ) , a ν , ν 1 = a ¯ p 2 + b ¯ p 2 ( ω 0 ( η ) + ω 2 ( η ) ) .
From Lemma 2, we have
ω 0 ( η ) + ω 2 ( η ) = η 2 + η ( η 2 + η 4 ) 4 > 0 .
Because a ¯ p > 0 , b ¯ p < 0 , then we obtain
a ν , ν + 1 = a ¯ p 2 + b ¯ p 2 ( ω 0 ( η ) + ω 2 ( η ) ) < 0 ,
a ν , ν 1 = a ¯ p 2 + b ¯ p 2 ( ω 0 ( η ) + ω 2 ( η ) ) < 0 .
According to Lemma 2, we have ω 1 ( η ) < 0 ; hence,
a ν , ν = b ¯ p ω 1 ( η ) > 0 .
As we know from Lemma 2, when θ 3 , ω θ ( η ) > 0 , then b ¯ p ω θ ( η ) < 0 ; thus, a ν , υ < 0 when υ < ν 1 , υ > ν + 1 . For a given ν , we can write
υ = 1 , υ ν N p 1 | a ν , υ | = υ = 1 ν 2 | a ν , υ | + υ = ν + 2 N p 1 | a ν , υ | + | a ν , ν 1 | + | a ν , ν + 1 | = υ = 1 ν 2 b ¯ p 2 ω ν υ + 1 ( η ) υ = ν + 2 N p 1 b ¯ p 2 ω υ υ + 1 ( η ) b ¯ p ( ω 0 ( η ) + ω 2 ( η ) ) < ν 2 b ¯ p 2 ω ν υ + 1 ( η ) υ = ν + 2 + b ¯ p 2 ω υ ν + 1 ( η ) b ¯ p ( ω 0 ( η ) + ω 2 ( η ) ) = b ¯ p θ = 3 + ω θ ( η ) b ¯ x θ = 3 + ω θ ( η ) b ¯ p ( ω 0 ( η ) + ω 2 ( η ) ) = b ¯ p θ = 0 + ω θ ( η ) b ¯ p θ = 0 + ω θ ( η ) + b ¯ p ω 1 ( η ) = b ¯ p ω 1 ( η ) = | a ν , ν | ,
this implies that
| a ν , ν | > υ = 1 , ν 1 N p 1 | a ν , υ | , ν = 1 , 2 , 3 , , N p 1 .
Therefore, A is strictly diagonally dominant. We can demonstrate the diagonally dominant result of the matrix B by the same procedure. □
Lemma 4 
([44]). For the given initial vector E 0 , there is a nonnegative constant number M, which is independent of both the space-step size and the time-step size, such that
E n + 1 M E 0 .

4.1. Stability of the CNADI–WSGD Approximation

The stability analysis of the numerical approximation method that was presented in (16) is analyzed in this subsection.
Theorem 1. 
The finite difference algorithm presented in (16) for solving the two-dimensional nonlinear Risez space–fractional convection–diffusion Equation (1) with 1 < η , σ 2 is unconditionally stable.
Proof. 
Suppose that u ˜ ν , υ n ( ν = 0 , 1 , , N p ; υ = 0 , 1 , , N q ; n = 0 , 1 , , N t ) is the numerical solution and u ν , υ n be the analytical solution for the discretization numerical method (16). Denoting the error between the approximate solution and the analytical one as ζ ν , υ n = u ˜ ν , υ n u ν , υ n and defining the vector
ζ n = [ ζ 1 , 1 n , ζ 2 , 1 n , , ζ N p 1 , 1 n , ζ 1 , 2 n , ζ 2 , 2 n , , ζ N p 1 , 2 n , , ζ 1 , N q 1 n , ζ 2 , N q 1 n , , ζ N p 1 , N q 1 n ] T .
According to (13), the error ζ ν , υ n = u ˜ ν , υ n u ν , υ n satisfies
ζ ν , υ n + 1 + a ¯ p 2 ζ ν + 1 , υ n + 1 ζ ν 1 , υ n + 1 + a ¯ q 2 ζ ν , υ + 1 n + 1 ζ ν , υ 1 n + 1 + b ¯ p 2 θ = 0 ν + 1 ω θ ( η ) ζ ν θ + 1 , υ n + 1 + θ = 0 N p ν + 1 ω θ ( η ) ζ ν + θ 1 , υ n + 1 + b ¯ q 2 θ = 0 υ + 1 ω θ ( σ ) ζ ν , υ θ + 1 n + 1 + θ = 0 N q υ + 1 ω θ ( σ ) ζ ν , υ + θ 1 n + 1 = ζ ν , υ n a ¯ p 2 ζ ν 1 , υ n ζ ν + 1 , υ n + a ¯ q 2 ζ ν , υ 1 n ζ ν , υ + 1 n
b ¯ p 2 θ = 0 ν + 1 ω θ ( η ) ζ ν θ + 1 , υ n + θ = 0 N p ν + 1 ω θ ( η ) ζ ν + θ 1 , υ n b ¯ q 2 θ = 0 υ + 1 ω θ ( σ ) ζ ν , υ θ + 1 n + θ = 0 N q υ + 1 ω θ ( σ ) ζ ν , υ + θ 1 n + τ f ( u ˜ ν , υ n + 1 2 , p ν , q υ , t n + 1 2 ) f ( u ν , υ n + 1 2 , p ν , q υ , t n + 1 2 ) .
Let E n + 1 = max 0 ν N p , 0 υ N q | ζ ν , υ n + 1 | . In order to demonstrate that the desired result is true, we will use the mathematical induction technique. For n = 0 , assuming | ζ ν 0 , υ 0 1 | = E 1 = max 0 ν N p , 0 υ N q | ζ ν , υ 1 | , and applying Lemma 2, we have
E 1 = | ζ ν 0 , υ 0 1 | | ζ ν 0 , υ 0 1 | + a ¯ p 2 | ζ ν 0 + 1 , υ 0 1 ζ ν 0 1 , υ 0 1 | + a ¯ q 2 | ζ ν 0 , υ 0 + 1 1 ζ ν 0 , υ 0 1 1 | + b ¯ p 2 θ = 0 ν 0 + 1 ω θ ( η ) | ζ ν 0 θ + 1 , υ 0 1 | + θ = 0 N p ν 0 + 1 ω θ ( η ) | ζ ν 0 + θ 1 , υ 0 1 | + b ¯ q 2 θ = 0 υ 0 + 1 ω θ ( σ ) | ζ ν 0 , υ 0 θ + 1 1 | + θ = 0 N q υ 0 + 1 ω θ ( σ ) | ζ ν 0 , υ 0 + θ 1 1 | | ζ ν 0 , j 0 1 + a ¯ p 2 ζ ν 0 + 1 , υ 0 1 ζ ν 0 1 , υ 0 1 + a ¯ q 2 ζ ν 0 , υ 0 + 1 1 ζ ν 0 , υ 0 1 1 + b ¯ p 2 θ = 0 ν 0 + 1 ω θ ( η ) ζ ν 0 θ + 1 , υ 0 1 + θ = 0 N p ν 0 + 1 ω θ ( η ) ζ ν 0 + θ 1 , υ 0 1 + b ¯ q 2 θ = 0 υ 0 + 1 ω θ ( σ ) ζ ν 0 , υ 0 θ + 1 1 + θ = 0 N q υ 0 + 1 ω θ ( σ ) ζ ν 0 , υ 0 + θ 1 1 |
= | ζ ν 0 , υ 0 0 a ¯ p 2 ζ ν 0 + 1 , υ 0 0 ζ ν 0 1 , υ 0 0 + a ¯ q 2 ζ ν 0 , υ 0 + 1 0 ζ ν 0 , υ 0 1 0 b ¯ p 2 θ = 0 ν 0 + 1 ω θ ( η ) ζ ν 0 θ + 1 , υ 0 0 + θ = 0 N p ν 0 + 1 ω θ ( η ) ζ ν 0 + θ 1 , υ 0 0 b ¯ q 2 θ = 0 υ 0 + 1 ω θ ( σ ) ζ ν 0 , υ 0 θ + 1 0 + θ = 0 N q υ 0 + 1 ω θ ( σ ) ζ ν 0 , υ 0 + θ 1 0 + τ ( f ( u ˜ ν 0 , υ 0 1 2 ) f ( u ν 0 , υ 0 1 2 ) ) | | ζ ν 0 , υ 0 0 + τ ( f ( u ˜ ν 0 , υ 0 1 2 ) f ( u ν 0 , υ 0 1 2 ) ) | | ζ ν 0 , υ 0 0 + τ ( f ( u ˜ ν 0 , υ 0 0 ) f ( u ν 0 , j 0 0 ) ) | E 0 + τ K | u ˜ ν 0 , υ 0 0 u ν 0 , υ 0 0 | E 0 + τ K E 0 ( 1 + τ K ) E 0
Thus,
E 1 ( 1 + τ K ) E 0 e x p ( n τ K ) E 0 e x p ( K T ) E 0 M E 0 , M = e x p ( K T ) .
Supposing E s E 0 , s = 1 , 2 , , n + 1 and | ζ ν 0 , υ 0 n + 1 | = E n + 1 = max 0 ν N p , 0 υ N q | ζ ν , υ n + 1 | , then from Lemma 2, we obtain
E n + 1 = | ζ ν 0 , υ 0 1 | | ζ ν 0 , υ 0 n + 1 | + a ¯ p 2 | ζ ν 0 + 1 , υ 0 n + 1 ζ ν 0 1 , υ 0 n + 1 | + a ¯ q 2 | ζ ν 0 , υ 0 + 1 n + 1 ζ ν 0 , υ 0 1 n + 1 | + b ¯ p 2 θ = 0 ν 0 + 1 ω θ ( η ) | ζ ν 0 θ + 1 , υ 0 n + 1 | + θ = 0 N p ν 0 + 1 ω θ ( η ) | ζ ν 0 + θ 1 , υ 0 n + 1 | + b ¯ q 2 θ = 0 υ 0 + 1 ω θ ( σ ) | ζ ν 0 , υ 0 θ + 1 n + 1 | + θ = 0 N q υ 0 + 1 ω θ ( σ ) | ζ ν 0 , υ 0 + θ 1 n + 1 | | ζ ν 0 , υ 0 n + 1 + a ¯ p 2 ζ ν 0 + 1 , υ 0 n + 1 ζ ν 0 1 , υ 0 n + 1 + a ¯ q 2 ζ ν 0 , υ 0 + 1 n + 1 ζ ν 0 , υ 0 1 n + 1 + b ¯ p 2 θ = 0 ν 0 + 1 ω θ ( η ) ζ ν 0 θ + 1 , υ 0 n + 1 + θ = 0 N p ν 0 + 1 ω θ ( η ) ζ ν 0 + θ 1 , υ 0 n + 1 + b ¯ q 2 θ = 0 υ 0 + 1 ω θ ( σ ) ζ ν 0 , υ 0 θ + 1 n + 1 + θ = 0 N q υ 0 + 1 ω θ ( σ ) ζ ν 0 , υ 0 + θ 1 n + 1 |
= | ζ ν 0 , υ 0 n a ¯ p 2 ζ ν 0 + 1 , υ 0 n ζ ν 0 1 , υ 0 n + a ¯ q 2 ζ ν 0 , υ 0 + 1 n ζ ν 0 , υ 0 1 n b ¯ p 2 θ = 0 ν 0 + 1 ω θ ( η ) ζ ν 0 θ + 1 , υ 0 n + θ = 0 N p ν 0 + 1 ω θ ( η ) ζ ν 0 + θ 1 , υ 0 n b ¯ q 2 θ = 0 υ 0 + 1 ω θ ( σ ) ζ ν 0 , υ 0 θ + 1 n + θ = 0 N q υ 0 + 1 ω θ ( σ ) ζ ν 0 , υ 0 + θ 1 n + τ f ( u ˜ ν 0 , υ 0 n + 1 2 ) f ( u ν 0 , υ 0 n + 1 2 ) | | ζ ν 0 , υ 0 n + τ f ( u ˜ ν 0 , υ 0 n + 1 ) f ( u ν 0 , υ 0 n + 1 ) | | ζ ν 0 , υ 0 n | + τ | f ( u ˜ ν 0 , υ 0 n + 1 ) f ( u ν 0 , υ 0 n + 1 ) | E n + τ K | u ˜ ν 0 , υ 0 n + 1 u ν 0 , υ 0 n + 1 | E n + τ K E n + 1 E n + τ K E n ( 1 + τ K ) E n
Therefore,
E n + 1 ( 1 + τ K ) n + 1 E 0 e x p ( n τ K ) E 0 M E 0 .
Hence, the proof is completed. □

4.2. Convergence of the CNADI–WSGD Approximation

Theorem 2. 
Assuming that the smooth solution to the continuous problem (1) with its initial condition exists and f ( u , p , q , t ) satisfies the Lipschitz condition and let u ν , υ n be the numerical approximate solution of u ( p ν , q υ , t n ) , then there is a nonnegative constant C independent of n , ν , υ , h p , h q , and τ such that
| u ( p ν , q υ , t n ) u ν , υ n | C ( τ 2 + h p 2 + h q 2 ) , ν = 1 , 2 , , N p 1 , υ = 1 , 2 , , N q 1 , n = 1 , 2 , , N t 1 .
Proof. 
Let the exact solution of the Equation (1) at the mesh point ( p ν , q υ , t n ) be given by u ( p ν , q υ , t n ) . Define ν , υ n = u ( p ν , q υ , t n ) u ν , υ n , and Z n = [ 1 , 1 n , 2 , 1 n , , N p 1 , 1 n , 1 , 2 n , 2 , 2 n , , N p 1 , 2 n , , 1 , N q 1 n , 2 , N q 1 n , , N p 1 , N q 1 n ] T .
Using Z 0 = 0 and u ν , v n = u p ν , q v , t n ν , v n , substitution into (3.2) leads to
ν , v n + 1 + a ¯ p 2 ν + 1 , v n + 1 ν 1 , v n + 1 + a ¯ q 2 ν , v + 1 n + 1 ν , v 1 n + 1 + b ¯ p 2 θ = 0 ν + 1 ω θ ( η ) ν θ + 1 , v n + 1 + θ = 0 N p ν + 1 ω θ ( η ) ν + θ 1 , v n + 1 + b ¯ q 2 θ = 0 v + 1 ω θ ( σ ) ν , v θ + 1 n + 1 + θ = 0 N q v + 1 ω θ ( σ ) ν , v + θ 1 n + 1 = ν , v n a ¯ p 2 ν 1 , v n ν + 1 , v n + a ¯ q 2 ν , v 1 n ν , v + 1 n b ¯ p 2 θ = 0 ν + 1 ω θ ( η ) ν θ + 1 , v n + θ = 0 N p ν + 1 ω θ ( η ) ν + θ 1 , v n b ¯ q 2 θ = 0 v + 1 ω θ ( σ ) ν , v θ + 1 n + θ = 0 N q v + 1 ω θ ( σ ) ν , v + θ 1 n + τ f u p ν , q v , t n + 1 2 , p ν , q v , t n + 1 2 f u ν , v n + 1 2 , p ν , q v , t n + 1 2 + R n + 1 2
where R ν , v n + 1 2 C 0 τ 3 + τ h p 2 + τ h q 2 .
Suppose that ν 0 , v 0 n + 1 = Z n + 1 = max 0 ν N p 0 v N q ν , v n + 1 . Applying Lemma 2, we obtain
Z n + 1 = | ν 0 , υ 0 n + 1 | | ν 0 , υ 0 n + 1 | + a ¯ p 2 | ν 0 + 1 , υ 0 n + 1 ν 0 1 , υ 0 n + 1 | + a ¯ q 2 | ν 0 , υ 0 + 1 n + 1 ν 0 , υ 0 1 n + 1 | + b ¯ p 2 θ = 0 ν 0 + 1 ω θ ( η ) | ν 0 θ + 1 , υ 0 n + 1 | + θ = 0 N p ν 0 + 1 ω θ ( η ) | ν 0 + θ 1 , υ 0 n + 1 | + b ¯ q 2 θ = 0 ν 0 + 1 ω θ ( σ ) | ν 0 , υ 0 θ + 1 n + 1 | + θ = 0 N q υ 0 + 1 ω θ ( σ ) | ν 0 , υ 0 + θ 1 n + 1 | | ν 0 , υ 0 n + 1 + a ¯ p 2 ν 0 + 1 , υ 0 n + 1 ν 0 1 , υ 0 n + 1 + a ¯ y 2 ν 0 , υ 0 + 1 n + 1 ν 0 , υ 0 1 n + 1 + b ¯ p 2 θ = 0 ν 0 + 1 ω θ ( η ) ν 0 θ + 1 , υ 0 n + 1 + θ = 0 N p ν 0 + 1 ω θ ( η ) ν 0 + θ 1 , ν 0 n + 1 + b ¯ q 2 θ = 0 υ 0 + 1 ω θ ( σ ) ν 0 , υ 0 θ + 1 n + 1 + θ = 0 N q υ 0 + 1 ω θ ( σ ) ν 0 , υ 0 + θ 1 n + 1 | = | ν 0 , υ 0 n + a ¯ p 2 ν 0 + 1 , υ 0 n ν 0 1 , υ 0 n + a ¯ y 2 ν 0 , υ 0 + 1 n ν 0 , υ 0 1 n + b ¯ p 2 θ = 0 ν 0 + 1 ω θ ( η ) ν 0 θ + 1 , υ 0 n + θ = 0 N p ν 0 + 1 ω θ ( η ) ν 0 + θ 1 , ν 0 n + b ¯ q 2 θ = 0 υ 0 + 1 ω θ ( σ ) ν 0 , υ 0 θ + 1 n + θ = 0 N q υ 0 + 1 ω θ ( σ ) ν 0 , υ 0 + θ 1 n + τ ( f ( u ( p ν 0 , q υ 0 , t n + 1 2 ) , p ν 0 q υ 0 , t n + 1 2 ) f ( u n + 1 2 , p ν 0 , q υ 0 , t n + 1 2 ) ) | | ν 0 , υ 0 n + R ν 0 , υ 0 n + 1 2 + τ ( f ( u ( p ν 0 , q υ 0 , t n + 1 2 ) , p ν 0 q υ 0 , t n + 1 2 ) f ( u n + 1 2 , p ν 0 , q υ 0 , t n + 1 2 ) ) | | ν 0 , υ 0 n + R ν 0 , υ 0 n + 1 2 + τ ( f ( u ( p ν 0 , q υ 0 , t n + 1 ) , p ν 0 q υ 0 , t n + 1 ) f ( u n + 1 , p ν 0 , q υ 0 , t n + 1 ) ) | | ν 0 , υ 0 n | + | R ν 0 , υ 0 n + 1 2 | + τ | f ( u ( p ν 0 , q υ 0 , t n + 1 ) , p ν 0 , q υ 0 , t n + 1 ) f ( u n + 1 , p ν 0 , q υ 0 , t n + 1 ) | Z n + C 0 ( τ 3 + τ h p 2 + τ h q 2 ) + τ K | u ( p ν 0 , q υ 0 , t n + 1 ) u ν 0 , υ 0 n + 1 | Z n + C 0 ( τ 3 + τ h p 2 + τ h q 2 ) + τ K Z n + 1 Z n + C 0 ( τ 3 + τ h p 2 + τ h q 2 ) + τ K Z n ( 1 + τ K ) Z n + C 0 ( τ 3 + τ h p 2 + τ h q 2 ) ,
which implies that
Z n + 1 ( 1 + τ K ) Z n + C 0 ( τ 3 + τ h p 2 + τ h q 2 ) .
With the help of the discretized Gronwall inequality, we obtain
Z n + 1 e x p ( n τ K ) n C 0 ( τ 3 + τ h p 2 + τ h q 2 ) e x p ( K T ) C 0 T ( τ 2 + h p 2 + h q 2 ) = C ( τ 2 + h p 2 + h q 2 ) ,
where C = e x p ( K T ) C 0 T , which completes the proof. □

5. Numerical Examples

In this section, we carry out some numerical examples to confirm our theoretical analysis results of the proposed scheme. Due to the term f ( u n + 1 ) , the difference scheme (16) is completely implicit. Therefore, we propose the linearized iterative algorithm at each time level and then use the L U decomposition method to solve the linear system of equations. Let u ν , υ n + 1 , ( k ) be the kth iterative value of the solution at the time level (n+1), then we have the following:
1 τ 2 δ p 1 τ 2 δ q u ν , υ n + 1 , ( k + 1 ) = 1 + τ 2 δ p 1 + τ 2 δ q u ν , υ n , ( k ) + τ 3 2 f ( u ν , υ n ) 1 2 f ( u ν , υ n 1 ) ,
where k is the iterative index. In the following experiments, the iterative processes at each time step ( n = 1 , 2 , 3 , ) are terminated when u n + 1 , ( k + 1 ) u n + 1 , ( k ) T o l . , where T o l . stands for the tolerance, which is a very small prescribed value. Let us now define the numerical errors L , L 2 , respectively, as
E ( h p , h q , τ ) = max 1 ν N p , 1 υ N q , 1 n N | u ( p ν , q υ , t n ) u ν , υ n | ,
E 2 ( h p , h q , τ ) = h p h q ν = 1 N p 1 υ = 1 N q 1 ( u ( p ν , q υ , t n ) u ν , υ n ) 2 1 / 2 ,
and their convergence orders, respectively, as
o r d e r m = log 2 E ( h p , h q , τ ) E ( 2 h p , 2 h q , 2 τ ) , o r d e r 2 = log 2 E 2 ( h p , h q , τ ) E 2 ( 2 h p , 2 h q , 2 τ ) .
All numerical simulations are performed by MATLAB 2020a software and we take maximum iteration (Iter. = 1000 , T o l . = 10 12 ) .
Example 1. 
Consider the following 2DNRSFCDE:
u ( p , q , t ) t = a p u ( p , q , t ) p a q u ( p , q , t ) q + b p η u ( p , q , t ) | p | η + b q σ u ( p , q , t ) | q | σ + u ( 1 u ) 2 + f ( p , q , t ) , u ( p , q , 0 ) = 0 , 0 p , q 1 , u ( 0 , q , t ) = u ( 1 , q , t ) = u ( p , 0 , t ) = u ( p , 1 , t ) = 0 , 0 p , q 1 , 0 t T ,
where
f ( p , q , t ) = 3 t 2 p 4 ( 1 p ) 4 q 4 ( 1 q ) 4 + a p t 3 ( 4 p 3 ( 2 p 1 ) ( p 1 ) 3 q 4 ( 1 q ) 4 ) + a q t 3 ( 4 q 3 ( 2 q 1 ) ( q 1 ) 3 p 4 ( 1 p ) 4 ) b p κ η t 3 q 4 ( 1 q ) 4 [ Γ ( 5 ) Γ ( 5 η ) p 4 η + ( 1 p ) 4 η 4 Γ ( 6 ) Γ ( 6 η ) p 5 η + ( 1 p ) 5 η + 6 Γ ( 7 ) Γ ( 7 η ) p 6 η + ( 1 p ) 6 η 4 Γ ( 8 ) Γ ( 8 η ) p 7 η + ( 1 p ) 7 η + Γ ( 9 ) Γ ( 9 η ) p 8 η + ( 1 p ) 8 η ] b q κ σ t 3 p 4 ( 1 p ) 4 [ Γ ( 5 ) Γ ( 5 σ ) q 4 σ + ( 1 q ) 4 σ 4 Γ ( 6 ) Γ ( 6 σ ) q 5 σ + ( 1 q ) 5 σ + 6 Γ ( 7 ) Γ ( 7 σ ) q 6 σ + ( 1 q ) 6 σ 4 Γ ( 8 ) Γ ( 8 σ ) q 7 σ + ( 1 q ) 7 σ + Γ ( 9 ) Γ ( 9 σ ) q 8 σ + ( 1 q ) 8 σ ) ] .
The exact solution for Equation (28) is u ( p , q , t ) = t 3 p 4 ( 1 p ) 4 q 4 ( 1 q ) 4 .
We solve the current problem using the proposed numerical method (27). Table 1 presents the maximum norm, L 2 norm errors, corresponding convergence orders, and computational time in seconds, obtained when T = 1 , a p = a q = 1 , b p = b q = 1.5 with τ = h p = h q for ( η , σ ) = ( 1.2 , 1.8 ) , ( η , σ ) = ( 1.3 , 1.7 ) , ( η , σ ) = ( 1.4 , 1.6 ) , respectively. In Table 2, we examine the accuracy and computational processing unit (CPU) efficiency of the CN–ADI and CN–non–ADI schemes. We find that the accuracy of both methods is comparable, while the computational cost of the CN–ADI is lower than the computational cost of the CN–non–ADI scheme defined in (13). These results show that the CN–ADI scheme is more efficient. The error curves of Equation (28) for different values of η , σ and different grid points are displayed in Figure 1. In Figure 2, we present the behavior of the 2DNRSFCDE for different values of η , σ at T = 1 with fixed τ = h p = h q = 1 / 64 and the diffusion coefficients b p = b q = 1.5 and the convection coefficients a p = a q = 1 . It can be observed that our discretized scheme is second-order convergent in both time and space.
Example 2. 
Consider the 2DNRSFCDE below [32]:
u ( p , q , t ) t = a p u ( p , q , t ) p a q u ( p , q , t ) q + b p η u ( p , q , t ) | p | η + b q σ u ( p , q , t ) | q | σ u + f ( p , q , t ) , u ( p , q , 0 ) = p 2 ( 1 p ) 2 q 2 ( 1 q ) 2 , 0 p , q 1 , u ( 0 , q , t ) = u ( 1 , q , t ) = u ( p , 0 , t ) = u ( p , 1 , t ) = 0 , 0 p , q 1 , 0 < t T ,
where
f ( p , q , t ) = e t p 2 ( 1 p ) 2 q 2 ( 1 q ) 2 + a p e t ( 2 p ( p 1 ) 2 + p 2 ( 2 p 2 ) q 2 ( 1 q ) 2 ) + a q e t ( 2 q ( q 1 ) 2 + q 2 ( 2 q 2 ) p 2 ( 1 p ) 2 ) b p κ η e t q 2 ( 1 q ) 2 [ 2 Γ ( 3 η ) p 2 η + ( 1 p ) 2 η 12 Γ ( 4 η ) p 3 η + ( 1 p ) 3 η + 24 Γ ( 5 η ) p 4 η + ( 1 p ) 4 η ] b q κ σ e t p 2 ( 1 p ) 2 [ 2 Γ ( 3 σ ) q 2 σ + ( 1 q ) 2 σ 12 Γ ( 4 σ ) q 3 σ + ( 1 q ) 3 σ + 24 Γ ( 5 σ ) q 4 σ + ( 1 q ) 4 σ ] .
The exact solution for Equation (29) is u ( p , q , t ) = e t p 2 ( 1 p ) 2 q 2 ( 1 q ) 2 . In Table 3, we display the maximum, L 2 errors with their related estimated convergence orders, and the computational time at T = 1 , a p = a q = 1 , b p = b q = 1.2 with τ = h p = h q .
The error curves of Equation (29) for different values of η , σ and different step sizes are illustrated in Figure 3. In Figure 4, we present the behavior of the 2DNRSFCDE for different values of η , σ at T = 1 with fixed τ = h p = h q = 1 / 64 and the diffusion coefficients b p = b q = 1.2 and the convection coefficients a p = a q = 1 . We see that the method yields O ( τ 2 + h p 2 + h q 2 ) convergence, as expected. It shows that our proposed difference scheme is accurate and effective. In Table 4, we give the comparison of the maximum error and convergence order of our scheme (27) with the results in [32] at ( η , σ ) = ( 1.5 , 1.5 ) , T = 1 , a p = a q = 0 , b p = b q = 0.5 with τ = h p = h q . The maximum error presented in the scheme (27) is more accurate than the maximum error obtained in [32]. We obtain second–order convergence in our proposed scheme while the convergence order in [32] is linear.

6. Conclusions

In this paper, the Crank–Nicolson method in the time direction and the weighted–shifted Grünwald–Letnikov difference method in space discretization are proposed to formulate and analyze the nonlinear Riesz space–fractional convection–diffusion equation in two dimensions on a finite domain. To find the solution of the two–dimensional problem alternatively and obtain the reduced one-dimensional problem with an efficient computational cost, we used the D’Yakonov ADI approach. Moreover, we have investigated the unconditional stability and convergence of the formulated problem, which illustrates the CNADI–WSGD scheme with O ( τ 2 + h p 2 + h q 2 ) accuracy. We have performed numerical simulations to justify the validity of our theoretical analysis results, which are in good agreement with the theoretical results. Because solving nonlinear space-fractional problems is one of the most difficult challenges, the existing approaches are rarely constructed to solve the problems. Most of the existing studies focused on the linear space-fractional equations, see [22,23,26,27,30,31,40]. The CNADI–WSGD discretization defined by (27) has second-order temporal and spatial accuracy, while the numerical schemes implemented in [32,45] have first-order accuracy in both the temporal and spatial directions. As we have seen in Table 1 and Table 3, when we refine the grid point in both the time and space directions, the L error and L 2 error are also decreased and obtain second–order accuracy. As the comparison result is shown in Table 4, our scheme gives second-order convergence, which implies that our constructed scheme is more precise and effective. A highly recommended line of study for future research is to extend this method to solve other fractional differential equations.

Author Contributions

Methodology, M.B.; Software, E.F.A.; Formal analysis, M.B.; Investigation, E.F.A.; Writing—original draft, M.B.; Supervision, B.D. All authors have read and agreed to the published version of the manuscript.

Funding

This research is supported by the National Natural Science Foundation of China (No. 11871475).

Data Availability Statement

Not applicable.

Acknowledgments

We would like to thank the editor and the reviewers for their valuable suggestions and comments which have updated the quality of our manuscript.

Conflicts of Interest

The authors declare that they have no conflict of interest.

References

  1. Miller, K.S.; Ross, B. An Introduction to the Fractional Calculus and Fractional Differential Equations; John Wiley & Sons Inc.: New York, NY, USA, 1993. [Google Scholar]
  2. Hilfer, R. Applications of Fractional Calculus in Physics; World Scientific: Singapore, 2000. [Google Scholar]
  3. Sheng, H.; Chen, Y.; Qiu, T. Fractional Processes and Fractional-Order Signal Processing: Techniques and Applications; Springer: London, UK, 2011. [Google Scholar]
  4. Fomin, S.; Chugunov, V.; Hashida, T. Application of fractional differential equations for modeling the anomalous diffusion of contaminant from fracture into porous rock matrix with bordering alteration zone. Transp. Porous Media 2010, 2, 187–205. [Google Scholar] [CrossRef]
  5. Wang, K.; Wang, H. A fast characteristic finite difference method for fractional advection–diffusion equations. Adv. Water Resour. 2011, 7, 810–816. [Google Scholar] [CrossRef]
  6. Magin, R.L. Fractional calculus models of complex dynamics in biological tissues. Comput. Math. Appl. 2010, 5, 1586–1593. [Google Scholar] [CrossRef] [Green Version]
  7. Sabatelli, L.; Keating, S.; Dudley, J.; Richmond, P. Waiting time distributions in financial markets. Eur. Phys. J. B 2002, 2, 273–275. [Google Scholar] [CrossRef]
  8. Basha, M.; Dai, B.; Al-Sadi, W. Existence and stability for a nonlinear coupled p-laplacian system of fractional differential equations. J. Math. 2021, 2021, 6687949. [Google Scholar] [CrossRef]
  9. Hejazi, H.; Moroney, T.; Liu, F. Stability and convergence of a finite volume method for the space fractional advection–dispersion equation. Comput. Appl. Math. 2014, 255, 684–697. [Google Scholar] [CrossRef] [Green Version]
  10. Jia, J.; Wang, H. A fast finite volume method for conservative space-fractional diffusion equations in convex domains. J. Comput. Phys. 2016, 310, 63–84. [Google Scholar] [CrossRef] [Green Version]
  11. Jin, B.; Lazarov, R.; Zhou, Z. A Petrov–Galerkin finite element method for fractional convection-diffusion equations. SIAM J. Numer. Anal. 2016, 1, 481–503. [Google Scholar] [CrossRef] [Green Version]
  12. Fu, T.; Duan, B.; Zheng, Z. An Effective Finite Element Method with Singularity Reconstruction for Fractional Convection-diffusion Equation. J. Sci. Comput. 2021, 3, 1–18. [Google Scholar] [CrossRef]
  13. Shen, J.; Stynes, M.; Sun, Z.Z. Two Finite Difference Schemes for Multi-Dimensional Fractional Wave Equations with Weakly Singular Solutions. Comput. Methods Appl. Math. 2021, 4, 913–928. [Google Scholar] [CrossRef]
  14. Li, C.; Zeng, F. Finite difference methods for fractional differential equations. Int. J. Bifurc. Chaos Appl. Sci. Eng. 2012, 4, 1230014. [Google Scholar] [CrossRef]
  15. Anley, E.F.; Zheng, Z. Finite difference approximation method for a space fractional convection–diffusion equation with variable coefficients. Symmetry 2020, 3, 485. [Google Scholar] [CrossRef] [Green Version]
  16. Huang, J.F.; Nie, N.; Tang, Y. Second order finite difference-spectral method for space fractional diffusion equations. Sci. China Math. 2014, 6, 1303–1317. [Google Scholar] [CrossRef]
  17. Basha, M.; Anley, E.F.; Dai, B. Numerical Solution for a Nonlinear Time-Space Fractional Convection-Diffusion Equation. J. Comput. Nonlinear Dyn. 2022, 1, 1–22. [Google Scholar] [CrossRef]
  18. Doha, E.H.; Bhrawy, A.H.; Baleanu, D.; Ezz-Eldien, S.S. On shifted Jacobi spectral approximations for solving fractional differential equations. Appl. Math. Comput. 2013, 15, 8042–8056. [Google Scholar] [CrossRef]
  19. Behroozifar, M.; Ahmadpour, F. A study on spectral methods for linear and nonlinear fractional differential equations. Int. J. Comput. Sci. Math. 2019, 6, 545–556. [Google Scholar] [CrossRef]
  20. Xu, Q.; Hesthaven, J.S. Discontinuous Galerkin method for fractional convection-diffusion equations. SIAM J. Numer. Anal. 2014, 1, 405–423. [Google Scholar] [CrossRef] [Green Version]
  21. Mustapha, K. Time-stepping discontinuous Galerkin methods for fractional diffusion problems. Numer. Math. 2015, 3, 497–516. [Google Scholar] [CrossRef] [Green Version]
  22. Feng, L.B.; Zhuang, P.; Liu, F.; Turner, I.; Li, J. High-order numerical methods for the Riesz space fractional advection-dispersion equations. Comput. Math. Appl. 2016. [Google Scholar] [CrossRef]
  23. Tian, W.; Deng, W.; Wu, Y. Polynomial spectral collocation method for space fractional advection–diffusion equation. Numer. Methods Partial Differ. Equ. 2015, 2, 514–535. [Google Scholar] [CrossRef] [Green Version]
  24. Bhrawy, A.H.; Baleanu, D. A spectral Legendre–Gauss–Lobatto collocation method for a space-fractional advection diffusion equations with variable coefficients. Rep. Math. Phys. 2013, 2, 219–233. [Google Scholar] [CrossRef]
  25. Xie, J.; Huang, Q.; Yang, X. Numerical solution of the one-dimensional fractional convection diffusion equations based on Chebyshev operational matrix. SpringerPlus 2016, 5, 1149. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  26. Borhanifar, A.; Ragusa, M.A.; Valizadehaz, S. High-order numerical method for two-dimensional Riesz space fractional advection-dispersion equation. Discrete Contin. Dyn. Syst. Ser. B 2020, 10, 5495–5508. [Google Scholar]
  27. Chen, M.; Deng, W. A second-order numerical method for two-dimensional two-sided space fractional convection diffusion equation. Appl. Math. Model. 2014, 13, 3244–3259. [Google Scholar] [CrossRef]
  28. Chen, M.; Deng, W. Fourth order accurate scheme for the space fractional diffusion equations. SIAM J. Numer. Anal. 2014, 3, 1418–1438. [Google Scholar] [CrossRef] [Green Version]
  29. Hou, D.; Azaiez, M.; Xu, C. Müntz Spectral Method for Two-Dimensional Space-Fractional Convection-Diffusion Equation. Commun. Comput. Phys. 2019, 26, 1415–1443. [Google Scholar] [CrossRef]
  30. Zhou, Y.; Zhang, C.; Brugnano, L. An implicit difference scheme with the KPS preconditioner for two-dimensional time–space fractional convection–diffusion equations. Comput. Math. Appl. 2020, 1, 31–42. [Google Scholar] [CrossRef]
  31. Bi, Y.; Jiang, Z. The finite volume element method for the two-dimensional space-fractional convection–diffusion equation. Adv. Differ. Equ. 2021, 2021, 379. [Google Scholar] [CrossRef]
  32. Liu, F.; Chen, S.; Turner, I.; Burrage, K.; Anh, V. Numerical simulation for two-dimensional Riesz space fractional diffusion equations with a nonlinear reaction term. Cent. Eur. J. Phys. 2013, 10, 1221–1232. [Google Scholar] [CrossRef] [Green Version]
  33. Zeng, F.; Liu, F.; Li, C.; Burrage, K.; Turner, I.; Anh, V. A Crank–Nicolson ADI spectral method for a two-dimensional Riesz space fractional nonlinear reaction-diffusion equation. SIAM J. Numer. Anal. 2014, 6, 2599–2622. [Google Scholar] [CrossRef] [Green Version]
  34. Zhu, X.; Nie, Y.; Wang, J.; Yuan, Z. A numerical approach for the Riesz space-fractional Fisher’equation in two-dimensions. Int. J. Comput. Math. 2017, 2, 296–315. [Google Scholar] [CrossRef]
  35. Yang, S. Numerical simulation for the two-dimensional and three-dimensional Riesz space fractional diffusion equations with delay and a nonlinear reaction term. Int. J. Comput. Math. 2019, 10, 1957–1978. [Google Scholar] [CrossRef]
  36. Samko, S.G.; Kilbas, A.A.; Marichev, O.I. Fractional Integrals and Derivatives: Theory and Applications; Gordon and Breach Science Publishers: Yverdon-les-Bains, Switzerland, 1993. [Google Scholar]
  37. Kilbas, A.A.A.; Srivastava, H.M.; Trujillo, J.J. Theory and Applications of Fractional Differential Equations; Elsevier Science Limited: Amsterdam, The Netherlands, 2006. [Google Scholar]
  38. Podlubny, I. Fractional Differential Equations; Academic Press: San Diego, CA, USA, 1999. [Google Scholar]
  39. Liu, F.; Anh, V.; Turner, I. Numerical solution of the space fractional Fokker–Planck equation. J. Comput. Appl. Math. 2004, 1, 209–219. [Google Scholar] [CrossRef] [Green Version]
  40. Anley, E.F.; Zheng, Z. Finite Difference Method for Two-Sided Two Dimensional Space Fractional Convection-Diffusion Problem with Source Term. Mathematics 2020, 11, 1878. [Google Scholar] [CrossRef]
  41. Tian, W.; Zhou, H.; Deng, W. A class of second order difference approximations for solving space fractional diffusion equations. Math. Comput. 2015, 294, 1703–1727. [Google Scholar] [CrossRef] [Green Version]
  42. Meerschaert, M.M.; Tadjeran, C. Finite difference approximations for two-sided space-fractional partial differential equations. Appl. Numer. Math. 2006, 1, 80–90. [Google Scholar] [CrossRef]
  43. Thomas, J.W. Numerical Partial Differential Equations: Finite Difference Methods; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2013. [Google Scholar]
  44. Yu, D.; Tan, H. Numerical Methods of Differential Equations; Science Publisher: Beijing, China, 2003. [Google Scholar]
  45. Nasrollahzadeh, F.; Hosseini, S.M. An implicit difference-ADI method for the two-dimensional space-time fractional diffusion equation. Iran. J. Math. Sci. Inform. 2016, 2, 71–86. [Google Scholar]
Figure 1. Errors of the computed scheme of Example 1 with T = 1 for different η , σ and grid points: (a) η = 1.2 , σ = 1.6 , τ = h p = h q = 1 / 64 , (b) η = 1.5 , σ = 1.9 , τ = h p = h q = 1 / 128 .
Figure 1. Errors of the computed scheme of Example 1 with T = 1 for different η , σ and grid points: (a) η = 1.2 , σ = 1.6 , τ = h p = h q = 1 / 64 , (b) η = 1.5 , σ = 1.9 , τ = h p = h q = 1 / 128 .
Fractalfract 07 00240 g001
Figure 2. The numerical solution of u ( p , q , t ) for the 2DNRSFCDE (28) at T = 1 , a p = a q = 1 , b p = b q = 1.5 with different η , σ when τ = h p = h q = 1 / 64 .
Figure 2. The numerical solution of u ( p , q , t ) for the 2DNRSFCDE (28) at T = 1 , a p = a q = 1 , b p = b q = 1.5 with different η , σ when τ = h p = h q = 1 / 64 .
Fractalfract 07 00240 g002
Figure 3. Errors of the computed scheme of Example (2) with T = 1 for different η , σ and grid points: (a) η = 1.2 , σ = 1.6 , τ = h p = h q = 1 / 80 , (b) η = 1.5 , σ = 1.9 , τ = h p = h q = 1 / 320 .
Figure 3. Errors of the computed scheme of Example (2) with T = 1 for different η , σ and grid points: (a) η = 1.2 , σ = 1.6 , τ = h p = h q = 1 / 80 , (b) η = 1.5 , σ = 1.9 , τ = h p = h q = 1 / 320 .
Fractalfract 07 00240 g003
Figure 4. The numerical approximation of u ( p , q , t ) for the 2DNRSFCDE (29) at T = 1 , a p = a q = 1 , b p = b q = 1.2 with different η , σ when τ = h p = h q = 1 / 64 .
Figure 4. The numerical approximation of u ( p , q , t ) for the 2DNRSFCDE (29) at T = 1 , a p = a q = 1 , b p = b q = 1.2 with different η , σ when τ = h p = h q = 1 / 64 .
Fractalfract 07 00240 g004
Table 1. Maximum errors, L 2 errors, convergence orders, and CPU time in seconds for Example 1 at T = 1 , a p = a q = 1 , b p = b q = 1.5 with τ = h p = h q .
Table 1. Maximum errors, L 2 errors, convergence orders, and CPU time in seconds for Example 1 at T = 1 , a p = a q = 1 , b p = b q = 1.5 with τ = h p = h q .
( η , σ ) τ = h p = h q L error order m L 2 error order 2 CPU(s)
(1.2, 1.8)1/4 1.8152 × 10 6 - 8.3261 × 10 7 -0.0020
1/8 5.2265 × 10 7 1.7962 2.2334 × 10 7 1.89840.0059
1/16 1.4877 × 10 7 1.8128 5.5676 × 10 8 2.00410.0288
1/32 3.6949 × 10 8 2.0094 1.3771 × 10 8 2.01540.1724
1/64 9.2722 × 10 9 1.9945 3.4245 × 10 9 2.00770.8077
1/128 2.316 × 10 9 2.0013 8.5576 × 10 10 2.00065.8330
(1.3, 1.7)1/4 1.8533 × 10 6 - 8.1189 × 10 7 -0.0022
1/8 5.4362 × 10 7 1.7694 2.2393 × 10 7 1.85830.0100
1/16 1.5247 × 10 7 1.834 5.7281 × 10 8 1.96690.0837
1/32 3.8912 × 10 8 1.9703 1.447 × 10 8 1.9850.1850
1/64 9.8603 × 10 9 1.9805 3.6419 × 10 9 1.99031.0993
1/128 2.4738 × 10 9 1.9949 9.1477 × 10 10 1.99328.0243
(1.4, 1.6)1/4 1.8759 × 10 6 - 7.9874 × 10 7 -0.0020
1/8 5.5635 × 10 7 1.7535 2.2431 × 10 7 1.83220.0066
1/16 1.531 × 10 7 1.8615 5.8323 × 10 8 1.94340.0355
1/32 4.0374 × 10 8 1.923 1.4919 × 10 8 1.96690.1485
1/64 1.023 × 10 8 1.9806 3.7801 × 10 9 1.98060.8680
1/128 2.5736 × 10 9 1.991 9.5229 × 10 10 1.9896.9709
Table 2. Results of CN-ADI and CN-non-ADI schemes for Example 1.
Table 2. Results of CN-ADI and CN-non-ADI schemes for Example 1.
CN–ADI CN–non–ADI
( η , σ ) τ = h p = h q l OrderCPU l OrderCPU
1/40 2.3767 × 10 8 -0.1268 2.3767 × 10 8 -0.2446
1/80 5.9314 × 10 9 2.00250.7686 5.9314 × 10 9 2.00251.3055
(1.2,1.8)1/160 1.4824 × 10 9 2.00045.9595 1.4824 × 10 9 2.00049.8197
1/320 3.7076 × 10 10 1.999461.1540 3.7076 × 10 10 1.999472.0935
1/40 2.5151 × 10 8 -0.1395 2.5151 × 10 8 -0.2249
1/80 6.3143 × 10 9 1.99391.1048 6.3143 × 10 9 1.99391.4776
(1.3,1.7)1/160 1.584 e × 10 9 1.9957.7145 1.584 × 10 9 1.99511.2881
1/320 3.9662 × 10 10 1.997862.0667 3.9662 × 10 10 1.997882.0642
1/40 2.5961 × 10 8 -0.1492 2.5961 × 10 8 -0.2446
1/80 6.5675 × 10 9 1.98291.0746 6.5675 × 10 9 1.98291.3055
(1.4,1.6)1/160 1.649 × 10 9 1.99387.7024 1.649 × 10 9 1.99389.8197
1/320 4.1311 × 10 10 1.99761.3860 4.1311 × 10 10 1.99772.0935
Table 3. Maximum errors, L 2 errors, convergence orders, and CPU time in seconds for Example 2 at T = 1 , a p = a q = 1 , b p = b q = 1.2 with τ = h p = h q .
Table 3. Maximum errors, L 2 errors, convergence orders, and CPU time in seconds for Example 2 at T = 1 , a p = a q = 1 , b p = b q = 1.2 with τ = h p = h q .
( η , σ ) τ = h p = h q L error order m L 2 error order 2 CPU(s)
(1.2, 1.8)1/4 2.1441 × 10 3 - 9.9306 × 10 4 -0.0164
1/8 5.1681 × 10 4 2.0527 2.4656 × 10 4 2.00990.0076
1/16 1.2652 × 10 4 2.0303 6.0392 × 10 5 2.02950.0155
1/32 3.0962 × 10 5 2.0308 1.4653 × 10 5 2.04310.1361
1/64 7.5627 × 10 6 2.0335 3.5437 × 10 6 2.04790.6257
1/128 2.1095 × 10 6 1.842 8.5769 × 10 7 2.04673.8980
(1.3, 1.7)1/4 2.2092 × 10 3 - 9.9462 × 10 4 -0.0077
1/8 5.3103 × 10 4 2.0566 2.4417 × 10 4 2.02630.0077
1/16 1.2932 × 10 4 2.0378 5.9397 × 10 5 2.03940.0336
1/32 3.1383 × 10 5 2.0429 1.4402 × 10 5 2.04420.1148
1/64 8.3628 × 10 6 1.9079 3.5005 × 10 6 2.04060.5898
1/128 2.5474 × 10 6 1.715 8.5536 × 10 7 2.0333.9085
(1.4, 1.6)1/4 2.2463 × 10 3 - 9.9341 × 10 4 -0.0038
1/8 5.3872 × 10 4 2.0599 2.4241 × 10 4 2.03490.0084
1/16 1.3074 × 10 4 2.0428 5.8792 × 10 5 2.04380.0367
1/32 3.1552 × 10 5 2.0509 1.4277 × 10 5 2.04190.1276
1/64 7.9727 × 10 6 1.9846 3.4954 e × 10 6 2.03020.5947
1/128 2.4315 × 10 6 1.7132 8.6459 × 10 7 2.01543.9343
Table 4. Maximum errors, convergence orders for Example 2 at T = 1 , b p = b q = 0.5 with τ = h p = h q .
Table 4. Maximum errors, convergence orders for Example 2 at T = 1 , b p = b q = 0.5 with τ = h p = h q .
Scheme (27) [32]
( η , σ ) τ = h p = h q l Order l Order
1/40 5.5484 × 10 6 - 5.6949 × 10 5 -
1/80 1.3355 × 10 6 2.0547 2.9406 × 10 5 0.9536
(1.5,1.5)1/160 3.22 × 10 7 2.0522 1.4925 × 10 5 0.9703
1/320 7.7859 × 10 8 2.0481 7.5139 × 10 6 0.9901
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Basha, M.; Anley, E.F.; Dai, B. Linearized Crank–Nicolson Scheme for the Two-Dimensional Nonlinear Riesz Space-Fractional Convection–Diffusion Equation. Fractal Fract. 2023, 7, 240. https://doi.org/10.3390/fractalfract7030240

AMA Style

Basha M, Anley EF, Dai B. Linearized Crank–Nicolson Scheme for the Two-Dimensional Nonlinear Riesz Space-Fractional Convection–Diffusion Equation. Fractal and Fractional. 2023; 7(3):240. https://doi.org/10.3390/fractalfract7030240

Chicago/Turabian Style

Basha, Merfat, Eyaya Fekadie Anley, and Binxiang Dai. 2023. "Linearized Crank–Nicolson Scheme for the Two-Dimensional Nonlinear Riesz Space-Fractional Convection–Diffusion Equation" Fractal and Fractional 7, no. 3: 240. https://doi.org/10.3390/fractalfract7030240

APA Style

Basha, M., Anley, E. F., & Dai, B. (2023). Linearized Crank–Nicolson Scheme for the Two-Dimensional Nonlinear Riesz Space-Fractional Convection–Diffusion Equation. Fractal and Fractional, 7(3), 240. https://doi.org/10.3390/fractalfract7030240

Article Metrics

Back to TopTop