Crank-Nicolson Quasi-Compact Scheme for the Nonlinear Two-Sided Spatial Fractional Advection-Diffusion Equations

Abstract

The higher-order numerical scheme of nonlinear advection-diffusion equations is studied in this article, where the space fractional derivatives are evaluated by using weighted and shifted Grünwald difference operators and combining the compact technique, in the time direction is discretized by the Crank-Nicolson method. Through the energy method, the stability and convergence of the numerical scheme in the sense of L2-norm are proved, and the convergence order is . Some examples are given to show that our numerical scheme is effective.

Share and Cite:

Gao, D. , Qiu, Z. , Wang, L. and Li, J. (2024) Crank-Nicolson Quasi-Compact Scheme for the Nonlinear Two-Sided Spatial Fractional Advection-Diffusion Equations. Journal of Applied Mathematics and Physics, 12, 1089-1100. doi: 10.4236/jamp.2024.124068.

1. Introduction

In the last two decades, many fractional differential models have been studied, and these models [1] - [8] have been widely applied in many fields of science and technology, and a lot of research results have been obtained. Among them, Meerschaert and Tadjeran [4] proposed the shifted Grünwald difference operator, which combined with the Crank-Nicolson method to derive the numerical scheme of the advection-dispersion equation. The scheme is unconditionally stable and convergent with order O ( τ 2 + h ) . Later, Meerschaert and Tadjeran [5] utilized the shifted Grünwald difference operators to approximate the left and right Riemann-Liouville fractional derivatives, in time direction is discretized by the explicit Euler method, numerical scheme is unconditionally stable and convergent with order O ( τ + h ) . Tadjeran et al. [9] adopted Crank-Nicolson method to discrete time partial derivative, and one-order shifted Grünwald difference operator to approximate space fractional derivative, derived numerical scheme with convergence order O ( τ 2 + h ) for solving the one-sided space fractional diffusion equation with variable coefficients. By weighting the shifted Grünwald difference operator, Tian et al. [10] combined Crank-Nicolson time discretization to construct a class of second-order numerical scheme for solving the two-sided space fractional diffusion equations. The schemes are proven to achieve convergence accuracy O ( τ 2 + h 2 ) . Zhou et al. [11] used the compact technique on the basis of weighted and shifted Grünwald difference operator and combined Crank-Nicolson time discretization to derive quasi-compact scheme for solving the two-sided space fractional diffusion equations, which is proved to be unconditionally stable and convergence with order O ( τ 2 + h 3 ) . Hao et al. [12] further derived numerical scheme with convergence accuracy O ( τ 2 + h 4 ) by using the compact technique. Haghi et al. [7] proposed a high-order compact numerical scheme for solving the two-dimensional nonlinear time-fractional fourth-order reaction-diffusion equation, the unique solvability of the numerical method is proved in detail. In addition, Li and Deng [13] proposed tempered weighted and shifted Grünwald difference operators for the Riemann-Liouville tempered fractional derivatives, and then a class of second-order numerical schemes is proposed for solving two-sided space tempered fractional diffusion equation. Numerical schemes show convergence order is O ( τ 2 + h 2 ) . More work on tempered fractional models reference [14] - [23] .

In this paper, the following nonlinear fractional advection-diffusion equations are considered:

