Abstract
Two numerical methods with graded temporal grids are analyzed for fractional evolution equations. One is a low-order discontinuous Galerkin (DG) discretization in the case of fractional order \(0<\alpha <1\), and the other one is a low-order Petrov Galerkin (PG) discretization in the case of fractional order \(1<\alpha <2\). By a new duality technique, pointwise-in-time error estimates of first-order and \( (3-\alpha ) \)-order temporal accuracies are respectively derived for DG and PG, under reasonable regularity assumptions on the initial value. Numerical experiments are performed to verify the theoretical results.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Let X be a separable Hilbert space with inner product \( (\cdot ,\cdot )_X \). Assume that the linear operator \( A: D(A) \subset X \rightarrow X \) is densely defined and admits a bounded inverse \( A^{-1}: X \rightarrow X \), which is compact, symmetric and positive. Consider the following time fractional evolution equation:
where \( \alpha \in (0,2)\setminus \{1\} \), \( 0< T < \infty \), \( u_0 \in X \) and \( D_{0+}^\alpha \) is a Riemann-Liouville fractional derivative operator of order \( \alpha \). Here, we assume that \(u(0)=u_0\) for \( \alpha \in (0,2)\setminus \{1\} \) and \(u'(0)= 0 \) for \( \alpha \in (1,2)\).
There are quite a few research works on the numerical treatment of time fractional evolution equations. Let us briefly introduce four types of numerical methods for the discretization of time fractional evolution equations. The first-type method uses the convolution quadrature to approximate the fractional integral (derivative) (cf. [2, 6, 16, 17, 36]). The second-type method uses the L1 scheme to approximate the fractional derivative (cf. [3, 5, 12, 15, 31, 32]). Such methods are popular and easy to implement. The third-type method is the spectral method (cf. [9, 14, 20, 33, 34]), which uses nonlocal basis functions to approximate the solution. The accuracy of the spectral method is high, provided that the solution or data is smooth enough. The fourth-type method is the finite element method (cf. [10, 13, 19, 21, 24, 25]), which uses local basis functions to approximate the solution. It should be mentioned that the finite element method is identical to the L1 scheme in some cases (cf. [7, 12]).
Most of the convergence analyses for the numerical methods mentioned above are based on the assumption that the exact solution is smooth enough. However, the solution of fractional equations is generally singular near the origin despite how smooth the data is (cf. [6, 8]). In fact, the main difficulty is to derive the error estimates without any regularity restriction on the solution, especially for the case with nonsmooth data. When using the uniform temporal grids, the Laplace transform technique is a powerful tool for error estimation in the case of nonsmooth data (cf. [2, 5, 12, 17, 21, 32]). We note that the non-uniform temporal grids are also useful to handle the singularity of fractional equations (cf. [15, 22, 26, 30]).
McLean and Mustapha analyzed the DG methods with graded temporal grids for a variant form of (1):
which is obtained by applying \(D^{1-\alpha }_{0+}\) to the both sides of (1). For (2) with \(0<\alpha <1\), they [22] derived first-order temporal accuracy for a piecewise-constant DG under the condition that \(u_0 \in D(A^{\nu })\) for \(\nu >0\). For the case \(1<\alpha <2\), they [23] proved optimal error bounds for the piecewise-constant DG and a piecewise-linear DG under the condition that
where \(0<{M}\leqslant 1\) is a constant. For a fractional reaction-subdiffusion equation, Mustapha [26] derived second-order temporal accuracy for the L1 approximation with graded temporal grids under the condition that
for all \(0<t\leqslant T\).
Though being equivalent to (2) in some senses, equation (1) leads to different kinds of numerical methods. For a fractional diffusion equation with nonsmooth data, Li et al. [11] obtained optimal error estimates for a low order DG. It should be noticed that their analysis is optimal in the sense of some space-time Sobolev norms, which is not very sharp when compared with the pointwise-in-time error estimates. For a fractional diffusion equation, Stynes et al. [30] analyzed the L1 scheme with graded temporal grids and derived temporal accuracy \( O(N^{\alpha -2}) \) (N is the number of nodes in the temporal grids) under the condition that
Liao et al. [15] obtained temporal accuracy \( O(N^{\alpha -2}) \) for a reaction-subdiffusion equation by assuming that
where \( {M} \in (0,2) \setminus \{1\} \). Although the regularity assumptions above are reasonable in some situations, it is worthwhile to carry out error estimation for some numerical methods with weaker regularity assumptions on the data. Moreover, as far as we know, there is no rigorous numerical analysis for (1) with \(1<\alpha <2\) and graded temporal grids.
In this paper, we consider the DG and PG approximations for time fractional evolution equation (1) with \(0<\alpha <1\) and \(1<\alpha <2\) respectively. These methods are identical to the L1 scheme when the temporal grid is uniform. We develop a new duality technique for the pointwise-in-time error estimation, which is inspired by the local error estimation for the standard linear finite element method [1, 29]. The key point of the analysis is the estimate of a “regularized Green function” (cf. Lemmas 3.3 and 4.2). For \(0<\alpha <1\) and \( u_0 \in D(A^\nu ) \) with \( 0 < \nu \leqslant 1 \), we obtain first-order temporal accuracy for the DG approximation with graded grids (cf. Theorem 3.1). For \(1<\alpha <2\) and \( u_0 \in D(A^\nu ) \) with \( 1/2 < \nu \leqslant 1 \), we obtain \((3-\alpha )\)-order temporal accuracy for the PG approximation with graded grids (cf. Theorem 4.1).
The rest of this paper is organized as follows. Section 2 gives some notations and basic results, including Sobolev spaces, fractional calculus operators, spectral decomposition of A, solution theory and discretization spaces. Sections 3 and 4 establish the error estimates for problem (1) with \(0<\alpha <1\) and \(1<\alpha <2\) respectively. Section 5 performs two numerical experiments to verify the theoretical results. The last section is a conclusion.
2 Preliminaries
Throughout this paper, we will use the following conventions: if \( \omega \subset {\mathbb {R}} \) is an interval, then \( \langle {p,q} \rangle _\omega \) denotes the Lebesgue or Bochner integral \( \int _\omega p q \) for scalar or vector valued functions p and q whenever the integral makes sense; for a Banach space W, we use \( \langle {\cdot ,\cdot } \rangle _W \) to denote a duality paring between \( W^* \) (the dual space of W) and W; the notation \( C_\times \) denotes a positive constant depending only on its subscript(s), and its value may differ at each occurrence; for any function v defined on (0, T) , by \( v(t-) \), \( 0 < t \leqslant T \) we mean \( \lim _{s \rightarrow {t-}} v(s) \) whenever this limit exists; given \( 0 < a \leqslant T \), the notation \( (a-t)_{+} \) denotes a function of variable t defined by
Sobolev spaces Assume that \( -\infty< a< b < \infty \). For any \( m \in {\mathbb {N}} \), define
and endow this space with the norm
where \( H^m(a,b) \) is an usual Sobolev space and \( v^{(k)} \), \( 1 \leqslant k \leqslant m \), is the k-th order weak derivative of v. For any \( m \in {\mathbb {N}}_{>0} \) and \( 0< \theta < 1 \), define
where \( (\cdot ,\cdot )_{\theta ,2} \) means the interpolation space defined by the K-method [18]. The space \( {}^0H^\gamma (a,b) \), \( 0 \leqslant \gamma < \infty \), is defined analogously. For each \( -\infty < \gamma \leqslant 0 \), we use \( {}_0H^\gamma (a,b) \) and \( {}^0H^\gamma (a,b) \) to denote the dual spaces of \( {}^0H^{-\gamma }(a,b) \) and \( {}_0H^{-\gamma }(a,b) \), respectively. The embedding \( L^2(a,b) \hookrightarrow {}_0H^{-\gamma }(a,b) \), \( \gamma > 0 \), is understood in the conventional sense that
Fractional calculus operators Assume that \( -\infty< a< b < \infty \). For \( -\infty< \gamma < 0 \), define
for all \( v \in L^1(a,b) \), where \( \Gamma (\cdot ) \) is the gamma function. In addition, let \( D_{a+}^0 \) and \( D_{b-}^0 \) be the identity operator on \( L^1(a,b) \). For \( j - 1 < \gamma \leqslant j \) with \( j \in {\mathbb {N}}_{>0} \), define
for all \( v \in L^1(a,b) \), where \( D\) is the first-order differential operator in the distribution sense. The vector-valued version fractional calculus operators are defined analogously. Assume that \( 0< \beta \leqslant \gamma < \beta + 1/2 \). For any \( v \in {}_0H^\beta (a,b) \), define \( D_{a+}^\gamma v \in {}_0H^{\beta -\gamma }(a,b) \) by that
for all \( w \in {}^0H^{\gamma -\beta }(a,b) \). For any \( v \in {}^0H^\beta (a,b) \), define \( D_{b-}^\gamma v \in {}^0H^{\beta -\gamma }(a,b) \) by that
for all \( w \in {}_0H^{\gamma -\beta }(a,b) \). By Lemma A.2 and a standard density argument, it is easy to verify that the above definitions are well-defined and that if
both make sense by the definition, then they are identical.
Spectral decomposition of \( \mathbf{A} \) Assume that the separable Hilbert space X is infinite dimensional. It is well known that (cf. [35]) there exists an orthonormal basis, \(\{\phi _n: n \in {\mathbb {N}} \} \subset D(A) \), of X such that
where \( \{ \lambda _n: n \in {\mathbb {N}} \} \) is a positive non-decreasing sequence and \(\lambda _n\rightarrow \infty \) as \(n\rightarrow \infty \). For any \( -\infty< \beta < \infty \), define
and equip this space with the norm
Solution theory Recall that \(\alpha \in (0,2) \setminus \{1\}\). For any \( \beta >0 \), define the Mittag-Leffler function \( E_{\alpha ,\beta }(z) \) by
which admits the following growth estimate (cf. [27]):
For any \( \lambda > 0 \), a straightforward calculation yields
Therefore, the solution to problem (1) is of the form (cf. [28])
For any \( 0 < t \leqslant T \), a straightforward calculation gives
Hence, for \(1<\alpha <2\), by (3) we obtain that
where \( 0 \leqslant \nu \leqslant 1 \).
Discretization spaces Let \( t_j := (j/J)^\sigma T \) for each \( 0 \leqslant j \leqslant J \), where \( J \in {\mathbb {N}}_{>0} \) and \( \sigma \geqslant 1 \). Define
For the particular case \( D(A)={\mathbb {R}} \), we use \( {\mathcal {W}}_\tau \) and \( {\mathcal {W}}_\tau ^\text {c} \) to denote \( W_\tau \) and \( W_\tau ^\text {c} \), respectively. Assume that \( Y = X \text { or } {\mathbb {R}} \). For any \( v \in L^1(0,T;Y) \) and \( w \in C([0,T];Y) \), define \( Q_\tau v \in L^\infty (0,T;Y) \) and \( \mathcal I_\tau w \in C([0,T];Y) \) respectively by
for all \( t_{j-1}< t < t_j \) and \( 1 \leqslant j \leqslant J \). In the sequel, we will always assume that \( \sigma \geqslant 1 \).
3 Fractional Diffusion Equation (\( 0< \alpha < 1 \))
This section considers the following discretization (cf. [11]): seek \( U \in W_\tau \) such that
Remark 3.1
By (5), a straightforward calculation yields that
Theorem 3.1
Assume that \( u_0 \in D(A^\nu ) \) with \( 0 < \nu \leqslant 1 \). Then
The main task of the rest of this section is to prove Theorem 3.1. To this end, we proceed as follows. Assume that \( \lambda > 0 \). For any \( y \in {}_0H^{\alpha /2}(0,T) \), define \( \Pi _\tau ^\lambda y \in {\mathcal {W}}_\tau \) by that
Remark 3.2
Note \({\mathcal {W}}_\tau \) is the piecewise constant finite element space.
For each \( 1 \leqslant m \leqslant J \), define \( G_\lambda ^m \in {\mathcal {W}}_\tau \) by that \( G_\lambda ^m|_{(t_m,T)} = 0 \) and
for all \( w \in {\mathcal {W}}_\tau \). In addition, let \( G_{\lambda ,m+1}^m := 0 \) and, for each \( 1 \leqslant j \leqslant m \), let
Remark 3.3
The \(G_{\lambda }^m\) can be viewed as a regularized Green function with respect to the operator \(D_{t_m-}^\alpha +\lambda \).
Lemma 3.1
For each \( 1 \leqslant m \leqslant J \),
Proof
Let us first prove that
For any \( 1 \leqslant k < m \), by (12) we obtain
where \( \mu := \lambda \Gamma (2-\alpha ) \), so that a simple algebraic computation yields
Inserting \( k=m-1 \) into the above equation and noting the fact \( G_{\lambda ,m}^m > 0 \) indicate \( G_{\lambda ,m}^m>G_{\lambda ,m-1}^m \). Assume that \( G_{\lambda ,j+1}^m>G_{\lambda ,j}^m \) for all \( k \leqslant j < m \), where \( 2 \leqslant k < m \). Multiplying both sides of (17) by
from Lemma B.2 we obtain
Similarly to (17), we have
Combining the above two equations yields \( G_{\lambda ,k}^m>G_{\lambda ,k-1}^m \). Therefore, (16) is proved by induction.
Next, inserting \( k=1 \) into (17) yields
Since
from (16) and (18) it follows that
This implies \( G_{\lambda ,1}^m > 0 \) and hence proves (13) by (16).
Finally, (14) is evident by (12), and dividing both sides of (18) by \( t_m^{1-\alpha }-(t_m-t_1)^{1-\alpha }+\mu t_1 \) proves (15). This completes the proof. \(\square \)
Lemma 3.2
For each \( 1 \leqslant k \leqslant J \),
Proof
A straightforward calculation gives
and
Combining the above two estimates proves (19). Similarly, a simple calculation gives
and
Combining the above two estimates proves (20) and thus concludes the proof. \(\square \)
Lemma 3.3
For each \( 1 \leqslant m \leqslant J \),
Proof
For each \( 1 \leqslant j \leqslant m \), let
Since
we have
Therefore, from Lemma 3.1 and the inequality
it follows that
In addition, by (14) and (22), it holds
Consequently, combining the above two estimates proves (21) and thus concludes the proof. \(\square \)
Remark 3.4
\(D_{t_m-}^\alpha G^m_{\lambda }\) is a non-smooth function in \(L^1(0,T)\), but it is smoother away from \(t_m\). This is the starting point of Lemma 3.3.
Lemma 3.4
If \( y \in {}_0H^{\alpha /2}(0,T) \cap C(0,T] \), then
for each \( 1 \leqslant m \leqslant J \).
Proof
A straightforward calculation gives
Hence, (23) follows from the equality
which is easily derived by the definition of \( Q_\tau \). This completes the proof. \(\square \)
Lemma 3.5
Assume that \( y \in {}_0H^{\alpha /2}(0,T) \cap C^1(0,T] \) satisfies
where \( 0< r < 1 \). Then
Proof
For any \( 1 \leqslant m \leqslant J \),
It follows that
and hence
In addition, by (24) we obtain
Finally, combining the above two estimates proves (25) and hence this lemma. \(\square \)
Finally, we are in a position to prove Theorem 3.1 as follows.
Proof of Theorem 3.1
For each \( n \in {\mathbb {N}} \), let
By (5) we have
A straightforward calculation gives
and hence (3) implies
By (8, (9) and (11) we have \( U = \sum _{n=0}^\infty (\Pi _\tau ^{\lambda _n} u^n) \phi _n \), so that
This proves (10) and thus concludes the proof. \(\square \)
4 Fractional Diffusion-Wave Equation (\( 1< \alpha < 2 \))
This section considers the following discretization: seek \( U \in W_\tau ^\text {c} \) such that \( U(0) = u_0 \) and
Remark 4.1
By (5), a straightforward calculation gives that \(u(0)=u_0\), \(u'(0)=0\) and
Remark 4.2
For the case with uniform temporal grids, the discretization (27) is equivalent to the L1 scheme (cf. [12]),
Theorem 4.1
Assume that \( u_0 \in D(A^\nu ) \) with \( 1/2 < \nu \leqslant 1 \). If
then
The main task of the rest of this section is to prove the above theorem. For each \( 1 \leqslant m \leqslant J \), define \( {\mathcal {G}}^m \in {\mathcal {W}}_\tau \) by that \( {\mathcal {G}}^m|_{(t_m,T)} = 0 \) and
Let \( {\mathcal {G}}_{m+1}^m = 0 \) and, for each \( 1 \leqslant j \leqslant m \), let
Since
a straightforward calculation yields, from (31), that
for each \( 1 \leqslant k \leqslant m \).
Remark 4.3
Although \({\mathcal {G}}^m\) is not a regularized Green function, it has similar properties.
Lemma 4.1
For any \( 1/2< \beta < 1 \) and \( 1 \leqslant k \leqslant J \),
Proof
An elementary calculation gives
and
It follows that
This proves (33) and hence this lemma. \(\square \)
Lemma 4.2
For any \( 1/2< \beta < 1 \) and \( 1 \leqslant m \leqslant J \),
Proof
By (32) and Lemma B.3, an inductive argument yields that
Plugging \( k = 1 \) into (32) shows
and hence
From (35) and the inequality
it follows that
Since
we obtain
This proves (34) and thus completes the proof. \(\square \)
Remark 4.4
For more details about proving (35), we refer the reader to the proof of (13).
Lemma 4.3
Assume that \( y \in C^2((0,T];X) \) satisfies
where \( 0< r < 2 \). For each \( 1 \leqslant j \leqslant J \), the following three estimates hold:
if \( \sigma < 2/(3-r) \), then
if \( \sigma = 2/(3-r) \), then
if \( \sigma > 2/(3-r) \), then
Proof
We only present a proof of (40), the proofs of (38) and (39) being similar. Since the case \( r=1 \) can be proved analogously, we assume that \( r \ne 1 \).
Let us first prove that
for each \( 2 \leqslant j \leqslant J \). Since the case \( j=2 \) can be easily verified, we assume that \( 3 \leqslant j \leqslant J \). Let \( t_{j-1} \leqslant a < t_j \). By the definition of \( Q_\tau \), we have
where
By (37) and the facts \( \sigma >2/(3-r) \) and \( t_{j-1} \leqslant a \), a routine calculation yields the following three estimates:
and
Since a, \( t_{j-1} \leqslant a < t_j \), is arbitrary, combining (42) and the above three estimates proves (41) for \( 3 \leqslant j \leqslant J \).
Next, let us prove that (40) holds for all \( 2 \leqslant j \leqslant J \). For any \( t_{j-1} \leqslant a < t_j \),
where
We have
and, by (41),
Combining the above two estimates and (43) gives
Hence, the arbitrariness of \( t_{j-1} \leqslant a < t_j \) proves (40) for \( 2 \leqslant j \leqslant J \).
Finally, for any \( 0 < a \leqslant t_1 \),
This proves (40) for \( j= 1 \) and thus concludes the proof. \(\square \)
For any \( y \in H^{(\alpha +1)/2}(0,T) \), define \( {\mathcal {P}}_\tau y \in \mathcal W_\tau ^\text {c} \) by
and define \( \Xi _\tau ^\lambda y \in {\mathcal {W}}_\tau ^\text {c} \) by
Lemma 4.4
If \( \alpha -1< \beta < 1 \) and \( y \in H^{(\alpha +1)/2}(0,T) \), then
for each \( 1 \leqslant m \leqslant J \).
Proof
A straightforward calculation gives
For any \( \alpha -1< \beta < 1 \),
Combining the above two equations proves (46) and hence this lemma. \(\square \)
For any
define
Remark 4.5
By (44), (47), Lemmas A.1 and A.2, we obtain
for all \( y \in H^{(\alpha +1)/2}(0,T;X) \).
Lemma 4.5
Assume that \( y \in H^{(\alpha +1)/2}(0,T;X) \cap C^2((0,T];X) \) satisfies
where \( 0< r < 2 \). Then
for each \( 1 \leqslant m \leqslant J \).
Proof
For each \( n \in {\mathbb {N}} \), let
A straightforward calculation gives
for any \( \alpha -1< \beta < 1 \). From Lemma 4.2 it follows that
Passing to the limit \( \beta \rightarrow {1-} \) then yields
so that a straightforward calculation proves (49) by Lemma 4.3. This completes the proof. \(\square \)
Lemma 4.6
Assume that \( y \in H^{(\alpha +1)/2}(0,T;X) \cap C^2((0,T];D(A^{1/2})) \) satisfies
where \( 0< r < 2 \). If \( \sigma > (3-\alpha )/(2-r) \), then
Proof
A simple modification of the proof of (49) yields
which implies
It follows that
In addition, a routine calculation gives
Combining the above two estimates proves (50) and hence this lemma. \(\square \)
Lemma 4.7
If \( y \in H^{(\alpha +1)/2}(0,T) \), then
for each \( 1 \leqslant m \leqslant J \).
Proof
Letting \( \theta := (\Xi _\tau ^\lambda - {\mathcal {P}}_\tau ) y \), by (44), (45) and Lemma A.3 we obtain
so that using Lemmas A.1 and A.2 and integration by parts yields
Since
it follows that
Hence, (52) follows from the triangle inequality
This completes the proof. \(\square \)
Proof of Theorem 4.1
For each \( n \in \mathbb N \), let
By (27), (28), (45) and Lemma A.3, we have
so that
Applying the Minkowski inequality gives
The above two estimates yield
In addition, using (6), (29) and Lemma 4.5 gives
and using (7), (29) and Lemma 4.6 shows
Finally, combining the above three estimates proves (30) and thus concludes the proof. \(\square \)
Remark 4.6
Assume that \( u_0 = 0 \) and \( u'(0) = u_1 \in X \). Similar to (6) and (7), we have
for all \( 0 < t \leqslant T \) and \( 0 \leqslant \nu \leqslant 1 \), provided that \( u_1 \in D(A^\nu ) \). Discretization (27) will be modified as follows: seek \( U \in W_\tau ^\text {c} \) such that \( U(0) = 0 \) and
Following the proof of Theorem 4.1, we have
By (54), (55) and Lemmas 4.5 and 4.6 we can estimate of the right hand side of the above inequality in terms of \( \Vert {u_1} \Vert _{D(A^\nu )} \) and J, and thus obtain the convergence of \( \max _{1 \leqslant m \leqslant J} \Vert {(u-U)(t_m)} \Vert _X \). We leave the details to the interested readers.
5 Numerical Experiments
This section performs two numerical experiments to verify Theorems 3.1 and 4.1, respectively, in the following settings:
Experiment 1. The purpose of this experiment is to verify Theorem 3.1. Let \( u_0 \) be the \( L^2 \)-orthogonal projection of \( x^{0.51}(1-x) \), \( 0< x < 1 \), onto X. Define
where \( U^* \) is the numerical solution of discretization (8) with \( J = 2^{15} \) and \( \sigma = 2/\alpha \). Clearly, regarding \( \nu \) as 0.5 is reasonable. The numerical results in Tables 1, 2 and 3 illustrate that \( \mathcal E_1 \) is close to \( O(J^{-\min \{\sigma \alpha /2,1\} }) \), which agrees well with estimate (10) in Theorem 3.1.
Experiment 2. The purpose of this experiment is to verify Theorem 4.1. Let \( u_0 \) be the \( L^2 \)-orthogonal projection of \( x^{1.51}(1-x)^2 \), \( 0< x < 1 \), onto X. Let
where \( U^* \) is the numerical solution of discretization (27) with \( J=2^{15} \) and \( \sigma =2(3-\alpha )/\alpha \). Evidently, regarding \( u_0 \in D(A) \) is reasonable. The numerical results in Table 4 clearly demonstrate that \( {\mathcal {E}}_2 \) is close to \( O(J^{\alpha -3}) \), which agrees well with Theorem 4.1.
6 Conclusions
For the fractional evolution equation, we have analyzed a low-order discontinuous Galerkin (DG) discretization with fractional order \( 0< \alpha < 1 \) and a low-order Petrov Galerkin (PG) discretization with fractional order \( 1< \alpha < 2 \). When using uniform temporal grids, the two discretizations are equivalent to the L1 scheme with \( 0< \alpha < 1 \) and \( 1< \alpha < 2 \), respectively. For the DG discretization with graded temporal grids, sharp error estimates are rigorously established for smooth and nonsmooth initial data. For the PG discretization, the optimal \( (3-\alpha ) \)-order temporal accuracy is derived on appropriately graded temporal grids. The theoretical results have been verified by numerical results.
However, our analysis of the PG discretization requires \( u_0 \in D(A^\nu ) \) with \( 1/2 < \nu \leqslant 1 \). Hence, how to analyze the case \( 0 < \nu \leqslant 1/2 \) remains an open problem. It appears that the results and techniques developed in this paper can be used to analyze the semilinear fractional diffusion-wave equations with graded temporal grids, and this is our ongoing work.
References
Brenner, S.C., Scott, R.: The Mathematical Theory of Finite Element Methods, 3rd edn. Springer, New York (2008)
Cuesta, E., Lubich, C., Palencia, C.: Convolution quadrature time discretization of fractional diffusion-wave equations. Math. Comput. 75(254), 673–696 (2006)
Du, Q., Yang, J., Zhou, Z.: Time-Fractional Allen–Cahn Equations: Analysis and Numerical Methods. arXiv:1906.06584, (2019)
Ervin, V., Roop, J.: Variational formulation for the stationary fractional advection dispersion equation. Numer. Methods Partial Differ. Equ. 22(3), 558–576 (2006)
Jin, B., Lazarov, R., Zhou, Z.: An analysis of the L1 scheme for the subdiffusion equation with nonsmooth data. IMA J. Numer. Anal. 36, 197–221 (2016)
Jin, B., Lazarov, R., Zhou, Z.: Two fully discrete schemes for fractional diffusion and diffusion-wave equations with nonsmooth data. SIAM J. Sci Comput. 38(1), A146–A170 (2016)
Jin, B., Li, B., Zhou, Z.: Discrete maximal regularity of time-stepping schemes for fractional evolution equations. Numer. Math. 138(1), 101–131 (2018)
Li, B., Xie, X.: Regularity of solutions to time fractional diffusion equations. Discrete Contin. Dyn. Syst. B 24(7), 3195–3210 (2019)
Li, B., Luo, H., Xie, X.: A time-spectral algorithm for fractional wave problems. J. Sci. Comput. 7(2), 1164–1184 (2018)
Li, B., Luo, H., Xie, X.: A space-time finite element method for fractional wave problems. Numer. Algorithms (2018). https://doi.org/10.1007/s11075-019-00857-w
Li, B., Luo, H., Xie, X.: Analysis of a time-stepping scheme for time fractional diffusion problems with nonsmooth data. SIAM J. Numer. Anal. 57(2), 779–798 (2019)
Li, B., Wang, T., Xie, X.: Analysis of the L1 scheme for fractional wave equations with nonsmooth data. Submitted. arXiv:1908.09145v2
Li, B., Wang, T., Xie, X.: Analysis of a time-stepping discontinuous Galerkin method for fractional diffusion-wave equations with nonsmooth data. J. Sci. Comput. (2020). https://doi.org/10.1007/s10915-019-01118-7
Li, X., Xu, C.: A space–time spectral method for the time fractional diffusion equation. SIAM J. Numer. Anal. 47(3), 2108–2131 (2009)
Liao, H., Li, D., Zhang, J.: Sharp error estimate of the nonuniform l1 formula for linear reaction-subdiffusion equations. SIAM J. Numer. Anal. 56(2), 1112–1133 (2018)
Lubich, C.: Convolution quadrature and discretized operational calculus. Numer. Math. 52(2), 129–145 (1988)
Lubich, C., Sloan, I., Thomée, V.: Nonsmooth data error estimates for approximations of an evolution equation with a positive-type memory term. Math. Comput. 65(213), 1–17 (1996)
Lunardi, A.: Interpolation Theory. Edizioni della Normale, Pisa (2018)
Luo, H., Li, B., Xie, X.: Convergence analysis of a Petrov–Galerkin method for fractional wave problems with nonsmooth data. J. Sci. Comput. 80(2), 957–992 (2019)
Mao, Z., Jie, S.: Efficient spectral-Galerkin methods for fractional partial differential equations with variable coefficients. J. Comput. Phys. 307(1), 243–261 (2016)
McLean, W., Mustapha, K.: Time-stepping error bounds for fractional diffusion problems with non-smooth initial data. J. Comput. Phys. 293(1), 201–217 (2015)
McLean, W., Mustapha, K.: Convergence analysis of a discontinuous Galerkin method for a sub-diffusion equation. Numer. Algorithm 52(1), 69–88 (2009)
Mustapha, K., McLean, W.: Discontinuous Galerkin method for an evolution equation with a memory term of positive type. Math. Comput. 78, 1975–1995 (2009)
Mustapha, K., McLean, W.: Uniform convergence for a discontinuous Galerkin, time-stepping method applied to a fractional diffusion equation. IMA J. Numer. Anal. 32(3), 906–925 (2012)
Mustapha, K., McLean, W.: Superconvergence of a discontinuous Galerkin method for fractional diffusion and wave equations. SIAM J. Numer. Anal. 51(1), 491–515 (2013)
Mustaph, K.: An L1 approximation for a fractional reaction–diffusion equation, a second-order error analysis over time-graded meshes. arXiv:1909.06739v1 (2019)
Podlubny, I.: Fractional Differential Equations. Academic Press, New York (1998)
Sakamoto, K., Yamamoto, M.: Initial value/boundary value problems for fractional diffusion-wave equations and applications to some inverse problems. J. Math. Anal. Appl. 382(1), 426–447 (2011)
Schatz, A.H.: Pointwise error estimates and asymptotic error expansion inequalities for the finite element method on irregular grids: Part I global estimates. Math. Comput. 67(23), 877–899 (1998)
Stynes, M., O’Riordan, E., Gracia, J.L.: Error analysis of a finite difference method on graded meshes for a time-fractional diffusion equation. SIAM J. Numer. Anal. 55(2), 1057–1079 (2017)
Sun, Z., Wu, X.: A fully discrete difference scheme for a diffusion-wave system. Appl. Numer. Math. 56(2), 193–209 (2006)
Yan, Y., Khan, M., Ford, N.J.: An analysis of the modified L1 scheme for time-fractional partial differential equations with nonsmooth data. SIAM J. Numer. Anal. 56(1), 210–227 (2018)
Yang, Y., Chen, Y., Huang, Y., Wei, H.: Spectral collocation method for the time-fractional diffusion-wave equation and convergence analysis. Comput. Math. Appl. 73(6), 1218–1232 (2017)
Zayernouri, M., Ainsworth, M., Karniadakis, G.E.: A unified Petrov–Galerkin spectral method for fractional PDES. Comput. Methods Appl. Mech. Eng. 283, 1545–1569 (2015)
Zeidler, E.: Applied Functional Analysis: Applications to Mathematical Physics. Springer, Berlin (2009)
Zeng, F., Li, C., Liu, F., Turner, I.: The use of finite difference/element approaches for solving the time-fractional subdiffusion equation. SIAM J. Sci. Comput. 35(6), 2976–3000 (2013)
Acknowledgements
Binjie Li was supported in part by the National Natural Science Foundation of China (NSFC) Grant No. 11901410 and the Research and Development Foundation of Sichuan University Grant No. 2020SCU12063. Xiaoping Xie was supported in part by the National Natural Science Foundation of China (NSFC) Grant No. 11771312. Tao Wang was supported in part by the China Postdoctoral Science Foundation (CPSF) Grant No. 2019M66294.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
A Properties of Fractional Calculus Operators
Lemma A.1
For any \( v \in {}_0H^\gamma (a,b) \) with \( 0< \gamma < 1/2 \),
Lemma A.2
For any \( v \in {}_0H^\gamma (a,b) \) and \( w \in {}^0H^\gamma (a,b) \) with \( 0< \gamma < \infty \),
where \( C_1 \) and \( C_2 \) are two positive constants depending only on \( \gamma \).
Lemma A.3
Assume that \( v \in {}_0H^{\gamma /2}(a,b) \) and \( w \in {}^0H^{\gamma /2}(a,b) \) with \( 0< \gamma < 1 \). Then
If \( D_{a+}^\gamma v \in L^{2/(1+\gamma )}(a,b) \), then
If \( D_{b-}^\gamma w \in L^{2/(1+\gamma )}(a,b) \), then
For the proof of Lemma A.1, we refer the reader to [4]. For the proof of Lemma A.2, we refer the reader to [19]. Since the proof of Lemma A.3 is a standard density argument by Lemmas A.1 and A.2, it is omitted here.
B Some Inequalities
Lemma B.1
For any \( 0< \beta < 1 \) and \( 0 \leqslant t< a< b< c < d \),
Proof
Let
A routine argument proves that w is strictly decreasing on \( {(0,\infty )} \), so that
It follows that, for any \( 0 \leqslant x \leqslant d-c \),
which implies
for all \( 0 \leqslant x \leqslant d-c \). A simple calculation then yields \( g'(x) < 0 \) for all \( 0 \leqslant x \leqslant d-c \), where
This proves \( g(d-c) < g(0) \), namely (59), and thus concludes the proof. \(\square \)
Lemma B.2
For any \( 0< \beta < 1 \), \( \mu \geqslant 0 \) and \( 0 \leqslant t< a< b< c < d \),
Proof
Define
By the mean value theorem, there exists \( \theta \in (0,1)\) such that
Since
it follows that
which implies
Hence, by the estimate
we obtain
Integrating both sides of the above equation with respect to s from t to a yields
Let
Since Lemma B.1 implies \( {\mathcal {A}} {\mathcal {D}} > {\mathcal {B}} {\mathcal {C}} \) and (63) implies \( {\mathcal {M}} ({\mathcal {D}}-{\mathcal {B}}) \geqslant {\mathcal {N}} ({\mathcal {C}} - {\mathcal {A}}) \), we obtain
which proves (60). This completes the proof. \(\square \)
Lemma B.3
For any \( 1< \beta < 2 \) and \( 0 \leqslant t< a < b \leqslant c \),
Proof
By the mean value theorem, there exists \( 0< \theta < 1 \) such that
and so
Since
it follows that
Hence, for any \( 0 \leqslant t < a \),
which implies (64). This completes the proof. \(\square \)
Lemma B.4
If \( \beta >-1 \) and \( \gamma >1 \), then
for all \( k \geqslant 2 \).
Proof
A routine calculation gives
for all \( 2 \leqslant j \leqslant k-1 \) and \( 0 < x \leqslant 1 \), where \( C_0 \) and \( C_1 \) are two positive constants depending only on \( \beta \), \( \gamma \) and \( \sigma \). Hence,
This proves the lemma. \(\square \)
A trivial modification of the proof of Lemma B.4 yields the following estimate.
Lemma B.5
If \( \beta > -1 \) and \( 1/2 \leqslant \gamma < 1 \), then
for all \( k \geqslant 2 \).
Rights and permissions
About this article
Cite this article
Li, B., Wang, T. & Xie, X. Numerical Analysis of Two Galerkin Discretizations with Graded Temporal Grids for Fractional Evolution Equations. J Sci Comput 85, 59 (2020). https://doi.org/10.1007/s10915-020-01365-z
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10915-020-01365-z