Next Article in Journal
A New Two-Dimensional Map with Hidden Attractors
Next Article in Special Issue
Time-Fractional Diffusion with Mass Absorption in a Half-Line Domain due to Boundary Value of Concentration Varying Harmonically in Time
Previous Article in Journal
The Relationship between Postural Stability and Lower-Limb Muscle Activity Using an Entropy-Based Similarity Index
Previous Article in Special Issue
The Power Law Characteristics of Stock Price Jump Intervals: An Empirical and Computational Experimental Study
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Finite Difference Method for Time-Space Fractional Advection–Diffusion Equations with Riesz Derivative

1
The State Key Laboratory of Scientific and Engineering Computing (LSEC), The Institute of Computational Mathematics and Scientific/Engineering Computing (ICMSEC), Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China
2
COMSATS Institute of Information Technology, Lahore 54500, Pakistan
3
Department of Mathematics, Cankaya University, Ankara 06530, Turkey
4
Institute of Space Sciences, Magurele-Bucharest 077125, Romania
5
College of Mathematical Sciences, Yangzhou University, Yangzhou 225002, China
6
Department of Mathematics, King Saud University, P.O. Box 22452, Riyadh 11495, Saudi Arabia
7
School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, China
*
Authors to whom correspondence should be addressed.
Entropy 2018, 20(5), 321; https://doi.org/10.3390/e20050321
Submission received: 1 March 2018 / Revised: 20 April 2018 / Accepted: 20 April 2018 / Published: 26 April 2018
(This article belongs to the Special Issue Power Law Behaviour in Complex Systems)

Abstract

:
In this article, a numerical scheme is formulated and analysed to solve the time-space fractional advection–diffusion equation, where the Riesz derivative and the Caputo derivative are considered in spatial and temporal directions, respectively. The Riesz space derivative is approximated by the second-order fractional weighted and shifted Grünwald–Letnikov formula. Based on the equivalence between the fractional differential equation and the integral equation, we have transformed the fractional differential equation into an equivalent integral equation. Then, the integral is approximated by the trapezoidal formula. Further, the stability and convergence analysis are discussed rigorously. The resulting scheme is formally proved with the second order accuracy both in space and time. Numerical experiments are also presented to verify the theoretical analysis.

1. Introduction

The concepts of fractional calculus and entropy are becoming more popular for analyzing the dynamics of complex systems. The idea of entropy was introduced in the field of thermodynamics by Clausius (1862) and Boltzmann (1896) and was later applied by Shannon (1948) and Jaynes (1957) in information theory. Recently, more general entropy measures have being proposed for application in several types of complex systems due to the relaxation of the additivity axiom. The concept of entropy for analyzing the dynamics of multi-particle systems with integer and fractional order behavior was proposed in [1]. The entropy production rate for the fractional diffusion process was calculated in [2]. In [3] it has been shown that the total spectral entropy can be used as a measure of the information content in a fractional order model of anomalous diffusion.
Fractional calculus has been applied to almost every field of science, engineering, and mathematics during the last decades [4,5,6,7,8]. Particularly fractional calculus has significant impact in the fields of viscoelasticity and rheology, physics, electrical engineering, electrochemistry, signal and image processing, biology, biophysics and bioengineering, mechanics, mechatronics, and control theory. Fractional calculus is indeed a worthwhile mathematical tool that can undertake more than integer calculus. The monographs authored by Samko, Kilbas, Marichev [9], Podlubny [10] and Kilbas, Srivastava, Trujillo [7] have been helpful in understanding the theory and applications of fractional differential equations.
Numerous numerical methods have been proposed for solving the time-fractional differential equations. In this paper, we convert the fractional differential equation into the equivalent integral equation. Then, fractional trapezoidal formula is used to approximate fractional integral which has second-order accuracy [11,12]. Early in 1993, Tang [13] presented a finite difference method for the numerical solution of the partial integro-differential equations with a weakly singular kernel based on the product trapezoidal formula. Chen et al. [14] proposed fractional trapezoidal rule (FTR) type difference scheme by combining the second order difference quotient for spatial discretization and the FTR alternating direction implicit method in the time stepping for a two-dimensional fractional evolution equation. Chen et al. [15] derived a fractional trapezoidal rule type difference scheme for fractional order integro-differential equation with second order accuracy both in temporal and spatial directions. Recently, a finite difference scheme has been proposed in [16] to solve time-space fractional diffusion equation of second-order accuracy in both time and space by employing trapezoidal rule. Numerical schemes for linear and nonlinear time-space fractional diffusion equations were constructed in [17] using the trapezoidal formula for temporal approximation and the centred difference approximation for the spatial Riesz fractional derivative. Several numerical schemes have been proposed to approximate Riesz fractional derivative based on numerical methods to approximate Riemann–Liouville derivative such as standard Grünwald–Letnikov formula (first-order accuracy), shifted Grünwald–Letnikov formula (first-order accuracy) [18], L-2 approximation method [19] (first-order accuracy), spline interpolation method [20] (second-order accuracy), weighted and shifted Grünwald–Letnikov formulas [21] (second and third-order accuracy), fractional average central difference formula [22] (second and fourth-order accuracy). It is worth mentioning that high-order algorithms for Riemann–Liouville derivatives were first proposed by Lubich [23], however, the high order algorithms for Riesz derivatives were constructed by Ding and Li [22,24,25].
Many researchers studied the fractional advection–dispersion equation (ADE) recently. Fractional ADE is used for the description of transport dynamics in the complex systems which are controlled by the anomalous diffusion and the non-exponential relaxation patterns [26]. The fractional ADE is also used in groundwater hydrology research to model the transport of passive tracers carried by the fluid flow in a porous medium [27]. Our aim is to investigate the time-space fractional ADE. Time nonlocality deals with memory effects, whereas space nonlocality describes the long-range interaction. The fundamental idea is that fractional order models convey more information about the underlying structure and dynamics of complex systems. Total Shannon spectral entropy for the case of anomalous diffusion governed by a fractional order diffusion equation generalized in space and in time is calculated in [3] as it can be used as a measure of the information content in a fractional order model of anomalous diffusion. This fractional order representation of the continuous time, random walk model of diffusion gives a spectral entropy minimum for normal (i.e., Gaussian) diffusion with surrounding values leading to greater values of spectral entropy. Povstenko et al. [28] examined the fundamental solutions to space-time fractional diffusion equation with mass absorption (mass release) in the case of axial symmetry. Liu et al. [29] considered time fractional ADE and the solution was obtained using variable transformation, Mellin and Laplace transforms, and H-functions. Povstenko and Kyrylych [30] discussed two different generalizations of the space-time fractional advection–diffusion equation. They studied the fundamental solutions to the corresponding Cauchy and source problems for one spatial variable using Laplace transform and Fourier transform with respect to time and spatial coordinate, respectively. Huang and Liu [31] also considered time-space fractional ADE and obtained the solution in terms of Green functions. Meerschaert et al. [18] proposed numerical methods to solve the one-dimensional space fractional ADE with variable coefficients on a finite domain. Tripathi et al. [32] investigated the approximate analytical solution of fractional order nonlinear diffusion equations by using the homotopy analysis method. Momani et al. [33] developed a reliable algorithm using the Adomian decomposition method to construct a numerical solution for the time-space fractional ADE. Liu et al. [34] proposed an approximation of the Lëvy–Feller advection–dispersion process by employing a random walk and finite difference methods. Finite difference methods [35], finite element methods [36], finite volume methods [37], homotopy perturbation methods [38] and spectral methods [39,40] are also employed to approximate the fractional ADE. Furthermore, recent advances in numerical linear algebra had a substantial impact on designing efficient methods for the solution of the resulting linear systems which are dense but whose computational cost can be essentially reduced to O ( N log ( N ) ) where N is the size of the underlying coefficient matrix (see [41,42,43,44] and references therein). In this article, we construct a numerical scheme for the time-space fractional ADE by transforming the fractional differential equations into equivalent Volterra integral equations. As it is known that numerical methods for an integral equation have better numerical stability over the schemes designed for equivalent differential equation. Also the numerical methods for an integral equation can be constructed based on the weaker smoothness requirement than that for the differential equation. To the best of our knowledge, all of the other higher order methods are proposed based on the discretizations for fractional derivative directly.
This paper is organized as follows. In Section 2, some useful notations and auxiliary lemmas are introduced. In Section 3, the fractional trapezoidal scheme is derived combined with the second-order fractional weighted and shifted Grünwald–Letnikov formula for the approximation of the Riesz derivative. Section 4 is devoted to the study of the stability and convergence of the proposed scheme. Some numerical experiments are presented to verify the efficiency of our theoretical results in Section 5. The last section concludes our work.

2. Preliminaries