( u ( x , t ) t = κ u ( x , t ) x + l a D x α u ( x , t ) + r x D b α u ( x , t ) + f ( u , x , t ) , ( x , t ) ( a , b ) × ( 0 , T ] , u ( x , 0 ) = φ ( x ) , x [ a , b ] , u ( a , t ) = ψ l ( t ) , u ( b , t ) = ψ r ( t ) , t [ 0 , T ] , (1)

where 1 < α < 2 , κ is the mean advective velocity, non-negative constants l and r denote the diffusion coefficients, which satisfy that l + r 0 , ψ l ( t ) 0 if l 0 , and ψ r ( t ) 0 if r 0 , the nonlinear source term f ( u , x , t ) satisfies Lipschitz condition:

| f ( u , x , t ) f ( v , x , t ) | L | u v | , u , v , (2)

D a x α u ( x , t ) and D x b α u ( x , t ) represent the left and right Riemann-Liouville fractional derivatives respectively, which are defined as [24] :

D a x α u ( x , t ) = 1 Γ ( 2 α ) 2 x 2 ( a x u ( τ , t ) ( τ x ) α 1 d τ ) ,

D x b α u ( x , t ) = 1 Γ ( 2 α ) 2 x 2 ( x b u ( τ , t ) ( τ x ) α 1 d τ ) .

The sections of this article are set as follows. The quasi-compact difference approximations of fractional derivatives are introduced in Section 2. The derivation process of numerical scheme for solving problem (1) is given in Section 3. Section 4 gives a detailed proof of the stability and convergence of the numerical scheme. In Section 5, numerical experiments are given to show that the numerical scheme constructed is effective. Section 6 gives a brief summary of the work.

2. Quasi-Compact Difference Approximations for the Fractional Derivatives

S n + α ( ) = { ν | ν L 1 ( ) and ( 1 + | w | ) | n + α | ν ^ ( w ) | d w < } ,

is a fractional Sobolev space S n + α ( ) , where ν ^ ( w ) = ν ( x ) e i w x d x is the Fourier transform of ν ( x ) .

Lemma 2.1. [9] Let ν ( x ) S n + α ( ) , 1 < α < 2 , the shift number p is an integer. The shifted Grünwald difference operators are defined as:

A h , p α ν ( x ) = 1 h α k = 0 + g k α ν ( x ( k p ) h ) , (3)

A ^ h , p α ν ( x ) = 1 h α k = 0 + g k α ν ( x + ( k p ) h ) , (4)

then

A h , p α ν ( x ) = D x α ν ( x ) + k = 1 n 1 a p α , k D x α + k ν ( x ) h k + O ( h n ) , (5)

A ^ h , p α ν ( x ) = D x + α ν ( x ) + k = 1 n 1 a p α , k D x + α + k ν ( x ) h k + O ( h n ) , (6)

where g k α = ( 1 ) k ( α k ) ( k 0 ) denotes the normalized Grünwald weights, a p α , k are the power series expansion coefficients of the function W p ( s ) = e p s ( 1 e s s ) α = 1 + ( p α 2 ) s + ( p 2 2 p α 2 + α 6 + α ( α 1 ) 8 ) s 2 + O ( | s | 3 ) .

Lemma 2.2. [25] Let ν ( x ) S 3 + α ( ) , 1 < α < 2 , if two difference operators are defined as:

B h α ν ( x ) = γ 1 A h , 1 α ν ( x ) + γ 2 A h , 0 α ν ( x ) + γ 3 A h , 1 α ν ( x ) = 1 h α k = 0 + w k α ν ( x ( k 1 ) h ) , (7)

B ^ h α ν ( x ) = γ 1 A ^ h , 1 α ν ( x ) + γ 2 A ^ h , 0 α ν ( x ) + γ 3 A ^ h , 1 α ν ( x ) = 1 h α k = 0 + w k α ν ( x + ( k 1 ) h ) . (8)

then

( I + 1 6 h 2 D x 2 ) D x α ν ( x ) = B h α ν ( x ) + O ( h 3 ) , (9)

( I + 1 6 h 2 x D + 2 ) x D + α ν ( x ) = B ^ h α ν ( x ) + O ( h 3 ) . (10)

where w k α = γ 1 g k 2 α + γ 2 g k 1 α + γ 3 g k α ( g 2 α = g 1 α = 0 ) , γ 1 = 1 24 ( 3 α 2 7 α + 4 ) , γ 2 = 1 12 ( 3 α 2 + α + 8 ) , γ 3 = 1 24 ( 3 α 2 + 5 α + 4 ) .

Noticed, D x 2 + α ν ( x ) = d 2 d x 2 ( D x α ν ( x ) ) , D x + 2 + α ν ( x ) = d 2 d x 2 ( D x + α ν ( x ) ) [24] , specially,

( I + 1 6 h 2 d 2 d x 2 ) d ν ( x ) d x = 1 2 h ( ν ( x + h ) ν ( x h ) ) + O ( h 3 ) = B h 1 ν ( x ) + O ( h 3 ) , (11)

( I + 1 6 h 2 d 2 d x 2 ) ν ( x ) = 1 6 ( ν ( x + h ) + 4 ν ( x ) + ν ( x h ) ) ) + O ( h 4 ) = C h ν ( x ) + O ( h 4 ) . (12)

