Skip to main content
Entropy logoLink to Entropy
. 2018 Apr 26;20(5):321. doi: 10.3390/e20050321

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

Sadia Arshad 1,2,*, Dumitru Baleanu 3,4, Jianfei Huang 5, Maysaa Mohamed Al Qurashi 6, Yifa Tang 1,7,*, Yue Zhao 1,7
PMCID: PMC7512840  PMID: 33265411

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.

Keywords: fractional advection dispersion equation, riesz derivative, caputo derivative, trapezoidal formula

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(Nlog(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:

aDxγf(x)=1Γ(n−γ)dndxn∫ax(x−s)n−γ−1f(s)ds,

Right Riemann–Liouville fractional derivative:

xDbγf(x)=(−1)nΓ(n−γ)dndxn∫xb(x−s)n−γ−1f(s)ds.

Definition 2.

The Caputo fractional derivative of order 0<α<1 of the function f on [a,b] is defined by:

cDtαf(x)=1Γ(1−α)∫ax(x−s)α−1ddxf(s)ds.

Definition 3.

The Riemann–Louville fractional integral of order α>0 of the function f on [a,b] is defined by:

Iαf(x)=1Γ(α)∫ax(x−s)α−1f(s)ds.

In this paper, we will consider the following time-space fractional ADE

cDtαu(x,t)=Kβ1∂β1∂|x|β1u(x,t)+Kβ2∂β2∂|x|β2u(x,t)+f(x,t),0<x<L,0<t≤T, (1)

with the initial conditions

u(x,0)=φ(x),0≤x≤L, (2)

and the Dirichlet boundary conditions

u(0,t)=u(L,t)=0,0≤t≤T, (3)

where 0<α<1, 0<β1<1,1<β2≤2,Kβ1≥0,Kβ2>0 and cDtα 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|β1u(x,t)=−ρβ1[0Dxβ1u(x,t)+xDLβ1u(x,t)], (4)
∂β2∂|x|β2u(x,t)=−ρβ2[0Dxβ2u(x,t)+xDLβ2u(x,t)], (5)

where

ρβ1=12cosπβ12,ρβ2=12cosπβ22,

and

0Dxβ1u(x,t)=1Γ(1−β1)∂∂x∫0x(x−τ)−β1u(τ,t)dτ,
xDLβ1u(x,t)=−1Γ(1−β1)∂∂x∫xL(τ−x)−β1u(τ,t)dτ,
0Dxβ2u(x,t)=1Γ(2−β2)∂2∂x2∫0x(x−τ)1−β2u(τ,t)dτ,
xDLβ2u(x,t)=1Γ(2−β2)∂2∂x2∫xL(τ−x)1−β2u(τ,t)dτ.

In the interval [a,b], let xj=jh,(j=0,1,…M) be mesh points in space, where h=b−aM 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

Apf(x)=1hγ∑k=0∞gk(γ)f(x−(k−p)h),
Bqf(x)=1hγ∑k=0∞gk(γ)f(x+(k−q)h),

that have the first order accuracy given by,

Apf(x)=−∞Dxγf(x)+O(h),
Bqf(x)=xD+∞γf(x)+O(h),

where p,q are integers, and gk(γ)=(−1)kγk. In fact, the coefficients gk(γ) are the coefficients of the power series of the function (1−z)γ,

(1−z)γ=∑k=0∞(−1)kγkzk=∑k=0∞gk(γ)zk,

for all |z|≤1, and they can be evaluated recursively by using the following relation

g0(γ)=1,gk(γ)=1−γ+1kgk−1(γ),k=1,2,….

Lemma 1 ([35]).

Suppose that 0<β1<1, then the coefficients gk(β1) satisfy

g0(β1)=1,g1(β1)=−β1<0,g2β1=β1(β1−1)2<0,g1(β1)<g2(β1)<g3(β1)…<0,∑k=0∞gk(β1)=0,∑k=0Mgk(β1)>0,M≥1.

Lemma 2 ([35]).

Suppose that 1<β2≤2, then the coefficients gk(β2) satisfy

g0(β2)=1,g1(β2)=−β2<0,gk(β2)=β2(β2−1)2>0,1≥g2(β2)≥g3(β2)≥…≥0,∑k=0∞gk(β2)=0,∑k=0Mgk(β2)<0,M≥1.

Tian et al. in [21] derived the following weighted shifted Grünwald difference operators based on the multi-step method

LDp,qγf(x)=γ−2q2(p−q)Apf(x)+2p−γ2(p−q)Aqf(x),
RDp,qγf(x)=γ−2q2(p−q)Bpf(x)+2p−γ2(p−q)Bqf(x).

Lemma 3 ([21]).

Suppose that 1<γ<2, let f(x)∈L1(R),−∞Dγf(x),D+∞γf(x) and their Fourier transforms belong to L1(R), then the weighted and shifted Grünwald difference operators satisfy

LDp,qγf(x)=−∞Dxγf(x)+O(h2),
RDp,qγf(x)=xD+∞γf(x)+O(h2),

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

aDxγf(x)=λ1hγ∑k=0[x−ah]+pgk(γ)f(x−(k−p)h)+λ2hγ∑k=0[x−ah]+qgk(γ)f(x−(k−q)h)+O(h2),
xDbγf(x)=λ1hγ∑k=0[b−xh]+pgk(γ)f(x+(k−p)h)+λ2hγ∑k=0[b−xh]+qgk(γ)f(x+(k−q)h)+O(h2),

where λ1=γ−2q2(p−q) and λ2=2p−γ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

0Dxγf(xj)=1hγ∑k=0j+1wk(γ)f(xj−k+1)+O(h2),
xDLγf(xj)=1hγ∑k=0M−j+1wk(γ)f(xj+k−1)+O(h2),

where

w0(γ)=γ2g0(γ),wk(γ)=γ2gk(γ)+2−γ2gk−1(γ),k≥1.

Lemma 5 ([45]).

Suppose that 0<β1<1, then the coefficients wk(β1) satisfy

w0(β1)=β12>0,w1(β1)=2−β1−β122>0,w2(β1)=β1(β12+β1−4)4<0,w2(β1)<w3(β1)<w4(β1)<…<0,∑k=0∞wk(β1)=0,∑k=0Mwk(β1)>0,M≥1.

Lemma 6 ([21]).

Suppose that 1<β2≤2, then the coefficients wkβ2 satisfy

w0(β2)=β22>0,w1(β2)=2−β2−β222<0,w2(β2)=β2(β22+β2−4)4,1≥w0(β2)≥w3(β2)≥w4(β2)≥…≥0,∑k=0∞wk(β2)=0,∑k=0Mwk(β2)<0,M≥2.

Lemma 7 ([46]).

Suppose u(t)∈C3[0,T], for ξ∈(tj,tj+1), there exists a positive constant C>0, such that

u(ξ)−(tj+1−ξ)u(tj)+(ξ−tj)u(tj+1)τ≤Cτ2. (6)

Lemma 8 ([47]).

Let

bnα=(n+1)α−nα,n=0,1,2,…, (7)

then bnα=(n+1)α−nα,(n=0,1,2,…) satisfy the following properties

  • 1.

    b0α=1,bnα>0,n=0,1,2,…,

  • 2.

    bnα>bn+1α,n=0,1,2,…,

  • 3.

    there exists a positive constant C>0, such that τ≤Cbnατα,n=1,2,3,….

Lemma 9 ([46]).

Suppose u(t)∈C3[0,T], then we have

Iαu(tn+1)−Iαu(tn)=ταΓ(α+1)anα−an−1αu(t0)+∑l=0n−1(dl+1−dl)u(tn−l)+c0αu(tn+1)+R1, (8)

for n=0,1,2,…,N−1, where

anα=(n+1)α−1α+1[(n+1)α+1−nα+1],n=0,1,2,…, (9)
cnα=1α+1[(n+1)α+1−nα+1]−nα,n=0,1,2,…, (10)
dnα=an−1α+cnα=1α+1[(n+1)α+1−2nα+1+(n−1)α+1],n=0,1,2,…, (11)

and R1 depends on τ with

|R1|≤Cτα+2(anα+cnα)=Cτα+2bnα. (12)

Here, we assume a−1α=0, that is,

d0α=c0α. (13)

Lemma 10 ([46]).

Suppose that anα,cnα,dnα are defined by Lemma 9, then we can conclude that:

  • 1.

    anα,(n=1,2,…) are monotonically decreasing when n increases.

  • 2.

    cnα,(n=0,1,2,…) are monotonically decreasing when n increases.

  • 3.

    dnα,(n=1,2,…) are monotonically decreasing when n increases.

3. Finite Difference Approximation

We define tn=nτ,n=0,1,…,N and xj=jh,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 (xj,tn), we have

cDtαu(xj,tn)=Kβ1∂β1∂|xj|β1u(xj,tn)+Kβ2∂β2∂|xj|β2u(xj,tn)+f(xj,tn),1≤j≤M−1,1<n<N,u(xj,0)=φ(xj),0≤j≤M,u(x0,tn)=u(xM,tn)=0,1≤n≤N. (14)

Assume that ujn denotes the numerical approximation of u(xj,tn). We can discretize the Riesz fractional derivatives ∂β1∂|x|β1 and ∂β2∂|x|β2 in truncated bounded domain as follows:

δxβ1u(xj,tn)=−12cosπβ12hβ1∑k=0j+1wk(β1)uj−k+1n+∑k=0M−j+1wk(β1)uj+k−1n+O(h2), (15)
δxβ2u(xj,tn)=−12cosπβ22hβ2∑k=0j+1wk(β2)uj−k+1n+∑k=0M−j+1wk(β2)uj+k−1n+O(h2). (16)

Let μ1=Kβ1ρβ1hβ1 and μ2=Kβ2ρβ2hβ2. Noting that μ1>0 and μ2<0 since ρβ1=12cosπβ12>0 for 0<β1≤1 and ρβ2=12cosπβ22<0 for 1<β2≤2. Using the approximation to the Riesz fractional derivative given in (15) and (16) into (14), we obtain

cDtαu(xj,tn)=−μ1∑k=0j+1wk(β1)uj−k+1n+∑k=0M−j+1wk(β1)uj+k−1n−μ2∑k=0j+1wk(β2)uj−k+1n+∑k=0M−j+1wk(β2)uj+k−1n+f(xj,tn), (17)

where 1≤j≤M−1,1<n<N, with initial and boundary conditions discretized as follows:

uj(0)=uj0,0≤j≤M,u0n=uMn=0,1≤n≤N. (18)

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 tn to tn+1, and using Lemmas 4, 7 and 9, we obtain

ujn+1−ujn=−ναc0αμ1∑k=0j+1wk(β1)uj−k+1n+1∑k=0M−j+1wk(β1)uj+k−1n+1−μ2∑k=0j+1wk(β2)uj−k+1n+1+∑k=0M−j+1wk(β2)uj+k−1n+1−R2−να(anα−an−1α)μ1∑k=0j+1wk(β1)uj−k+10+∑k=0M−j+1wk(β1)uj+k−10+μ2∑k=0j+1wk(β2)uj−k+10+∑k=0M−j+1wk(β2)uj+k−10−R2−να∑l=0n−1(dl+1α−dlα)+μ1∑k=0j+1wk(β1)uj−k+1n−l+∑k=0M−j+1wk(β1)uj+k−1n−l+μ2∑k=0j+1wk(β2)uj−k+1n−l+∑k=0M−j+1wk(β2)uj+k−1n−l−R2+(Iαf(xj,tn+1)−Iαf(xj,tn)+R1)=−μ1ναc0α∑k=0j+1wk(β1)uj−k+1n+1+∑k=0M−j+1wk(β1)uj+k−1n+1+(anα−an−1α)∑k=0j+1wk(β1)uj−k+10+∑k=0M−j+1wk(β1)uj+k−10+∑l=0n−1(dl+1α−dlα)∑k=0j+1wk(β1)uj−k+1n−l+∑k=0M−j+1wk(β1)uj+k−1n−l−μ2ναc0α∑k=0j+1wk(β2)uj−k+1n+1+∑k=0M−j+1wk(β2)uj+k−1n+1+(anα−an−1α)∑k=0j+1wk(β2)uj−k+10+∑k=0M−j+1wk(β2)uj+k−10+∑l=0n−1(dl+1α−dlα)∑k=0j+1wk(β2)uj−k+1n−l+∑k=0M−j+1wk(β2)uj+k−1n−l+(f˜(xj,tn+1)−f˜(xj,tn))+R3,

where R2 depends on h and by using Lemma 4, we have

|R2|≤Ch2,

and

να=ταΓ(α+1),f˜(xj,tn)=1Γ(α)∫0tn(tn−s)α−1f(xj,s)ds,
R3=R1+[c0α(uj−k+1n+1+uj+k−1n+1)+(anα−an−1α)(uj−k+10+uj+k−10)+∑l=0n−1(dl+1α−dlα)(uj−k+1n−l+uj+k−1n−l)]R2. (19)

Here R3 depends on τ and h as by Lemma 7, we get

|R3|=Cτ2+αbnα+Cταh2bnα=Cταbnα(τ2+h2).

Letting η1=μ1να≥0,η2=μ2να≤0, we obtain

ujn+1−ujn=−η1c0α∑k=0j+1wk(β1)uj−k+1n+1+∑k=0M−j+1wk(β1)uj+k−1n+1+(anα−an−1α)∑k=0j+1wk(β1)uj−k+10+∑k=0M−j+1wk(β1)uj+k−10+∑l=0n−1(dl+1α−dlα)∑k=0j+1wk(β1)uj−k+1n−l+∑k=0M−j+1wk(β1)uj+k−1n−l−η2c0α∑k=0j+1wk(β2)uj−k+1n+1+∑k=0M−j+1wk(β2)uj+k−1n+1+(anα−an−1α)∑k=0j+1wk(β2)uj−k+10+∑k=0M−j+1wk(β2)uj+k−10+∑l=0n−1(dl+1α−dlα)∑k=0j+1wk(β2)uj−k+1n−l+∑k=0M−j+1wk(β2)uj+k−1n−l+(f˜(xj,tn+1)−f˜(xj,tn))+Cταbnα(τ2+h2). (20)

Hence, the solution for system (1)–(3) can be approximated by the following scheme:

ujn+1+η1c0α∑k=0j+1wk(β1)uj−k+1n+1+∑k=0M−j+1wk(β1)uj+k−1n+1+η2c0α∑k=0j+1wk(β2)uj−k+1n+1+∑k=0M−j+1wk(β2)uj+k−1n+1=ujn−η1(anα−an−1α)∑k=0j+1wk(β1)uj−k+10+∑k=0M−j+1wk(β1)uj+k−10+∑l=0n−1(dl+1α−dlα)∑k=0j+1wk(β1)uj−k+1n−l+∑k=0M−j+1wk(β1)uj+k−1n−l−η2(anα−an−1α)∑k=0j+1wk(β2)uj−k+10+∑k=0M−j+1wk(β2)uj+k−10+∑l=0n−1(dl+1α−dlα)∑k=0j+1wk(β2)uj−k+1n−l+∑k=0M−j+1wk(β2)uj+k−1n−l+(f˜jn+1−f˜jn), (21)

where f˜jn=f˜(xj,tn). We can write this system into the following matrix form:

I+η1c0α(B1+B1T)+c0αη2(B2+B2T)Un+1=Un−(anα−an−1α)(η1(B1+B1T)+η2(B2+B2T))U0−(η1(B1+B1T)+η2(B2+B2T))∑l=0n−1(dl+1α−dlα)Un−l+(F˜n+1−F˜n)+Cταbnα(τ2+h2), (22)

where

Un=(u1n,u2n,…,uM−1n)T,F˜n=(f˜1n,f˜2n,…,f˜M−1n)T,

with I is an (M−1)×(M−1) identity matrix, B1 and B2 are (M−1)×(M−1) matrices that satisfy

B1=w1(β1)w0(β1)00…0w2(β1)w1(β1)w0β20…0w3(β1)w2(β1)w1β20…0………………wM−2(β1)wM−3(β1)wM−4(β1)…w1(β1)w0(β1)wM−1(β1)wM−2(β1)wM−3(β1)…w2(β1)w1(β1), (23)
B2=w1(β2)w0(β2)00…0w2(β2)w1(β2)w0(β2)0…0w3(β2)w2(β2)w1(β2)0…0………………wM−2(β2)wM−3(β2)wM−4(β2)…w1(β2)w0(β2)wM−1(β2)wM−2(β2)wM−3(β2)…w2(β2)w1(β2). (24)

Let

B1=B1+B1T,B2=B2+B2T,A=η1B1+η2B2, (25)

then we obtain the following numerical scheme based on fractional trapezoid formula

(I+c0αA)Un+1=Un−A(anα−an−1α)U0−A∑l=0n−1(dl+1α−dlα)Un−l+(F˜n+1−F˜n), (26)

with initial and boundary conditions

U(0)=U0u0n=uMn=0,1≤n≤N. (27)

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,d0α=c0α=11+α,d1α=a0α+c1α=2α+1−2α+1. If

2α+1≤3, (28)

then we obtain

d0α>d1α.

Remark 2.

Let bnα be as defined in Lemma 8, then c0α≥bnα,n=0,1,2,…, where 0<c0α=11+α<1,0<bnα<1,n=0,1,2,…. Using dnα=an−1α+cnα, we have

0<an−1α−anα+d0α−dnα=an−1α−anα+d0α−(an−1α+cnα)=d0α−(anα+cnα)=d0α−bnα=c0α−bnα.

Lemma 11.

w2(β2)≥0 if

17−12≤β2≤2. (29)

Proof. 

Since w2(β2)≥0 is equivalent to

β22+β2−4≥0,

that is

17−12≤β2≤2.

 ☐

Let u˜jn numerical solution of the numerical scheme (21) with a different initial value u˜j0, and

εjn=u˜jn−ujn,n=0,1,…N,j=1,2,…M−1.

According to (21), we have

εjn+1+c0αη1∑k=0j+1wk(β1)εj−k+1n+1+∑k=0M−j+1wk(β1)εj+k−1n+1+η2∑k=0j+1wk(β2)εj−k+1n+1+∑k=0M−j+1wk(β2)εj+k−1n+1=εjn−(anα−an−1α)η1∑k=0j+1wk(β1)εj−k+10+∑k=0M−j+1wk(β1)εj+k−10+η2∑k=0j+1wk(β2)εj−k+10+∑k=0M−j+1wk(β2)εj+k−10−∑l=0n−1(dl+1α−dlα)η1∑k=0j+1wk(β1)εj−k+1n−l+∑k=0M−j+1wk(β1)εj+k−1n−l+η2∑k=0j+1wk(β2)εj−k+1n−l+∑k=0M−j+1wk(β2)εj+k−1n−l. (30)

For convenience, we suppose that

S(β)=∑k=0j+1wk(β),S¯(β)=∑k=0M−j+1wk(β).

Put En=(ε1n,ε2n,…,εM−1n),n=0,1,2,…N, and assume that

∥En∥∞=max1≤j≤M−1|εjn|=|εj^n|.

Theorem 1.

Suppose (28) and (29) hold. Then, the fractional numerical scheme (26) is stable, i.e.,

∥En+1∥∞≤∥E0∥∞,n=0,1,…,N−1.

Proof. 

We prove by mathematical induction. For n=0, (30) can be written as

εj1+c0αη1∑k=0j+1wk(β1)εj−k+11+∑k=0M−j+1wk(β1)εj+k−11+η2∑k=0j+1wk(β2)εj−k+11+∑k=0M−j+1wk(β2)εj+k−11=εj0−a1αη1∑k=0j+1wk(β1)εj−k+10+∑k=0M−j+1wk(β1)εj+k−10+η2∑k=0j+1wk(β2)εj−k+10+∑k=0M−j+1wk(β2)εj+k−10, (31)

that is

εj1+c0αη1∑k=0j+1wk(β1)εj−k+11+∑k=0M−j+1wk(β1)εj+k−11+η2∑k=0j+1wk(β2)εj−k+11+∑k=0M−j+1wk(β2)εj+k−11+a1αη1∑k=0j+1wk(β1)εj−k+10+∑k=0M−j+1wk(β1)εj+k−10+η2∑k=0j+1wk(β2)εj−k+10+∑k=0M−j+1wk(β2)εj+k−10=εj0. (32)

Using |v1|−|v2|≤|v1−v2| and (32), we have

∥E1∥∞=|εj^1|≤|εj^1|+c0αη1∑k=0j+1wk(β1)|εj^1|+∑k=0M−j+1wk(β1)|εj^1|+η2∑k=0j+1wk(β2)|εj^1|+∑k=0M−j+1wk(β2)|εj^1|+a0αη1∑k=0j+1wk(β1)|εj^0|+∑k=0M−j+1wk(β1)|εj^0|+η2∑k=0j+1wk(β2)|εj^0|+∑k=0M−j+1wk(β2)|εj^0|≤|εj^1|+c0αη1∑k=0j+1wk(β1)|εj^−k+11|+∑k=0M−j+1wk(β1)|εj^+k−11|+η2∑k=0j+1wk(β2)|εj^−k+11|+∑k=0M−j+1wk(β2)|εj^+k−11|+a0αη1∑k=0j+1wk(β1)|εj^−k+10|+∑k=0M−j+1wk(β1)|εj^+k−10|+η2∑k=0j+1wk(β2)|εj^−k+10|+∑k=0M−j+1wk(β2)|εj^+k−10|=(|εj^1|+2(c0α|εj^1|+a0α|εj^0|)(η1w1(β1)+η2w1(β2)))+c0αη1∑k=0,k≠1j+1wk(β1)|εj^−k+11|+∑k=0,k≠1M−j+1wk(β1)|εj^+k−11|+η2∑k=0,k≠1j+1wk(β2)|εj^−k+11|+∑k=0,k≠1M−j+1wk(β2)|εj^+k−11|+a0αη1∑k=0,k≠1j+1wk(β1)|εj^−k+10|+∑k=0,k≠1M−j+1wk(β1)|εj^+k−10|+η2∑k=0,k≠1j+1wk(β2)|εj^−k+10|+∑k=0,k≠1M−j+1wk(β2)|εj^+k−10|≤εj^1+2(c0α|εj^1|+a0α|εj^0|)(η1w1(β1)+η2w1(β2))+c0αη1∑k=0,k≠1j+1wk(β1)εj^−k+11+∑k=0,k≠1M−j+1wk(β1)εj^+k−11+η2∑k=0,k≠1j+1wk(β2)εj^−k+11+∑k=0,k≠1M−j+1wk(β2)εj^+k−11+a0αη1∑k=0,k≠1j+1wk(β1)|εj^−k+10|+∑k=0,k≠1M−j+1wk(β1)|εj^+k−10|+η2∑k=0,k≠1j+1wk(β2)|εj^−k+10|+∑k=0,k≠1M−j+1wk(β2)|εj^+k−10|=εj^1+c0αη1∑k=0j+1wk(β1)εj^−k+11+∑k=0M−j+1wk(β1)εj^+k−11+η2∑k=0j+1wk(β2)εj^−k+11+∑k=0M−j+1wk(β2)εj^+k−11+a0αη1∑k=0j+1wk(β1)εj^−k+10+∑k=0M−j+1wk(β1)εj^+k−10+η2∑k=0j+1wk(β2)εj^−k+10+∑k=0M−j+1wk(β2)εj^+k−10=|εj^0|.

Hence, we obtain

∥E1∥∞≤∥E0∥∞.

Now suppose that

∥Ek∥∞≤∥E0∥∞,k=0,1,2,…,n.

Using |v1|−|v2|≤|v1−v1| and (30), we have

1+c0αη1∑k=0j+1wk(β1)+∑k=0M−j+1wk(β1)+η2∑k=0j+1wk(β2)+∑k=0M−j+1wk(β2)|εj^n+1|≤|εj^n+1|+c0αη1∑k=0j+1wk(β1)|εj^−k+1n+1|+∑k=0M−j+1wk(β1)|εj^+k−1n+1|+η2∑k=0j+1wk(β2)|εj^−k+1n+1|+∑k=0M−j+1wk(β2)|εj^+k−1n+1|=(1+2c0α(η1w0(β1)+η2w1(β2))|εj^n+1|)+c0αη1∑k=0,k≠1j+1wk(β1)|εj^−k+1n+1|+∑k=0,k≠1M−j+1wk(β1)|εj^+k−1n+1|+η2∑k=0,k≠1j+1wk(β2)|εj^−k+1n+1|+∑k=0,k≠1M−j+1wk(β2)|εj^+k−1n+1|≤εj^n+1+c0αη1∑k=0j+1wk(β1)εj^−k+1n+1+∑k=0M−j+1wk(β1)εj^+k−1n+1+η2∑k=0j+1wk(β2)εj^−k+1n+1+∑k=0M−j+1wk(β2)εj^+k−1n+1=εj^n−(anα−an−1α)η1∑k=0j+1wk(β1)εj^−k+10+∑k=0M−j+1wk(β1)εj^+k−10+η2∑k=0j+1wk(β2)εj^−k+10+∑k=0M−j+1wk(β2)εj^+k−10−∑l=0n−1(dl+1α−dlα)η1∑k=0j+1wk(β1)εj^−k+1n−l+∑k=0M−j+1wk(β1)εj^+k−1n−l+η2∑k=0j+1wk(β2)εj^−k+1n−l+∑k=0M−j+1wk(β2)εj^+k−1n−l≤|εj^n|−(anα−an−1α)η1∑k=0j+1wk(β1)|εj^−k+10|+∑k=0M−j+1wk(β1)|εj^+k−10|+η2∑k=0j+1wk(β2)|εj^−k+10|+∑k=0M−j+1wk(β2)|εj^+k−10|−∑l=0n−1(dl+1α−dlα)η1∑k=0j+1wk(β1)|εj^−k+1n−1|+∑k=0M−j+1wk(β1)|εj^+k−1n−1|+η2∑k=0j+1wk(β2)|εj^−k+1n−1|+∑k=0M−j+1wk(β2)|εj^+k−1n−1|=∥E0∥−(anα−an−1α)η1∑k=0j+1wk(β1)∥E0∥+∑k=0M−j+1wk(β1)∥E0∥+η2∑k=0j+1wk(β2)∥E0∥+∑k=0M−j+1wk(β2)∥E0∥−(dnα−d0α)η1∑k=0j+1wk(β1)∥E0∥+∑k=0M−j+1wk(β1)∥E0∥+η2∑k=0j+1wk(β2)∥E0∥+∑k=0M−j+1wk(β2)∥E0∥=1−(anα−an−1α+dnα−d0α)η1∑k=0j+1wk(β1)+∑k=0M−j+1wk(β1)+η2∑k=0j+1wk(β2)+∑k=0M−j+1wk(β2)∥E0∥=1+(c0α−bnα)η1∑k=0j+1wk(β1)+∑k=0M−j+1wk(β1)+η2∑k=0j+1wk(β2)+∑k=0M−j+1wk(β2)∥E0∥,

hence

∥En+1∥∞≤1+(c0α−bnα)[η1(S(β1)+S¯(β1))+η2(S(β2)+S¯(β2))]1+c0α[η1(S(β1)+S¯(β1))+η2(S(β2)+S¯(β2))]∥E0∥∞≤∥E0∥∞.

 ☐

4.2. Convergence

Let the error at the grid points (xj,tn) be defined by

ejn=u(xj,tn)−ujn,n=0,1,…N,j=1,2,…M−1,

and we denote En=(e1n,e2n,…,eM−1n)T. According to (22), the error satisfies

ejn+1+c0αη1∑k=0j+1wk(β1)ej−k+1n+1+∑k=0M−j+1wk(β1)ej+k−1n+1+η2∑k=0j+1wk(β2)ej−k+1n+1+∑k=0M−j+1wk(β2)ej+k−1n+1=ejn−∑l=0n−1(dl+1α−dlα)η1∑k=0j+1wk(β1)ej−k+1n−l+∑k=0M−j+1wk(β1)ej+k−1n−l+η2∑k=0j+1wk(β2)ej−k+1n−l+∑k=0M−j+1wk(β2)ej+k−1n−l+ταbnαC(τ2+h2). (33)

Put En=(e1n,e2n,…,eM−1n),n=0,1,2,…N, and assume that

∥En∥∞=max1≤j≤M−1|ejn|=|ej^n|.

Theorem 2.

Suppose (28) and (29) hold. Then, the fractional numerical scheme (26) is convergent with accuracy O(τ2+h2), that is, there exists a positive constant C such that

∥En+1∥∞≤C(τ2+h2),n=0,1,…,N−1.

Proof. 

We prove by mathematical induction. For n=0, (33) can be written as

ej1+c0αη1∑k=0j+1wk(β1)ej−k+11+∑k=0M−j+1wk(β1)ej+k−11+η2∑k=0j+1wk(β2)ej−k+11+∑k=0M−j+1wk(β2)ej+k−11=ταb0αC(τ2+h2). (34)

Using |v1|−|v2|≤|v1−v2| and (34), we have

∥E1∥∞=|ej^1|≤|ej^1|+c0αη1∑k=0j+1wk(β1)|ej^1|+∑k=0M−j+1wk(β1)|ej^1|+η2∑k=0j+1wk(β2)|ej^1|+∑k=0M−j+1wk(β2)|ej^1|≤|ej^1|+c0αη1∑k=0j+1wk(β1)|ej^−k+11|+∑k=0M−j+1wk(β1)|ej^+k−11|+η2∑k=0j+1wk(β2)|ej^−k+11|+∑k=0M−j+1wk(β2)|ej^+k−11|=(1+2c0α(η1w1(β1)+η2w1(β2)))|ej^1|+c0αη1∑k=0,k≠1j+1wk(β1)|ej^1|+∑k=0,k≠1M−j+1wk(β1)|ej^1|+η2∑k=0,k≠1j+1wk(β2)|ej^1|+∑k=0,k≠1M−j+1wk(β2)|ej^1|≤ej^1+2c0αej^1(η1w1(β1)+η2w1(β2))+c0αη1∑k=0,k≠1j+1wk(β1)ej^−k+11+∑k=0,k≠1M−j+1wk(β1)ej^+k−11+η2∑k=0,k≠1j+1wk(β2)ej^−k+11+∑k=0,k≠1M−j+1wk(β2)ej^+k−11=ej^1+c0αη1∑k=0j+1wk(β1)ej^−k+11+∑k=0M−j+1wk(β1)ej^+k−11+η2∑k=0j+1wk(β2)ej^−k+11+∑k=0M−j+1wk(β2)ej^+k−11=ταb0αC(τ2+h2)≤ταC(τ2+h2).

Hence, we get

∥E1∥∞≤ταC(τ2+h2).

Now suppose that

∥Ek∥≤ταnαC(τ2+h2),k=0,1,2,…,n.

Using |v1|−|v2|≤|v1−v2| and (33), it yields

1+c0αη1∑k=0j+1wk(β1)+∑k=0M−j+1wk(β1)+η2∑k=0j+1wk(β2)+∑k=0M−j+1wk(β2)|ej^n+1|≤|ej^n+1|+c0αη1∑k=0j+1wk(β1)|ej^−k+1n+1|+∑k=0M−j+1wk(β1)|ej^+k−1n+1|+η2∑k=0j+1wk(β2)|ej^−k+1n+1|+∑k=0M−j+1wk(β2)|ej^+k−1n+1|=(1+2c0α(η1w0(β1)+η2w1(β2))|ej^n+1|)+c0αη1∑k=0,k≠1j+1wk(β1)|ej^−k+1n+1|+∑k=0,k≠1M−j+1wk(β1)|ej^+k−1n+1|+η2∑k=0,k≠1j+1wk(β2)|ej^−k+1n+1|+∑k=0,k≠1M−j+1wk(β2)|ej^+k−1n+1|≤ej^n+1+c0αη1∑k=0j+1wk(β1)ej^−k+1n+1+∑k=0M−j+1wk(β1)ej^+k−1n+1+η2∑k=0j+1wk(β2)ej^−k+1n+1+∑k=0M−j+1wk(β2)ej^+k−1n+1=|ej^n−∑l=0n−1(dl+1α−dlα)η1∑k=0j+1wk(β1)ej^−k+1n−l+∑k=0M−j+1wk(β1)ej^+k−1n−l+η2∑k=0j+1wk(β2)ej^−k+1n−l+∑k=0M−j+1wk(β2)ej^+k−1n−l+ταbnαC(τ2+h2)|≤|ej^n|−∑l=0n−1(dl+1α−dlα)η1∑k=0j+1wk(β1)|ej^−k+1n−1|+∑k=0M−j+1wk(β1)|ej^+k−1n−1|+η2∑k=0j+1wk(β2)|ej^−k+1n−1|+∑k=0M−j+1wk(β2)|ej^+k−1n−1|+ταbnαC(τ2+h2)=ταnαC(τ2+h2)−(dnα−d0α)η1∑k=0j+1wk(β1)+∑k=0M−j+1wk(β1)+η2∑k=0j+1wk(β2)+∑k=0M−j+1wk(β2)ταnαC(τ2+h2)+ταbnαC(τ2+h2)=ταnαC(τ2+h2)+(d0α−dnα)η1∑k=0j+1wk(β1)+∑k=0M−j+1wk(β1)+η2∑k=0j+1wk(β2)+∑k=0M−j+1wk(β2)ταnαC(τ2+h2)+τα((n+1)α−nα)C(τ2+h2)≤(d0α−dnα)η1∑k=0j+1wk(β1)+∑k=0M−j+1wk(β1)+η2∑k=0j+1wk(β2)+∑k=0M−j+1wk(β2)τα(n+1)αC(τ2+h2)+τα(n+1)αC(τ2+h2)=1+(d0α−dnα)η1∑k=0j+1wk(β1)+∑k=0M−j+1wk(β1)+η2∑k=0j+1wk(β2)+∑k=0M−j+1wk(β2)τα(n+1)αC(τ2+h2)≤1+(c0α−dnα)η1∑k=0j+1wk(β1)+∑k=0M−j+1wk(β1)+η2∑k=0j+1wk(β2)+∑k=0M−j+1wk(β2)TαC(τ2+h2).

Hence

∥En+1∥∞≤1+(c0α−dnα)[η1(S(β1)+S¯(β1))+η2(S(β2)+S¯(β2))]1+c0α[η1(S(β1)+S¯(β1))+η2(S(β2)+S¯(β2))]TαC(τ2+h2)≤TαC(τ2+h2).

Therefore, there exists a positive constant C* such that

∥En+1∥∞≤C*(τ2+h2).

 ☐

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

cDtαu(x,t)=∂β1∂|x|β1u(x,t)+∂β2∂|x|β2u(x,t)+f(x,t),0<x<1,0<t<1, (35)
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+2t2−αΓ(3−α)x2(1−x)2+t+t2cos(πβ12)Γ(5−β1)×(12[x4−β1+(1−x)4−β1]−6(4−β1)[x3−β1+(1−x)3−β1]+(3−β1)(4−β1)[x2−β1+(1−x)2−β1])+t+t2cos(πβ22)Γ(5−β2)×(12[x4−β2+(1−x)4−β2]−6(4−β2)[x3−β2+(1−x)3−β2]+(3−β2)(4−β2)[x2−β2+(1−x)2−β2]).

The exact solution is u(x,t)=(t+t2)x2(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.

Figure 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.

Figure 2.

Figure 2

Error plot for τ=0.01,h=0.01,α=0.7,β1=0.3,β2=1.5,T=1.

Figure 3.

Figure 3

Approximate solution (Upper) and exact solution (Lower) for τ=0.01,h=0.005.

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 L2–norm is used to compute the error of the numerical solution at the last time step by

E(τ,h)=h∑j=1M−1|u(xj,tN)−ujN|2.

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.0380 5.8594 ×10−4 2.0382 5.9700 ×10−4 2.0377 6.1222 ×10−4 2.0371
1/40 1.4044 ×10−4 2.0414 1.4235 ×10−4 2.0413 1.4512 ×10−4 2.0404 1.4893 ×10−4 2.0393
1/80 3.3971 ×10−5 2.0475 3.4438 ×10−5 2.0473 3.5130 ×10−5 2.0464 3.6083 ×10−5 2.0452
1/160 7.9725 ×10−6 2.0912 8.0845 ×10−6 2.0907 8.2539 ×10−6 2.0895 8.4892 ×10−6 2.0876

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.9923 5.9481 ×10−4 2.0400 6.6725 ×10−4 2.0422 7.3624 ×10−4 1.9988
1/40 1.3605 ×10−4 1.9904 1.4434 ×10−4 2.0429 1.6095 ×10−4 2.0516 1.8368 ×10−4 2.0029
1/80 3.4175 ×10−5 1.9931 3.4894 ×10−5 2.0484 3.8429 ×10−5 2.0663 4.5457 ×10−5 2.0146
1/160 8.3926 ×10−6 2.0257 8.1970 ×10−6 2.0898 8.8282 ×10−6 2.1220 1.0893 ×10−5 2.0609

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+h2), as in Theorem 2.

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.8992 5.3402 ×10−5 1.9596 5.9403 ×10−5 1.9911 6.2750 ×10−5 2.0035
1/20 1.0120 ×10−5 1.9293 1.3551 ×10−5 1.9784 1.4831 ×10−5 2.0018 1.5587 ×10−5 2.0092
1/40 2.5497 ×10−6 1.9888 3.3379 ×10−6 2.0214 3.6155 ×10−6 2.0363 3.7925 ×10−6 2.0391
1/80 5.7769 ×10−7 2.1419 7.5305 ×10−7 2.1481 8.1450 ×10−7 2.1502 8.5804 ×10−7 2.1440

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+h2) under the sufficient conditions 2α+1≤3 and 17−12≤β2≤2. However, our numerical experiments given in Table 2 and Table 3 depict that when 2α+1>3 and β2<17−12 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.

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.

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.

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. doi: 10.1515/jnet.1998.23.2.166. [DOI] [Google Scholar]
  • 3.Magin R.L., Ingo C. Entropy and information in a fractional order model of anomalous diffusion. IFAC Proc. 2012;45:428–433. doi: 10.3182/20120711-3-BE-2027.00063. [DOI] [Google Scholar]
  • 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. Oxford Centre for Collaborative Applied Mathematics; Oxford, UK: 2013. Technical Report OCCAM 13/35. [DOI] [PMC free article] [PubMed] [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. doi: 10.1007/s11071-011-0208-y. [DOI] [Google Scholar]
  • 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. doi: 10.2478/s13540-013-0007-x. [DOI] [Google Scholar]
  • 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. doi: 10.1023/B:NUMA.0000027736.85078.be. [DOI] [Google Scholar]
  • 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. doi: 10.1137/060673114. [DOI] [Google Scholar]
  • 13.Tang T. A finite difference scheme for partial integro-differential equations with weakly singular kernel. Appl. Numer. Math. 1993;11:309–319. doi: 10.1016/0168-9274(93)90012-G. [DOI] [Google Scholar]
  • 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. doi: 10.1080/00207160.2014.975694. [DOI] [Google Scholar]
  • 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. doi: 10.1016/j.jcp.2017.08.038. [DOI] [Google Scholar]
  • 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. doi: 10.1080/00207160.2017.1344231. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 18.Meerschaert M.M., Tadjeran C. Finite difference approximations for fractional advection–dispersion flow equations. J. Comput. Appl. Math. 2004;172:65–77. doi: 10.1016/j.cam.2004.01.033. [DOI] [Google Scholar]
  • 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. doi: 10.1016/j.apm.2009.04.006. [DOI] [Google Scholar]
  • 20.Sousa E. A second order explicit finite difference method for the fractional advection diffusion equation. Comput. Math. Appl. 2012;64:3141–3152. doi: 10.1016/j.camwa.2012.03.002. [DOI] [Google Scholar]
  • 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. doi: 10.1090/S0025-5718-2015-02917-2. [DOI] [Google Scholar]
  • 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. doi: 10.1155/2014/653797. [DOI] [Google Scholar]
  • 23.Lubich C. Discretized fractional calculus. SIAM J. Math. Anal. 1986;17:704–719. doi: 10.1137/0517050. [DOI] [Google Scholar]
  • 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. doi: 10.1016/j.jcp.2014.06.007. [DOI] [Google Scholar]
  • 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. doi: 10.1515/fca-2016-0003. [DOI] [Google Scholar]
  • 26.Metzler R., Klafter J. The random walk’s guide to anomalous diffusion: A fractional dynamics approach. Phys. Rep. 2000;339:1–77. doi: 10.1016/S0370-1573(00)00070-3. [DOI] [Google Scholar]
  • 27.Benson D.A., Wheatcraft S.W., Meerschaert M.M. Application of a fractional advection–dispersion equation. Water Resour. Res. 2000;36:1403–1412. doi: 10.1029/2000WR900031. [DOI] [Google Scholar]
  • 28.Povstenko Y., Kyrylych T., Ryga G. Fractional diffusion in a solid with mass absorption. Entropy. 2017;19:203. doi: 10.3390/e19050203. [DOI] [Google Scholar]
  • 29.Liu F., Anh V., Turner I., Zhuang P. Time fractional advection dispersion equation. J. Appl. Math. Comput. 2003;13:233–245. doi: 10.1007/BF02936089. [DOI] [Google Scholar]
  • 30.Povstenko Y., Kyrylych T. Two approaches to obtaining the space-time fractional advection–diffusion equation. Entropy. 2017;19:297. doi: 10.3390/e19070297. [DOI] [Google Scholar]
  • 31.Huang F., Liu F. The fundamental solution of the space–time fractional advection–dispersion equation. J. Appl. Math. Comput. 2005;19:233–245. doi: 10.1007/BF02936577. [DOI] [Google Scholar]
  • 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. doi: 10.3390/e18090329. [DOI] [Google Scholar]
  • 33.Momani S., Odibat Z. Numerical solutions of the space–time fractional advection–dispersion equation. Numer. Meth. Part. Differ. Equat. 2008;24:1416–1429. doi: 10.1002/num.20324. [DOI] [Google Scholar]
  • 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. doi: 10.1016/j.jcp.2006.06.005. [DOI] [Google Scholar]
  • 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. doi: 10.1016/j.amc.2006.08.162. [DOI] [Google Scholar]
  • 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. doi: 10.1002/num.20112. [DOI] [Google Scholar]
  • 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. doi: 10.1016/j.cam.2013.06.039. [DOI] [Google Scholar]
  • 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. doi: 10.1016/j.mcm.2010.12.046. [DOI] [Google Scholar]
  • 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. doi: 10.1016/j.jcp.2012.04.050. [DOI] [Google Scholar]
  • 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. doi: 10.1016/j.cam.2009.11.009. [DOI] [Google Scholar]
  • 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. doi: 10.1016/j.jcp.2015.11.061. [DOI] [Google Scholar]
  • 42.Lei S.L., Sun H.W. A circulant preconditioner for fractional diffusion equations. J. Comput. Phys. 2013;242:715–725. doi: 10.1016/j.jcp.2013.02.025. [DOI] [Google Scholar]
  • 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. doi: 10.1137/17M1115447. [DOI] [Google Scholar]
  • 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. doi: 10.1137/15M1030273. [DOI] [Google Scholar]
  • 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 doi: 10.1016/j.camwa.2016.01.015. [DOI] [Google Scholar]
  • 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. doi: 10.1007/s11075-014-9877-1. [DOI] [Google Scholar]
  • 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. doi: 10.1093/imamat/hxp015. [DOI] [Google Scholar]

Articles from Entropy are provided here courtesy of Multidisciplinary Digital Publishing Institute (MDPI)

RESOURCES