Definition 1.
The γ ( n 1 < γ < n ) order left and right Riemann–Liouville fractional derivatives of the function f on [ a , b ] are given by:
Left Riemann–Liouville fractional derivative:
a D x γ f ( x ) = 1 Γ ( n γ ) d n d x n a x ( x s ) n γ 1 f ( s ) d s ,
Right Riemann–Liouville fractional derivative:
x D b γ f ( x ) = ( 1 ) n Γ ( n γ ) d n d x n x b ( x s ) n γ 1 f ( s ) d s .
Definition 2.
The Caputo fractional derivative of order 0 < α < 1 of the function f on [ a , b ] is defined by:
c D t α f ( x ) = 1 Γ ( 1 α ) a x ( x s ) α 1 d d x f ( s ) d s .
Definition 3.
The Riemann–Louville fractional integral of order α > 0 of the function f on [ a , b ] is defined by:
I α f ( x ) = 1 Γ ( α ) a x ( x s ) α 1 f ( s ) d s .
In this paper, we will consider the following time-space fractional ADE
c D t α u ( x , t ) = K β 1 β 1 | x | β 1 u ( x , t ) + K β 2 β 2 | x | β 2 u ( x , t ) + f ( x , t ) , 0 < x < L , 0 < t T ,
with the initial conditions
u ( x , 0 ) = φ ( x ) , 0 x L ,
and the Dirichlet boundary conditions
u ( 0 , t ) = u ( L , t ) = 0 , 0 t T ,
where 0 < α < 1 , 0 < β 1 < 1 , 1 < β 2 2 , K β 1 0 , K β 2 > 0 and c D t α is the Caputo fractional derivative. In addition, β 1 | x | β 1 and β 2 | x | β 2 are the Riesz fractional derivatives of order β 1 and β 2 respectively, defined on the domain [ 0 , L ] as follows [19]
β 1 | x | β 1 u ( x , t ) = ρ β 1 [ 0 D x β 1 u ( x , t ) + x D L β 1 u ( x , t ) ] ,
β 2 | x | β 2 u ( x , t ) = ρ β 2 [ 0 D x β 2 u ( x , t ) + x D L β 2 u ( x , t ) ] ,
where
ρ β 1 = 1 2 cos π β 1 2 , ρ β 2 = 1 2 cos π β 2 2 ,
and
0 D x β 1 u ( x , t ) = 1 Γ ( 1 β 1 ) x 0 x ( x τ ) β 1 u ( τ , t ) d τ ,
x D L β 1 u ( x , t ) = 1 Γ ( 1 β 1 ) x x L ( τ x ) β 1 u ( τ , t ) d τ ,
0 D x β 2 u ( x , t ) = 1 Γ ( 2 β 2 ) 2 x 2 0 x ( x τ ) 1 β 2 u ( τ , t ) d τ ,
x D L β 2 u ( x , t ) = 1 Γ ( 2 β 2 ) 2 x 2 x L ( τ x ) 1 β 2 u ( τ , t ) d τ .
In the interval [ a , b ] , let x j = j h , ( j = 0 , 1 , M ) be mesh points in space, where h = b a M is the uniform spatial step size. Meerschaert and Tadjeran [18] showed that the standard Grünwald–Letnikov difference formula was often unstable for time dependent problems and they proposed the shifted Grünwald difference operators to approximate the left and right Riemann–Liouville fractional derivatives
A p f ( x ) = 1 h γ k = 0 g k ( γ ) f ( x ( k p ) h ) ,
B q f ( x ) = 1 h γ k = 0 g k ( γ ) f ( x + ( k q ) h ) ,
that have the first order accuracy given by,
A p f ( x ) = D x γ f ( x ) + O ( h ) ,
B q f ( x ) = x D + γ f ( x ) + O ( h ) ,
where p , q are integers, and g k ( γ ) = ( 1 ) k γ k . In fact, the coefficients g k ( γ ) are the coefficients of the power series of the function ( 1 z ) γ ,
( 1 z ) γ = k = 0 ( 1 ) k γ k z k = k = 0 g k ( γ ) z k ,
for all | z | 1 , and they can be evaluated recursively by using the following relation
g 0 ( γ ) = 1 , g k ( γ ) = 1 γ + 1 k g k 1 ( γ ) , k = 1 , 2 , .
Lemma 1 ([35]).
Suppose that 0 < β 1 < 1 , then the coefficients g k ( β 1 ) satisfy
g 0 ( β 1 ) = 1 , g 1 ( β 1 ) = β 1 < 0 , g 2 β 1 = β 1 ( β 1 1 ) 2 < 0 , g 1 ( β 1 ) < g 2 ( β 1 ) < g 3 ( β 1 ) < 0 , k = 0 g k ( β 1 ) = 0 , k = 0 M g k ( β 1 ) > 0 , M 1 .
Lemma 2 ([35]).
Suppose that 1 < β 2 2 , then the coefficients g k ( β 2 ) satisfy
g 0 ( β 2 ) = 1 , g 1 ( β 2 ) = β 2 < 0 , g k ( β 2 ) = β 2 ( β 2 1 ) 2 > 0 , 1 g 2 ( β 2 ) g 3 ( β 2 ) 0 , k = 0 g k ( β 2 ) = 0 , k = 0 M g k ( β 2 ) < 0 , M 1 .
Tian et al. in [21] derived the following weighted shifted Grünwald difference operators based on the multi-step method
L D p , q γ f ( x ) = γ 2 q 2 ( p q ) A p f ( x ) + 2 p γ 2 ( p q ) A q f ( x ) ,
R D p , q γ f ( x ) = γ 2 q 2 ( p q ) B p f ( x ) + 2 p γ 2 ( p q ) B q f ( x ) .
Lemma 3 ([21]).
Suppose that 1 < γ < 2 , let f ( x ) L 1 ( R ) , D γ f ( x ) , D + γ f ( x ) and their Fourier transforms belong to L 1 ( R ) , then the weighted and shifted Grünwald difference operators satisfy
L D p , q γ f ( x ) = D x γ f ( x ) + O ( h 2 ) ,
R D p , q γ f ( x ) = x D + γ f ( x ) + O ( h 2 ) ,
uniformly for x R , where p , q are integers and p q .
Consider a function f ( x ) under the same assumptions as in Lemma 3 on the bounded interval [ a , b ] , if f ( a ) = 0 or f ( b ) = 0 , the function f ( x ) can be zero extended for x < a or x > b . In addition, then, the γ order left and right Riemann–Liouville fractional derivatives of f ( x ) at each point x can be approximated with the second order accuracy as follows
a D x γ f ( x ) = λ 1 h γ k = 0 [ x a h ] + p g k ( γ ) f ( x ( k p ) h ) + λ 2 h γ k = 0 [ x a h ] + q g k ( γ ) f ( x ( k q ) h ) + O ( h 2 ) ,
x D b γ f ( x ) = λ 1 h γ k = 0 [ b x h ] + p g k ( γ ) f ( x + ( k p ) h ) + λ 2 h γ k = 0 [ b x h ] + q g k ( γ ) f ( x + ( k q ) h ) + O ( h 2 ) ,
where λ 1 = γ 2 q 2 ( p q ) and λ 2 = 2 p γ 2 ( p q ) .
Lemma 4.
When ( p , q ) = ( 1 , 0 ) the discrete approximations for the Riemann–Liouville fractional derivatives on the domain [ 0 , L ] are
0 D x γ f ( x j ) = 1 h γ k = 0 j + 1 w k ( γ ) f ( x j k + 1 ) + O ( h 2 ) ,
x D L γ f ( x j ) = 1 h γ k = 0 M j + 1 w k ( γ ) f ( x j + k 1 ) + O ( h 2 ) ,
where
w 0 ( γ ) = γ 2 g 0 ( γ ) , w k ( γ ) = γ 2 g k ( γ ) + 2 γ 2 g k 1 ( γ ) , k 1 .
Lemma 5 ([45]).
Suppose that 0 < β 1 < 1 , then the coefficients w k ( β 1 ) satisfy
w 0 ( β 1 ) = β 1 2 > 0 , w 1 ( β 1 ) = 2 β 1 β 1 2 2 > 0 , w 2 ( β 1 ) = β 1 ( β 1 2 + β 1 4 ) 4 < 0 , w 2 ( β 1 ) < w 3 ( β 1 ) < w 4 ( β 1 ) < < 0 , k = 0 w k ( β 1 ) = 0 , k = 0 M w k ( β 1 ) > 0 , M 1 .
Lemma 6 ([21]).
Suppose that 1 < β 2 2 , then the coefficients w k β 2 satisfy
w 0 ( β 2 ) = β 2 2 > 0 , w 1 ( β 2 ) = 2 β 2 β 2 2 2 < 0 , w 2 ( β 2 ) = β 2 ( β 2 2 + β 2 4 ) 4 , 1 w 0 ( β 2 ) w 3 ( β 2 ) w 4 ( β 2 ) 0 , k = 0 w k ( β 2 ) = 0 , k = 0 M w k ( β 2 ) < 0 , M 2 .
Lemma 7 ([46]).
Suppose u ( t ) C 3 [ 0 , T ] , for ξ ( t j , t j + 1 ) , there exists a positive constant C > 0 , such that
u ( ξ ) ( t j + 1 ξ ) u ( t j ) + ( ξ t j ) u ( t j + 1 ) τ C τ 2 .
Lemma 8 ([47]).
Let
b n α = ( n + 1 ) α n α , n = 0 , 1 , 2 , ,
then b n α = ( n + 1 ) α n α , ( n = 0 , 1 , 2 , ) satisfy the following properties
1.
b 0 α = 1 , b n α > 0 , n = 0 , 1 , 2 , ,
2.
b n α > b n + 1 α , n = 0 , 1 , 2 , ,
3.
there exists a positive constant C > 0 , such that τ C b n α τ α , n = 1 , 2 , 3 , .
Lemma 9 ([46]).
Suppose u ( t ) C 3 [ 0 , T ] , then we have
I α u ( t n + 1 ) I α u ( t n ) = τ α Γ ( α + 1 ) a n α a n 1 α u ( t 0 ) + l = 0 n 1 ( d l + 1 d l ) u ( t n l ) + c 0 α u ( t n + 1 ) + R 1 ,
for n = 0 , 1 , 2 , , N 1 , where
a n α = ( n + 1 ) α 1 α + 1 [ ( n + 1 ) α + 1 n α + 1 ] , n = 0 , 1 , 2 , ,
c n α = 1 α + 1 [ ( n + 1 ) α + 1 n α + 1 ] n α , n = 0 , 1 , 2 , ,
d n α = a n 1 α + c n α = 1 α + 1 [ ( n + 1 ) α + 1 2 n α + 1 + ( n 1 ) α + 1 ] , n = 0 , 1 , 2 , ,
and R 1 depends on τ with
| R 1 | C τ α + 2 ( a n α + c n α ) = C τ α + 2 b n α .
Here, we assume a 1 α = 0 , that is,
d 0 α = c 0 α .
Lemma 10 ([46]).
Suppose that a n α , c n α , d n α are defined by Lemma 9, then we can conclude that:
1.
a n α , ( n = 1 , 2 , ) are monotonically decreasing when n increases.
2.
c n α , ( n = 0 , 1 , 2 , ) are monotonically decreasing when n increases.
3.
d n α , ( n = 1 , 2 , ) are monotonically decreasing when n increases.