3. Numerical Scheme

The time interval [ 0, T ] and the space interval [ a , b ] are divided into equidistant grids, and the time stepsize is denoted as τ = T / N and the space stepsize is denoted as h = ( b a ) / M respectively, t n = n τ , 0 n N , x i = a + i h , 0 i M .

Denoting t n + 1 / 2 = t n + t n + 1 2 , δ t u i n + 1 / 2 = u i n + 1 u i n τ , u i n + 1 / 2 = u i n + u i n + 1 2 , f i n + 1 / 2 = f ( x i , t n + 1 / 2 , u i n + u i n + 1 2 ) , f ^ i n + 1 / 2 = f ( x i , t n + 1 / 2 , U i n + U i n + 1 2 ) .

The function u ( x , ) in problem (1) belongs to S 3 + α ( ) after zero extension.

Applying ( I + 1 6 h 2 d 2 d x 2 ) to both sides of the equation in problem (1), andthen discretizing time partial derivative at point ( x i , t n + 1 / 2 ) by Crank-Nicolson method, and from Lemma 2.2, we can see:

C h δ t u i n + 1 / 2 = κ B h 1 u i n + 1 / 2 + l B h α u i n + 1 / 2 + r B ^ h α u i n + 1 / 2 + C h f i n + 1 / 2 + R i n ,0 n N 1, (13)

C h u i n + 1 u i n τ = κ B h 1 u i n + 1 / 2 + l B h α u i n + 1 / 2 + r B ^ h α u i n + 1 / 2 + C h f i n + 1 / 2 + R i n , (14)

where R i n = O ( τ 2 + h 3 ) is the local truncation error.

Denoting U i n + 1 / 2 = U i n + U i n + 1 2 , the corresponding numerical scheme is obtained by eliminating the local truncation error in (14):

C h U i n + 1 U i n τ = κ B h 1 U i n + 1 / 2 + l B h α U i n + 1 / 2 + r B ^ h α U i n + 1 / 2 + C h f ^ i n + 1 / 2 , 1 i M 1. (15)

The corresponding matrix form is:

C ( U n + 1 U n ) = P U n + 1 / 2 + τ C f ^ n + 1 / 2 + τ F n , (16)

where U n = ( U 1 n , U 2 n , , U M 1 n ) T , f ^ n + 1 / 2 = ( f ^ 1 n + 1 / 2 , f ^ 2 n + 1 / 2 , , f ^ M 1 n + 1 / 2 ) T , P = τ ( κ B 1 + l B α + r B α T ) , C = t r i d i a g { 1 6 , 2 3 , 1 6 } , B 1 = 1 2 h t r i d i a g { 1,0,1 } ,

B α = 1 h α ( w 1 α w 0 α w 2 α w 1 α w 0 α w M 2 α w M 3 α w M 4 α w 1 α w 0 α w M 1 α w M 2 α w M 3 α w 2 α w 1 α ) , (17)

