Abstract
This paper develops a high-accuracy algorithm for time fractional wave problems, which employs a spectral method in the temporal discretization and a finite element method in the spatial discretization. Moreover, stability and convergence of this algorithm are derived, and numerical experiments are performed, demonstrating the exponential decay in the temporal discretization error provided the solution is sufficiently smooth.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Let \( 1< \gamma < 2 \) and let \( \Omega \subset \mathbb R^d \) (\(d=2,3\)) be a polygon/polyhedron. This paper considers the fractional wave problem
where \( u_0 \in H_0^1(\Omega ) \), \( u_1 \in L^2(\Omega ) \), and \( f \in L^2(\Omega _T) \) with \( \Omega _T := \Omega \times (0,T) \). Here \( u_t \) is the derivative of u with respect to the time variable t, and \( D_{0+}^\gamma \) is a Riemann–Liouville fractional differential operator.
The above problem is a particular case of time fractional diffusion-wave problems, which have attracted a considerable amount of research in the field of numerical analysis in the past twenty years. By now, most of the existing numerical algorithms employ the L1 scheme ([5, 11, 17, 27, 28]), Grünwald-Letnikov discretization ([2, 12, 19, 20, 23, 24]) or fractional linear multi-step method ([8, 21, 26]) to discrete the fractional derivatives. Generally, for those algorithms, the best temporal accuracy are \( O(\tau ^2) \) for the fractional diffusion problems and \( O(\tau ^{3-\gamma }) \) for the fractional wave problems, where \( \tau \) is the time step size.
Due to the nonlocal property of fractional differential operator, the memory and computing cost of an accuracy approximation to a fractional diffusion-wave problem is significantly more expensive than that to a corresponding normal diffusion-wave problem. To reduce the cost, high-accuracy algorithms are often preferred, especially those of high accuracy in the time direction. This motivates us to develop high-accuracy numerical algorithms for problem (1). The efforts in this aspect are summarized as follows. Li and Xu [10] proposed a space-time spectral algorithm for the fractional diffusion equation, and then Zheng et al. [29] constructed a high order space-time spectral method for the fractional Fokker–Planck equation. Gao et al. [7] proposed a new scheme to approximate Caputo fractional derivatives of order \( \gamma \) (\(0<\gamma <1\)). Zayernouri and Karniadakis [25] developed an exponentially accurate fractional spectral collocation method. Yang et al. [22] developed a spectral Jacobi collocation method for the time fractional diffusion-wave equation. Recently, Ren et al. [14] investigated the superconvergence of finite element approximation to time fractional wave problems; however, the temporal accuracy order is only \( O(\tau ^{3-\gamma }) \).
In this paper, using a spectral method in the temporal discretization and a finite element method in the spatial discretization, we design a high-accuracy algorithm for problem (1) and establish its stability and convergence. Our numerical experiments show the exponential decay in the temporal discretization errors, provided the underlying solution is sufficiently smooth.
The rest of this paper is organized as follows. Section 2 introduces some Sobolev spaces and the Riemann–Liouville fractional calculus operators. Section 3 describes a time-spectral algorithm and constructs the basis functions for the temporal discretization. Sections 4 and 5 establish the stability and convergence of the proposed algorithm, and Sect. 6 performs some numerical experiments to demonstrate its high accuracy. Finally, Sect. 7 provides some concluding remarks.
2 Notation
Let us first introduce some Sobolev spaces. For \( 0< \alpha < \infty \), as usual, \( H_0^\alpha (0,T) \), \( H^\alpha (0,T) \), \( H_0^\alpha (\Omega ) \) and \( H^\alpha (\Omega ) \) are used to denote four standard Sobolev spaces; see [18]. Let X be a separable Hilbert space with an inner product \( (\cdot ,\cdot )_X \) and an orthonormal basis \( \{ e_k: k \in \mathbb N \} \). For \( 0< \alpha < \infty \), define
and endow this space with the norm
where \( L^2(0,T;X) \) is an X-valued Bochner \( L^2 \) space. For \( v \in H^j(0,T; X) \) with \( j \in \mathbb N_{\geqslant 1} \), the symbol \( v^{(j)} \) denotes its jth weak derivative:
where \( c_k(\cdot ) := (v(\cdot ), e_k)_X \) and \( c_k^{(j)} \) is its jth weak derivative. Conventionally, \( v^{(1)} \) and \( v^{(2)} \) are also abbreviated to \( v' \) and \( v'' \), respectively.
Moreover, for \( j \in \mathbb N \) we define
and equip this space with the norm
where the space \( B^j(0,T) \) and its norm are respectively given by
and
Then we introduce the Riemann–Liouville fractional operators. Let X be a Banach space and let \( L^1(0,T;X) \) be an X-valued Bochner \( L^1 \) space.
Definition 2.1
For \( 0< \alpha < \infty \), define \( I_{0+}^{\alpha ,X}, I_{T-}^{\alpha ,X}:~L^1(0,T;X) \rightarrow L^1(0,T;X) \), respectively, by
for all \( v \in L^1(0,T;X) \).
Definition 2.2
For \( j-1< \alpha < j \) with \( j \in \mathbb N_{>0} \), define
where D is the first-order differential operator in the distribution sense.
Above \( \Gamma (\cdot ) \) is the Gamma function, and, for convenience, we shall simply use \( I_{0+}^\alpha \), \( I_{T-}^\alpha \), \( D_{0+}^\alpha \) and \( D_{T-}^\alpha \), without indicating the underlying Banach space X. Each \( v \in L^1(\Omega _T) \) also regarded as an element of \( L^1(0,T;X) \) with \( X=L^1(\Omega ) \), and thus \( D_{0+}^\alpha v \) and \( D_{T-}^\alpha v \) mean \( D_{0+}^{\alpha ,X}v \) and \( D_{T-}^{\alpha ,X}v \), respectively, for all \( 0< \alpha < \infty \).
3 Algorithm Definition
Let \( \mathcal K_h \) be a triangulation of \( \Omega \) consisting of d-simplexes, and let h be the maximum diameter of these simplexes in \( \mathcal K_h \). Define
where m is a positive integer and \( P_m(K) \) is the set of all polynomials defined on K of degree \( \leqslant m \). For \( j \in \mathbb N \), define
where \( P_j[0,T] \) is the set of all polynomials defined on [0, T] of degree \( \leqslant j \). Moreover, we introduce a projection operator \( R_h: H_0^1(\Omega ) \rightarrow \mathring{V}_h \) by
Here and in the rest of this paper, I denotes the identity operator.
Now, let us describe a time-spectral algorithm for problem (1) as follows: seek \( U \in P_M[0,T] \otimes \mathring{V}_h \) with \( U(0) = R_h u_0 \) such that
for all \( V \in P_{M-1}[0,T] \otimes \mathring{V}_h \), where \( M \geqslant 2 \) is an integer, \( \gamma _0 := (\gamma -1)/2 \), and \( u_{h,1} \) is the \( L^2(\Omega ) \)-projection of \( u_1 \) onto \( V_h \).
Remark 3.1
In “Appendix A” we define the weak solution of problem (1). The numerical solution obtained by (2) is actually an approximation of the weak solution to problem (1).
Remark 3.2
It is well known that the solution to problem (1) generally has singularity in time, caused by the fractional derivative. However, in view of the basic properties of the operator \( D_{0+}^\gamma \), it is anticipated that we can improve the performance of the above algorithm by enlarging \( P_M[0,T] \) and \( P_{M-1}[0,T] \) by some singular functions, such as \( t^\gamma \) for \( P_M[0,T] \) and correspondingly \( t^{\gamma -1} \) for \( P_{M-1}[0,T] \).
The remainder of this section is devoted to the construction of the bases of \( P_M[0,T] \) and \( P_{M-1}[0,T] \), which is crucial in the implementation of the proposed algorithm. To this purpose, let us first introduce the well-known Jacobi polynomials; see [1, 16] for more details. Given \( -1< \alpha , \beta < \infty \), the Jacobi polynomials \( \{ J_n^{(\alpha ,\beta )}:\ n \in \mathbb N \} \) are defined by
where
for all \( -1< r,s < +\infty \). They form a complete orthogonal basis of \( L_{w^{\alpha ,\beta }}^2(-1,1) \), the weighted \( L^2 \) space with weight function \( w^{\alpha ,\beta } \).
Then we construct a basis \( \{p_i\}_{i=0}^M \) of \( P_M[0,T] \) and a basis \( \{q_j\}_{j=0}^{M-1} \) of \( P_{M-1}[0,T] \), respectively, by
and
By [3, Lemma 2.5] a straightforward computing yields
for all \( 0 \leqslant i \leqslant M \) and \( 0 \leqslant j < M \). Above \( \zeta _{ij}(t) \) and \( \varsigma _{ij}(t) \) are given respectively by
where
Then \( \int _0^T D_{0+}^{\gamma _0} p_i' D_{T-}^{\gamma _0} q_j \, \mathrm {d}t \) is evaluated numerically by a suitable Jacobi-Gauss quadrature rule.
4 Main Results
Let us first introduce the following conventions: u and U are the solutions to problem (1) and (2), respectively; unless otherwise specified, C is a generic positive constant that is independent of any function and is bounded as \( M \rightarrow \infty \); \( a \lesssim b \) means that there exists a positive constant c, depending only on \( \gamma \), T, \( \Omega \), m or the shape regular parameter of \( \mathcal K_h \), such that \( a \leqslant c b \); the symbol \( a \sim b \) means \( a \lesssim b \lesssim a \). The above shape regular parameter of \( \mathcal K_h \) means
where \( h_K \) is the diameter of K, and \( \rho _K \) is the diameter of the circle (\( d=2 \)) or ball (\( d =3 \)) inscribed in K.
Then we introduce an interpolation operator. Let X be a separable Hilbert space and let \( P_M[0,T;X] \) be the set of all X-valued polynomials defined on [0, T] of degree \( \leqslant M \). Define the interpolation operator
as follows: for each \( v \in H^{1+\gamma _0}(0,T;X) \), the interpolant \( Q_M^X v \) fulfills
For convenience, we shall use \( Q_M \) instead of \( Q_M^X \) when no confusion will arise.
Remark 4.1
Let \( \{e_k: k \in \mathbb N \} \) be an orthonormal basis of X. For any \( v \in H^{\gamma _0}(0,T;X) \), the definition of \( H^{\gamma _0}(0,T;X) \) implies that
and hence, as Lemma 5.4 (in the next section) indicates
it is evident that
Remark 4.2
Since \( Q_M^\mathbb R \) is well-defined by Lemma 5.4, \( Q_M^X \) is evidently also well-defined and
Furthermore, we can redefine \( Q_M^X \) equivalently as follows: for each \( v \in H^{1+\gamma _0}(0,T;X) \), the interpolant \( Q_M^X v \) fulfills
Finally, we are ready to state the main results of this paper as follows.
Theorem 4.1
Problem (2) has a unique solution U. Moreover,
Theorem 4.2
If \( u \in H^2\left( 0,T; H_0^1(\Omega ) \cap H^2(\Omega ) \right) \), then
where
Corollary 4.1
If
then
where \( r \in \mathbb N \) and
5 Proofs
5.1 Preliminaries
Lemma 5.1
If \( v \in H_0^1(\Omega ) \cap H^{m+1}(\Omega ) \), then
Lemma 5.2
If \( v \in H^\alpha (0,T) \) with \( \alpha > \gamma _0 \), then
If \( v \in H^2(0,T) \) such that \( v'' \in B^j(0,T) \) with \( j \in \mathbb N \), then
Lemma 5.3
The following properties hold:
-
If \( 0< \alpha , \beta < \infty \), then
$$\begin{aligned} I_{0+}^\alpha I_{0+}^\beta = I_{0+}^{\alpha +\beta }, \quad I_{T-}^\alpha I_{T-}^\beta = I_{T-}^{\alpha +\beta }. \end{aligned}$$ -
If \( 0< \alpha< \beta < \infty \), then
$$\begin{aligned} D_{0+}^\beta I_{0+}^\alpha = D_{0+}^{\beta -\alpha }, \quad D_{T-}^\beta I_{T-}^\alpha = D_{T-}^{\beta -\alpha }. \end{aligned}$$ -
If \( 0< \alpha < \infty \), then
$$\begin{aligned} \left\| I_{0+}^\alpha v \right\| _{L^2(0,T)} \leqslant C \left\| v \right\| _{L^2(0,T)}, \quad \left\| I_{T-}^\alpha v \right\| _{L^2(0,T)} \leqslant C \left\| v \right\| _{L^2(0,T)}, \end{aligned}$$where C is a positive constant that only depends on \( \alpha \) and T.
-
If \( 0< \alpha < \infty \) and \( u,v \in L^2(0,T) \), then
$$\begin{aligned} ( I_{0+}^\alpha u, v )_{L^2(0,T)} = ( u, I_{T-}^\alpha v )_{L^2(0,T)}. \end{aligned}$$
Lemma 5.4
We have the following properties.
-
If \( v \in H^{\alpha }(0,T) \) with \(0<\alpha <1/2\), then
$$\begin{aligned} \left\| v \right\| _{H^{\alpha }(0,T)} \sim \left\| {D_{0+}^{\alpha }}v \right\| _{L^2(0,T)} \sim \left\| {D_{T-}^{\alpha }} v \right\| _{L^2(0,T)} \sim \sqrt{ \left( {D_{0+}^{\alpha }}v, {D_{T-}^{\alpha }} v \right) _{L^2(0,T)} }. \end{aligned}$$ -
If \( v,w \in H^{\alpha }(0,T) \) with \(0<\alpha <1/2\), then
$$\begin{aligned} \left( {D_{0+}^{\alpha }}v, {D_{T-}^{\alpha }} w \right) _{L^2(0,T)}\lesssim \left\| v \right\| _{H^{\alpha }(0,T)} \left\| w \right\| _{H^{\alpha }(0,T)}. \end{aligned}$$
Above, the implicit constants are only depend on \(\alpha \) and T.
Lemma 5.5
If \( v \in H^2(0,T) \) and \( w \in H^1(0,T) \), then
Lemma 5.6
Let X and Y be two separable Hilbert spaces, and let \( A: X \rightarrow Y \) be a bounded linear operator. If \( v \in H^{1+\gamma _0}(0,T; X) \), then
Lemma 5.1 is standard (see [4]), and Lemma 5.3 follows from [16, Theorems 3.35–3.37] and the basic properties of the interpolation spaces. The proof of Lemma 5.3 is included in [13, 15], and for convenience this lemma will be used implicitly in the forthcoming analysis. Lemma 5.4 is a direct consequence of [6, Lemma 2.4, Theorem 2.13 and Corollary 2.15], and Lemma 5.5 follows from [10, Lemma 2.6]. Finally, by Lemma 5.4 and the standard properties of the interpolation spaces and the Bochner integrals, a rigorous proof of Lemma 5.6 is tedious but straightforward, and so it is omitted here.
Lemma 5.7
If \( v \in L^2(0,T) \), then
Moreover, if \( v \in H^{\gamma _0}(0,T) \), then
Lemma 5.8
If \( v \in H^2(0,T) \) and \( w \in H^{\gamma _0}(0,T) \), then
Lemma 5.9
If \( v \in H^2(0,T) \) and \( v'' \in B^j(0,T) \) with \( j \in \mathbb N \), then
Proof of Lemma 5.7
Define
where v is extended to \( \mathbb R \backslash (0,T) \) by zero. Since \( 0< \gamma _0 < 0.5 \), a routine calculation yields \( w \in L^2(\mathbb R) \), and then [15, Theorem 7.1] implies
where \( \mathcal F: L^2(\mathbb R) \rightarrow L^2(\mathbb R) \) is the Fourier transform operator, and \( \mathrm {i} \) is the imaginary unit. Therefore, the well-known Plancherel Theorem yields
and hence
Furthermore, if \( v \in H_0^1(0,T) \) then
by the evident equality \( ( I_{T-}^{\gamma _0} v )' = I_{T-}^{\gamma _0} v' \). Consequently, since \( H_0^{\gamma _0}(0,T) \) coincides with \( H^{\gamma _0}(0,T) \) with equivalent norms, applying [18, Lemma 22.3] gives
namely estimate (8). Analogously, we can obtain (9) and hence conclude the proof of the lemma. \(\square \)
Proof of Lemma 5.8
Let \( g:= (I-Q_M)v \). Since a straightforward calculation yields
the fact \( \gamma _0 < 0.5 \) indicates that \( I_{0+}^{1-\gamma _0}g' \in H^1(0,T) \) and \( (I_{0+}^{1-\gamma _0}g')(0) = 0 \). Then using integration by parts gives
Hence, as the definition of \( Q_M \) implies \( g(0) = 0 \), we obtain
which, combined with the evident equality
yields
Therefore, Lemma 5.4, the definition of \( Q_M \) and the Cauchy–Schwarz inequality imply
Clearly, to prove (10), by Lemma 5.2 it suffices to show
Therefore, since
using Lemma 5.7 completes the proof of Lemma 5.8. \(\square \)
Proof of Lemma 5.9
Let us first consider (11). For each \( p \in P_{M-1}[0,T] \), by Lemma 5.4, the definition of \( Q_M \) and the Cauchy–Schwarz inequality, we obtain
It follows that
and so
Therefore, as the fact \( (v-Q_Mv)(0) = 0 \) implies
Next let us consider (12, 13). Proceeding as in the proof of Lemma 5.8 gives
which proves (12) by (11). Then, combining (11,12) and applying [18, Lemma 22.3] yield
so that (13) follows from (12) and the Gagliardo–Nirenberg interpolation inequality, namely,
This concludes the proof of Lemma 5.9. \(\square \)
Remark 5.1
Assume that \( P_M[0,T] \) and \( P_{M-1}[0,T] \) are respectively replaced by
where \( w(t) := T-t,\ 0< t < T \). For each \( v \in H^{1+\gamma _0}(0,T) \), the definition of \( Q_M \) implies
and then, as in the previous remark, a straightforward computing yields
Correspondingly, we can improve Corollary 4.1 by
5.2 Proofs of Theorems 4.1 and 4.2 and Corollary 4.1
Proof of Theorem 4.1
Since (3) contains the unique existence of U, it suffices to prove the former. Observe first that integration by parts yields
and that Lemma 5.4 implies
Moreover, the fact that \( u_{h,1} \) is the \( L^2(\Omega )\)-projection of \( u_1 \) onto \( V_h \) gives
Consequently, by the Cauchy–Schwarz inequality and the Young’s inequality with \( \epsilon \), inserting \( V := U' \) into (2) yields
which, combined with the estimate
indicates
As the definition of \( R_h \) and the fact \( U(0) = R_hu_0 \) imply
this proves (3) and thus concludes the proof of Theorem 4.1. \(\square \)
Proof of Theorem 4.2
Set \( \rho := (I-Q_MR_h)u \) and \( \theta := U - Q_MR_hu \). By Lemma 5.5 and integration by parts, using (1) gives
which, together with (2), yields
where
Moreover, the fact \( \theta (0) = 0 \) gives
by integration by parts, and Lemma 5.4 implies
Therefore, it follows
Let us first estimate \( \mathbb I_1 \). Since \( R_h: H_0^1(\Omega ) \rightarrow \mathring{V}_h \) and \( -\Delta : H^2(\Omega ) \rightarrow L^2(\Omega ) \) are two bounded linear operators, Lemma 5.6 implies
so that, by integration by parts and the definition of \( R_h \), a straightforward calculation gives
Therefore, Lemma 5.8 leads to
Next let us estimate \( \mathbb I_2 \) and \( \mathbb I_3 \). The definition of \( Q_M \) gives
so that the Cauchy–Schwarz inequality and Lemma 5.4 indicate
By the evident estimate
the Cauchy–Schwarz inequality and Lemma 5.4 also yield
Finally, by the Young’s inequality with \( \epsilon \), combining (14), (15), (16), (17) gives
Since \( \theta (0) = 0 \) implies
it follows
As (4), (5) are evident from the above estimate, this concludes the proof of Theorem 4.2.\(\square \)
Proof of Corollary 4.1
It suffices to prove \( \eta _i \lesssim \xi _i \) for all \( 1 \leqslant i \leqslant 5 \), where \( \{ \eta _i \}_{i=1}^5 \) are defined in Theorem 4.2. Observing that \( \eta _1 \lesssim \xi _1 \) is a standard result [4], that \( \eta _2 \lesssim \xi _2 \) follows from Lemma 5.9, and that \( \eta _3 \lesssim \xi _3 \) follows from Lemma 5.1, we only need to prove \( \eta _4 \lesssim \xi _4 \) and \( \eta _5 \lesssim \xi _5 \).
Let us first consider \( \eta _4 \lesssim \xi _4 \). By Lemma 5.4, the definition of \( Q_M \) implies
so that Lemma 5.1 and [18, Lemma 22.3] yield
Moreover, Lemma 5.9 gives
Consequently, \( \eta _4 \lesssim \xi _4 \) is a direct consequence of the inequality
Then let us consider \( \eta _5 \lesssim \xi _5 \). Since Lemma 5.6 gives \( R_hQ_M u = Q_M R_h u \), the definition of \( R_h \) yields
and hence Lemma 5.9 indicates
Therefore, as Lemma 5.1 implies
the estimate \( \eta _5 \lesssim \xi _5 \) follows from the inequality
This concludes the proof of Corollary 4.1. \(\square \)
6 Numerical Experiments
This section performs some numerical experiments to demonstrate the high order accuracy of the proposed algorithm in two dimensional case. Throughout this section we set \(\gamma := 1.5 \), \( T := 1 \) and \( \Omega := (0,1)^2 \).
Example 1
In this example the solution to problem (1) is
where \( x = (x_1,x_2) \). Let us first consider the spatial discretization errors of the proposed algorithm, and, to this end, we set \( M := 20 \) to ensure that the temporal discretization errors are negligible compared with the former. The corresponding numerical results, presented in Table 1, illustrate that the convergence orders of
are m and \( m + 1 \) respectively, which agrees well with Corollary 4.1. Then let us consider the temporal discretization errors and hence set \( m := 4 \) and \( h := 1/32 \) to ensure that the temporal discretization error is dominant. We plot the log-linear relationship between the errors and the polynomial degree M in Fig. 1. As indicated by Corollary 4.1, these numerical results demonstrate that the errors reduce exponentially as M increases.
Example 2
This example adopts
as the solution to problem (1), where \( \beta \) is a positive constant. Here we only consider the temporal discretization errors and hence set \( m := 6 \) and \( h := 2^{-4} \) to ensure that the temporal discretization errors are dominant. The corresponding numerical results are presented in Tables 2 and 3. Observing that
by Corollary 4.1 and [18, Lemma 22.3] we have
where \( C(\epsilon ) \) is a constant that depends on \( \epsilon \). Evidently, for the convergence order of \( \left\| u-U \right\| _{ H^{1+\gamma _0}( 0,T;L^2(\Omega ) ) } \), the numerical results are in agreement with Corollary 4.1. However, in this case, \( \left\| (u-U)(T) \right\| _{H_0^1(\Omega )} \) reduces significantly faster than that predicted by Corollary 4.1.
Example 3
This example investigates the temporal accuracy of the algorithm in the case that the underlying solution has singularity at \( t = 0 \). The solution to problem (1) is
where \( \beta = 1.2 \), 1.5 or 1.8. We set \( m := 4 \) and \( h := 2^{-5} \), and display the corresponding numerical results in Tables 4, 5 and 6. These numerical results illustrate that both \( \left\| (u-U)(T) \right\| _{H_0^1(\Omega )} \) and \( \left\| u-U \right\| _{H^{1+\gamma _0}(0,T;L^2(\Omega ))} \) converge significantly faster than that implied by Corollary 4.1.
7 Conclusions
In this paper, a high accuracy algorithm for time fractional wave problems is developed, which adopts a spectral method to approximate the fractional derivative and uses a finite element method in the spatial discretization. Stability and a priori error estimates of this algorithm are derived, and numerical experiments are also performed to verify its high accuracy.
In future work, we shall consider the following issues. Firstly, the optimal error estimates of \( \left\| (u-U)(T) \right\| _{L^\infty (\Omega )} \) and \( \left\| (u-U)(T) \right\| _{L^2(\Omega )} \) are not established. Secondly, it is worth applying the idea of approximating fractional differential operators of order \( \gamma \) (\( 1< \gamma < 2\)) by spectral methods to other fractional differential equations, such as nonlinear fractional ordinary differential equations and nonlinear time fractional wave equations.
References
Canuto, C., Hussaini, M.Y., Quarteroni, A., Zang, T.A.: Spectral Methods: Fundamentals in Single Domains. Springer, Berlin (2006)
Chen, C., Liu, F., Turner, I., Anh, V.: A Fourier method for the fractional diffusion equation describing sub-diffusion. J. Comput. Phys. 227(2), 886–897 (2007)
Chen, S., Shen, J., Wang, L.: Generalized Jacobi functions and their applications to fractional differential equations. Math. Comput. 85(300), 1603–1638 (2016)
Ciarlet, P.: The Finite Element Method for Elliptic Problems. Society for Industrial and Applied Mathematics, Philadelphia (2002)
Deng, W.: Finite element method for the space and time fractional Fokker–Planck equation. SIAM J. Numer. Anal. 47(1), 204–226 (2009)
Ervin, V.J., Roop, J.P.: Variational formulation for the stationary fractional advection dispersion equation. Numer. Methods Partial Differ. Equ. 22(3), 558–576 (2006)
Gao, G., Sun, 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)
Huang, J., Tang, Y., Vzquez, L., Yang, J.: Two finite difference schemes for time fractional diffusion-wave equation. Numer. Algorithms 64(4), 707–720 (2013)
Li, B., Luo, H., Xie, X.: Analysis of a time-stepping scheme for time fractional diffusion problems with nonsmooth data. Submitted. arXiv:1804.10552 (2018)
Li, X., Xu, C.: A space–time spectral method for the time fractional diffusion equation. SIAM J. Numer. Anal. 47(3), 2108–2131 (2009)
Lin, Y., Xu, C.: Finite difference/spectral approximations for the time-fractional diffusion equation. J. Comput. Phys. 225(2), 1533–1552 (2007)
Meerschaert, M.M., Tadjeran, C.: Finite difference approximations for fractional advection-dispersion flow equations. J. Comput. Appl. Math. 172, 65–77 (2004)
Podlubny, I.: Fractional Eifferential Equations. Academic Press, San Diego (1998)
Ren, J., Long, X., Mao, S., Zhang, J.: Superconvergence of finite element approximations for the fractional diffusion-wave equation. J. Sci. Comput. 72(3), 917–935 (2017)
Samko, S.G., Kilbas, A.A., Marichev, O.I.: Fractional Integrals and Derivatives: Theory and Applications. Gordon and Breach Science Publishers, Philadelphia (1993)
Shen, J., Tang, T., Wang, L.: Spectral Methods: Algorithms. Analysis and Applications. Springer, Berlin (2011)
Sun, Z., Wu, X.: A fully discrete difference scheme for a diffusion-wave system. Appl. Numer. Math. 56(2), 193–209 (2006)
Tartar, L.: An Introduction to Sobolev Spaces and Interpolation Spaces. Springer, Berlin (2007)
Tian, W., Zhou, H., Deng, W.: A class of second order difference approximations for solving space fractional diffusion equations. Math. Comput. 84(294), 1703–1727 (2012)
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)
Yang, J., Huang, J., Liang, D., Tang, Y.: Numerical solution of fractional diffusion-wave equation based on fractional multistep method. Appl. Math. Model. 38(14), 3652–3661 (2014)
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)
Yuste, S.B.: Weighted average finite difference methods for fractional diffusion equations. J. Comput. Phys. 216(1), 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(5), 1862–1874 (2005)
Zayernouri, M., Karniadakis, G.E.: Fractional spectral collocation method. SIAM J. Sci. Comput. 36(1), A40–A62 (2014)
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)
Zhang, Y., Sun, Z., Liao, H.: Finite difference methods for the time fractional diffusion equation on non-uniform meshes. J. Comput. Phys. 265, 195–210 (2014)
Zhang, Y., Zhao, X.: Compact alternating direction implicit scheme for the two-dimensional fractional diffusion-wave equation. Siam J. Numer. Anal. 45(50), 1535–1555 (2012)
Zheng, M., Liu, F., Turner, I., Anh, V.: A novel high order space–time spectral method for the time fractional Fokker–Planck equation. Siam J. Sci. Comput. 37(2), A701–A724 (2015)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by National Natural Science Foundation of China (11771312).
Appendix A: Weak Solution
Appendix A: Weak Solution
We call
a weak solution to problem (1) if \( u(0) = u_0 \) and
for all \( v \in H^{(\gamma -1)/2}(0,T; L^2(\Omega )) \cap L^2(0,T; H_0^1(\Omega )) \).
To prove that problem (1) admits a unique weak solution, we first consider the following problem: given \( c_0 \), \( c_1 \in \mathbb R \) and \( g \in L^2(0,T) \), seek \( y \in H^\gamma (0,T) \) such that
where \( \lambda \) is a positive constant such that \( \lambda \geqslant 1 \).
Lemma A.1
Suppose that \(v\in H^{(\gamma +1)/2}(0,T)\) and \(D_{0+}^{\gamma }v\in L^2(0,T)\), then
Proof
Since \(D_{0+}^\gamma v\in L^2(0,T)\), by [9, Lemmas A.4] we conclude that \(I_{0+}^\gamma D_{0+}^\gamma v\in H^{\gamma }(0,T)\) with
A simple calculation yields
which indicates that \(c_0=c_1=0\) by the fact \(v\in H^{(\gamma +1)/2}(0,T)\). Then (20) follows from (21). This completes the proof. \(\square \)
Lemma A.2
Suppose that \(v\in H^{(\gamma +1)/2}(0,T)\) with \(v(0)=0\), then we have the following properties.
-
(a)
It holds that
$$\begin{aligned} \left( D_{0+}^\frac{\gamma +1}{2} v, D_{T-}^\frac{\gamma -1}{2} v' \right) _{L^2(0,T)} \sim \left\| v \right\| _{H^{(\gamma +1)/2}(0,T)}^2. \end{aligned}$$(22) -
(b)
For any \(w\in H^{(\gamma -1)/2}(0,T)\), it holds that
$$\begin{aligned} \left( D_{0+}^\frac{\gamma +1}{2} v, D_{T-}^\frac{\gamma -1}{2} w \right) _{L^2(0,T)}\lesssim \left\| v \right\| _{H^{(\gamma +1)/2}(0,T)} \left\| w \right\| _{H^{(\gamma -1)/2}(0,T)}. \end{aligned}$$(23) -
(c)
For any \(\varphi \in C_0^{\infty }(0,T)\), it holds that
$$\begin{aligned} \left\langle {D_{0+}^\gamma v, \varphi } \right\rangle = \left( D_{0+}^\frac{\gamma +1}{2} v, D_{T-}^\frac{\gamma -1}{2} \varphi \right) _{L^2(0,T)}. \end{aligned}$$(24)
Proof
Let us first prove (a). Since \(v\in H^{(\gamma +1)/2}(0,T)\) and \(v(0)=0\), we have
In addition, a straightforward calculation gives
So (22) follows from (25), (26) and Lemma 5.4.
Then let us prove (b). In view of (25), (26), using Lemma 5.4 yields (23).
Finally we prove (c). Observe that (26) implies \(I_{0+}^{\frac{3-\gamma }{2}}v'\in H^1(0,T)\), and a simple computation implies
Thus,
Using integration by parts gives
for all \(\varphi \in C_0^\infty (0,T)\). This shows (24) and completes the proof of this lemma. \(\square \)
Lemma A.3
Problem (19) has a unique solution \( y \in H^\gamma (0,T) \), and y satisfies that \( y(0) = c_0 \) and
for all \( z \in H^\frac{\gamma -1}{2} (0,T) \). Moreover,
Proof
Set
for all \( z \in H^\frac{\gamma -1}{2}(0,T) \). Since Lemma 5.4 implies \( b \in H^\frac{1-\gamma }{2}(0,T) \), Lemma A.2 and the well-known Lax-Milgram Theorem guarantee the unique existence of \( w \in H^\frac{\gamma +1}{2}(0,T) \) with \( w(0) = 0 \) such that
for all \( z \in H^\frac{\gamma -1}{2}(0,T) \). Using Lemma A.2 gives
for all \( \varphi \in C_0^\infty (0,T) \), so that from (29) it follows that
Putting \( y := w + c_0 \) gives
and then by Lemma A.1 and A.2 it is evident that y is the unique \( H^\gamma (0,T) \)-solution to problem (19). Also, \( y(0) = c_0 \) is obvious, and (27) follows directly from (29).
Now let us prove (28). Firstly, substituting \( z := y' \) into (27) and using integration by parts yield
Therefore, Lemma A.2, the Cauchy–Schwarz inequality and the Young’s inequality with \( \epsilon \) imply
and so
Secondly, substituting \( z := y \) into (27) yields
so that using Lemmas 5.4 and A.2, the Cauchy–Schwarz inequality and the Young’s inequality with \( \epsilon \) gives
which, together with (30), yields
Finally, collecting (30), (31) proves (28), and thus proves this lemma. \(\square \)
Finally, by the above lemma and the Galerkin method, we readily conclude that problem (1) admits a unique weak solution indeed. We summarize the result as follows.
Theorem A.1
The weak solution u of problem (1) satisfies that \( u(0) = u_0 \) and that
for all \( v \in H^\frac{\gamma -1}{2} (0,T;H_0^1(\Omega )) \). Furthermore, we have
Rights and permissions
About this article
Cite this article
Li, B., Luo, H. & Xie, X. A Time-Spectral Algorithm for Fractional Wave Problems. J Sci Comput 77, 1164–1184 (2018). https://doi.org/10.1007/s10915-018-0743-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10915-018-0743-5