3. Finite Difference Approximation

We define t n = n τ , n = 0 , 1 , , N and x j = j h , j = 0 , 1 , M , where τ = T / N , and h = L / M are the time and space step sizes, respectively. Considering system (1)–(3) at the point ( x j , t n ) , we have
c D t α u ( x j , t n ) = K β 1 β 1 | x j | β 1 u ( x j , t n ) + K β 2 β 2 | x j | β 2 u ( x j , t n ) + f ( x j , t n ) , 1 j M 1 , 1 < n < N , u ( x j , 0 ) = φ ( x j ) , 0 j M , u ( x 0 , t n ) = u ( x M , t n ) = 0 , 1 n N .
Assume that u j n denotes the numerical approximation of u ( x j , t n ) . We can discretize the Riesz fractional derivatives β 1 | x | β 1 and β 2 | x | β 2 in truncated bounded domain as follows:
δ x β 1 u ( x j , t n ) = 1 2 cos π β 1 2 h β 1 k = 0 j + 1 w k ( β 1 ) u j k + 1 n + k = 0 M j + 1 w k ( β 1 ) u j + k 1 n + O ( h 2 ) ,
δ x β 2 u ( x j , t n ) = 1 2 cos π β 2 2 h β 2 k = 0 j + 1 w k ( β 2 ) u j k + 1 n + k = 0 M j + 1 w k ( β 2 ) u j + k 1 n + O ( h 2 ) .
Let μ 1 = K β 1 ρ β 1 h β 1 and μ 2 = K β 2 ρ β 2 h β 2 . Noting that μ 1 > 0 and μ 2 < 0 since ρ β 1 = 1 2 cos π β 1 2 > 0 for 0 < β 1 1 and ρ β 2 = 1 2 cos π β 2 2 < 0 for 1 < β 2 2 . Using the approximation to the Riesz fractional derivative given in (15) and (16) into (14), we obtain
c D t α u ( x j , t n ) = μ 1 k = 0 j + 1 w k ( β 1 ) u j k + 1 n + k = 0 M j + 1 w k ( β 1 ) u j + k 1 n μ 2 k = 0 j + 1 w k ( β 2 ) u j k + 1 n + k = 0 M j + 1 w k ( β 2 ) u j + k 1 n + f ( x j , t n ) ,
where 1 j M 1 , 1 < n < N , with initial and boundary conditions discretized as follows:
u j ( 0 ) = u j 0 , 0 j M , u 0 n = u M n = 0 , 1 n N .

Fractional Trapezoid Formula

In this subsection and in the sequel, the symbol C denotes a generic constant, whose value may be different from one line to another. Integrating both sides of (17) with respect to the time t from t n to t n + 1 , and using Lemmas 4, 7 and 9, we obtain
u j n + 1 u j n = ν α c 0 α μ 1 k = 0 j + 1 w k ( β 1 ) u j k + 1 n + 1 k = 0 M j + 1 w k ( β 1 ) u j + k 1 n + 1 μ 2 k = 0 j + 1 w k ( β 2 ) u j k + 1 n + 1 + k = 0 M j + 1 w k ( β 2 ) u j + k 1 n + 1 R 2 ν α ( a n α a n 1 α ) μ 1 k = 0 j + 1 w k ( β 1 ) u j k + 1 0 + k = 0 M j + 1 w k ( β 1 ) u j + k 1 0 + μ 2 k = 0 j + 1 w k ( β 2 ) u j k + 1 0 + k = 0 M j + 1 w k ( β 2 ) u j + k 1 0 R 2 ν α l = 0 n 1 ( d l + 1 α d l α ) + μ 1 k = 0 j + 1 w k ( β 1 ) u j k + 1 n l + k = 0 M j + 1 w k ( β 1 ) u j + k 1 n l + μ 2 k = 0 j + 1 w k ( β 2 ) u j k + 1 n l + k = 0 M j + 1 w k ( β 2 ) u j + k 1 n l R 2 + ( I α f ( x j , t n + 1 ) I α f ( x j , t n ) + R 1 ) = μ 1 ν α c 0 α k = 0 j + 1 w k ( β 1 ) u j k + 1 n + 1 + k = 0 M j + 1 w k ( β 1 ) u j + k 1 n + 1 + ( a n α a n 1 α ) k = 0 j + 1 w k ( β 1 ) u j k + 1 0 + k = 0 M j + 1 w k ( β 1 ) u j + k 1 0 + l = 0 n 1 ( d l + 1 α d l α ) k = 0 j + 1 w k ( β 1 ) u j k + 1 n l + k = 0 M j + 1 w k ( β 1 ) u j + k 1 n l μ 2 ν α c 0 α k = 0 j + 1 w k ( β 2 ) u j k + 1 n + 1 + k = 0 M j + 1 w k ( β 2 ) u j + k 1 n + 1 + ( a n α a n 1 α ) k = 0 j + 1 w k ( β 2 ) u j k + 1 0 + k = 0 M j + 1 w k ( β 2 ) u j + k 1 0 + l = 0 n 1 ( d l + 1 α d l α ) k = 0 j + 1 w k ( β 2 ) u j k + 1 n l + k = 0 M j + 1 w k ( β 2 ) u j + k 1 n l + ( f ˜ ( x j , t n + 1 ) f ˜ ( x j , t n ) ) + R 3 ,
where R 2 depends on h and by using Lemma 4, we have
| R 2 | C h 2 ,
and
ν α = τ α Γ ( α + 1 ) , f ˜ ( x j , t n ) = 1 Γ ( α ) 0 t n ( t n s ) α 1 f ( x j , s ) d s ,
R 3 = R 1 + [ c 0 α ( u j k + 1 n + 1 + u j + k 1 n + 1 ) + ( a n α a n 1 α ) ( u j k + 1 0 + u j + k 1 0 ) + l = 0 n 1 ( d l + 1 α d l α ) ( u j k + 1 n l + u j + k 1 n l ) ] R 2 .
Here R 3 depends on τ and h as by Lemma 7, we get
| R 3 | = C τ 2 + α b n α + C τ α h 2 b n α = C τ α b n α ( τ 2 + h 2 ) .
Letting η 1 = μ 1 ν α 0 , η 2 = μ 2 ν α 0 , we obtain
u j n + 1 u j n = η 1 c 0 α k = 0 j + 1 w k ( β 1 ) u j k + 1 n + 1 + k = 0 M j + 1 w k ( β 1 ) u j + k 1 n + 1 + ( a n α a n 1 α ) k = 0 j + 1 w k ( β 1 ) u j k + 1 0 + k = 0 M j + 1 w k ( β 1 ) u j + k 1 0 + l = 0 n 1 ( d l + 1 α d l α ) k = 0 j + 1 w k ( β 1 ) u j k + 1 n l + k = 0 M j + 1 w k ( β 1 ) u j + k 1 n l η 2 c 0 α k = 0 j + 1 w k ( β 2 ) u j k + 1 n + 1 + k = 0 M j + 1 w k ( β 2 ) u j + k 1 n + 1 + ( a n α a n 1 α ) k = 0 j + 1 w k ( β 2 ) u j k + 1 0 + k = 0 M j + 1 w k ( β 2 ) u j + k 1 0 + l = 0 n 1 ( d l + 1 α d l α ) k = 0 j + 1 w k ( β 2 ) u j k + 1 n l + k = 0 M j + 1 w k ( β 2 ) u j + k 1 n l + ( f ˜ ( x j , t n + 1 ) f ˜ ( x j , t n ) ) + C τ α b n α ( τ 2 + h 2 ) .
Hence, the solution for system (1)–(3) can be approximated by the following scheme:
u j n + 1 + η 1 c 0 α k = 0 j + 1 w k ( β 1 ) u j k + 1 n + 1 + k = 0 M j + 1 w k ( β 1 ) u j + k 1 n + 1 + η 2 c 0 α k = 0 j + 1 w k ( β 2 ) u j k + 1 n + 1 + k = 0 M j + 1 w k ( β 2 ) u j + k 1 n + 1 = u j n η 1 ( a n α a n 1 α ) k = 0 j + 1 w k ( β 1 ) u j k + 1 0 + k = 0 M j + 1 w k ( β 1 ) u j + k 1 0 + l = 0 n 1 ( d l + 1 α d l α ) k = 0 j + 1 w k ( β 1 ) u j k + 1 n l + k = 0 M j + 1 w k ( β 1 ) u j + k 1 n l η 2 ( a n α a n 1 α ) k = 0 j + 1 w k ( β 2 ) u j k + 1 0 + k = 0 M j + 1 w k ( β 2 ) u j + k 1 0 + l = 0 n 1 ( d l + 1 α d l α ) k = 0 j + 1 w k ( β 2 ) u j k + 1 n l + k = 0 M j + 1 w k ( β 2 ) u j + k 1 n l + ( f ˜ j n + 1 f ˜ j n ) ,
where f ˜ j n = f ˜ ( x j , t n ) . We can write this system into the following matrix form:
I + η 1 c 0 α ( B 1 + B 1 T ) + c 0 α η 2 ( B 2 + B 2 T ) U n + 1 = U n ( a n α a n 1 α ) ( η 1 ( B 1 + B 1 T ) + η 2 ( B 2 + B 2 T ) ) U 0 ( η 1 ( B 1 + B 1 T ) + η 2 ( B 2 + B 2 T ) ) l = 0 n 1 ( d l + 1 α d l α ) U n l + ( F ˜ n + 1 F ˜ n ) + C τ α b n α ( τ 2 + h 2 ) ,
where
U n = ( u 1 n , u 2 n , , u M 1 n ) T , F ˜ n = ( f ˜ 1 n , f ˜ 2 n , , f ˜ M 1 n ) T ,
with I is an ( M 1 ) × ( M 1 ) identity matrix, B 1 and B 2 are ( M 1 ) × ( M 1 ) matrices that satisfy
B 1 = w 1 ( β 1 ) w 0 ( β 1 ) 0 0 0 w 2 ( β 1 ) w 1 ( β 1 ) w 0 β 2 0 0 w 3 ( β 1 ) w 2 ( β 1 ) w 1 β 2 0 0 w M 2 ( β 1 ) w M 3 ( β 1 ) w M 4 ( β 1 ) w 1 ( β 1 ) w 0 ( β 1 ) w M 1 ( β 1 ) w M 2 ( β 1 ) w M 3 ( β 1 ) w 2 ( β 1 ) w 1 ( β 1 ) ,
B 2 = w 1 ( β 2 ) w 0 ( β 2 ) 0 0 0 w 2 ( β 2 ) w 1 ( β 2 ) w 0 ( β 2 ) 0 0 w 3 ( β 2 ) w 2 ( β 2 ) w 1 ( β 2 ) 0 0 w M 2 ( β 2 ) w M 3 ( β 2 ) w M 4 ( β 2 ) w 1 ( β 2 ) w 0 ( β 2 ) w M 1 ( β 2 ) w M 2 ( β 2 ) w M 3 ( β 2 ) w 2 ( β 2 ) w 1 ( β 2 ) .
Let
B 1 = B 1 + B 1 T , B 2 = B 2 + B 2 T , A = η 1 B 1 + η 2 B 2 ,
then we obtain the following numerical scheme based on fractional trapezoid formula
( I + c 0 α A ) U n + 1 = U n A ( a n α a n 1 α ) U 0 A l = 0 n 1 ( d l + 1 α d l α ) U n l + ( F ˜ n + 1 F ˜ n ) ,
with initial and boundary conditions
U ( 0 ) = U 0 u 0 n = u M n = 0 , 1 n N .