F n = 1 6 τ ( U 0 n U 0 n + 1 , 0 , , 0 , U M n U M n + 1 ) T + 1 6 ( f ^ 0 n + 1 / 2 , 0 , , 0 , f ^ M n + 1 / 2 ) T + κ 2 h ( U 0 n + 1 / 2 , 0 , , 0 , U M n + 1 / 2 ) T + U 0 n + 1 / 2 h α ( l w 2 α + r w 0 α , l w 3 α , , l w M 1 α , l w M α ) T + U M n + 1 / 2 h α ( r w M α , r w M 1 α , , r w 3 α , r w 2 α + l w 0 α ) T .

4. Theoretical Analysis of the Numerical Scheme

Before giving a detailed theoretical analysis, let’s first give some lemmas that will be used.

Lemma 4.1. [26] Real matrix A of order n is negative definite if and only if D = A + A T 2 is negative definite.

Lemma 4.2. C = t r i d i a g { 1 6 , 2 3 , 1 6 } , for all given nonzero real column vectors ε , C satisfies that:

1 3 ε T ε ε T C ε ε T ε .

Proof. By Gerschgorin disk theorem [27] , it is easy to check 1 3 λ ( C ) 1 , then 1 3 ε T ε ε T C ε ε T ε

Lemma 4.3. Matrix P is given in (16) is negative definite.

Proof. Let D = P + P T 2 = ( l + r ) τ 2 ( B α + B α T ) , from [17] , B α is negative definite, by Lemma 4.1, it is known that the matrix P is negative definite.¨

Define U h = { u | u = { u i } is a grid function defined on { x i = a + i h } i = 1 M 1 } . For u U h , the corresponding discrete L 2 -norm is defined as u L 2 = ( h i = 1 M 1 u i 2 ) 1 / 2 .

Theorem 4.1. The numerical scheme (15) is stable.

Proof. Let U i n and V i n represent the numerical solutions obtained by scheme (15) under different initial conditions respectively. Denoting ε i n = U i n V i n , ε n = ( ε 1 n , ε 2 n , , ε M 1 n ) T , then

C ( ε n + 1 ε n ) = P ε n + 1 / 2 + τ C ( f ^ n + 1 / 2 f ¯ n + 1 / 2 ) , (18)

where f ¯ i n + 1 / 2 = f ( x i , t n + 1 / 2 , V i n + V i n + 1 2 ) .

Let’s multiply both sides of (18) by h ( ε n + 1 / 2 ) T , we get:

h ( ε n + 1 / 2 ) T C ( ε n + 1 ε n ) = h ( ε n + 1 / 2 ) T P ε n + 1 / 2 + τ h ( ε n + 1 / 2 ) T C ( f ^ n + 1 / 2 f ¯ n + 1 / 2 ) , (19)

because

h ( ε n + 1 / 2 ) T C ( ε n + 1 ε n ) = h 2 ( ε n + 1 + ε n ) T C ( ε n + 1 ε n ) = h 2 ( ( ε n + 1 ) T C ε n + 1 ( ε n ) T C ε n ) , (20)

arrange the formula to obtain:

h 2 ( ( ε n + 1 ) T C ε n + 1 ( ε n ) T C ε n ) = h ( ε n + 1 / 2 ) T P ε n + 1 / 2 + τ h ( ε n + 1 / 2 ) T C ( f ^ n + 1 / 2 f ¯ n + 1 / 2 ) . (21)

The following inequalities are established:

| ε i n + 1 / 2 | = | 1 2 ( ε i n + ε i n + 1 ) | 1 2 ( | ε i n | + | ε i n + 1 | ) ,

| f ^ i n + 1 / 2 f ¯ i n + 1 / 2 | L | ε i n + 1 / 2 | L 2 ( | ε i n | + | ε i n + 1 | ) ,

