Abstract
This paper analyzes a time-stepping discontinuous Galerkin method for fractional diffusion-wave problems. This method uses piecewise constant functions in the temporal discretization and continuous piecewise linear functions in the spatial discretization. Nearly optimal convergence with respect to the regularity of the solution is established when the source term is nonsmooth, and nearly optimal convergence rate \( \scriptstyle \ln (1/\tau )(\sqrt{\ln (1/h)}h^2+\tau ) \) is derived under appropriate regularity assumption on the source term. Convergence is also established without smoothness assumption on the initial value. Finally, numerical experiments are performed to verify the theoretical results.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
This paper considers the following time fractional diffusion-wave problem:
where \( 0<\alpha <1 \), \( 0< T < \infty \), \( \Omega \subset {\mathbb {R}}^d \) (\(d=1,2,3\)) is a convex d-polytope, \( {{\,\mathrm{D}\,}}_{0+}^{-\alpha } \) is a Riemann-Liouville fractional integral operator of order \( \alpha \), and f and \( u_0 \) are two given functions. The above fractional diffusion-wave equation is an intermediate equation between diffusion and wave equations, and it also belongs to the class of evolution equations with a positive-type memory term (or integro-differential equations with a weakly singular convolution kernel), which has attracted a lot of works in the past thirty years.
Let us first briefly summarize some works devoted to the numerical treatments of problem (1). McLean and Thomée [9] proposed and analyzed two discretizations: the first uses the backward Euler method to approximate the first-order time derivative and a first-order integration rule to approximate the fractional integral; the second uses a second-order backward difference scheme to approximate the first-order time derivative and a second-order integration rule to approximate the fractional integral. Then McLean et al. [10] analyzed two discretizations with variable time steps: the first is a simple variant of the first one analyzed in [9]; the second combines the Crank–Nicolson scheme and two integral rules to approximate the fractional integral (but the temporal accuracy is not better than \( {\mathcal {O}}(\tau ^{1+\alpha }) \)). By combining the first-order and second-order backward difference schemes and the convolution quadrature rules [4], Lubich et al. [5] proposed and analyzed two discretizations for problem (1), where optimal order error bounds were derived for positive time without spatial regularity assumption on the data. Cuesta et al. [1] proposed and studied a second-order discretization for problem (1) and its semilinear version.
By representing the solution as a contour integral by the Laplace transform technique and approximating this contour integral, McLean and Thomée [7, 8] developed and analyzed three numerical methods for problem (1). These methods use \( 2N+1 \) quadrature points, and the first method possesses temporal accuracies \( {\mathcal {O}}(e^{-cN}) \) away from \( t=0 \), the second and third have temporal accuracy \( {\mathcal {O}}(e^{-c\sqrt{N}}) \).
McLean and Mustapha [11] studied a generalized Crank–Nicolson scheme for problem (1), and obtained accuracy \( {\mathcal {O}}(h^2 + \tau ^2) \) on appropriately graded temporal grids under the condition that the solution and the forcing term satisfy some growth estimates. Mustapha and McLean [14] applied the famous time-stepping discontinuous Galerkin (DG) method [18, Chapter 12] to an evolution equation with a memory term of positive type. For the low-order DG method, they derived the accuracy order \( {\mathcal {O}}(\ln (1/\tau )h^2 + \tau ) \) on appropriately graded temporal grids under the condition that the time derivatives of the solution satisfy some growth estimates. We notice that this low-order DG method is identical to the first-order discretization analyzed in the aforementioned work [10]. They also analyzed an hp-version of the DG method in [13]. So far, to our best knowledge, the convergence of the low-order DG algorithm has not been established with nonsmooth data.
This paper is devoted to the convergence analysis of the aforementioned low-order DG method for problem (1) with nonsmooth data, which is a further development of the works in [10, 14]. For \( f = 0 \), we derive the error estimate
For \( u_0 = 0 \), we obtain the following estimates:
where the first estimate is nearly optimal with respect to the regularity of the solution, and the second is nearly optimal. We note that \( f(\cdot ,t) \) in the first estimate has no boundary condition on (0, T) due to \( \alpha /(\alpha +1) < 1/2 \). In addition, to investigate the effect of the nonvanishing \( f(\cdot ,0) \) on the accuracy of the numerical solution, we establish the error estimate
in the case that \( u_0 = 0 \) and \( f(x,t) = {\tilde{f}}(x) \in L^2(\Omega ) \), \( 0 \leqslant t \leqslant T \).
The rest of this paper is organized as follows. Section 2 introduces some Sobolev spaces, fractional calculus operators, the time-stepping discontinuous Galerkin method, the weak solution of problem (1) and its regularity results. Section 3 investigates two discretizations of two fractional ordinary equations, respectively. Section 4 establishes the convergence of the numerical method. Section 5 performs four numerical experiments to confirm the theoretical results. Finally, Sect. 6 provides some concluding remarks.
2 Preliminaries
Assume that \( -\infty< a< b < \infty \). For each \( m \in {\mathbb {N}} \), define
where \( H^m(a,b) \) is a usual Sobolev space [17] and \( v^{(k)} \) is the k-th weak derivative of v. We equip the above two spaces with the norms
respectively. For any \( m \in {\mathbb {N}}_{>0} \) and \( 0< \theta < 1 \), define
where \( [X,Y]_{1-\theta ,2} \) means the interpolation space of X and Y constructed by the famous K-method [17, Chapter 22]. For \( 0< \gamma < \infty \), 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. Conversely, since \( {}_0H^\gamma (a,b) \) and \( {}^0H^\gamma (a,b) \) are reflexive, they are the dual spaces of \( {}^0H^{-\gamma }(a,b) \) and \( {}_0H^{-\gamma }(a,b) \), respectively. Moreover, for any \( 0< \gamma < 1/2 \), \( {}_0H^\gamma (a,b) = {}^0H^\gamma (a,b) = H^\gamma (a,b) \) with equivalent norms (cf. [3, Chapter 1]), and hence \( {}_0H^{-\gamma }(a,b) = {}^0H^{-\gamma }(a,b) \) with equivalent norms.
It is well known that there exists an orthonormal basis \(\{\phi _n: n \in {\mathbb {N}} \}\) of \( L^2(\Omega ) \) such that
where \( \{ \lambda _n: n \in {\mathbb {N}} \} \) is a positive non-decreasing sequence with \(\lambda _n\rightarrow \infty \) as \(n\rightarrow \infty \). For any \( -\infty< \beta < \infty \), define
and endow this space with the norm
For any \( \beta ,\gamma \in {\mathbb {R}} \), define
and equip this space with the norm
The space \( {}_0H^\gamma (a,b;\dot{H}^\beta (\Omega )) \) is analogously defined, and it is evident that \( {}^0H^{-\gamma }(a,b;\dot{H}^{-\beta }(\Omega )) \) is the dual space of \( {}_0H^\gamma (a,b;\dot{H}^\beta (\Omega )) \) in the sense that
for all \( \sum _{n=0}^\infty c_n \phi _n \in {}^0H^\gamma (a,b;\dot{H}^{-\beta }(\Omega )) \) and \( \sum _{n=0}^\infty d_n \phi _n \in {}_0H^\gamma (a,b;\dot{H}^\beta (\Omega )) \). Since \( {}_0H^\gamma (a,b;\dot{H}^\beta (\Omega )) \) is reflexive, it is the dual space of \( {}^0H^{-\gamma }(a,b;\dot{H}^{-\beta }(\Omega )) \). Above and in what follows, for any Banach space W, the notation \( \langle {\cdot ,\cdot } \rangle _W \) means the duality paring between \( W^* \) (the dual space of W) and W.
2.1 Fractional Calculus Operators
This section introduces fractional calculus operators on a domain (a, b) , \( -\infty< a< b < \infty \), and summarizes several properties of these operators to be used in this paper. Assume that X is a separable Hilbert space.
Definition 2.1
For \( -1< \gamma < 0 \), define
for all \( v \in L^1(a,b;X) \), where \( \Gamma (\cdot ) \) is the Gamma function. In addition, let \( {{\,\mathrm{D}\,}}_{a+}^0 \) and \( {{\,\mathrm{D}\,}}_{b-}^0 \) be the identity operator on \( L^1(a,b;X) \). For \(0 < \gamma \leqslant 1 \), the left-sided and right-sided Riemann–Liouville fractional differential operators of order \(\gamma \) are defined respectively as
for all \( v \in L^1(a,b;X) \), where \( {{\,\mathrm{D}\,}}\) is the first-order differential operator in the distribution sense.
Let \( \{e_n:n \in {\mathbb {N}}\} \) be an orthonormal basis of X. For any \(-\infty< \gamma < \infty \), define
and endow this space with the norm
The space \( {}_0H^\gamma (a,b;X) \) is analogously defined. It is standard that \( {}_0H^{-\gamma }(a,b;X) \) is the dual space of \( {}^0H^\gamma (a,b;X) \) in the sense that
for all \( \sum _{n=0}^\infty c_n e_n \in {}_0H^{-\gamma }(a,b;X) \) and \( \sum _{n=0}^\infty d_n e_n \in {}^0H^\gamma (a,b;X) \).
Remark 2.1
For any \( 0< \gamma < 1 \), a simple calculation gives that \( {}_0H^\gamma (a,b;X) \) is identical to \( [L^2(a,b;X), {}_0H^1(a,b;X)]_{\gamma ,2} \), and
for all \( v \in {}_0H^\gamma (a,b;X) \).
Lemma 2.1
If \( -1/2< \gamma < 1/2 \), then
for all \( v \in {}_0H^\gamma (a,b;X) \) (equivalent to \( {}^0H^\gamma (a,b;X) \)), where \( (\cdot ,\cdot )_{L^2(a,b;X)} \) is the usual inner product in \( L^2(a,b;X) \).
Lemma 2.2
If \( -1< \beta < 0\) and \( -1 < \gamma \leqslant \beta \), then
where \( C_1 \) and \( C_2 \) are two positive constants depending only on \( \beta \) and \( \gamma \).
Lemma 2.3
If \(-1<\beta <1/2\) and \( \beta< \gamma < \beta +1/2 \), then
for all \( v \in {}_0H^\beta (a,b;X) \) and \( w \in {}^0H^{\gamma -\beta }(a,b;X) \).
Remark 2.2
For the proofs of the above lemmas, we refer the reader to [6, Section 3].
2.2 Algorithm Definition
Given \( J \in {\mathbb {N}}_{>0} \), we set \( \tau := T/J \) and \( t_j := j\tau \), \( 0 \leqslant j \leqslant J \), and use \( I_j \) to denote the interval \( (t_{j-1},t_j) \) for each \( 1 \leqslant j \leqslant J \). Let \( {\mathcal {K}}_h \) be a shape-regular triangulation of \(\Omega \) consisting of d-simplexes, and we use h to denote the maximum diameter of the elements in \( {\mathcal {K}}_h \). Define
For any \( V \in W_{\tau ,h} \), we set
where the value of \( V_0 \) or \( V_J^{+} \) will be explicitly specified whenever needed.
Assuming that \( u_0 \in S_h^* \) and \( f \in (W_{\tau ,h})^* \), we consider the following time-stepping discontinuous Galerkin scheme for problem (1): seek \( U \in W_{\tau ,h} \) such that \( U_0 = P_hu_0 \) and
for all \( V \in W_{\tau ,h} \), where \( P_h \) is the \( L^2 \)-orthogonal projection onto \( S_h \). Above and afterwards, for a Lebesgue measurable set \( \omega \) of \( \mathbb R^l \) (\( l= 1,2,3,4 \)), the symbol \( \langle {p,q} \rangle _\omega \) means \( \int _\omega pq \) whenever \( pq \in L^1(\omega ) \). In addition, the symbol \( C_\times \) means a positive constant depending only on its subscript(s), and its value may differ at each occurrence.
Theorem 2.1
Assume that \( u_0 \in L^2(\Omega ) \). If \( f \in L^1(0,T;L^2(\Omega )) \), then
If \( f \in {}_0H^{\alpha /2}(0,T;\dot{H}^{-1}(\Omega )) \), then
For the proof of (3), we refer the reader to [14, Theorem 2.1]. By the techniques used in the proof of Theorem 4.3 (in Sect. 4), the proof of (4) is trivial and hence omitted.
2.3 Weak Solution and Regularity
Following [6], we introduce the weak solution to problem (1) as follows. Define
and endow them with the norms
respectively. Assuming that \( u_0 t^{-(\alpha +1)/2} \in W^* \) and \( f \in \widehat{W}^* \), we call \( u \in W \) a weak solution to problem (1) if
for all \( v \in W \).
By [6], we readily obtain the following regularity results.
Theorem 2.2
Assume that \( u_0 t^{-(\alpha +1)/2} \in W^* \) and \( f \in \widehat{W}^* \), then the weak solution u in (5) is well-defined and
Moreover, if \( u_0 = 0 \) and \( f \in {}_0H^\gamma (0,T;\dot{H}^\beta (\Omega )) \) with \((\alpha -3)/4 \leqslant \gamma < \infty \) and \( 0 \leqslant \beta < \infty \), then the following conclusions hold:
The solution u satisfies that
$$\begin{aligned}&{{\,\mathrm{D}\,}}_{0+}^{\gamma +1} u - \Delta {{\,\mathrm{D}\,}}_{0+}^{\gamma -\alpha } u = {{\,\mathrm{D}\,}}_{0+}^\gamma f, \end{aligned}$$(6)$$\begin{aligned}&\Vert {u} \Vert _{{}_0H^{\gamma +1}(0,T;\dot{H}^\beta (\Omega ))} + \Vert {u} \Vert _{{}_0H^{\gamma -\alpha }(0,T;\dot{H}^{2+\beta }(\Omega ))} \leqslant C_{\alpha ,\gamma } \Vert {f} \Vert _{{}_0H^\gamma (0,T;\dot{H}^\beta (\Omega ))}; \end{aligned}$$(7)If \( 0 \leqslant \gamma < \alpha +1/2 \), then
$$\begin{aligned} \Vert {u} \Vert _{C([0,T];\dot{H}^{\beta +(2\gamma +1)/(\alpha +1)}(\Omega ))} \leqslant C_{\alpha ,\gamma } \Vert {f} \Vert _{{}_0H^\gamma (0,T;\dot{H}^\beta (\Omega ))}; \end{aligned}$$(8)If \( \gamma = \alpha + 1/2 \), then
$$\begin{aligned} \Vert {u} \Vert _{ C([0,T];\dot{H}^{\beta +2(1-\epsilon )}(\Omega )) } \leqslant \frac{C_\alpha }{\sqrt{\epsilon }} \Vert {f} \Vert _{{}_0H^{\alpha +1/2}(0,T;\dot{H}^\beta (\Omega ))} \end{aligned}$$(9)for all \( 0< \epsilon < 1 \).
Remark 2.3
For any \( v \in W \), since [17, Lemma 33.2] implies
we have
Therefore, \( t^{-(\alpha +1)/2} u_0 \in W^* \) and hence the above weak solution is well-defined for the case \( u_0 \in L^2(\Omega ) \).
Next, we briefly summarize two other methods to define the weak solution to problem (1). The first method [11] uses the Mittag–Leffler function to define the weak solution of problem (1) with \( f = 0 \) and \( u_0 \in \dot{H}^{-2}(\Omega ) \), by that
where, for any \( \beta , \gamma > 0 \), the Mittag–Leffler function \( E_{\beta ,\gamma } \) is defined by
Then we can investigate the regularity of this weak solution by a growth estimate [15]
The second method uses the well-known transposition technique to define the weak solution to problem (1) as follows. Define
and equip this space with the norm
Also, define
and endow this space with the norm
Assuming that \( u_0 \in G_\mathrm {tr}^* \) and \( f \in G^* \), we call u a weak solution to problem (1) if
for all \( v \in G \). By the symmetric version of Theorem 2.2, applying the famous Babuška-Lax-Milgram theorem proves that the above weak solution is well-defined.
3 Discretizations of Two Fractional Ordinary Equations
3.1 An Auxiliary Function
For any \( z \in \{x+iy:\ 0< x< \infty , -\infty< y < \infty \} \), define
By the standard analytic continuation technique, \( \psi \) has a Hankel integral representation (cf. [19, (12.1)] and [12, (21)])
where \( \int _{-\infty }^{({0+})} \) means an integral on a piecewise smooth and non-self-intersecting path enclosing the negative real axis and orienting counterclockwise, 0 and \( \{z+2k\pi i \ne 0: k \in {\mathbb {Z}}\} \) lie on the different sides of this path, and \( w^{-2-\alpha } \) is evaluated in the sense that
By Cauchy’s integral theorem and Cauchy’s integral formula, it is clear that (cf. [19, (13.1)])
for all \( z \in {\mathbb {C}} \setminus (-\infty , 0] \) satisfying \( -2\pi< {\text {Im}} z < 2\pi \). From this series representation, it follows that
Moreover,
and hence
Lemma 3.1
For any \( \mu >0 \), there exist \( \theta _\alpha \) and \( \delta _{\alpha ,\mu }\), depending only on \( \alpha \) and on \( \alpha \) and \( \mu \), respectively, with \( \pi /2 < \theta _\alpha \leqslant (\alpha +3)/(4\alpha +4)\pi \) and \( 0< \delta _{\alpha ,\mu } < \infty \), such that
Proof
By (14), there exists \( 0< \delta _\alpha < \pi \), depending only on \( \alpha \), such that \( {\text {Im}} \psi (z) < 0 \) and hence
For \( 0 < y \leqslant \pi \), by (11) we have
where
It follows that
A straightforward calculation then gives
and hence, by the continuity of \( \psi \) in
a routine argument yields that there exists \( 0 < r_\alpha \leqslant \delta _\alpha \tan ((1-\alpha )/(4\alpha +4)\pi ) \), depending only on \( \alpha \), such that
By (16) and (20), letting \( \theta _\alpha := \pi /2 + {\text {arctan}}(r_\alpha /\pi ) \) yields
In addition, by (18), (19), (14) and the continuity of \( \psi \) in \(\Phi \), there exists \( \delta _{\alpha ,\mu } > 0 \) depending only on \( \alpha \) and \( \mu \) such that
Finally, combining (12), (21) and (22) proves (15) and hence this lemma. \(\square \)
Lemma 3.2
For any \( \mu > 0 \) and \( 0 < y \leqslant \pi \),
Proof
By (14), (18) and (19), there exists \( 0< y_\alpha < \pi \), depending only on \( \alpha \), such that
It follows that
and hence
It remains, therefore, to prove
By (11), there exists a continuous function g on \( [0,\pi ] \) such that \( g(0) = 0 \) and
A straightforward calculation gives
so that, by the fact \( g(0) = 0 \), there exists \( 0< y_\alpha < \pi \), depending only on \( \alpha \), such that
In addition, applying the extreme value theorem implies, by (15), that
Consequently, (24) follows from the above two estimates and the estimate
This completes the proof. \(\square \)
Lemma 3.3
For any \( \mu > 0 \) and \( 0 < y \leqslant \pi \),
where \( g(y) := (1+\mu \psi (iy))^{-1} \).
Proof
By (17), \( \psi (iy) \) can be expressed in the form
where F is analytic on \( [0,\pi ] \) and
A direct calculation gives
so that
In addition, Lemma 3.2 implies
Therefore, (25) follows from the equality
This completes the proof. \(\square \)
In the next two subsections, we use \( \theta \) to abbreviate \( \theta _\alpha \) given in Lemma 3.1, define
and let \( \Upsilon \) be oriented so that \( {\text {Im}} z \) increases along \( \Upsilon \). In addition, set
which inherits the orientation of \( \Upsilon \).
3.2 The First Fractional Ordinary Equation
This subsection considers the fractional ordinary equation
subject to the initial value condition \( \xi (0) = \xi _0 \), where \( \lambda \) is a positive constant and \( \xi _0 \in {\mathbb {R}} \). By [5, (2.1)], the solution \( \xi \) of Eq. (26) can be expressed by a contour integral
Applying the temporal discretization used in (2) to Eq. (26) yields the following discretization: let \( Y_0 = \xi _0 \); for \( k \in {\mathbb {N}} \), the value of \( Y_{k+1} \) is determined by that
where \( \mu := \lambda \tau ^{1+\alpha } \) and \( b_j := j^{1+\alpha }/\Gamma (2+\alpha ) \), \( j \in {\mathbb {N}} \).
Theorem 3.1
For any \( k \in {\mathbb {N}}_{>0} \), it holds
Theorem 3.2
For any \( k \in {\mathbb {N}}_{>0} \), it holds
The main task of the rest of this subsection is to prove the above two theorems by the well-known Laplace transform method (the basic idea comes from [2, 5, 12]). To this end, we introduce the discrete Laplace transform of \( (Y_k)_{k=0}^\infty \) by that
where \( H := \{x+iy: 0 < x \leqslant \delta _{\alpha ,\mu },\, -\pi \leqslant y \leqslant \pi \} \), with \( \delta _{\alpha ,\mu } \) being defined in Lemma 3.1. By the definition of the sequence \( (Y_k)_{k=0}^\infty \), a straightforward calculation gives
where \( {\widehat{b}} \) is the discrete transform of the sequence \( (b_k)_{k=0}^\infty \), namely
For any \( z \in H \), combining like terms yields
which, together with (10) and Lemma 3.1, indicates
Therefore, a routine calculation (cf. [12, (28)]) yields that, for any \( 0 < a \leqslant \delta _{\alpha ,\mu } \) and \( k \in {\mathbb {N}}_{>0} \),
By (14) and (15), letting \( a \rightarrow {0+} \) and applying Lebesgue’s dominated convergence theorem then lead to
From (15) it follows that the integrand in (31) is analytic on
and continuous on \( \partial \omega \setminus \{0\} \), and that (14) implies that
Additionally,
for all \( z = x-i\pi \), \( -\pi \tan \theta \leqslant x \leqslant 0 \). Therefore, an elementary calculation yields
by (31) and Cauchy’s integral theorem.
Remark 3.1
By the techniques used in the proof of Theorem 2.1, it is easy to obtain that \( |{Y_k} | \leqslant |{\xi _0} | \) for all \( k \in {\mathbb {N}}_{>0} \). Thus, the series in (30) converges absolutely for all \( z \in H \).
Finally, we show the proofs of Theorems 3.1 and 3.2 as follows.
Proof of Theorem 3.1
Firstly, let us prove
where \( g(y) := (1+\mu \psi (iy))^{-1} \), \( 0 < y \leqslant \pi \). A straightforward calculation gives
It follows that
which proves (33).
Secondly, let us prove
If \( k = 1 + 2m \), \( m \in {\mathbb {N}} \), then a similar argument as that to derive (33) yields
and hence (34) follows from the estimate
which is evident by Lemma 3.2. If \( k = 2m \), \( m \in {\mathbb {N}}_{>0} \), then a simple modification of the above analysis proves that (34) still holds.
Finally, combining (33) and (34) yields
so that
Therefore, (28) follows from
which is evident by (12) and (31). This concludes the proof of Theorem 3.1. \(\square \)
Proof of Theorem 3.2
Substituting \( \eta := \tau z \) into (27) yields
and then subtracting (32) from this equation gives
where
Since \({\mathbb {I}}_1\) is a real number, a simple calculation gives
and the fact \( \pi /2< \theta < (\alpha +3)/(4\alpha +4)\pi \) implies
Consequently,
Then let us estimate \( {\mathbb {I}}_2 \). For any \( z \in \Upsilon _1 \setminus \{0\} \), since
from the fact \( \pi /2< \theta < (\alpha +3)/(4\alpha +4)\pi \) it follows that
By (11), a routine calculation gives
and, similar to (23), we have
In addition, it is clear that
Using the above four estimates, we obtain
for all \( z \in \Upsilon _1 \setminus \{0\} \). Therefore,
Finally, combing (35) and the above estimates for \( {\mathbb {I}}_1 \) and \( {\mathbb {I}}_2 \) proves (29) and thus concludes the proof. \(\square \)
3.3 The Second Fractional Ordinary Equation
This subsection considers the fractional ordinary equation
subject to the initial value condition \( \xi (0) = 0 \). Applying the temporal discretization in (2) yields the following discretization: let \( Y_0 = 0 \); for \( k \in {\mathbb {N}} \), the value of \( Y_{k+1} \) is determined by that
Similar to (27) and (32), we have
Theorem 3.3
For any \( k \in {\mathbb {N}}_{>0} \),
Proof
Since the proof of this theorem is similar to that of Theorem 3.2, we only highlight the differences. Proceeding as in the proof of Theorem 3.2 yields
where
Moreover,
For any \( z \in \Upsilon _1 \setminus \{0\} \), since
from the fact \( \pi /2< \theta < (\alpha +3)/(4\alpha +4)\pi \) it follows that there exists a positive constant c, depending only on \( \alpha \), such that
By (11), a routine calculation gives
and, similar to (23), it holds
Using the above three estimates, we obtain
for all \( z \in \Upsilon _1 \setminus \{0\} \). Therefore, if \( c\mu ^{1/(1+\alpha )} \leqslant \pi /\sin \theta \), then
and, if \( c\mu ^{1/(1+\alpha )} > \pi /\sin \theta \), then
Finally, combing the above estimates for \( {\mathbb {I}}_1 \) and \( {\mathbb {I}}_2 \) proves (40) and hence this theorem. \(\square \)
4 Main Results
In the rest of this paper, we assume that \( h < e^{-2(1+\alpha )} \) and \( \tau < T/e \). The symbol \( a\lesssim b \) means \( a \leqslant Cb \), where C is a generic positive constant depending only on \( \alpha \), T, \( \Omega \), the shape-regular parameter of \( {\mathcal {K}}_h \), and the ratio of h to the minimum diameter of the elements in \( {\mathcal {K}}_h \). Additionally, since the following properties are frequently used in the forthcoming analysis, we shall use them implicitly (cf. [16]): for \( -\infty< a< b < \infty \), \( -1< \beta , \gamma < 1\) and \( -1< \beta +\gamma < 1\),
Let u be the weak solution to problem (1) and U be the numerical solution defined by (2).
Theorem 4.1
If \( u_0 \in L^2(\Omega ) \) and \( f = 0 \), then
for all \( 1 \leqslant j \leqslant J \).
Proof
Let \( u_h \) be the solution of the spatially discrete problem:
subject to the initial value condition \( u_h(\cdot ,0) = P_h u_0 \), where the discrete Laplace operator \( \Delta _h:S_h \rightarrow S_h \) is defined by that
By [5, Theorem 2.1] we have
and by Theorem 3.2 we obtain
Combining the above two estimates proves (41). \(\square \)
Theorem 4.2
If \( u_0 = 0 \) and \( f(x,t) = {\tilde{f}}(x) \in L^2(\Omega ) \), \( 0< t < T \), then
for all \( 1 \leqslant j \leqslant J \).
Proof
Let \( u_h \) be the solution of the spatially discrete problem:
subject to the initial value condition \( u_h(\cdot ,0) = 0 \). By [5, Theorem 2.2] it holds
and Theorem 3.3 implies
Combining the above two estimates proves (42). \(\square \)
Theorem 4.3
If \( u_0 = 0 \) and \( f \in L^2(0,T;\dot{H}^{\alpha /(\alpha +1)}(\Omega )\!) \), then
Remark 4.1
Since Theorem 2.2 implies
the estimate (43) is nearly optimal with respect to the regularity of u.
Theorem 4.4
If \( u_0 = 0 \) and \( f \in {}_0H^{\alpha +1/2}(0,T;L^2(\Omega )) \), then
Remark 4.2
Assume that u satisfies the following regularity assumptions: for any \( 0 < t \leqslant T \),
where M and \( \sigma \) are two positive constants. By taking
Mustapha and McLean [14] obtained
Hence, no convergence rate is available in the case that \( u_0 \in L^2(\Omega ) \). Besides, under the condition that \( u_0 = 0 \) and \( f \in {}_0H^{\alpha +1/2}(0,T;L^2(\Omega )) \), Theorem 2.2 only yields
so that u does not satisfy the above three regularity assumptions necessarily.
Remark 4.3
Theorems 4.2 and 4.4 imply that if \( f \in H^{\alpha +1/2}(0,T;L^2(\Omega )) \) and \( f(\cdot ,0) \ne 0 \), then
for all \( 1 \leqslant j \leqslant J \), where \( H^{\alpha +1/2}(0,T;L^2(\Omega )) \) is defined analogously to the space \( {}_0H^{\alpha +1/2}(0,T;L^2(\Omega )) \). Furthermore, Theorems 4.1 and 4.2 imply that if the accuracy of U near \( t = 0 \) is unimportant, then it is unnecessary to use graded temporal grids to tackle the singularity caused by nonsmooth \( u_0 \) and f(0) .
The rest of this section is devoted to the proofs of Theorems 4.3 and 4.4. Let X be a separable Hilbert space. For any \( w \in C((0,T];X) \) and \( v \in L^1(0,T;X) \), we define, for \(1 \leqslant j \leqslant J,\)
The operator \( Q_\tau \) possesses the standard estimates
Hence, for any \( v \in {}_0H^\beta (0,T;X) \) with \( 0< \beta < 1 \), applying [17, Lemma 22.3] yields
so that [17, (23.11)] implies
Here we have used the fact that \( {}_0H^\beta (0,T;X) = [L^2(0,T;X), {}_0H^1(0,T;X)]_{\beta ,2} \) with equivalent norms (cf. Remark 2.1). Similarly, for any \( v \in {}^0H^\beta (0,T;X) \) with \( 0< \beta < 1 \),
Moreover, from [17, Lemmas 12.4, 16.3, 22.3, 23.1] it follows the following lemma.
Lemma 4.1
If \( v \in {}_0H^\beta (0,1) \) with \( 0< \beta < 1 \), then
Furthermore, if \( 1/2< \beta < 1 \), then
where C is a positive constant independent of \( \beta \) and v.
Lemma 4.2
If \( v \in {}_0H^\beta (0,T) \) with \( 1/2< \beta < 1 \), then
Proof
By the definition of \( P_\tau \) and (49), a scaling argument yields
so that from (45) it follows
Another scaling argument, together with (47), gives that
Combining the above two estimates proves (50). \(\square \)
Lemma 4.3
[6]. Assume that \( -\infty< \beta ,\gamma ,r,s < \infty \) and \( 0< \theta < 1 \). If \( v \in {}_0H^\beta (0,T;\dot{H}^r(\Omega )) \cap {}_0H^\gamma (0,T;\dot{H}^s(\Omega )) \), then
In particular, if \( \beta = 0 \) and \( \gamma = 1 \), then
for all \( v \in L^2(0,T;\dot{H}^r(\Omega )) \cap {}_0H^1(0,T;\dot{H}^s(\Omega )) \).
Lemma 4.4
[18]. If \( V \in W_{\tau ,h} \) and \( 0 \leqslant i < k \leqslant J \), then
4.1 Proof of Theorem 4.3
Let us first prove
For any \( 1 \leqslant j \leqslant J \), by (2) and (6) we have
where \( \theta :=U-P_\tau P_hu \) and we set \( (P_\tau P_h u)_0 = 0 \). By the definitions of \( P_h \) and \( P_\tau \), a routine calculation (see [18, Chapter 12]) then yields
so that using Lemma 4.4, Lemma 2.1, Sobolev inequality and Young’s inequality with \( \epsilon \) gives
Since \( 1 \leqslant j \leqslant J \) is arbitrary, this implies (53).
Next, let us prove
By the inverse estimate and Lemma 4.2, a straightforward calculation gives that, for any \( 0< \epsilon < 1/(\alpha +1) \),
and hence letting \( \epsilon = (2\ln (1/h)\!)^{-1} \) yields
Moreover, by Lemma 2.2 it holds
Therefore, by Theorem 2.2 and Lemma 4.3, combining (53) and the above two estimates yields (54).
Finally, a routine calculation gives
so that (43) follows from (54) and the triangle inequality
This completes the proof of Theorem 4.3.
Remark 4.4
From the above proof, it is easy to see that Theorem 4.3 still holds for the case of variable time steps.
4.2 Proof of Theorem 4.4
Lemma 4.5
If \( W \in W_{\tau ,h} \) satisfies that \( W_0 := v_h \in S_h \) and
then
Proof
Since Lemma 4.4 implies
inserting \( V = W \) into (55) yields
Hence, using Lemmas 2.1 and 2.2 proves (56).
Now let us prove (57). Let \( \{\phi _{n,h}: 1 \leqslant n \leqslant N\} \) be an orthonormal basis of \( S_h \) endowed with the \( L^2(\Omega ) \) inner-product such that
where \( \{\lambda _{n,h}: 1 \leqslant n \leqslant N \} \) is the set of all eigenvalues of \( -\Delta _h \). For each \( 1 \leqslant n \leqslant N \), define \( (Y_k^n(t))_{k=0}^\infty \) by
with \( Y_k^n(0)=\langle {v_h,\phi _{n,h}} \rangle _\Omega \). Set \( W^n(t) := \langle {W(t), \phi _{n,h}} \rangle _\Omega \), \( 0< t < T \), and it is easy to verify that
Hence, Theorem 3.1 implies
and then it follows that
In addition, inserting \( V = W \chi _{(0,t_1)} \) into (55) yields, by Lemma 2.1, that
which implies
Consequently, since (55) leads to
combining (59) and (60) proves (57) and hence this lemma. \(\square \)
Lemma 4.6
If \( f \in {}_0H^{\alpha /2}(0,T;L^2(\Omega )) \), then
for each \( 1 \leqslant j \leqslant J \).
Proof
Let \( \theta = U - P_\tau P_h u \) and set \( (P_\tau P_hu)_0 = 0 \). Define \( W \in W_{\tau ,h} \) by that \( W_J^{+} = \theta _J \) and
A simple calculation then yields
and proceeding as in the proof of Theorem 4.3 shows
Consequently,
where
Next, it is evident that
By the definitions of \( Q_\tau \) and \( R_h \),
In addition,
Thus,
Finally, from the symmetric version of Theorem 4.5 it follows
and hence combining (62)–(64) yields that (61) holds for \( j = J \). Since the case \( 1 \leqslant j < J \) can be proved analogously, this completes the proof. \(\square \)
Finally, we conclude the proof of Theorem 4.4 as follows. By Lemma 4.6, a straightforward calculation yields
By Theorem 2.2 it holds
for all \( 0< \epsilon < 1/2 \), so that, by the assumption \( h < e^{-2(1+\alpha )} \) (cf. the first paragraph of Sect. 4), letting \( \epsilon := (\ln (1/h))^{-1} \) yields
In addition, by Theorem 2.2 and Lemma 4.3, it is standard that
Combining (65)–(67) proves (44) and thus concludes the proof of Theorem 4.4.
5 Numerical Experiments
This section performs some numerical experiments in one dimensional space to verify the theoretical results. Throughout this section, \( \Omega = (0,1) \), \( T = 1 \), the spatial grids are uniform, and \( U^{m,n} \) is the numerical solution with \( h = 2^{-m} \) and \( \tau = 2^{-n} \). Additionally, \( \Vert {\cdot } \Vert _{L^\infty (0,T;L^2(\Omega ))} \) is abbreviated to \( \Vert {\cdot } \Vert \) for convenience, and, for any \( \beta > 0 \),
where \( v((j/2^n)-) \) means the left limit of v at \( j/2^n \).
Experiment 1. This experiment verifies Theorem 4.1 by setting
which is slightly smoother than the \( L^2(\Omega ) \)-regularity. Table 1 validates the theoretical prediction that the convergence behavior of U is close to \( \mathcal O(\tau ) \) when h is fixed and sufficiently small. Table 2 confirms the theoretical prediction that the convergence behavior of U is close to \( {\mathcal {O}}(h^2) \) when \( \tau \) is fixed and sufficiently small.
Experiment 2. This experiment verifies Theorem 4.2 by setting
Table 3 confirms the theoretical prediction that the convergence behavior of U is close to \( {\mathcal {O}}(\tau ) \) when h is fixed and sufficiently small. Table 4 confirms the theoretical prediction that the accuracy of \( U(T-) \) (the left limit of U at T) in the norm \( \Vert {\cdot } \Vert _{L^2(\Omega )} \) is close to \( {\mathcal {O}}(h^2) \) when \( \tau \) is fixed and sufficiently small.
Experiment 3. This experiment verifies Theorem 4.3 by setting
which has slightly higher regularity than the \( L^2(0,T;\dot{H}^{\alpha /(\alpha +1)}(\Omega )) \)-regularity. Theorem 4.3 predicts that the convergence behavior of U is close to \( {\mathcal {O}}(h) \) when \( \tau \) is fixed and sufficiently small, as is in good agreement with the numerical results in Table 5. Moreover, Theorem 4.3 predicts that the convergence behavior of U is close to \( {\mathcal {O}}(\tau ^{1/2}) \) when h is fixed and sufficiently small, which agrees well with the numerical results in Table 6.
Experiment 4. This experiment verifies Theorem 4.4 by setting
which is slightly smoother than the \( {}_0H^{\alpha +1/2}(0,T;L^2(\Omega )) \)-regularity. Table 7 confirms the theoretical prediction that the convergence behavior of U is close to \( {\mathcal {O}}(h^2) \) when \( \tau \) is fixed and sufficiently small, and Table 8 confirms the theoretical prediction that the convergence behavior of U is close to \( {\mathcal {O}}(\tau ) \) when h is fixed and sufficiently small.
Experiment 5. This experiment verifies the effect of graded temporal grids by setting
Let \( U^{m,J,\sigma } \) be the numerical solution with \( h = 2^{-m} \) and temporal grids
For simplicity, \( \Vert {\cdot } \Vert _{L^2(0,T;L^2(\Omega ))} \) is abbreviated to \( \Vert {\cdot } \Vert _2 \). Table 9 gives the numerical results with different \(\alpha \) and \(\sigma \), which show that the graded temporal grids can improve the accuracy in the \(L^2(0,T;L^2(\Omega ))\) norm significantly.
6 Conclusion
A time-stepping discontinuous Galerkin method has been analyzed in this paper. Nearly optimal error estimates with respect to the regularity of the solution have been derived with nonsmooth and smooth source terms. The error estimation with nonsmooth initial value has been carried out by the Laplace transform technique. In addition, the effect of the nonvanishing \( f(\cdot ,0) \) on the accuracy of the numerical solution has been investigated. Finally, numerical results have confirmed the theoretical results.
References
Cuesta, E., Lubich, C., Palencia, C.: Convolution quadrature time discretization of fractional diffusion-wave equations. Math. Comput. 75(254), 673–696 (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(1), 197–221 (2016)
Lions, J., Magenes, E.: Non-Homogeneous Boundary Value Problems and Applications. Springer, Berlin (1972)
Lubich, C.: Discretized fractional calculus. SIAM J. Math. Anal. 17(3), 704–719 (1986)
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)
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)
McLean, W., Thomée, V.: Maximum-norm error analysis of a numerical solution via Laplace transformation and quadrature of a fractional-order evolution equation. IMA J. Numer. Anal. 30(1), 208–230 (2010)
McLean, W., Thomée, V.: Numerical solution via laplace transforms of a fractional order evolution equation. J. Integral Equ. Appl. 22(1), 57–94 (2010)
McLean, W., Thomée, V.: Numerical solution of an evolution equation with a positive type memory term. J. Aust. Math. Soc. Ser. B Appl. Math. 35(1), 23–70 (1993)
McLean, W., Thomée, V., Wahlbin, L.B.: Discretization with variable time steps of an evolution equation with a positive-type memory term. J. Comput. Appl. Math. 69(1), 49–69 (1996)
McLean, W., Mustapha, K.: A second-order accurate numerical method for a fractional wave equation. Numer. Math. 105(3), 481–510 (2007)
McLean, W., Mustapha, K.: Time-stepping error bounds for fractional diffusion problems with non-smooth initial data. J. Comput. Phys. 293(C), 201–217 (2015)
Mustapha, K., Schötzau, D.: Well-posedness of hp-version discontinuous Galerkin methods for fractional diffusion wave equations. IMA J. Numer. Anal. 34(4), 1426–1446 (2014)
Mustapha, K., McLean, W.: Discontinuous Galerkin method for an evolution equation with a memory term of positive type. Math. Comput. 78(268), 1975–1995 (2009)
Podlubny, I.: Fractional Differential Equations. Academic Press, Cambridge (1998)
Samko, S., Kilbas, A., Marichev, O.: Fractional Integrals and Derivatives: Theory and Applications. Gordon and Breach Science Publishers, London (1993)
Tartar, L.: An Introduction to Sobolev Spaces and Interpolation Spaces. Springer, Berlin (2007)
Thomée, V.: Galerkin Finite Element Methods for Parabolic Problems. Springer, Berlin (2006)
Wood, D.: The computation of polylogarithms. Technical report. University of Kent (1992)
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.
This work was supported by National Natural Science Foundation of China (11901410, 11771312).
Rights and permissions
About this article
Cite this article
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 82, 4 (2020). https://doi.org/10.1007/s10915-019-01118-7
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10915-019-01118-7