4. Stability and Convergence Analysis

4.1. Stability

In this section, we analyze the stability and convergence for the scheme (26).
Remark 1.
For n = 0 , d 0 α = c 0 α = 1 1 + α , d 1 α = a 0 α + c 1 α = 2 α + 1 2 α + 1 . If
2 α + 1 3 ,
then we obtain
d 0 α > d 1 α .
Remark 2.
Let b n α be as defined in Lemma 8, then c 0 α b n α , n = 0 , 1 , 2 , , where 0 < c 0 α = 1 1 + α < 1 , 0 < b n α < 1 , n = 0 , 1 , 2 , . Using d n α = a n 1 α + c n α , we have
0 < a n 1 α a n α + d 0 α d n α = a n 1 α a n α + d 0 α ( a n 1 α + c n α ) = d 0 α ( a n α + c n α ) = d 0 α b n α = c 0 α b n α .
Lemma 11.
w 2 ( β 2 ) 0 if
17 1 2 β 2 2 .
Proof. 
Since w 2 ( β 2 ) 0 is equivalent to
β 2 2 + β 2 4 0 ,
that is
17 1 2 β 2 2 .
 ☐
Let u ˜ j n numerical solution of the numerical scheme (21) with a different initial value u ˜ j 0 , and
ε j n = u ˜ j n u j n , n = 0 , 1 , N , j = 1 , 2 , M 1 .
According to (21), we have
ε j n + 1 + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) ε j k + 1 n + 1 + k = 0 M j + 1 w k ( β 1 ) ε j + k 1 n + 1 + η 2 k = 0 j + 1 w k ( β 2 ) ε j k + 1 n + 1 + k = 0 M j + 1 w k ( β 2 ) ε j + k 1 n + 1 = ε j n ( a n α a n 1 α ) η 1 k = 0 j + 1 w k ( β 1 ) ε j k + 1 0 + k = 0 M j + 1 w k ( β 1 ) ε j + k 1 0 + η 2 k = 0 j + 1 w k ( β 2 ) ε j k + 1 0 + k = 0 M j + 1 w k ( β 2 ) ε j + k 1 0 l = 0 n 1 ( d l + 1 α d l α ) η 1 k = 0 j + 1 w k ( β 1 ) ε j k + 1 n l + k = 0 M j + 1 w k ( β 1 ) ε j + k 1 n l + η 2 k = 0 j + 1 w k ( β 2 ) ε j k + 1 n l + k = 0 M j + 1 w k ( β 2 ) ε j + k 1 n l .
For convenience, we suppose that
S ( β ) = k = 0 j + 1 w k ( β ) , S ¯ ( β ) = k = 0 M j + 1 w k ( β ) .
Put E n = ( ε 1 n , ε 2 n , , ε M 1 n ) , n = 0 , 1 , 2 , N , and assume that
E n = max 1 j M 1 | ε j n | = | ε j ^ n | .
Theorem 1.
Suppose (28) and (29) hold. Then, the fractional numerical scheme (26) is stable, i.e.,
E n + 1 E 0 , n = 0 , 1 , , N 1 .
Proof. 
We prove by mathematical induction. For n = 0 , (30) can be written as
ε j 1 + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) ε j k + 1 1 + k = 0 M j + 1 w k ( β 1 ) ε j + k 1 1 + η 2 k = 0 j + 1 w k ( β 2 ) ε j k + 1 1 + k = 0 M j + 1 w k ( β 2 ) ε j + k 1 1 = ε j 0 a 1 α η 1 k = 0 j + 1 w k ( β 1 ) ε j k + 1 0 + k = 0 M j + 1 w k ( β 1 ) ε j + k 1 0 + η 2 k = 0 j + 1 w k ( β 2 ) ε j k + 1 0 + k = 0 M j + 1 w k ( β 2 ) ε j + k 1 0 ,
that is
ε j 1 + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) ε j k + 1 1 + k = 0 M j + 1 w k ( β 1 ) ε j + k 1 1 + η 2 k = 0 j + 1 w k ( β 2 ) ε j k + 1 1 + k = 0 M j + 1 w k ( β 2 ) ε j + k 1 1 + a 1 α η 1 k = 0 j + 1 w k ( β 1 ) ε j k + 1 0 + k = 0 M j + 1 w k ( β 1 ) ε j + k 1 0 + η 2 k = 0 j + 1 w k ( β 2 ) ε j k + 1 0 + k = 0 M j + 1 w k ( β 2 ) ε j + k 1 0 = ε j 0 .
Using | v 1 | | v 2 | | v 1 v 2 | and (32), we have
E 1 = | ε j ^ 1 | | ε j ^ 1 | + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) | ε j ^ 1 | + k = 0 M j + 1 w k ( β 1 ) | ε j ^ 1 | + η 2 k = 0 j + 1 w k ( β 2 ) | ε j ^ 1 | + k = 0 M j + 1 w k ( β 2 ) | ε j ^ 1 | + a 0 α η 1 k = 0 j + 1 w k ( β 1 ) | ε j ^ 0 | + k = 0 M j + 1 w k ( β 1 ) | ε j ^ 0 | + η 2 k = 0 j + 1 w k ( β 2 ) | ε j ^ 0 | + k = 0 M j + 1 w k ( β 2 ) | ε j ^ 0 | | ε j ^ 1 | + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) | ε j ^ k + 1 1 | + k = 0 M j + 1 w k ( β 1 ) | ε j ^ + k 1 1 | + η 2 k = 0 j + 1 w k ( β 2 ) | ε j ^ k + 1 1 | + k = 0 M j + 1 w k ( β 2 ) | ε j ^ + k 1 1 | + a 0 α η 1 k = 0 j + 1 w k ( β 1 ) | ε j ^ k + 1 0 | + k = 0 M j + 1 w k ( β 1 ) | ε j ^ + k 1 0 | + η 2 k = 0 j + 1 w k ( β 2 ) | ε j ^ k + 1 0 | + k = 0 M j + 1 w k ( β 2 ) | ε j ^ + k 1 0 | = ( | ε j ^ 1 | + 2 ( c 0 α | ε j ^ 1 | + a 0 α | ε j ^ 0 | ) ( η 1 w 1 ( β 1 ) + η 2 w 1 ( β 2 ) ) ) + c 0 α η 1 k = 0 , k 1 j + 1 w k ( β 1 ) | ε j ^ k + 1 1 | + k = 0 , k 1 M j + 1 w k ( β 1 ) | ε j ^ + k 1 1 | + η 2 k = 0 , k 1 j + 1 w k ( β 2 ) | ε j ^ k + 1 1 | + k = 0 , k 1 M j + 1 w k ( β 2 ) | ε j ^ + k 1 1 | + a 0 α η 1 k = 0 , k 1 j + 1 w k ( β 1 ) | ε j ^ k + 1 0 | + k = 0 , k 1 M j + 1 w k ( β 1 ) | ε j ^ + k 1 0 | + η 2 k = 0 , k 1 j + 1 w k ( β 2 ) | ε j ^ k + 1 0 | + k = 0 , k 1 M j + 1 w k ( β 2 ) | ε j ^ + k 1 0 | ε j ^ 1 + 2 ( c 0 α | ε j ^ 1 | + a 0 α | ε j ^ 0 | ) ( η 1 w 1 ( β 1 ) + η 2 w 1 ( β 2 ) ) + c 0 α η 1 k = 0 , k 1 j + 1 w k ( β 1 ) ε j ^ k + 1 1 + k = 0 , k 1 M j + 1 w k ( β 1 ) ε j ^ + k 1 1 + η 2 k = 0 , k 1 j + 1 w k ( β 2 ) ε j ^ k + 1 1 + k = 0 , k 1 M j + 1 w k ( β 2 ) ε j ^ + k 1 1 + a 0 α η 1 k = 0 , k 1 j + 1 w k ( β 1 ) | ε j ^ k + 1 0 | + k = 0 , k 1 M j + 1 w k ( β 1 ) | ε j ^ + k 1 0 | + η 2 k = 0 , k 1 j + 1 w k ( β 2 ) | ε j ^ k + 1 0 | + k = 0 , k 1 M j + 1 w k ( β 2 ) | ε j ^ + k 1 0 | = ε j ^ 1 + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) ε j ^ k + 1 1 + k = 0 M j + 1 w k ( β 1 ) ε j ^ + k 1 1 + η 2 k = 0 j + 1 w k ( β 2 ) ε j ^ k + 1 1 + k = 0 M j + 1 w k ( β 2 ) ε j ^ + k 1 1 + a 0 α η 1 k = 0 j + 1 w k ( β 1 ) ε j ^ k + 1 0 + k = 0 M j + 1 w k ( β 1 ) ε j ^ + k 1 0 + η 2 k = 0 j + 1 w k ( β 2 ) ε j ^ k + 1 0 + k = 0 M j + 1 w k ( β 2 ) ε j ^ + k 1 0 = | ε j ^ 0 | .
Hence, we obtain
E 1 E 0 .
Now suppose that
E k E 0 , k = 0 , 1 , 2 , , n .
Using | v 1 | | v 2 | | v 1 v 1 | and (30), we have
1 + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) + k = 0 M j + 1 w k ( β 1 ) + η 2 k = 0 j + 1 w k ( β 2 ) + k = 0 M j + 1 w k ( β 2 ) | ε j ^ n + 1 | | ε j ^ n + 1 | + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) | ε j ^ k + 1 n + 1 | + k = 0 M j + 1 w k ( β 1 ) | ε j ^ + k 1 n + 1 | + η 2 k = 0 j + 1 w k ( β 2 ) | ε j ^ k + 1 n + 1 | + k = 0 M j + 1 w k ( β 2 ) | ε j ^ + k 1 n + 1 | = ( 1 + 2 c 0 α ( η 1 w 0 ( β 1 ) + η 2 w 1 ( β 2 ) ) | ε j ^ n + 1 | ) + c 0 α η 1 k = 0 , k 1 j + 1 w k ( β 1 ) | ε j ^ k + 1 n + 1 | + k = 0 , k 1 M j + 1 w k ( β 1 ) | ε j ^ + k 1 n + 1 | + η 2 k = 0 , k 1 j + 1 w k ( β 2 ) | ε j ^ k + 1 n + 1 | + k = 0 , k 1 M j + 1 w k ( β 2 ) | ε j ^ + k 1 n + 1 | ε j ^ n + 1 + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) ε j ^ k + 1 n + 1 + k = 0 M j + 1 w k ( β 1 ) ε j ^ + k 1 n + 1 + η 2 k = 0 j + 1 w k ( β 2 ) ε j ^ k + 1 n + 1 + k = 0 M j + 1 w k ( β 2 ) ε j ^ + k 1 n + 1 = ε j ^ n ( a n α a n 1 α ) η 1 k = 0 j + 1 w k ( β 1 ) ε j ^ k + 1 0 + k = 0 M j + 1 w k ( β 1 ) ε j ^ + k 1 0 + η 2 k = 0 j + 1 w k ( β 2 ) ε j ^ k + 1 0 + k = 0 M j + 1 w k ( β 2 ) ε j ^ + k 1 0 l = 0 n 1 ( d l + 1 α d l α ) η 1 k = 0 j + 1 w k ( β 1 ) ε j ^ k + 1 n l + k = 0 M j + 1 w k ( β 1 ) ε j ^ + k 1 n l + η 2 k = 0 j + 1 w k ( β 2 ) ε j ^ k + 1 n l + k = 0 M j + 1 w k ( β 2 ) ε j ^ + k 1 n l | ε j ^ n | ( a n α a n 1 α ) η 1 k = 0 j + 1 w k ( β 1 ) | ε j ^ k + 1 0 | + k = 0 M j + 1 w k ( β 1 ) | ε j ^ + k 1 0 | + η 2 k = 0 j + 1 w k ( β 2 ) | ε j ^ k + 1 0 | + k = 0 M j + 1 w k ( β 2 ) | ε j ^ + k 1 0 | l = 0 n 1 ( d l + 1 α d l α ) η 1 k = 0 j + 1 w k ( β 1 ) | ε j ^ k + 1 n 1 | + k = 0 M j + 1 w k ( β 1 ) | ε j ^ + k 1 n 1 | + η 2 k = 0 j + 1 w k ( β 2 ) | ε j ^ k + 1 n 1 | + k = 0 M j + 1 w k ( β 2 ) | ε j ^ + k 1 n 1 | = E 0 ( a n α a n 1 α ) η 1 k = 0 j + 1 w k ( β 1 ) E 0 + k = 0 M j + 1 w k ( β 1 ) E 0 + η 2 k = 0 j + 1 w k ( β 2 ) E 0 + k = 0 M j + 1 w k ( β 2 ) E 0 ( d n α d 0 α ) η 1 k = 0 j + 1 w k ( β 1 ) E 0 + k = 0 M j + 1 w k ( β 1 ) E 0 + η 2 k = 0 j + 1 w k ( β 2 ) E 0 + k = 0 M j + 1 w k ( β 2 ) E 0 = 1 ( a n α a n 1 α + d n α d 0 α ) η 1 k = 0 j + 1 w k ( β 1 ) + k = 0 M j + 1 w k ( β 1 ) + η 2 k = 0 j + 1 w k ( β 2 ) + k = 0 M j + 1 w k ( β 2 ) E 0 = 1 + ( c 0 α b n α ) η 1 k = 0 j + 1 w k ( β 1 ) + k = 0 M j + 1 w k ( β 1 ) + η 2 k = 0 j + 1 w k ( β 2 ) + k = 0 M j + 1 w k ( β 2 ) E 0 ,
hence
E n + 1 1 + ( c 0 α b n α ) [ η 1 ( S ( β 1 ) + S ¯ ( β 1 ) ) + η 2 ( S ( β 2 ) + S ¯ ( β 2 ) ) ] 1 + c 0 α [ η 1 ( S ( β 1 ) + S ¯ ( β 1 ) ) + η 2 ( S ( β 2 ) + S ¯ ( β 2 ) ) ] E 0 E 0 .
 ☐