( ε n + 1 / 2 ) T C ( f ^ n + 1 / 2 f ¯ n + 1 / 2 ) L 4 ( | ε 1 n | + | ε 1 n + 1 | , , | ε M 1 n | + | ε M 1 n + 1 | ) C ( | ε 1 n | + | ε 1 n + 1 | , , | ε M 1 n | + | ε M 1 n + 1 | ) T L 2 ( ( | ε 1 n | , , | ε M 1 n | ) C ( | ε 1 n | , , | ε M 1 n | ) T + ( | ε 1 n + 1 | , , | ε M 1 n + 1 | ) C ( | ε 1 n + 1 | , , | ε M 1 n + 1 | ) T ) L 2 h ( ε n L 2 2 + ε n + 1 L 2 2 ) .

Denoting E n + 1 = h ( ε n + 1 ) T C ε n + 1 , from Lemma 4.3 and (21), then

E n + 1 E n + τ L ( ε n L 2 2 + ε n + 1 L 2 2 ) E 0 + τ L ( k = 0 n ε k L 2 2 + k = 1 n + 1 ε k L 2 2 ) = E 0 + τ L ε 0 L 2 2 + τ L ε n + 1 L 2 2 + 2 τ L k = 1 n ε k L 2 2 . (22)

Applying 1 3 ε k L 2 2 E k ε k L 2 2 , then for all given μ ( 0,1 ) , when 0 < τ 1 μ 3 L , we obtain:

ε n + 1 L 2 2 3 + 3 τ L 1 3 τ L ε 0 L 2 2 + 6 τ L 1 3 τ L k = 1 n ε k L 2 2 4 μ μ ε 0 L 2 2 + 6 τ L μ k = 1 n ε k L 2 2 . (23)

By the discrete Gronwall inequalities,

ε n + 1 L 2 2 4 μ μ e 6 n τ L μ ε 0 L 2 2 4 μ μ e 6 T L μ ε 0 L 2 2 . (24)

Therefore,

ε n + 1 L 2 C 1 ε 0 L 2 , 0 n N 1, (25)

where C 1 = 4 μ μ e 6 T L μ

Theorem 4.2. The numerical scheme (15) is convergent.

e n L 2 C 2 ( τ 2 + h 3 ) ,1 n N ,

where e n = ( e 1 n , e 2 n , , e M 1 n ) T , e i n = u i n U i n , C 2 is existed constant.

Proof. Subtracting (15) from (14), we know that:

C h e i n + 1 e i n τ = κ B h 1 e i n + 1 / 2 + l B h α e i n + 1 / 2 + r B ^ h α u i n + 1 / 2 + C h ( f i n + 1 / 2 f ^ i n + 1 / 2 ) + R i n . (26)

The corresponding matrix form is:

C ( e n + 1 e n ) = P e n + 1 / 2 + τ C ( f n + 1 / 2 f ^ n + 1 / 2 ) + τ R n , (27)

where R n = ( R 1 n , R 2 n , , R M 1 n ) T .

Let’s multiply both sides of (27) by h ( e n + 1 / 2 ) T ,

h ( e n + 1 / 2 ) T C ( e n + 1 e n ) = h ( e n + 1 / 2 ) T P e n + 1 / 2 + τ h ( e n + 1 / 2 ) T C ( f n + 1 / 2 f ^ n + 1 / 2 ) + τ h ( e n + 1 / 2 ) T R n . (28)

Denoting E n + 1 = h ( e n + 1 ) T C e n + 1 , similar to the proof of Theorem 4.1, then

E n + 1 E n + τ L ( e n L 2 2 + e n + 1 L 2 2 ) + 2 τ h ( e n + 1 / 2 ) T R n = E n + τ L ( e n L 2 2 + e n + 1 L 2 2 ) + τ h i = 1 M 1 ( e i n + e i n + 1 ) R i n E n + τ L ( e n L 2 2 + e n + 1 L 2 2 ) + 1 2 τ h i = 1 M 1 ( | e i n | 2 + | e i n + 1 | 2 + 2 | R i n | 2 ) = E n + τ 1 + 2 L 2 ( e n L 2 2 + e n + 1 L 2 2 ) + τ R n L 2 2 E 0 + τ 1 + 2 L 2 ( k = 0 n e k L 2 2 + k = 1 n + 1 e k L 2 2 ) + τ k = 0 n R n L 2 2 = E 0 + τ 1 + 2 L 2 e 0 L 2 2 + τ 1 + 2 L 2 e n + 1 L 2 2 + ( 1 + 2 L ) τ k = 1 n e k L 2 2 + τ k = 0 n R n L 2 2 . (29)

