Abstract
Based on the weighted and shifted Grünwald operator, a new high-order compact finite difference scheme is derived for the fractional sub-diffusion equation. It is proved that the difference scheme is unconditionally stable and convergent in \(L_{\infty }\)-norm by the energy method. The convergence order is \(O(\tau ^3+h^4)\), where \(\tau \) is the temporal step size and \(h\) is the spatial step size. Although the unconditional stability and convergence of the difference scheme are obtained for all \(\alpha \in (0, \alpha ^{*}],\) where \(\alpha ^{*}=0.9569347,\) some numerical experiments show that they are valid for all \(\alpha \in (0, 1).\) Finally, some numerical examples are given to confirm the theoretical results.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
During the past several decades, the study of fractional partial differential equations (FPDEs) has attracted many scholars’ attention. The classical integer order derivatives are the local operators, which may not be adequate to describe the underlying phenomena. The fractional integrals and derivatives enjoy the nonlocal properties. They can model anomalous transport phenomena and more accurately describe the evolution of a system in some physical and chemical processes. For more relevant references and books, readers can refer to the works [1–5]. Like traditional partial differential equations, most commonly, the exact solutions of fractional partial differential equations are not available. Even if their solutions can be found, they are usually in the forms of series, which are difficult to evaluate. One can read some relevant works [6–8]. So the numerical investigation of the fractional partial differential equations has been a vital topic in recent years.
For the time-fractional diffusion equations, there have been a lot of numerical works. Langlands and Henry [9] considered an implicit numerical method for solving the fractional diffusion equation and analyzed the accuracy and stability of the scheme. Zhuang et al. [10, 11] integrated the linear and non-linear sub-diffusion equations about the time variable \(t,\) then approximated the obtained equivalent equations numerically with the idea of numerical integrals. Sun and Wu [12] first derived the error estimate of the \(L_1\) formula to approximate the Caputo derivative and constructed the fully discrete difference scheme for the diffusion-wave equation. Gao and Sun [13] applied the \(L_1\) approximation for the time-fractional derivative and developed a compact finite difference scheme for the fractional sub-diffusion equation. The solvability, stability and \(L_{\infty }\) convergence are proved by the energy method. Zhang et al. [14] proposed a Crank–Nicolson-type difference scheme for solving the sub-diffusion equation, in which the discrete \(H_1\) norm convergence has been proved and the maximum norm error estimate has been obtained. Adopting the Grünwald–Letnikov formula to approximate time-fractional derivative, Yuste [15, 16] proposed the explicit schemes and analyzed these two schemes using the Von Neumann method. Also, Cui [17, 18] proposed a compact difference scheme. In addition, some scholars are devoted to other numerical algorithms, including the finite element method [19], spectral element method [20, 21] and others.
Fractional derivatives are nonlocal and they have the character of history dependence, which implies a high storage requirement. Therefore, developing high-order numerical methods can reduce the requirement and computational complexity. Considerable attentions have been paid to the high-order schemes. Cao and Xu [22] constructed a high-order approximation scheme based on a modified 2-block-by-block method for nonlinear FODEs and proved that the convergence order of the scheme is \(3+\alpha \) for \(0<\alpha <1\), and 4 for \(\alpha >1.\) Gao et al. [23] modified the \(L_1\) approximation formula to discretize the Caputo fractional derivative and showed that the order of local truncation error is 3-\(\alpha \) for \(0<\alpha <1,\) but they did not provide a rigorous theoretical analysis about the stability and convergence of the obtained difference scheme. Li and Ding [24] derived a second-order difference approximation formula based on Lubich’s operator for the Riemann–Liouville fractional derivative, where the strict convergence analysis for the corresponding difference scheme has only been obtained for \(\alpha \in [\frac{3}{8},1).\) Recently, by assembling the Grünwald–Letnikov difference operators with different weights and shifts, Deng’ group [25–28] has presented some high-order approximations to discretize the space-fractional derivatives. Following this idea, weighting two shifted Grünwald–Letnikov difference operators and choosing shifts \((p,q)=(0,-1),\) Wang and Vong [29] provided a second-order accuracy formula to approximate the time-fractional derivative and established a compact finite difference scheme for solving the modified anomalous fractional sub-diffusion equation.
Consider the following one-dimensional fractional sub-diffusion equation with non-homogeneous source term on the interval \([a,b]\)
where \(0<\alpha <1\) and the operator \({}^C_0\mathcal {D}^{\alpha }_{t}\) denotes the Caputo fractional derivative of order \(\alpha \) defined by [1]
\(K_{\alpha }\) is the generalized diffusion constant, \(\Gamma (\cdot )\) is the gamma function, and \(\beta (t),\gamma (t),\psi (x)\) and \(f(x,t)\) are the known smooth functions, \(\beta (0)=\psi (a),~\gamma (0)=\psi (b)\). Without loss of generality, suppose Eq. (1.1) with zero initial value \(u(x,0)=0\), for any \(x\in [a,b].\) Otherwise, we take a transform \(v(x,t)=u(x,t)-\psi (x)\).
The main goal of this paper is to construct a high-order compact finite difference scheme and establish the corresponding error estimate. The method follows the idea of the weighted and shifted Grünwald–Letnikov difference operators [25, 29]. Choosing shifts \((p,q,r)=(0,-1,-2)\) and utilizing the equivalence of Riemann–Liouville derivative and Caputo derivative under some regularity assumptions, we derive a third-order accuracy formula to approximate Caputo fractional derivative and construct the corresponding compact difference scheme (called the \(GL_3\) scheme) for the fractional sub-diffusion equation. The unconditional stability and \(L_{\infty }\) convergence are proved by the discrete energy method. The main novelty of this paper is that we obtain a high-order approximation scheme in time by using the same grid points as [29]. This advantage implies that our scheme needs much less storage capacity than the scheme mentioned in [29], since fractional derivatives have memory and hereditary properties.
The outline of this paper is as follows. In Sect. 2, some notations and lemmas are listed. In Sect. 3, the \(GL_3\) finite difference scheme is derived for the fractional sub-diffusion equation. The unconditional stability and convergence are rigorously proved in Sect. 4 by the discrete energy method. Some numerical examples are presented in Sect. 5 to support our theoretical results and indicate the efficiency of the difference scheme. Some comments are presented in the concluding section.
2 Some Notations and Lemmas
We commence with some definitions of fractional derivatives and Riemann–Liouville fractional integral.
Definition 2.1
[1–5] The \(\alpha (n-1<\alpha <n)\) order fractional derivatives of the function \(f(t)\) are defined as
-
(1)
Riemann–Liouville fractional derivative:
$$\begin{aligned} {}_{0}\mathcal {D}^{\alpha }_tf(t)=\frac{1}{\Gamma (n-\alpha )}\frac{d^n}{dt^n}\int _{0}^t\frac{f(\xi )}{(t-\xi )^{\alpha +1-n}}d\xi , \end{aligned}$$ -
(2)
Liouville fractional derivative:
$$\begin{aligned} {}_{-\infty }\mathcal {D}^{\alpha }_tf(t)=\frac{1}{\Gamma (n-\alpha )}\frac{d^n}{dt^n}\int _{-\infty }^t\frac{f(\xi )}{(t-\xi )^{\alpha +1-n}}d\xi . \end{aligned}$$
Definition 2.2
[1] The \(\alpha \in \mathbb {R}_{+}\) order Riemann–Liouville fractional integral of the function \(f(t)\) is defined as
For the numerical approximation, take two positive integers \(M,~N\) and let \(h=(b-a)/M,~\tau =T/N\). Define \(x_i=a+ih ~(0\le i\le M),~t_n=n\tau ~(0\le n\le N),\Omega _h=\{x_i~|~0\le i\le M\}, \Omega _{\tau }=\{t_n~|~0\le n\le N\}\), then the computational domain \([a,b]\times [0,T]\) is covered by \(\Omega _h\times \Omega _{\tau }\). Let \(\mathcal {V}=\{u_i^n~|~0\le i\le M,0\le n\le N\}\) be the grid function on the mesh \(\Omega _h\times \Omega _{\tau }\). For any grid function \(u\in \mathcal {V}\), we introduce the following notations
and the average operator
The following four lemmas will be used in the derivation of the difference scheme.
Define
The textbook [30] provided the following result.
Lemma 2.1
If \(f\in C^{2+m}(\mathbb {R}),\) then \(f\in \fancyscript{C}^{\alpha +m}(\mathbb {R})\) is valid for \(\alpha \in (0,1).\)
Lemma 2.2
[31] Suppose that \(f\in L_1(\mathbb {R})\cap \fancyscript{C}^{\alpha +1}(\mathbb {R})\), and define the shifted Grünwald difference operator by
where \(p\) is an integer and \(g^{(\alpha )}_k=(-1)^k\left( {\begin{array}{c}\alpha \\ k\end{array}}\right) =\frac{\Gamma (k-\alpha )}{\Gamma (-\alpha )\Gamma (k+1)}\). Then
uniformly for \(t\in \mathbb {R}\) as \(\tau \rightarrow 0\).
In fact, the sequences \(\{g_k^{(\alpha )}\}\) in Eq. (2.1) are the coefficients of the power series of the function \((1-z)^{\alpha }\), i.e,
for all \(-1<z\le 1\), and they can be evaluated recursively
Lemma 2.3
[25] Let \(f(t)\in L_1(\mathbb {R}),{}_{-\infty }\mathcal {D}^{\alpha +3}_{t}f(t)\) and its Fourier transform belong to \(L_1(\mathbb {R})\). Define the weighted and shifted Grünwald difference operator by
where
and \(p,q\) and \(r\) are all integers. Then we have
uniformly for \(t\in \mathbb {R}\) as \(\tau \rightarrow 0\).
Remark
From the proof of Lemma 2.3, the condition that \(f(t)\in L_1(\mathbb {R}), {}_{-\infty }\mathcal {D}^{\alpha +3}_{t}f(t)\) and its Fourier transform belong to \(L_1(\mathbb {R})\) can be replaced by \(f\in L_1(\mathbb {R}) \cap \fancyscript{C}^{\alpha +3}(\mathbb {R})\). Furthermore, if \(\alpha \in (0,1),\) according to Lemma 2.1, \(f\in C^{5}(\mathbb {R})\) satisfies the condition of Lemma 2.3.
Due to the symmetry of \(p,q\) and \(r\), we can suppose that \(p>q>r\). By choosing \((p,q,r)=(0,-1,-2)\), we get
If \(f(t)\in C[0,T]\), we define
then \(\tilde{f}(t)\) is a function on \(\mathbb {R}\).
Now further assume that \(f(t)\in C^5[0,T],\) and \(d^kf(0)/dt^k=0,~~ k=0,1,\ldots ,5.\) Thus, \(\tilde{f}(t)\) satisfies the conditions of Lemma 2.3. According to Lemma 2.3, we have
Noticing the relationship [1, 14] of the Caputo fractional derivative and the Riemann–Liouvile fractional derivative:
if \(f(0)=0,\) we have
Lemma 2.4
If \(f(0)=0\), then it holds that \({}_0\mathcal {D}^{-\alpha }_t({}^C_0\mathcal {D}^{\alpha }_tf(t))=f(t)\), for \(0<\alpha <1.\)
Proof
Let us now consider the Riemann–Liouvile fractional integral of order \(q\) of the fractional derivative of order \(p\) [1]:
Under the condition \(f(0)=0,\) we can see that
It follows from (2.4) and (2.5) that
\(\square \)
To obtain the fourth-order accuracy in spatial direction, we need the following lemma.
Lemma 2.5
[32] Denote \(\theta (s)=(1-s)^3[5- 3(1 - s)^2].\) If \(g(x)\in C^6[a,b],\) \(h=(b-a)/M, x_i=a+ih ~(0 \le i\le M),\) it holds that
We are now ready to establish our high-order compact scheme in the following section.
3 Derivation of the \(GL_3\) Finite Difference Scheme
Let \(\mathcal {V}_{\tau }=\{u~|~u=(u^0,u^1,\ldots ,u^{N})\}\) be grid function space on \(\Omega _{\tau }\). For any grid function \(u\in \mathcal {V}_{\tau }\), for simplicity, we formally define the time weighted and shifted Grünwald-Letnikov difference (TWSGD) operator
where
Remark
When applying the TWSGD operator to approximate \({}_0^C\mathcal {D}^{\alpha }_tu(x_i,t_n)\) in Eq. (1.1), it ensures that the truncation error order is 3 on the grid points \(t_n=n\tau (n=2,3,\ldots ,N)\) in temporal direction provided that \(u(\cdot ,t)\in C^{5}[0,t_n]\) and \(\frac{\partial ^k u(\cdot ,t)}{\partial t^k}|_{t=0}=0,~0\le k\le 5\). Nevertheless, we should consider the discretization scheme of Eq. (1.1) at the first time level alone.
Define the grid functions
Firstly, we derive the compact scheme of the fractional sub-diffusion equation (1.1) from the second level to \(N\)th level.
Suppose \(u(x,t)\in C^{6,5}_{x,t}([a,b]\times [0,T])\) and \(\partial ^ku(x,0)/\partial t^k=0\) for \(k=0,1,\ldots ,5.\) Considering Eq. (1.1) on the grid point \((x_i,t_n)\), we have
For the time discretization, we choose the TWSGD operator \({}_0\mathbb {D}^{\alpha }_{\tau }U^n_i\) to approximate \({}^C_0\mathcal {D}^{\alpha }_tu(x_i,\) \(t_n),\) which implies
For the space discretization, performing the average operator \(\fancyscript{A}\) on both sides of Eq. (3.3), we get
Using Lemma 2.5, we have
where there exists a positive constant \(C_1\) such that
Next, we derive the compact scheme of the fractional sub-diffusion equation (1.1) at the first time level.
By operating the Riemann–Liouville fractional integral operator \({}_0\mathcal {D}^{-\alpha }_t\) on both sides of Eq. (1.1), we obtain
Using Lemma 2.4, we have
where \(F(x,t)={}_0\mathcal {D}^{-\alpha }_tf(x,t)\).
Taking \(t=t_1\) in Eq.(3.7), we have
Using \(u_{xx}(x,0), u_{xxt}(x,0)\) and \(u_{xx}(x,t_1)\) makes a Hermite interpolation of \(u_{xx}(x,\xi )\) on the interval \([0,t_1]\), as follows
where
Suppose \(u(x,0)=0\) and \(u_t(x,0)=0\). We obtain an approximation
It is easy to check that
where
It follows from (3.9) that
For the space discretization, performing the average operator \(\fancyscript{A}\) on both side of Eq. (3.10), we have
Using Lemma 2.5, we obtain
where there exists a positive constant \(C_3\) such that
Omitting the small terms \(R^1_i\) in Eq. (3.12) and \(R^n_i\) in Eq. (3.5), replacing \(U_i^n\) with its numerical approximation \(u^n_i\), and noticing the initial-boundary conditions
we get the following \(GL_3\) difference scheme
For the first time level, Eq. (3.17) is a tridiagonal system of linear algebraic equations and the coefficient matrix is strictly diagonally dominant. Similarly, from the second time level to \(N\)th time level, Eq. (3.16) is also a tridiagonal system of linear algebraic equations and the coefficient matrix is also strictly diagonally dominant. Therefore, the \(GL_3\) difference scheme (3.16)–(3.19) has a unique solution and can be easily solved with Thomas algorithm.
4 The Analysis of Stability and Convergence of the \(GL_3\) Difference Scheme
We give some notations and lemmas, which will be used in the analysis of the stability and convergence.
Define \(\mathcal {V}_h=\{u~|~u=(u_0,u_1,\ldots ,u_M),~u_0=u_M=0\}\) be grid function space on \(\Omega _h\). For any \( u,v\in \mathcal {V}_h\), we define the discrete inner products, the corresponding norms and \(L_{\infty }\)-norm as follows
Lemma 4.1
[33] Let \(u\in \mathcal {V}_h\). Then, it holds that
Lemma 4.2
[13] Let \(v\in \mathcal {V}_h\). Then, it holds that
Define
Obviously, \((\cdot ,\cdot )_A\) is an inner product. And \(\Vert u\Vert _A=\sqrt{(u,u)_A}\) denotes the induced norm.
Lemma 4.3
Let \(\{w_k^{(\alpha )}\}^{\infty }_{k=0}\) be defined as in (3.1). If \(\alpha \in (0,\alpha ^{*}]\), then for any positive integer \(N\) and real vector \((v^0,v^1,\ldots ,v^N)\in R^{N+1}\), it holds that
where \(\alpha ^{*}=0.9569347.\)
Proof
For simplicity, we denote \(w_k=w_k^{(\alpha )}\) without ambiguity. One can easily check that, the validity of Lemma 4.3 is equivalent to proving that the symmetric Toeplitz matrix \(W\) is positive semi-definite, where
Notice that the generating function [25] of \(W\) is given by
Obviously, \(f(\alpha ,x)\) is a real-valued and even function of \(x\) on \([-\pi ,\pi ]\), so we just consider its principal value on \([0,\pi ]\) [25]. Applying the formula
we obtain
where the generating function \(f(\alpha ,x)\) is a transcendental function, which is difficult to analyze the property analytically.
Now, let us analyze the generating function \(f(\alpha ,x)\) numerically. Figure 1 shows that \(f(\alpha ,x)\le 0\) on a very small domain. To depict the values of \(f(\alpha ,x)\) clearly, we draw the contours of the function \(f(\alpha ,x)\) and the amplified contours on the partial domain (see Figs. 2, 3). In fact, we need an \(\alpha ^{*},\) which satisfies that for all \(x\in [0,\pi ],\) \(f(\alpha ,x)\ge 0\) when \(\alpha \in (0,\alpha ^{*}].\) Based on this, we consider the tangent line parallel to \(x\)-axis of the curve \(f(\alpha ,x)=0\). Solve the simultaneous system
By Newton iteration method, we get its solution \( (\alpha ^{*}, x^{*}) =(0.9569347,0.9529852),\) which is the coordinate of the tangent point. Thus, \(f(\alpha ,x)\ge 0\) for \(\alpha \in (0,\alpha ^{*}].\) The lemma follows as a result of the Grenander–Szegö Theorem [34]. \(\square \)
Lemma 4.4
If \(\alpha \in (0,1),\) then,
where \(w^{(\alpha )}_0=\frac{24+17\alpha +3\alpha ^2}{24}.\)
Proof
Noticing a two-side inequality of the Gamma function[35]:
Taking \(n=3,\) we have
Hence,
Let \(g(\alpha )=\frac{5(24+17\alpha +3\alpha ^2)}{12}-6\cdot 3^{\alpha }.\) It is easy to analyze that the function \(g(\alpha )\) is monotone increasing for \(\alpha \in (0,\alpha _0)\) and monotone decreasing for \(\alpha \in (\alpha _0,1),\) where \(\alpha _0=0.0957\), acquired by bisection method. Together with \(g(0)=4,\) \(g(\alpha _0)=4.0241\) and \(g(1)=\frac{1}{3},\) one finds that \(g(\alpha )\ge g(1)=\frac{1}{3}\) for \(\alpha \in (0,1).\) From (4.1), we get
Now we turn to the analysis of the stability and convergence for the \(GL_3\) difference scheme. To this end, a Prior estimate will be given to simplify the proof.\(\square \)
Lemma 4.5
Suppose \(\{v_i^n\}\) is the solution of the following difference scheme
then, if \(\alpha \in (0,\alpha ^{*}]\), we have
where \(C_4=\frac{3(b-a)^2}{8K_{\alpha }^2}+\frac{15(b-a)^2(w_0^{(\alpha )})^2\Gamma (3+\alpha )}{16K_{\alpha }^2(10w_0^{(\alpha )}-3\Gamma (3+\alpha ))}\) and \(\Vert f^n\Vert ^2=h\sum ^{M-1}_{i=1}(f^n_i)^2.\)
Proof
(I) Multiplying Eq. (4.2) by \(h(\frac{1}{K_{\alpha }}\fancyscript{A}v^n_i)\) and summing up for \(i\) from 1 to \(M-1\), we obtain
For the second term on the left hand of (4.7), we have
For the term on the right hand of (4.7), using Lemmas 4.1 and 4.2, it holds that
Substituting (4.8)-(4.9) into (4.7), we get
Replacing \(n\) by \(m\) and summing up for \(m\) from \(2\) to \(n\) on both sides of (4.10), we have
(II) Multiplying Eq.(4.3) by \(\frac{w^{(\alpha )}_0}{K_{\alpha }}h\fancyscript{A}v^1_i\) and summing up for \(i\) from 1 to \(M-1\), we obtain
For the second term on the left hand of (4.12), we have
For the right hand of (4.12), by Lemmas 4.1 and 4.2, we get
Substituting (4.13)–(4.14) into (4.12) and taking \(\epsilon =\frac{4K_{\alpha }(10w_0^{(\alpha )}-3\Gamma (3+\alpha ))}{5w^{(\alpha )}_0(b-a)^2\Gamma (3+\alpha )}\), we have
where one can easily find that \(\epsilon >0\) from Lemma 4.4.
Multiplying Eq.(4.3) by \(\frac{w^{(\alpha )}_1}{K_{\alpha }}h\fancyscript{A}v^0_i\) and summing up for \(i\) from 1 to \(M-1\) lead to
Using the inverse estimate[33], we have
According to Lemmas 4.1 and 4.2, the following inequality holds
Substituting (4.17) and (4.18) into (4.16), we obtain
Adding \(\frac{w^{(\alpha )}_0}{K_{\alpha }\tau ^{\alpha }}(\fancyscript{A}v^0,\fancyscript{A}v^0)\) on the both sides of the result of addition of (4.11), (4.15), (4.19) yields
where \(C_4=\frac{3(b-a)^2}{8K_{\alpha }^2}+\frac{15(b-a)^2(w_0^{(\alpha )})^2\Gamma (3+\alpha )}{16K_{\alpha }^2(10w_0^{(\alpha )}-3\Gamma (3+\alpha ))}.\) According to Lemma 4.3, we have
Combining (4.20) with (4.21), it holds that
\(\square \)
From the above lemma, we can obtain the stability of the difference scheme.
Theorem 4.1
The \(GL_3\) difference scheme (3.16)–(3.19) is unconditionally stable to the right hand term and initial value for all \(\alpha \in (0,\alpha ^{*}]\).
We now consider the convergence of the difference scheme (3.16)–(3.19).
Theorem 4.2
Assume that \(u(x,t)\in C^{6,5}_{x,t}([a,b]\times [0,T])\) is the solution of problem (1.1)–(1.3), and \(\{u^n_i|0\le i\le M,0\le n\le N\}\) is the solution of the finite difference scheme (3.16)–(3.19). Suppose
Denote
Then, when \(N\tau \le T, \) it holds
Proof
Subtracting (3.16)–(3.19) from (3.5), (3.12), (3.14) and (3.15), respectively, we have the error equations
From Lemma 4.5, it holds that
or,
Consequently, we have
Hence,
\(\square \)
Remark
The condition (4.23) can be guaranteed by Dimitrov’s work [36]. Furthermore, the condition (4.23) is only sufficient but not necessary. Some examples in Sect. 5 can verify this conclusion. On the other hand, under the condition \(\alpha \in (0,\alpha ^{*}]\), the stability and convergence of \(GL_3\) difference scheme can be acquired. Though we can not get the same conclusion for \(\alpha \in (\alpha ^{*},1)\) by using the present analytical method, many numerical examples show that the stability and convergence of our scheme still hold for \(\alpha \in (\alpha ^{*},1)\). We hope that such a problem can be solved in the near future work.
5 Numerical Examples
In this section, we report on some numerical results to show the effectiveness and convergence orders of our difference scheme.
Consider the following problem
where \(\beta \in \mathbb {R}_{+}\). The exact solution is \(u(x,t)=t^{\beta }\sin (x)\).
Let
and assume
If \(\tau \) is small enough, then \(E_{\infty }(h,\tau ) \approx O(h^q)\). Consequently, \(\frac{E_{\infty }(2h,\tau )}{E_{\infty }(h,\tau )}\approx 2^q\) and hence \(q \approx \log _2\left( \frac{E_{\infty }(2h,\tau )}{E_{\infty }(h,\tau )}\right) \) is the convergence order with respect to the spatial step-size. Similarly, we obtain \(p \approx \log _2\left( \frac{E_{\infty }(h,2\tau )}{E_{\infty }(h,\tau )}\right) \) for small enough \(h\). Denote
We solve problem (5.1)–(5.3) by using \(GL_3\) finite difference scheme (3.16)–(3.19). In order to check the convergence order in temporal direction, we apply our scheme on a coarse grid \(\tau \) and then on a finer grid of size \(\tau /2\) with the same sufficiently small spatial step size \(h\). Similarly, in order to check the convergence order in spatial direction, we apply our scheme on a coarse grid \(h\) and then on a finer grid of size \(h/2\) with the same sufficiently small temporal step size \(\tau \).
Firstly, taking \(\beta =5\), Table 1 presents the maximum norm errors and the corresponding convergence orders of \(GL_3\) finite difference scheme for \(\alpha \in (0,1)\) in temporal direction, where the spatial step size \(h=\frac{1}{1000}\) is fixed. We observe that our scheme generates the temporal accuracy with the order of \(3\). Table 2 shows that our scheme has the accuracy of order \(4\) in spatial direction for \(\alpha \in (0,1)\), where the temporal step size \(\tau =\frac{1}{12000}\) is fixed.
In Figs. 4 and 5, we compare the exact solution and the numerical solution with different \(\alpha , \alpha =0.25,0.75\) respectively. We can see that the fitting degree is perfect by using the \(GL_3\) difference scheme to approximate the problem (5.1)–(5.3) with \(\beta =5\), which implies that our scheme is efficient.
Secondly, taking \(\beta =3+\alpha , 3, 2.5\) respectively, one can find that the condition (4.23) in convergence Theorem 4.2 is not satisfied longer. Now we would like to test the efficiency of the \(GL_3\) finite difference scheme for those cases.
In order to test the convergence order of our scheme in temporal direction, we fix sufficiently small spatial step size \(h=\frac{1}{1000}\) and vary the temporal step sizes. Tables 3, 4 and 5 list the numerical results for different parameters. Just as we hope, the third-order convergence of our scheme in temporal direction can still be achieved. The results tell us that maybe the conditions of the above convergence theorem can be relaxed a little. Similarly, in order to test the convergence order of our scheme in spatial direction, we fix sufficiently small temporal step size \(\tau =\frac{1}{12000}\) and vary the spatial step sizes. The numerical results show our scheme has the fourth-order accuracy in spatial direction for \(\alpha \in (0,1)\). Here, Table 6 just lists the numerical results for \(\beta =2.5\).
Thirdly, taking \(\beta =2\), the exact solution does not satisfy \(\frac{\partial ^2 u(x,0)}{\partial t^2}=0\) . With sufficiently small spatial step \(h=\frac{1}{1000}\), we test the temporal convergence order. From Table 7, we can see that the third-order convergence in temporal direction can only be achieved for \(\alpha \in (0,0.5)\), which implies that the condition \(\frac{\partial ^k u(x,0)}{\partial t^k}=0\) for \(k=0,1,2\) in Theorem 4.2 is a must. Table 8 shows that the fourth-order convergence in spatial direction can still be achieved.
Finally, Tables 9 and 10 report the numerical errors and convergence orders in temporal direction for the problems with the exact solutions \(u(x,t)=t^{0.2}\sin (x)\) and \(u(x,t)=t\sin (x)\), respectively. The third-order convergence of difference scheme in temporal direction can not be achieved for the above two problems. However, the maximum norm errors are sufficiently small, which implies our scheme still has a good fitting degree for those cases.
6 Conclusion
In this paper, based on the weighted and shifted Grünwald operator in time direction and the compact technique in space direction, a high-order compact difference scheme (\(GL_3\) scheme) is derived to solve the fractional sub-diffusion equation. By using the energy method, we proved that our difference scheme is unconditionally stable to the non-homogeneous term and the numerical solution is convergent in the maximum norm. The temporal convergence order and the spatial convergence order of our scheme can reach three and four respectively, provided that some regularities of solution hold. Some numerical examples have been given to show the effectiveness and convergence orders of our scheme.
The Caputo fractional derivative is equivalent to the Riemann–Liouvile fractional derivative with zero initial value for \(\alpha \in (0,1)\). By weighting the shifted Grünwald-Letnikov operator linearly, we choose \((p,q,r)=(0,-1,-2)\) to obtain the TWSGD operator, which approximates the Caputo fractional derivative with the third-order accuracy. The absolute values of \(p, q \) and \(r\) are the numbers of left shifts of the grid point.
For multi-dimensional fractional sub-diffusion equation, alternating direction implicit (ADI) methods become urgent and important due to large amounts of storages and computation complexity. How to construct a third-order convergent ADI difference scheme in time to solve this kind of problems seems to be a difficult task, which will be considered in the future.
References
Podlubny, I.: Fractional Differential Equations. Academic Press, New York (1999)
Oldham, K.B., Spanier, J.: The Fractional Calculus. Academic Press, New York (1974)
Kilbas, A., Srivastava, H., Trujillo, J.: Theory and Applications of Fractional Differential Equations. Elsevier, Boston (2006)
Mainardi, F.: Fractional Calculus and Waves in Linear Viscoelasticity. Imperial College Press, London (2010)
Anastassiou, G.A.: Advances on Fractional Inequalities. Springer, Berlin (2011)
Das, S.: Functional Fractional Calculus. Springer, Berlin (2011)
Tomovski, Ž., Sandev, T.: Exact solutions for fractional diffusion equation in a bounded domain with different boundary conditions. Nonlinear Dyn. 71, 671–683 (2013)
Luchko, Y., Mainardi, F.: Some properties of the fundamental solution to the signalling problem for the fractional diffusion-wave equation. Cent. Eur. J. Phys. 11, 666–675 (2013)
Langlands, T.A.M., Henry, B.I.: The accuracy and stability of an implicit solution method for the fractional diffusion equation. J. Comput. Phys. 205, 719–736 (2005)
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. 46, 1079–1095 (2008)
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. 74, 645–667 (2009)
Sun, Z.Z., Wu, X.N.: A fully discrete difference scheme for a diffusion-wave system. Appl. Numer. Math. 56, 193–209 (2006)
Gao, G., Sun, Z.Z.: A compact finite difference scheme for the fractional sub-diffusion equations. J. Comput. Phys. 230, 586–595 (2011)
Zhang, Y., Sun, Z.Z., Wu, H.W.: Error estimates of Crank–Nicolson-type difference schemes for the subdiffusion equation. SIAM J. Numer. Anal. 49, 2302–2322 (2011)
Yuste, S.: Weighted average finite difference methods for fractional diffusion equations. J. Comput. Phys. 216, 264–274 (2006)
Yuste, S.B., Acedo, L.: An explicit finite difference method and a new von Neumann-type stability analysis for fractional diffusion equations. SIAM J. Numer. Anal. 42, 1862–1874 (2005)
Cui, M.: Compact finite difference method for the fractional diffusion equation. J. Comput. Phys. 228, 7792–7804 (2009)
Cui, M.: Compact alternating direction implict method for two-diemnsional time fractional diffusion equation. J. Comput. Phys. 231, 2621–2633 (2012)
Ervin, V.J., Roop, J.P.: Variational formulation for the stationary fractional advection dispersion equation. Numer. Methods Partial Differ. Equ. 22, 558–576 (2006)
Li, X., Xu, C.: A space-time spectral method for the time fractional diffusion equation. SIAM J. Numer. Anal. 47, 2108–2131 (2009)
Lin, X., Xu, C.: Finite difference/spectral approximations for the time-fractional diffusion equation. J. Comput. Phys. 225, 1533–1552 (2007)
Cao, J., Xu, C.: A high order schema for the numerical solution of the fractional ordinary differential equations. J. Comput. Phys. 238, 154–168 (2013)
Gao, G., Sun, Z.Z., Zhang, H.: A new fractional numerical differentiation formula to approximate the Caputo fractional derivative and its applications. J. Comput. Phys. 259, 33–50 (2014)
Li, C.P., Ding, H.F.: Higher order finite difference method for the reaction and anomalous-diffusion equation. Appl. Math. Model. 38, 3802–3821 (2014)
Tian, W., Zhou, H., Deng, W.H.: A class of second order difference approximations for solving space fractional diffusion equations. Math. Comput. (to appear). arXiv:1201.5949[math.NA]
Li, C., Deng, W.H.: Second order WSGD operators II: a new family of difference schemes for space fractional advection diffusion equation. arXiv:1310.7671v1[math.NA] 29 Oct 2013
M.H. Chen, W.H. Deng: WSLD operators: a class of fourth order difference approximations for space Riemann-Liouville derivative, arXiv preprint. arXiv:1304.7425,2013-arxiv.org
Chen, M.H., Deng, W.H.: WSLD operators II: the new fourth order difference approximations for space Riemann-Liouville derivative. arXiv:1306.5900v1[math.NA] 25 Jun 2013
Wang, Z., Vong, S.: Compact difference schemes for the modified anomalous fractional subdiffusion equation and the fractional diffusion-wave equation. J. Comput. Phys. 277, 1–15 (2014)
Zorich, V.A.: Mathematical Analysis II. Springer, Berlin (2004)
Meerschaert, M., Tadjeran, C.: Finite difference approximations for fractional advection–dispersion flow equations. J. Comput. Appl. Math. 172, 65–77 (2004)
Liao, H.L., Sun, Z.Z.: Maximum norm error bounds of ADI and compact ADI methods for solving parabolic equations. Numer. Methods Partial Differ. Equ. 26, 37–60 (2010)
Sun, Z.Z.: Numerical Methods of Partial Differential Equations, 2D edn. Science Press, Beijing (2012). (in Chinese)
Chan, R., Jin, X.: An Introduction to Iterative Toeplitz Solvers. SIAM, Philadelphia (2007)
Gautschi, W.: Some elementary inequalities relating to the gamma and incomplete gamma function. J. Math. Phys. 38, 77–81 (1959)
Dimitrov, Y.: Numerical approximations for fractional differential equations. arXiv:1311.3935v1
Acknowledgments
We would like to express our gratitude to the editor and the reviewers for their many valuable comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
The research is supported by National Natural Science Foundation of China (No. 11271068).
Rights and permissions
About this article
Cite this article
Ji, Cc., Sun, Zz. A High-Order Compact Finite Difference Scheme for the Fractional Sub-diffusion Equation. J Sci Comput 64, 959–985 (2015). https://doi.org/10.1007/s10915-014-9956-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10915-014-9956-4