4.2. Convergence

Let the error at the grid points ( x j , t n ) be defined by
e j n = u ( x j , t n ) u j n , n = 0 , 1 , N , j = 1 , 2 , M 1 ,
and we denote E n = ( e 1 n , e 2 n , , e M 1 n ) T . According to (22), the error satisfies
e j n + 1 + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) e j k + 1 n + 1 + k = 0 M j + 1 w k ( β 1 ) e j + k 1 n + 1 + η 2 k = 0 j + 1 w k ( β 2 ) e j k + 1 n + 1 + k = 0 M j + 1 w k ( β 2 ) e j + k 1 n + 1 = e j n l = 0 n 1 ( d l + 1 α d l α ) η 1 k = 0 j + 1 w k ( β 1 ) e j k + 1 n l + k = 0 M j + 1 w k ( β 1 ) e j + k 1 n l + η 2 k = 0 j + 1 w k ( β 2 ) e j k + 1 n l + k = 0 M j + 1 w k ( β 2 ) e j + k 1 n l + τ α b n α C ( τ 2 + h 2 ) .
Put E n = ( e 1 n , e 2 n , , e M 1 n ) , n = 0 , 1 , 2 , N , and assume that
E n = max 1 j M 1 | e j n | = | e j ^ n | .
Theorem 2.
Suppose (28) and (29) hold. Then, the fractional numerical scheme (26) is convergent with accuracy O ( τ 2 + h 2 ) , that is, there exists a positive constant C such that
E n + 1 C ( τ 2 + h 2 ) , n = 0 , 1 , , N 1 .
Proof. 
We prove by mathematical induction. For n = 0 , (33) can be written as
e j 1 + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) e j k + 1 1 + k = 0 M j + 1 w k ( β 1 ) e j + k 1 1 + η 2 k = 0 j + 1 w k ( β 2 ) e j k + 1 1 + k = 0 M j + 1 w k ( β 2 ) e j + k 1 1 = τ α b 0 α C ( τ 2 + h 2 ) .
Using | v 1 | | v 2 | | v 1 v 2 | and (34), we have
E 1 = | e j ^ 1 | | e j ^ 1 | + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) | e j ^ 1 | + k = 0 M j + 1 w k ( β 1 ) | e j ^ 1 | + η 2 k = 0 j + 1 w k ( β 2 ) | e j ^ 1 | + k = 0 M j + 1 w k ( β 2 ) | e j ^ 1 | | e j ^ 1 | + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) | e j ^ k + 1 1 | + k = 0 M j + 1 w k ( β 1 ) | e j ^ + k 1 1 | + η 2 k = 0 j + 1 w k ( β 2 ) | e j ^ k + 1 1 | + k = 0 M j + 1 w k ( β 2 ) | e j ^ + k 1 1 | = ( 1 + 2 c 0 α ( η 1 w 1 ( β 1 ) + η 2 w 1 ( β 2 ) ) ) | e j ^ 1 | + c 0 α η 1 k = 0 , k 1 j + 1 w k ( β 1 ) | e j ^ 1 | + k = 0 , k 1 M j + 1 w k ( β 1 ) | e j ^ 1 | + η 2 k = 0 , k 1 j + 1 w k ( β 2 ) | e j ^ 1 | + k = 0 , k 1 M j + 1 w k ( β 2 ) | e j ^ 1 | e j ^ 1 + 2 c 0 α e j ^ 1 ( η 1 w 1 ( β 1 ) + η 2 w 1 ( β 2 ) ) + c 0 α η 1 k = 0 , k 1 j + 1 w k ( β 1 ) e j ^ k + 1 1 + k = 0 , k 1 M j + 1 w k ( β 1 ) e j ^ + k 1 1 + η 2 k = 0 , k 1 j + 1 w k ( β 2 ) e j ^ k + 1 1 + k = 0 , k 1 M j + 1 w k ( β 2 ) e j ^ + k 1 1 = e j ^ 1 + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) e j ^ k + 1 1 + k = 0 M j + 1 w k ( β 1 ) e j ^ + k 1 1 + η 2 k = 0 j + 1 w k ( β 2 ) e j ^ k + 1 1 + k = 0 M j + 1 w k ( β 2 ) e j ^ + k 1 1 = τ α b 0 α C ( τ 2 + h 2 ) τ α C ( τ 2 + h 2 ) .
Hence, we get
E 1 τ α C ( τ 2 + h 2 ) .
Now suppose that
E k τ α n α C ( τ 2 + h 2 ) , k = 0 , 1 , 2 , , n .
Using | v 1 | | v 2 | | v 1 v 2 | and (33), it yields
1 + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) + k = 0 M j + 1 w k ( β 1 ) + η 2 k = 0 j + 1 w k ( β 2 ) + k = 0 M j + 1 w k ( β 2 ) | e j ^ n + 1 | | e j ^ n + 1 | + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) | e j ^ k + 1 n + 1 | + k = 0 M j + 1 w k ( β 1 ) | e j ^ + k 1 n + 1 | + η 2 k = 0 j + 1 w k ( β 2 ) | e j ^ k + 1 n + 1 | + k = 0 M j + 1 w k ( β 2 ) | e j ^ + k 1 n + 1 | = ( 1 + 2 c 0 α ( η 1 w 0 ( β 1 ) + η 2 w 1 ( β 2 ) ) | e j ^ n + 1 | ) + c 0 α η 1 k = 0 , k 1 j + 1 w k ( β 1 ) | e j ^ k + 1 n + 1 | + k = 0 , k 1 M j + 1 w k ( β 1 ) | e j ^ + k 1 n + 1 | + η 2 k = 0 , k 1 j + 1 w k ( β 2 ) | e j ^ k + 1 n + 1 | + k = 0 , k 1 M j + 1 w k ( β 2 ) | e j ^ + k 1 n + 1 | e j ^ n + 1 + c 0 α η 1 k = 0 j + 1 w k ( β 1 ) e j ^ k + 1 n + 1 + k = 0 M j + 1 w k ( β 1 ) e j ^ + k 1 n + 1 + η 2 k = 0 j + 1 w k ( β 2 ) e j ^ k + 1 n + 1 + k = 0 M j + 1 w k ( β 2 ) e j ^ + k 1 n + 1 = | e j ^ n l = 0 n 1 ( d l + 1 α d l α ) η 1 k = 0 j + 1 w k ( β 1 ) e j ^ k + 1 n l + k = 0 M j + 1 w k ( β 1 ) e j ^ + k 1 n l + η 2 k = 0 j + 1 w k ( β 2 ) e j ^ k + 1 n l + k = 0 M j + 1 w k ( β 2 ) e j ^ + k 1 n l + τ α b n α C ( τ 2 + h 2 ) | | e j ^ n | l = 0 n 1 ( d l + 1 α d l α ) η 1 k = 0 j + 1 w k ( β 1 ) | e j ^ k + 1 n 1 | + k = 0 M j + 1 w k ( β 1 ) | e j ^ + k 1 n 1 | + η 2 k = 0 j + 1 w k ( β 2 ) | e j ^ k + 1 n 1 | + k = 0 M j + 1 w k ( β 2 ) | e j ^ + k 1 n 1 | + τ α b n α C ( τ 2 + h 2 ) = τ α n α C ( τ 2 + h 2 ) ( d n α d 0 α ) η 1 k = 0 j + 1 w k ( β 1 ) + k = 0 M j + 1 w k ( β 1 ) + η 2 k = 0 j + 1 w k ( β 2 ) + k = 0 M j + 1 w k ( β 2 ) τ α n α C ( τ 2 + h 2 ) + τ α b n α C ( τ 2 + h 2 ) = τ α n α C ( τ 2 + h 2 ) + ( d 0 α d n α ) η 1 k = 0 j + 1 w k ( β 1 ) + k = 0 M j + 1 w k ( β 1 ) + η 2 k = 0 j + 1 w k ( β 2 ) + k = 0 M j + 1 w k ( β 2 ) τ α n α C ( τ 2 + h 2 ) + τ α ( ( n + 1 ) α n α ) C ( τ 2 + h 2 ) ( d 0 α d n α ) η 1 k = 0 j + 1 w k ( β 1 ) + k = 0 M j + 1 w k ( β 1 ) + η 2 k = 0 j + 1 w k ( β 2 ) + k = 0 M j + 1 w k ( β 2 ) τ α ( n + 1 ) α C ( τ 2 + h 2 ) + τ α ( n + 1 ) α C ( τ 2 + h 2 ) = 1 + ( d 0 α d n α ) η 1 k = 0 j + 1 w k ( β 1 ) + k = 0 M j + 1 w k ( β 1 ) + η 2 k = 0 j + 1 w k ( β 2 ) + k = 0 M j + 1 w k ( β 2 ) τ α ( n + 1 ) α C ( τ 2 + h 2 ) 1 + ( c 0 α d n α ) η 1 k = 0 j + 1 w k ( β 1 ) + k = 0 M j + 1 w k ( β 1 ) + η 2 k = 0 j + 1 w k ( β 2 ) + k = 0 M j + 1 w k ( β 2 ) T α C ( τ 2 + h 2 ) .
Hence
E n + 1 1 + ( c 0 α d n α ) [ η 1 ( S ( β 1 ) + S ¯ ( β 1 ) ) + η 2 ( S ( β 2 ) + S ¯ ( β 2 ) ) ] 1 + c 0 α [ η 1 ( S ( β 1 ) + S ¯ ( β 1 ) ) + η 2 ( S ( β 2 ) + S ¯ ( β 2 ) ) ] T α C ( τ 2 + h 2 ) T α C ( τ 2 + h 2 ) .
Therefore, there exists a positive constant C * such that
E n + 1 C * ( τ 2 + h 2 ) .
 ☐