Applying 1 3 e k L 2 2 E k e k L 2 2 , and noticing that e 0 L 2 2 = 0 , then for all given μ ( 0,1 ) , when 0 < τ 2 6 μ 3 + 6 L , we obtain:

e n + 1 L 2 2 6 τ 2 ( 3 + 6 L ) τ k = 0 n R k L 2 2 + 6 ( 1 + 2 L ) τ 2 ( 3 + 6 L ) τ k = 1 n e k L 2 2 τ μ k = 0 n R k L 2 2 + ( 1 + 2 L ) τ μ k = 1 n e k L 2 2 . (30)

By the discrete Gronwall inequalities,

e n + 1 L 2 2 τ μ e n ( 1 + 2 L ) τ μ k = 0 n R k L 2 2 τ μ e ( 1 + 2 L ) T μ k = 0 n R k L 2 2 . (31)

e n + 1 L 2 C 2 ( τ 2 + h 3 ) . (32)

¨

5. Numerical Experiments

In this section, we give some numerical experiments to prove the accuracy and validity of the numerical scheme.

Order = log m ( e L 2 , h e L 2 , h / m ) ,

is the order of measurement.

Example 5.1. Consider the following nonlinear fractional advection-diffusion equations.

( u ( x , t ) t = κ u ( x , t ) x + l a D x α u ( x , t ) + r x D b α u ( x , t ) + f ( u , x , t ) , ( x , t ) ( 0 , 1 ) × ( 0 , 1 ] , u ( 0 , t ) = 0 , u ( 1 , t ) = 0 , t [ 0 , 1 ] , u ( x , 0 ) = x 4 ( 1 x ) 4 , x [ 0 , 1 ] ,

where 1 < α < 2 , and the nonlinear source term is:

f ( u , x , t ) = ( u ( x , t ) ) 3 2 + 4 κ e α t ( 1 2 x ) ( 1 x ) 3 x 3 + α e α t x 4 ( 1 x ) 4 e α t [ l k = 0 4 ( 1 ) k ( 4 k ) Γ ( 5 + k ) Γ ( 5 + k α ) x 4 + k α + r k = 0 4 ( 1 ) k ( 4 k ) Γ ( 5 + k ) Γ ( 5 + k α ) ( 1 x ) 4 + k α + e α t 2 x 6 ( 1 x ) 6 ] .

The analytical solution is u ( x , t ) = e α t x 4 ( 1 x ) 4 .

Choose different α , the mean advective velocity κ , diffusion coefficients l and r, the proposed method is used to solve Example 5.1. Let τ = h 3 2 , the error results and measurement order results obtained by the numerical method are displayed in Table 1 and Table 2. From Table 1 and Table 2, we can see that the numerical scheme reaches the third-order precision in the spatial direction, and the results are in complete agreement with the conclusion of theoretical analysis. In Table 3 and Table 4, we choose different time stepsizes and fixed h = 1 1000 , and obtain the errors and the time measurement order results. From Table 3 and Table 4, we verify the numerical scheme is second-order in time.

6. Conclusion

The novelty of this paper is that the higher-order numerical scheme of the

Table 1. Errors and the corresponding space measurement order results at t = 1 , κ = 1 , l = 1 , r = 2 .

Table 2. Errors and the corresponding space measurement order results at t = 1 , κ = 1 10 , l = 2 , r = 5 .

Table 3. Errors and the corresponding time measurement order results at t = 1 , h = 1 1000 , κ = 1 , l = 1 , r = 2 .

Table 4. Errors and the corresponding time measurement order results at t = 1 , h = 1 1000 , κ = 1 10 , l = 2 , r = 5 .

nonlinear fractional advection-diffusion equations is studied, and the spatial convergence accuracy reaches the third order. Firstly, Crank-Nicolson quasi-compact scheme is constructed. Secondly, the numerical scheme is analyzed theoretically by the energy method in the sense of L2-norm. Finally, the effectiveness of the numerical scheme is verified in numerical experiments.

Acknowledgments

The authors would like to express thanks to the editors and anonymous reviewers for their valuable comments and suggestions. This research is supported by the Xinjiang University of Political Science and Law President Fund (XZSK2022039).

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Baeumer, B. and Meerschaert, M. (2010) Tempered Stable Lévy Motion and Transient Super-Diffusion. Journal of Computational and Applied Mathematics, 233, 2438-2448.
https://doi.org/10.1016/j.cam.2009.10.027
[2] Liu, F., Anh, V. and Turner, I. (2004) Numerical Solution of the Space Fractional Fokker-Plank Equation. Journal of Computational and Applied Mathematics, 166, 209-219.
https://doi.org/10.1016/j.cam.2003.09.028
[3] Liu, F., Zhuang, P. and Burrage, K. (2012) Numerical Methods and Analysis for a Class of Fractional Advection-Dispersion Models. Computers & Mathematics with Applications, 64, 2990-3007.
https://doi.org/10.1016/j.camwa.2012.01.020
[4] Meerschaert, M. and Tadjeran, C. (2004) Finite Difference Approximations for Fractional Advection-Dispersion Equations. Journal of Computational and Applied Mathematics, 172, 65-77.
https://doi.org/10.1016/j.cam.2004.01.033
[5] Meerschaert, M. and Tadjeran, C. (2006) Finite Difference Approximations for Two-Sided Space-Fractional Partial Differential Equations. Applied Numerical Mathematics, 56, 80-90.
https://doi.org/10.1016/j.apnum.2005.02.008
[6] Ortigueira, M. (2006) Riesz Potential Operators and Inverses via Fractional Centred Derivatives. International Journal of Mathematics and Mathematical Sciences, 2006, Article ID: 048391.
https://doi.org/10.1155/IJMMS/2006/48391
[7] Haghi, M., Ilati, M. and Dehghan, M. (2023) A Fourth-Order Compact Difference Method for the Nonlinear Time-Fractional Fourth-Order Reaction-Diffusion Equation. Engineering with Computers, 39, 1329-1340.
https://doi.org/10.1007/s00366-021-01524-2
[8] Zamani-Gharaghoshi, H., Dehghan, M. and Abbaszadeh, M. (2024) A Meshless Collocation Method Based on Pascal Polynomial Approximation and Implicit Closest Point Method for Solving Reaction-Diffusion Systems on Surfaces. Engineering with Computers, 40, 313-322.
https://doi.org/10.1007/s00366-023-01794-y
[9] Tadjeran, C., Meerschaert, M. and Scheffler (2006) A Second-Order Accurate Numerical Approximation for the Fractional Diffusion Equation. Journal of Computational Physics, 213, 205-213.
https://doi.org/10.1016/j.jcp.2005.08.008
[10] Tian, W., Zhou, H. and Deng, W. (2015) A Class of Second Order Difference Approximations for Solving Space Fractional Diffusion Equations. Mathematics of Computation, 84, 1703-1727.
https://doi.org/10.1090/S0025-5718-2015-02917-2
[11] Zhou, H., Tian, W. and Deng, W. (2013) Quasi-Compact Finite Difference Schemes for Space Fractional Diffusion Equations. Journal of Scientific Computing, 56, 45-66.
https://doi.org/10.1007/s10915-012-9661-0
[12] Hao, Z., Sun, Z. and Cao, W. (2015) A Fourth-Order Approximation of Fractional Derivatives with Its Applications. Journal of Computational Physics, 281, 787-825.
https://doi.org/10.1016/j.jcp.2014.10.053
[13] Li, C. and Deng, W. (2016) High Order Schemes for the Tempered Fractional Diffusion Equations. Advances in Computational Mathematics, 42, 543-572.
https://doi.org/10.1007/s10444-015-9434-z
[14] Celik, C. and Duman, M. (2017) Finite Element Method for a Symmetric Tempered Fractional Diffusion Equation. Applied Numerical Mathematics, 120, 270-286.
https://doi.org/10.1016/j.apnum.2017.05.012
[15] Dehghan, M., Abbaszadeh, M. and Deng, W. (2017) Fourth-Order Numerical Method for the Space-Time Tempered Fractional Diffusion-Wave Equation. Applied Mathematics Letters, 73, 120-127.
https://doi.org/10.1016/j.aml.2017.04.011
[16] Hu, D. and Cao, X. (2019) The Implicit Midpoint Method for Riesz Tempered Fractional Diffusion Equation with a Nonlinear Source Term. Advances in Difference Equations, 2019, Article No. 66.
https://doi.org/10.1186/s13662-019-1990-y
[17] Yu, Y., Deng, W., Wu, Y. and Wu, J. (2017) Third Order Difference Schemes (without Using Points Outside of the Domain) for One Sided Space Tempered Fractional Partial Differential Equations. Applied Numerical Mathematics, 112, 126-145.
https://doi.org/10.1016/j.apnum.2016.10.011
[18] Zhang, Y., Li, Q. and Ding, H. (2018) High-Order Numerical Approximation Formulas for Riemann-Liouville (Riesz) Tempered Fractional Derivatives: Construction and Application (I). Applied Mathematics and Computation, 329, 432-443.
https://doi.org/10.1016/j.amc.2018.02.023
[19] Abbaszadeh, M. and Dehghan, M. (2021) Fourth-Order Alternating Direction Implicit Difference Scheme to Simulate the Space-Time Riesz Tempered Fractional Diffusion Equation. International Journal of Computer Mathematics, 98, 2137-2155.
https://doi.org/10.1080/00207160.2020.1841175
[20] Deng, W. and Zhang, Z. (2017) Numerical Schemes of the Time Tempered Fractional Feynman-Kac Equation. Computers & Mathematics with Applications, 73, 1063-1076.
https://doi.org/10.1016/j.camwa.2016.12.017
[21] Hanert, E. and Piret, C. (2014) A Chebyshev Pseudospectral Method to Solve the Space-Time Tempered Fractional Diffusion Equation. SIAM Journal of Scientific Computing, 36, A1797-A1812.
https://doi.org/10.1137/130927292
[22] Hu, D. and Cao, X. (2019) A Fourth-Order Compact ADI Scheme for Two-Dimensional Riesz Space Fractional Nonlinear Reaction-Diffusion Equation. International Journal of Computer Mathematics, 97, 1928-1948.
https://doi.org/10.1080/00207160.2019.1671587
[23] Yang, Q., Liu, F. and Turner, I. (2010) Numerical Methods for Fractional Partial Differential Equations with Riesz Space Fractional Derivatives. Applied Mathematical Modelling, 34, 200-218.
https://doi.org/10.1016/j.apm.2009.04.006
[24] Podlubny, I. (1999) Fractional Differential Equations. Academic Press, New York.
https://lib.ugent.be/catalog/rug01:002178612
[25] Yu, Y., Deng, W. and Wu, Y. (2017) High-Order Quasi-Compact Difference Schemes for Fractional Diffusion Equations. Communications in Mathematical Sciences, 15, 1183-1209.
https://doi.org/10.4310/CMS.2017.v15.n5.a1
[26] Bhatia, R. (2009) Positive Definite Matrices. Princeton University Press, Princeton.
https://doi.org/10.1515/9781400827787
[27] Varga, R. (2009) Matrix Iterative Analysis. Springer Science and Business Media, Berlin.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.