Abstract
In this paper, the numerical approximation of the distributed-order time-fractional reaction–diffusion equation is proposed and analyzed. Based on the finite difference method in time and local discontinuous Galerkin method in space, we develop a fully discrete scheme and prove that the scheme is unconditionally stable and convergent with order \(O\left( h^{k+\frac{1}{2}}+(\Delta t)^2+\Delta \alpha ^4\right) \), where \(h,k,\Delta t\) and \(\Delta \alpha \) are the space-step size, piecewise polynomial degree, time-step size, step size in distributed-order variable, respectively. Numerical examples are presented to show the effectiveness and the accuracy of the numerical scheme.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Fractional partial differential equations (FPDEs) have gained more and more attention since many phenomena could be modeled by these equations in science and engineering [20]. Some publications have summarized the historical developments of fractional calculus, such as Oldham and Spanier [16], Miller and Ross [14], and Podlubny [17] and so on. Due to the important applications of FPDEs in engineering and science, some numerical methods including finite difference methods, finite element methods and spectral methods have been developed and analyzed; for details, the readers can refer to [2, 13, 18, 19, 22].
In recent years the study of distributed-order differential equations has attracted much attention of many researchers. The distributed-order partial differential equations could be viewed as a natural generalization of the multi-term fractional differential equation. It has important application in modeling ultraslow diffusion where a plume of particles spreads at a logarithmic rate [10]. Luchko [12] studied the generalized distributed-order time-fractional diffusion equation on bounded domains and proved its uniqueness and continuous dependence on initial conditions. Ford and Morgado [5] studied the existence and uniqueness of solutions of the distributed-order differential equations.
Some scholars have proposed different numerical methods to solve the distributed-order differential equations. B. Jin and his coworkers [8] studied the Galerkin finite element method for the distributed-order time-fractional diffusion and established error estimates optimal with respect to data regularity in \(L^2\) and \(H^1\) norms for both smooth and nonsmooth initial data. Katsikadelis [9] presented an efficient numerical method to solve linear and nonlinear distributed-order differential equations. Diethelm and Ford [4] developed an effective numerical method to solve the distributed-order fractional ordinary differential equations. Morgado and Rebelo [15] proposed and analyzed an implicit scheme for the distributed-order time-fractional reaction–diffusion equation. Ye, Liu and Anh [25] studied a compact finite difference scheme for a distributed-order time-fractional diffusion-wave equation. Li and Wu [11] proposed a numerical method to solve the distributed-order diffusion equations. In [1] Alikhanov presented a finite difference method for the multi-term variable distributed-order diffusion equation. Gao and Sun [6] studied the finite difference methods for the distributed-order differential equations and also proved its stability and convergence. However, up to our knowledge, the study on numerical methods for distributed-order differential equations is just beginning. The development of easy-to-use and higher-order numerical methods for such equations is still an important issue.
Consider the following distributed-order time-fractional reaction–diffusion equation in the Caputo sence
\(\rho >0\) is the constant reaction rate, and
Here \(\Gamma (\cdot )\) denotes the Gamma function, and the periodic or compactly supported boundary condition considered in this paper.
The discontinuous Galerkin method, which has many good features of a finite element and a finite volume method, is a very attractive method to solve partial differential equations due to its flexibility in terms of mesh and shape functions and can achieve a high order of convergence. In this paper, we first present a finite difference scheme to approximate the time-fractional derivatives, and then a fully discrete method for the distributed-order time-fractional reaction–diffusion equation in which the spatial direction is approximated by a LDG method is presented and analyzed.
The paper is organized as follows. In Sect. 2 we will introduce some basic notations and theoretic results. Then in Sect. 3 we present our finite difference/local discontinuous Galerkin method for the distributed-order time-fractional reaction–diffusion equation and discuss the stability and give an error estimate in Sect. 4. In Sect. 5, numerical results are also given to illustrate the accuracy of convergence and capability of the method, and the concluding remarks are included in the final section.
2 Notations and Auxiliary Results
Let \(\Omega =\bigcup _jI_j\) be the partition of \(\Omega =[a,b]\), and \(I_{j}=\left[ x_{j-\frac{1}{2}}, x_{j+\frac{1}{2}}\right] ,\) for \(j=1,\ldots N\). The cell lengths \(\Delta x_j=x_{j+\frac{1}{2}}-x_{j-\frac{1}{2}},~1\le j\le N,\) and \(h=\max \limits _{1\le j\le N}\Delta x_j\).
Denote by \(u_{j+\frac{1}{2}}^+\) and \(u_{j+\frac{1}{2}}^-\) the traces from the right cell \(I_{j+1}\) and the left cell \(I_j\), respectively. \(\left[ u_h^n\right] _{j-\frac{1}{2}}\) is used to denote \(\left( u_h^n\right) _{j-\frac{1}{2}}^+-\left( u_h^n\right) _{j-\frac{1}{2}}^-\), i.e., the jump of \(u_h^n\) at each element boundary point, and the jump will be zero for a continuous function.
The associated discontinuous Galerkin element space \(V_h^k\) is defined as the space of piecewise polynomials of the degree up to k,
For error estimates, we will use the projections \(\mathcal {P}\) and \(\mathcal {P}^\pm \) in [a, b], for \(j=1,\ldots N\),
and
The above projections \(\mathcal {P}\) and \(\mathcal {P}^\pm \) satisfy the following inequality [23, 24, 26]
here \(\mu ^e=\mathcal {P}\mu -\mu \) or \(\mu ^e=\mathcal {P}^\pm \mu -\mu \). The positive constant C is independent of h and solely depends on \(\mu \). \(\tau _h\) denotes the set of boundary points of all elements \(I_j\).
Divide the interval [0, T] uniformly with a time-step size \(\Delta t=\frac{T}{M}\), \(M \in \mathbb {N}\), \(t_{n}=n\Delta t, n=0,1,\ldots ,M\) be the mesh points.
Divide the integral interval [0, 1] into 2L-subintervals with \(\Delta \alpha =\frac{1}{2L}\) and \(\alpha _j=j\Delta \alpha , j=0,1, 2,\ldots , 2L\).
In order to discretize the distributed-order time derivative, we introduce the following composite Simpson formula.
Lemma 2.1
(The composite Simpson formula)
If \(s(\alpha )\in C^{(4)}[0,1]\), then we have
where
Next some definitions about fractional calculus will be given. The left-sided Riemann–Liouville fractional derivative is defined as
and the left-sided Caputo fractional derivative
when \(n-1<\alpha <n\).
Lemma 2.2
[17] For \(0<\alpha <1, t>0\), the left-sided Caputo fractional derivative
is equivalent to the Riemann–Liouville fractional derivative
when \(f(0)=0\).
Denote
where \(\widehat{f}(\xi )=\int _{-\infty }^{\infty }e^{i\xi t}f(t) \mathrm{d}t\) is the Fourier transformation of f(t).
In order to approximate the Riemann–Liouville fractional derivative, and using the weighted and shifted Grünwald difference operator, we have
Lemma 2.3
[3, 6, 7] Suppose \(f\in \mathfrak {I}^{2+\alpha }(R)\) with \(0\le \alpha \le 1\). We have
where
The coefficients \(g_j^{\alpha }\) satisfy the following properties
and they can be evaluated recursively by
\(g_0^{\alpha }=1, g_k^{\alpha }=\left( 1-\frac{\alpha +1}{k}\right) g_{k-1}^{\alpha },~~~ k\ge 1. \)
For \(0\le \alpha \le 1\), after some manual calculation we know
Lemma 2.4
[6, 21] Suppose \((\delta _0,\delta _1,\delta _2,\ldots ,\delta _m)^{T}\in R^{m+1}\) is a real vector, \(m\in N^+\). Then the coefficients \(\{\mu _j^\alpha \}_{j=0}^\infty \) defined in Lemma 2.3 satisfy the following inequality
In the present paper C will be used as a positive constant which may have a different value in different occurrences. We denote the piecewise derivative of the function w(x) by \(w_x\) and the \(L^2\) norm on D by \(\Vert \cdot \Vert _{D}\), respectively. If \(D=\Omega \), we drop D.
3 The Scheme
In this section, we introduce the numerical scheme for the solution of Eq. (1.1).
In virtue of Lemmas 2.1, 2.2 and 2.3, we have [6]
where the truncation error \(|r^n|\le C\left( (\Delta t)^2+\Delta \alpha ^4\right) .\)
For Eq. (1.1) we first consider the equivalent first-order system
Let \(u_h^n, p_h^n\in V_h^k\) be the approximation of \(u(\cdot ,t_n), p(\cdot ,t_n)\), respectively, \(f^n(x)=f(x,t_n)\). We seek the approximation solutions \(u_h^n, p_h^n \in V_h^k,\) such that for test functions \(v, \xi \in V_h^k,\)
The initial conditions \(u_h^0\) are taken as the \(L^2\) projections of u(, 0)
The “hat” terms in (3.3) in the cell boundary terms from integration by parts are the so-called numerical fluxes, which are single-valued functions defined on the edges and should be designed based on different guiding principles for different PDEs to ensure stability. It turns out that we can take the simple choices such that
where \(\tau >0\) is a constant. We remark that the choice for fluxes (3.4) is not unique. In fact the crucial part is taking \(\widetilde{u_h^n}\) and \(\widehat{p_h^n}\) from opposite sides [23, 24, 26].
4 Stability and Convergence
Theorem 4.1
Fully discrete LDG scheme (3.3) is unconditionally stable for any \(\Delta t>0\),
where \(\chi =\Delta \alpha \sum _{j=0}^{2L}d_j w(\alpha _j) \frac{1}{(\Delta t)^{\alpha _j}}\mu _0^{\alpha _j}.\)
Proof
Scheme (3.3) can be rewritten as
Taking the test functions \(v=u^n_h, \xi =p^n_h\) in (4.1) and with fluxes choice (3.4) we obtain
here
After some calculations, we can easily obtain \(\Theta (u_h^n,p_h^n)=0\).
Then we can get
Denoting \(\chi =\Delta \alpha \sum \limits _{j=0}^{2L}d_j w(\alpha _j) \frac{1}{(\Delta t)^{\alpha _j}}\mu _0^{\alpha _j},\) we know [6]
Next summing up n from 1 to m, and adding a term \(\chi \Vert u_h^0\Vert ^2\) on both sides in 4.3, we obtain
In virtue of Lemma 2.4, we get
where \(\chi \Delta t=\frac{1}{O(|\ln \Delta t|)}\le 1.\)
This finishes the proof of the stability result. \(\square \)
Theorem 4.2
Let \(u(x,t_n)\) be the exact solution of problem (1.1) at time \(t=t_n\), \(u_h^n\) be the numerical solution of fully discrete LDG scheme (3.3), for any positive integer m, there exists a constant C such that
Proof
Denote
Taking fluxes (3.4), we can obtain the error equation:
By virtue of (4.5), error Eq. (4.6) can be written as follows:
Let \(v=\mathcal {P}e_u^n, \xi =\mathcal {P^+}e_p^n\) in (4.7), and by the application of properties (2.1)–(2.2), we can obtain the following inequality easily
Noticing the fact that
using the Höld’s inequality, choosing a small enough \(\varepsilon \le \tau \), we have
Notice
summing up n from 1 to m, using Lemma 2.4 and interpolating property (2.4), we have
From the triangle inequality, Theorem 4.2 follows. \(\square \)
Remark
We can find that a \(L^2\)-error estimate of half an order lower \(O\left( h^{k+\frac{1}{2}}\right) \) in space has been proved; however, the optimal error estimate will be obtained in the numerical experiments.
5 Numerical Examples
In this section, in order to verify numerical accuracy of the proposed method and the correctness of analysis, numerical experiments will be carried out.
Example In (1.1), taking \(\Omega =[0,1]\), \(T=0.5, w(\alpha )=\Gamma (p+1-\alpha ), \rho =1\), and
where \(p>0\). Then the exact solution of the example is
Firstly, to confirm the spatial accuracy, we take the fixed and sufficiently small step sizes \(\Delta t\) and \(\Delta \alpha \), and the varying \(h=1/5, 1/10, 1/15, 1/20,\), respectively, and the numerical errors and order of convergence in \(L^2\)-norm and \(L^\infty \)-norm are listed in Tables 1, 2, 3 and 4. From the tables one can find that the errors attain \((k+1)\)-th order of accuracy for piecewise \(P^k\) polynomials.
Secondly, the numerical accuracy of scheme (3.3) in time variable is computed. Take the fixed and sufficiently small h and \(\Delta \alpha \). From Table 5 and Fig. 1 we can find that the second order of convergence of scheme (3.3) in time variable is verified.
6 Conclusion
We have proposed and analyzed a fully discrete LDG method for the distributed-order time-fractional reaction–diffusion equation in this paper. Based on the weighted and shifted Gr\(\ddot{u}\)nwald formula for discretizing the time-fractional derivative, we develop a fully discrete scheme to solve problem (1.1) and prove that the method is unconditionally stable and convergent with order \(O\left( h^{k+\frac{1}{2}}+(\Delta t)^2+\Delta \alpha ^4\right) \). Numerical example is computed to show the convergence order and excellent numerical performance of proposed method. It is noted that the method proposed in this paper could be extended to solve the problems on a rectangular or cubical domain, but the computation is very huge. In future we want to try our best to solve this problem.
References
Alikhanov, A.A.: Numerical methods of solutions of boundary value problems for the multi-term variable distributed order diffusion equation. Appl. Math. Comput. 268, 12–22 (2015)
Basu, T., Wang, H.: A fast second-order finite difference method for space-fractional diffusion equations. Int. J. Numer. Anal. Model. 9, 658–666 (2012)
Chen, H., Lü, S., Chen, W.: Finite difference/spectral approximations for the distributed order time fractional reaction–diffusion equation on an unbounded domain. J. Comput. Phys. 315, 84–97 (2016)
Diethelm, K., Ford, N.J.: Numerical analysis for distributed-order differential equations. J. Comput. Appl. Math. 225, 96–104 (2009)
Ford, N., Morgado, M.: Distributed order equations as boundary value problems. Comput. Math. Appl. 64, 2973–2981 (2012)
Gao, G.H., Sun, Z.Z.: Two alternating direction implicit difference schemes for two-dimensional distributed-order fractional diffusion equations. J. Sci. Comput. 69, 926–948 (2016)
Gao, G.H., Sun, Z.Z.: Two unconditionally stable and convergent difference schemes with the extrapolation method for the one-dimensional distributed-order differential equations. Numer. Methods Part. Differ. Equ. 32, 591–615 (2016)
Jin, B., Lazarov, R., Sheen, D., Zhou, Z.: Error estimates for approximations of distributed order time fractional diffusion with nonsmooth data. Fract. Calc. Appl. Anal. 19(1), 69–93 (2016)
Katsikadelis, J.T.: Numerical solution of distributed order fractional differential equations. J. Comput. Phys. 259, 11–22 (2014)
Kochubei, A.N.: Distributed order calculus and equations of ultraslow diffusion. J. Math. Anal. Appl. 340, 252–281 (2008)
Li, X.Y., Wu, B.Y.: A numerical method for solving distributed order diffusion equations. Appl. Math. Lett. 53, 92–99 (2016)
Luchko, Y.: Boundary value problems for the generalized time-fractional diffusion equation of distributed order. Fract. Calc. Appl. Anal. 12, 409–422 (2009)
Lv, C., Xu, C.: Improved error estimates of a finite difference/spectral method for time-fractional diffusion equations. Int. J. Numer. Anal. Model. 12, 384–400 (2015)
Miller, K.S., Ross, B.: An Introduction to the Fractional Calculus and Fractional Differential Equations. Wiley, New York (1993)
Morgado, M.L., Rebelo, M.: Numerical approximation of distributed order reaction–diffusion equations. J. Comput. Appl. Math. 275, 216–227 (2015)
Oldham, K.B., Spanier, J.: The Fractional Calculus. Academic Press, New York (1974)
Podlubny, I.: Fractional Differential Equations. Academic Press, San Diego (1999)
Tian, H., Wang, H., Wang, W.: An efficient collocation method for a non-local diffusion model. Int. J. Numer. Anal. Model. 10, 815–825 (2013)
Vabishchevich, P.: Numerical solution of nonstationary problems for a convection and a space-fractional diffusion equation. Int. J. Numer. Anal. Model. 13, 296–309 (2016)
Wang, H., Cheng, A., Wang, K.: Fast finite volume methods for space-fractional diffusion equations. Discrete Contin. Dyn. Syst. Ser. B 20, 1427–1441 (2015)
Wang, Z., Vong, S.: Compact difference schemes for the modified anomalous fractional sub-diffusion equation and the fractional diffusion-wave equation. J. Comput. Phys. 277, 1–15 (2014)
Wei, L., He, Y.: Analysis of a fully discrete local discontinuous Galerkin method for time-fractional fourth-order problems. Appl. Math. Model. 38, 1511–1522 (2014)
Xia, Y., Xu, Y., Shu, C.-W.: Application of the local discontinuous Galerkin method for the Allen-Cahn/Cahn-Hilliard system. Commun. Comput. Phys. 5, 821–835 (2009)
Xu, Y., Shu, C.-W.: Local discontinuous Galerkin method for the Camassa–Holm equation. SIAM J. Numer. Anal. 46, 1998–2021 (2008)
Ye, H., Liu, F., Anh, V.: Compact difference scheme for distributed-order time-fractional diffusion-wave equation on bounded domains. J. Comput. Phys. 298, 652–660 (2015)
Zhang, Q., Shu, C.-W.: Error estimate for the third order explicit Runge–Kutta discontinuous Galerkin method for a linear hyperbolic equation with discontinuous initial solution. Numer. Math. 126, 703–740 (2014)
Acknowledgements
The author is grateful to the editor and the anonymous referees for their helpful comments and suggestions on the revision of the manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Syakila Ahmad.
This work is supported by the High-Level Personal Foundation of Henan University of Technology (2013BS041), Plan For Scientific Innovation Talent of Henan University of Technology (2013CXRC12), the National Natural Science Foundation of China (11426090, 11461072), Foundation of He’nan Educational Committee (15A110018) and China Postdoctoral Science Foundation-funded project (2015M572115).
Rights and permissions
About this article
Cite this article
Wei, L. A Fully Discrete LDG Method for the Distributed-Order Time-Fractional Reaction–Diffusion Equation. Bull. Malays. Math. Sci. Soc. 42, 979–994 (2019). https://doi.org/10.1007/s40840-017-0525-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40840-017-0525-5
Keywords
- Distributed-order fractional reaction–diffusion equation
- Time-fractional derivative
- Local discontinuous Galerkin method
- Stability
- Error estimate