5. Numerical Experiments

In this section, some numerical experiments are given to demonstrate the effectiveness and accuracy of the proposed numerical scheme. Consider the following time-space fractional advection–diffusion equation ( 0 < α < 1 , 0 < β 1 < 1 , 1 < β 2 2 ) .

Example

c D t α u ( x , t ) = β 1 | x | β 1 u ( x , t ) + β 2 | x | β 2 u ( x , t ) + f ( x , t ) , 0 < x < 1 , 0 < t < 1 ,
u ( x , 0 ) = 0 , 0 x 1 ,
and the Dirichlet boundary conditions
u ( 0 , t ) = u ( 1 , t ) = 0 , 0 t 1 ,
where
f ( x , t ) = Γ ( α + 2 ) t + 2 t 2 α Γ ( 3 α ) x 2 ( 1 x ) 2 + t + t 2 cos ( π β 1 2 ) Γ ( 5 β 1 ) × ( 12 [ x 4 β 1 + ( 1 x ) 4 β 1 ] 6 ( 4 β 1 ) [ x 3 β 1 + ( 1 x ) 3 β 1 ] + ( 3 β 1 ) ( 4 β 1 ) [ x 2 β 1 + ( 1 x ) 2 β 1 ] ) + t + t 2 cos ( π β 2 2 ) Γ ( 5 β 2 ) × ( 12 [ x 4 β 2 + ( 1 x ) 4 β 2 ] 6 ( 4 β 2 ) [ x 3 β 2 + ( 1 x ) 3 β 2 ] + ( 3 β 2 ) ( 4 β 2 ) [ x 2 β 2 + ( 1 x ) 2 β 2 ] ) .
The exact solution is u ( x , t ) = ( t + t 2 ) x 2 ( 1 x ) 2 .
We solve this fractional advection–dispersion equation with the proposed numerical scheme with K β 1 = K β 2 = 1 , T = 1 , L = 1 . The comparison of the numerical solution with the exact solution for h = τ = 0.01 , α = 0.7 , β 1 = 0.3 , β 2 = 1.5 at T = 1 is given in Figure 1. To compare the numerical and the exact solutions, error plot is given in Figure 2. For fixed α = 0.7 , β 1 = 0.3 , β 2 = 1.5 the exact solution and the approximate solution with temporal and spatial steps τ = 0.01 , h = 0.005 are shown in Figure 3.
The spatial errors and convergence orders of the proposed scheme for solving (35) are shown in Table 1 and Table 2 for different values of β 1 and β 2 , respectively. Fixing τ = 0.01 , α = 0.9 , β 2 = 1.6 . The L 2 –norm is used to compute the error of the numerical solution at the last time step by
E ( τ , h ) = h j = 1 M 1 | u ( x j , t N ) u j N | 2 .
Next, we fix the spatial step size h = 0.01 and vary the time step. Table 3 presents the errors and convergence order for various values of α at time T = 1 . The numerical convergence order in the spatial and temporal direction is O ( τ 2 + h 2 ) , as in Theorem 2.

6. Conclusions

In this article, we have proposed a finite difference method for solving a class of time-space fractional advection–dispersion equation. We combined the trapezoidal formula, which is well known for the numerical integration of Riemann–Liouville integral, with the Grünwald–Letnikov discretization of the Riesz fractional derivative in space to obtain a numerical scheme. We proved that our proposed scheme is stable and convergent with the accuracy of O ( τ 2 + h 2 ) under the sufficient conditions 2 α + 1 3 and 17 1 2 β 2 2 . However, our numerical experiments given in Table 2 and Table 3 depict that when 2 α + 1 > 3 and β 2 < 17 1 2 the presented numerical method is still stable and convergent for various temporal and spatial time steps. Finally, some numerical experiments for the fractional finite difference method are given that agree very well with our theoretical results.

Author Contributions

Sadia Arshad designed this manuscript. Sadia arshad and Jianfei Huang performed the numerical experiments. Dumitru Baleanu, Maysaa Mohamed Al Qurashi, Yifa Tang and Zhao Yue prepared the final version of the paper and analyzed. All the authors have equally contributed in the discussion and overall preparation of the manuscript, as well as read and improved the final version of the manuscript.

Acknowledgments

This research is supported by the National Natural Science Foundation of China under grant 11771438 and 11701502, the Scientific and Technological Research Council of Turkey (TÜBİTAK) under grant TBAG-117F473, Higher Education Commission of Pakistan (HEC) under NRPU project 2017 and the “Research Center of the Center for Female Scientific and Medical Colleges”, Deanship of Scientific Research, King Saud University. The authors are extending their heartfelt thanks to the reviewers for their constructive suggestions towards the improvement of the revised article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Machado, J.A.T. Entropy analysis of integer and fractional dynamical systems. Nonlinear Dyn. 2010, 62, 371–378. [Google Scholar]
  2. Hoffmann, K.H.; Essex, C.; Schulzky, C. Fractional diffusion and entropy production. J. Non-Equilib. Thermodyn. 1998, 23, 166–175. [Google Scholar] [CrossRef]
  3. Magin, R.L.; Ingo, C. Entropy and information in a fractional order model of anomalous diffusion. IFAC Proc. 2012, 45, 428–433. [Google Scholar] [CrossRef]
  4. Bueno-Orovio, A.; Kay, D.; Grau, V.; Rodriguez, B.; Burrage, K. Fractional Diffusion Models of Cardiac Electrical Propagation: Role of Structural Heterogeneity in Dispersion of Repolarization; Technical Report OCCAM 13/35; Oxford Centre for Collaborative Applied Mathematics: Oxford, UK, 2013. [Google Scholar]
  5. Cafagna, D.; Grassi, G. Observer-based projective synchronization of fractional systems via a scalar signal: Application to hyperchaotic Rösslersystems. Nonlinear Dyn. 2012, 68, 117–128. [Google Scholar] [CrossRef]
  6. Caponetto, R.; Maione, G.; Pisano, A.; Rapaic, M.M.R.; Usai, E. Analysis and shaping of the self-sustained oscillations in relay controlled fractional-order systems. Fract. Calculus Appl. Anal. 2013, 16, 93–108. [Google Scholar] [CrossRef]
  7. Kilbas, A.A.; Srivastava, H.M.; Trujillo, J.J. Theory and Applications of Fractional Differential Equations, vol. 204 of North-Holland Mathematics Studies; Elsevier: New York, NY, USA, 2006. [Google Scholar]
  8. Machado, J.T.; Stefanescu, P.; Tintareanu, O.; Baleanu, D. Fractional calculus analysis of the cosmic microwave background. Romanian Rep. Phys. 2013, 65, 316–323. [Google Scholar]
  9. Samko, S.G.; Kilbas, A.A.; Marichev, O.I. Fractional Integrals and Derivatives: Theory and Applications, Gordon and Breach; Science Publishers: Hauppauge, NY, USA, 1993. [Google Scholar]
  10. Podlubny, I. Fractional Differential Equations; Acdemic Press: San Diego, CA, USA, 1999. [Google Scholar]
  11. Diethelm, K.; Ford, N.J.; Freed, A.D. Detailed error analysis for a fractional Adams method. Numer. Algor. 2004, 36, 31–52. [Google Scholar] [CrossRef]
  12. Zhuang, P.; Liu, F.; Anh, V.; Turner, I. New solution and analytical techniques of the implicit numerical method for the anomalous subdiffusion equation. SIAM J. Numer. Anal. 2008, 46, 1079–1095. [Google Scholar] [CrossRef] [Green Version]
  13. Tang, T. A finite difference scheme for partial integro-differential equations with weakly singular kernel. Appl. Numer. Math. 1993, 11, 309–319. [Google Scholar] [CrossRef]
  14. Chen, H.; Xu, D.; Peng, Y. An alternating direction implicit fractional trapezoidal rule type difference scheme for the two-dimensional fractional evolution equation. Int. J. Comput. Math. 2015, 92, 2178–2197. [Google Scholar] [CrossRef]
  15. Chen, H.; Gan, S.; Xu, D. A fractional trapezoidal rule type difference scheme for fractional order integro–differential equation. J. Frac. Calcul. Appl. 2016, 7, 133–146. [Google Scholar]
  16. Arshad, S.; Huang, J.; Khaliq, A.Q.M.; Tang, Y. Trapezoidal scheme for time-space fractional diffusion equation with Riesz derivative. J. Comput. Phys. 2017, 350, 1–15. [Google Scholar] [CrossRef]
  17. Arshad, S.; Bu, W.; Huang, J.; Tang, Y.; Zhao, Y. Finite difference method for time-space linear and nonlinear fractional diffusion equations. Int. J. Comp. Math. 2018, 95, 202–217. [Google Scholar] [CrossRef]
  18. Meerschaert, M.M.; Tadjeran, C. Finite difference approximations for fractional advection–dispersion flow equations. J. Comput. Appl. Math. 2004, 172, 65–77. [Google Scholar] [CrossRef]
  19. Yang, Q.; Liu, F.; Turner, I. Numerical methods for fractional partial differential equations with Riesz space fractional derivatives. Appl. Math. Model. 2010, 34, 200–218. [Google Scholar] [CrossRef] [Green Version]
  20. Sousa, E. A second order explicit finite difference method for the fractional advection diffusion equation. Comput. Math. Appl. 2012, 64, 3141–3152. [Google Scholar] [CrossRef]
  21. Tian, W.Y.; Zhou, H.; Deng, W.H. A class of second order difference approximation for solving space fractional diffusion equations. Math. Comput. 2015, 84, 1703–1727. [Google Scholar] [CrossRef]
  22. Ding, H.F.; Li, C.P.; Chen, Y.Q. High-order algorithms for Riesz derivative and their applications (I). Abstr. Appl. Anal. 2014, 2014, 653797. [Google Scholar] [CrossRef]
  23. Lubich, C. Discretized fractional calculus. SIAM J. Math. Anal. 1986, 17, 704–719. [Google Scholar] [CrossRef]
  24. Ding, H.F.; Li, C.P.; Chen, Y.Q. High-order algorithms for Riesz derivative and their applications (II). J. Comput. Phys. 2015, 293, 218–237. [Google Scholar] [CrossRef]
  25. Ding, H.F.; Li, C.P. High-order algorithms for Riesz derivative and their applications (III). Fract. Calc. Appl. Anal. 2016, 19, 19–55. [Google Scholar] [CrossRef]
  26. Metzler, R.; Klafter, J. The random walk’s guide to anomalous diffusion: A fractional dynamics approach. Phys. Rep. 2000, 339, 1–77. [Google Scholar] [CrossRef]
  27. Benson, D.A.; Wheatcraft, S.W.; Meerschaert, M.M. Application of a fractional advection–dispersion equation. Water Resour. Res. 2000, 36, 1403–1412. [Google Scholar] [CrossRef]
  28. Povstenko, Y.; Kyrylych, T.; Ryga, G. Fractional diffusion in a solid with mass absorption. Entropy 2017, 19, 203. [Google Scholar] [CrossRef]
  29. Liu, F.; Anh, V.; Turner, I.; Zhuang, P. Time fractional advection dispersion equation. J. Appl. Math. Comput. 2003, 13, 233–245. [Google Scholar] [CrossRef]
  30. Povstenko, Y.; Kyrylych, T. Two approaches to obtaining the space-time fractional advection–diffusion equation. Entropy 2017, 19, 297. [Google Scholar] [CrossRef]
  31. Huang, F.; Liu, F. The fundamental solution of the space–time fractional advection–dispersion equation. J. Appl. Math. Comput. 2005, 19, 233–245. [Google Scholar] [CrossRef]
  32. Tripathi, N.K.; Das, S.; Ong, S.H.; Jafari, H.; Qurashi, M.A. Solution of higher order nonlinear time-fractional reaction diffusion equation. Entropy 2016, 18, 329. [Google Scholar] [CrossRef]
  33. Momani, S.; Odibat, Z. Numerical solutions of the space–time fractional advection–dispersion equation. Numer. Meth. Part. Differ. Equat. 2008, 24, 1416–1429. [Google Scholar] [CrossRef]
  34. Liu, Q.; Liu, F.; Turner, I.; Anh, V. Approximation of the Lëvy–Feller advection–dispersion process by random walk and finite difference method. J. Comput. Phys. 2007, 222, 57–70. [Google Scholar] [CrossRef] [Green Version]
  35. Liu, F.; Zhuang, P.; Anh, V.; Turner, I.; Burra, K. Stability and convergence of the difference methods for the space-time fractional advection–diffusion equation. Appl. Math. Comput. 2007, 191, 12–20. [Google Scholar] [CrossRef]
  36. Ervin, V.J.; Roop, J.P. Variational formulation for the stationary fractional advection–dispersion equation. Numer. Meth. Part. Diff. Equ. 2006, 22, 558–576. [Google Scholar] [CrossRef]
  37. Hejazi, H.; Moroney, T.; Liu, F. Stability and convergence of a finite volume method for the space fractional advection–dispersion equation. J. Comput. Appl. Math. 2014, 255, 684–697. [Google Scholar] [CrossRef] [Green Version]
  38. Golbabai, A.; Sayevand, K. Analytical modelling of fractional advection–dispersion equation defined in a bounded space domain. Math. Comput. Model. 2011, 53, 1708–1718. [Google Scholar] [CrossRef]
  39. Carella, A.R.; Dorao, C.A. Least-squares spectral method for the solution of a fractional advection–dispersion equation. J. Comput. Phys. 2013, 232, 33–45. [Google Scholar] [CrossRef]
  40. Zheng, G.H.; Wei, T. Spectral regularization method for a Cauchy problem of the time fractional advection–dispersion equation. J. Comput. Appl. Math. 2010, 233, 2631–2640. [Google Scholar] [CrossRef]
  41. Donatelli, M.; Mazza, M.; Serra-Capizzano, S. Spectral analysis and structure preserving preconditioners for fractional diffusion equations. J. Comput. Phys. 2016, 307, 262–279. [Google Scholar] [CrossRef]
  42. Lei, S.L.; Sun, H.W. A circulant preconditioner for fractional diffusion equations. J. Comput. Phys. 2013, 242, 715–725. [Google Scholar] [CrossRef]
  43. Lin, X.L.; Ng, M.K.; Sun, H.W. A splitting preconditioner for Toeplitz-like linear systems arising from fractional diffusion equations. SIAM J. Matrix Anal. Appl. 2017, 38, 1580–1614. [Google Scholar] [CrossRef]
  44. Pan, J.; Ng, K.M.; Wang, H. Hong Fast iterative solvers for linear systems arising from time-dependent space-fractional diffusion equations. SIAM J. Sci. Comput. 2016, 38, A2806–A2826. [Google Scholar] [CrossRef]
  45. 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]
  46. Yu, B.; Jiang, X.; Xu, H. A novel compact numerical method for solving the two-dimensional non-linear fractional reaction-subdiffusion equation. Numer. Algor. 2015, 68, 923–950. [Google Scholar] [CrossRef]
  47. Zhuang, P.; Liu, F.; Anh, V.; Turner, I. Stability and convergence of an implicit numerical method for the non-linear fractional reaction–subdiffusion process. IMA J. Appl. Math. 2009, 74, 645–667. [Google Scholar] [CrossRef]
Figure 1. Comparison between numerical solution and exact solution for τ = 0.01 , h = 0.01 , α = 0.7 , β 1 = 0.3 , β 2 = 1.5 , T = 1 .
Figure 1. Comparison between numerical solution and exact solution for τ = 0.01 , h = 0.01 , α = 0.7 , β 1 = 0.3 , β 2 = 1.5 , T = 1 .
Entropy 20 00321 g001
Figure 2. Error plot for τ = 0.01 , h = 0.01 , α = 0.7 , β 1 = 0.3 , β 2 = 1.5 , T = 1 .
Figure 2. Error plot for τ = 0.01 , h = 0.01 , α = 0.7 , β 1 = 0.3 , β 2 = 1.5 , T = 1 .
Entropy 20 00321 g002
Figure 3. Approximate solution (Upper) and exact solution (Lower) for τ = 0.01 , h = 0.005 .
Figure 3. Approximate solution (Upper) and exact solution (Lower) for τ = 0.01 , h = 0.005 .
Entropy 20 00321 g003
Table 1. The errors and convergence order when τ = 0.01 , α = 0.9 , β 2 = 1.6 , T = 1 .
Table 1. The errors and convergence order when τ = 0.01 , α = 0.9 , β 2 = 1.6 , T = 1 .
β 1 = 0.1 β 1 = 0.3 β 1 = 0.5 β 1 = 0.7
h E ( τ , h ) order E ( τ , h ) order E ( τ , h ) order E ( τ , h ) order
1 / 10 2.3743 × 10 3 -2.4068 × 10 3 -2.4513 × 10 3 -2.5127 × 10 3 -
1 / 20 5.7815 × 10 4 2.03805.8594 × 10 4 2.03825.9700 × 10 4 2.03776.1222 × 10 4 2.0371
1 / 40 1.4044 × 10 4 2.04141.4235 × 10 4 2.04131.4512 × 10 4 2.04041.4893 × 10 4 2.0393
1 / 80 3.3971 × 10 5 2.04753.4438 × 10 5 2.04733.5130 × 10 5 2.04643.6083 × 10 5 2.0452
1 / 160 7.9725 × 10 6 2.09128.0845 × 10 6 2.09078.2539 × 10 6 2.08958.4892 × 10 6 2.0876
Table 2. The errors and convergence order when τ = 0.01 , α = 0.7 , β 1 = 0.3 , T = 1 .
Table 2. The errors and convergence order when τ = 0.01 , α = 0.7 , β 1 = 0.3 , T = 1 .
β 2 = 1.4 β 2 = 1.6 β 2 = 1.8 β 2 = 2
h E ( τ , h ) order E ( τ , h ) order E ( τ , h ) order E ( τ , h ) order
1 / 10 2.1509 × 10 3 -2.4462 × 10 3 -2.7484 × 10 3 -2.9426 × 10 3 -
1 / 20 5.4062 × 10 4 1.99235.9481 × 10 4 2.04006.6725 × 10 4 2.04227.3624 × 10 4 1.9988
1 / 40 1.3605 × 10 4 1.99041.4434 × 10 4 2.04291.6095 × 10 4 2.05161.8368 × 10 4 2.0029
1 / 80 3.4175 × 10 5 1.99313.4894 × 10 5 2.04843.8429 × 10 5 2.06634.5457 × 10 5 2.0146
1 / 160 8.3926 × 10 6 2.02578.1970 × 10 6 2.08988.8282 × 10 6 2.12201.0893 × 10 5 2.0609
Table 3. The errors and convergence order when h = 0.001 , β 1 = 0.5 , β 2 = 1.4 , T = 1 .
Table 3. The errors and convergence order when h = 0.001 , β 1 = 0.5 , β 2 = 1.4 , T = 1 .
α = 0.2 α = 0.4 α = 0.6 α = 0.8
t E ( τ , h ) order E ( τ , h ) order E ( τ , h ) order E ( τ , h ) order
1 / 5 1.4377 × 10 4 -2.0772 × 10 4 -2.3616 × 10 4 -2.5162 × 10 5 -
1 / 10 3.8544 × 10 5 1.89925.3402 × 10 5 1.95965.9403 × 10 5 1.99116.2750 × 10 5 2.0035
1 / 20 1.0120 × 10 5 1.92931.3551 × 10 5 1.97841.4831 × 10 5 2.00181.5587 × 10 5 2.0092
1 / 40 2.5497 × 10 6 1.98883.3379 × 10 6 2.02143.6155 × 10 6 2.03633.7925 × 10 6 2.0391
1 / 80 5.7769 × 10 7 2.14197.5305 × 10 7 2.14818.1450 × 10 7 2.15028.5804 × 10 7 2.1440

Share and Cite

MDPI and ACS Style

Arshad, S.; Baleanu, D.; Huang, J.; Al Qurashi, M.M.; Tang, Y.; Zhao, Y. Finite Difference Method for Time-Space Fractional Advection–Diffusion Equations with Riesz Derivative. Entropy 2018, 20, 321. https://doi.org/10.3390/e20050321

AMA Style

Arshad S, Baleanu D, Huang J, Al Qurashi MM, Tang Y, Zhao Y. Finite Difference Method for Time-Space Fractional Advection–Diffusion Equations with Riesz Derivative. Entropy. 2018; 20(5):321. https://doi.org/10.3390/e20050321

Chicago/Turabian Style

Arshad, Sadia, Dumitru Baleanu, Jianfei Huang, Maysaa Mohamed Al Qurashi, Yifa Tang, and Yue Zhao. 2018. "Finite Difference Method for Time-Space Fractional Advection–Diffusion Equations with Riesz Derivative" Entropy 20, no. 5: 321. https://doi.org/10.3390/e20050321

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