Abstract
SUSHI (Scheme Using Stabilization and Hybrid Interfaces) is a finite volume method has been developed at the first time to approximate heterogeneous and anisotropic diffusion problems. It has been applied later to approximate several types of partial differential equations. The main feature of SUSHI is that the control volumes can only be assumed to be polyhedral. Further, a consistent and stable Discrete Gradient is developed.
In this note, we establish a second order time accurate implicit scheme for the TFDWE (Time Fractional Diffusion-Wave Equation). The space discretization is based on the use of SUSHI whereas the time discretization is performed using a uniform mesh. The scheme is based on the use of an equivalent system of two low order equations. We sketch the proof of the convergence of the stated scheme. The convergence is unconditional. This work is an improvement of [3] in which a first order scheme, whose convergence is conditional, is established.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
Keywords
- Finite volume
- Time Fractional Diffusion Wave Equation
- System
- Unconditional convergence
- Second order time accurate
1 Problem to Be Solved and Aim of This Paper
Let us consider the following time-fractional equation:
where \(\varOmega \) is an open bounded connected subset of \({\mathrm{I \! R}}^d\) (\(d \in {\mathrm{I \! N}}^\star \)), \(T>0\), and f is a given function. The operator \(\displaystyle \partial _t^\alpha \) denotes the Caputo derivative of order \(\alpha \) whose general formula is given by, for \(m-1<\rho <m\) with \(m\in {\mathrm{I \! N}}^\star \)
We are concerned with the case of TFDWE in which \(\alpha \), which appears in the first term on the left hand side of (1), is satisfying
In this case the operator \(\displaystyle \partial _t^\alpha \) is given by
Initial conditions are given by, for all \({{{\varvec{x}}}}\in \varOmega \):
where \(u^0\) and \(u^1\) are given functions defined on \(\varOmega \).
Homogeneous Dirichlet boundary conditions are given by
The TFDWE arises in several applications and several numerical methods have been devoted to approximate such equation, see [7, 8] and references therein. In this note, we establish a second order time accurate implicit finite volume scheme using SUSHI [5] for TFDWE in any space dimension along with a brief study for its convergence analysis in several discrete norms. The scheme is based on an equivalent system of low order equations for (1). This work improves [3] which deal with a first order scheme with a conditional convergence.
2 Definition of a Consistent and Stable Discrete Gradient
We consider as discretization in space the mesh of [5]. In brief, such mesh is defined as the triplet \(\mathcal {D}= (\mathcal {M}, {\mathcal {E}},\mathcal {P})\) where \(\mathcal {M}\) is the set of cells, \({\mathcal {E}}\) is the set of edges, and \(\mathcal {P}\) is a set of points \({{{\varvec{x}}}}_K\) in each cell K. We assume that, for all \(K \in \mathcal {M}\), there exists a subset \({\mathcal {E}}_K\) of \({\mathcal {E}}\) such that \(\displaystyle \partial K =\cup _{\sigma \in {\mathcal {E}}_K} \overline{\sigma }\). For any \(\sigma \in {\mathcal {E}}\), we denote by \(\displaystyle \mathcal {M}_\sigma =\{K, \sigma \in {\mathcal {E}}_K\}\). We then assume that, for any \(\sigma \in {\mathcal {E}}\), either \(\mathcal {M}_\sigma \) has exactly one element and then \(\sigma \subset \partial \varOmega \) (the set of these interfaces, called boundary interfaces, denoted by \({{\mathcal {E}}}_\mathrm{ext}\)) or \(\mathcal {M}_\sigma \) has exactly two elements (the set of these interfaces, called interior interfaces, denoted by \({{\mathcal {E}}}_\mathrm{int}\)). For all \(\sigma \in {\mathcal {E}}\), we denote by \({{{\varvec{x}}}}_\sigma \) the barycentre of \(\sigma \). For all \(K \in \mathcal {M}\) and \(\sigma \in {\mathcal {E}}\), we denote by \({\mathbf{n }}_{K,\sigma }\) the unit vector normal to \(\sigma \) outward to K. Denoting by \(d_{K,\sigma }\) the Euclidean distance between \({{{\varvec{x}}}}_K\) and the hyperplane including \(\sigma \), one assumes that \(d_{K,\sigma } > 0\). We then denote by \(\mathcal {D}_{K,\sigma }\) the cone with vertex \({{{\varvec{x}}}}_K\) and basis \(\sigma \). Also, \(h_K\) is used to denote the diameter of K. For more details on the mesh, we refer to [5, Definition 2.1, Page 1012].
We define the discrete space \(\mathcal {X}_{\mathcal {D},0}\) as the set of all \(v=\left( \left( v_K\right) _{K\in \mathcal {M}},\,\left( v_\sigma \right) _{\sigma \in {\mathcal {E}}}\right) \), where \(v_K, v_\sigma \in {\mathrm{I \! R}}\) and \(v_\sigma =0\) for all \(\sigma \in {{\mathcal {E}}}_\mathrm{ext}\). Let \(H_\mathcal {M}(\varOmega )\subset L^2(\varOmega )\) be the space of functions which are constant on each control volume K of the mesh \(\mathcal {M}\). For all \(v\in \mathcal {X}_\mathcal {D}\), we denote by \(\Pi _\mathcal {M}v\in H_\mathcal {M}(\varOmega )\) the function defined by \(\Pi _\mathcal {M}v({{{\varvec{x}}}})=v_K\), for a.e. \({{{\varvec{x}}}}\in K\), for all \(K \in \mathcal {M}\). In order to analyze the convergence, we need to consider the size of the discretization \(\mathcal {D}\) defined by \(\displaystyle h_\mathcal {D}=\sup \left\{ \mathrm{{diam}(K)},\,\,K \in \mathcal {M}\right\} \) and the regularity of the mesh given by \(\displaystyle \theta _\mathcal {D}=\max \left( \max _{\sigma \in {{\mathcal {E}}}_\mathrm{int},K,L\in \mathcal {M}}\frac{d_{K,\sigma }}{d_{L,\sigma }},\max _{K\in \mathcal {M},\sigma \in {{\mathcal {E}}}_K}\frac{h_{K}}{d_{K,\sigma }} \right) \).
The formulation of the scheme we want to consider involves the discrete gradient, denoted by \(\nabla _\mathcal {D}\), developed in [5]. The value of \(\nabla _\mathcal {D}u\), where \(u \in \mathcal {X}_{\mathcal {D},0}\), is defined by, for all \(K \in \mathcal {M}\), for a.e. \({{{\varvec{x}}}}\in \mathcal {D}_{K,\sigma }\)
We define now the inner product defined on \(\mathcal {X}_{\mathcal {D},0}\times \mathcal {X}_{\mathcal {D},0}\) and given by
The time discretization is performed with a constant time step \(\displaystyle k=\frac{T}{N+1}\), where \(\displaystyle N \in {\mathrm{I \! N}}^{\star }\), and we shall denote \(\displaystyle t_n=nk\), for \(\displaystyle n \in \llbracket 0,N+1\rrbracket \). We denote by \(\partial ^1\) the discrete first time derivative given by \(\displaystyle \partial ^1 v^{j+1}=\frac{v^{j+1}-v^{j}}{k}\).
Throughout this paper, the letter C stands for a positive constant independent of the parameters of the space and time discretizations.
3 A High Order Approximation for the Caputo Derivative and Its Properties
For the sake of completeness, we recall in this section some results concerning a second order approximation for the time fractional derivative \(\displaystyle \partial _t^\beta \varPhi \) with \(0<\beta <1\) and \(\varPhi \) is smooth, i.e. \(\displaystyle \varPhi \in \mathcal {C}^3[0,T]\), and its properties. This approximation is given by the so-called \(L2-1_\sigma \) formula developed in [1, 6]. Such approximation will help to derive a second order time accurate scheme for the considered problem (1)–(5). To construct this high order approximation for the Caputo derivative, we consider the “fractional mesh points” \(\displaystyle t_{n+\sigma }=(n+\sigma )k\), for \(n\in \llbracket 0,N \rrbracket \), where
Using (2) when \(\rho =\beta \in (0,1)\) and consequently \(m=1\), the value \(\displaystyle \partial _t^\beta \varPhi (t_{n+\sigma })\) is given by
For each \(j\in \llbracket 1,N \rrbracket \), let \(\Pi _{2,j}\varPhi \) be the quadratic interpolation defined on \((t_{j-1},t_j)\) on the points \(t_{j-1},t_{j},t_{j+1}\) of \(\varPhi \). An explicit expansion for \(\Pi _{2,j}\varPhi \) yields:
When approximating the terms of the sum (resp. the last term) using quadratic interpolations (resp. a linear interpolation) in (9) of \(\displaystyle \partial _t^\beta \varPhi (t_{n+\sigma })\), we have to compute the following integrals:
-
1.
First set of integrals:
$$ \int _{t_{j-1}}^{t_{j}}\left( s-t_{j-\frac{1}{2}}\right) (t_{n+\sigma }-s)^{-\beta }ds=\frac{k^{2-\beta }}{1-\alpha }b_{n-j}^\sigma , $$where \(\displaystyle b_{l}^\sigma =\frac{1}{2-\beta }\left( (l+\sigma +1)^{2-\beta }-(l+\sigma )^{2-\beta }\right) -\frac{1}{2}\left( (l+\sigma +1)^{1-\beta }+(l+\sigma )^{1-\beta }\right) \).
-
2.
Second set of integrals:
$$\begin{aligned} \int _{t_{j-1}}^{t_{j}}(t_{n+\sigma }-s)^{-\beta }ds=\frac{k^{1-\beta }}{1-\beta }d_{n+\sigma -j,\beta }, \end{aligned}$$(10)with, for all \(s>0\), \(d_{s,\beta }\) is given by \(d_{s,\beta }= (s+1)^{1-\beta }-s^{1-\beta }\).
-
3.
Third set of integrals:
$$\begin{aligned} \int _{t_n}^{t_{n+\sigma }}(t_{n+\sigma }-s)^{-\beta }ds=\frac{k^{1-\beta }}{1-\beta }\sigma ^{1-\beta }. \end{aligned}$$(11)
We then obtained approximation for the fractional derivative \(\partial _t^\beta \varPhi (t_{n+\sigma })\) using (9)–(11)
This gives, after re-ordering the sum (see [1, (27)-(28), Page 429])
where \(c_{0}^{\sigma ,0}=\sigma ^{1-\beta }\) and for all \(n\ge 1\)
Let us denote
The following lemma summarizes some properties of the approximation given by (12). Some of these results are proved in [1] whereas the other ones can be justified using the explicit form (14).
Lemma 1
(Some results concerning the time discretization, cf. [1, 6]).
Let \(\beta \in (0,1)\) be given and \(\lambda _j^{n+1}\) be defined by (14). Then the following results hold:
1. Properties of the coefficients \(\displaystyle \lambda _j^{n+1}\), cf. [1, Lemma 4, Page 431].
and for all \(j\in \llbracket 0,n \rrbracket \) and \(i\in \llbracket 0,m \rrbracket \) such that \(n-j=m-i\), \(i\not =0\), and \(j\not =0\), we have \(\displaystyle \lambda _j^{n+1}=\lambda _i^{m+1}\).
2. Stability result, cf. [1, Corollary 1, Page 427]. For all \(\displaystyle \left( \beta ^j\right) _{j=0}^{N+1}\in {\mathrm{I \! R}}^{N+2}\), for any \(n\in \llbracket 0,N+1 \rrbracket \):
3. Consistency result, cf. [1, Lemma 2, Page 429]. For any \(\varPhi \in \mathcal {C}^3\left( [0,T]\right) \):
4 Principles of the Scheme
The principles of the scheme we want to present are:
1. First step. Taking the “fractional mesh point” \(t=t_{n+\sigma }\), with \(\sigma \) is given by (8) and \(\beta =\alpha -1\), in (1) and using the general formula (2) implies that (which gives \(\displaystyle \partial _t^\alpha u(t)=\partial _t^{\alpha -1} (u_t)\))
2. Second step. Approximation of \(\displaystyle \partial _t^{\alpha -1} \overline{u}(t_{n+\sigma })\), which is the first term in (19), can be deduced from (18) by choosing \(\beta =\alpha -1\) and \(\varPhi (t)=\overline{u}(t)=u_t\):
where \(\displaystyle \vert {\mathbb T}_1^{n+1}(\overline{u}) \vert \le Ck^{4-\alpha }\left| u^{(4)}\right| _{\mathcal {C}\left( [0,T]\right) }\).
3. Third step. Approximation of the first equation of (19). We have, thanks to a convenient Taylor expansion
where \(\displaystyle \vert {\mathbb T}_2^{n+1}\vert \le \frac{k^2}{2} \Vert u\Vert _{\mathcal {C}^2\left( [0,T]\right) }\). From (19)–(21), we deduce that
where \(\displaystyle \vert {\mathbb T}_3^{n+1}\vert \le Ck^2 \Vert u\Vert _{\mathcal {C}^4\left( [0,T]\right) }\).
4. Fourth step. Approximation of the second equation of (19) when \(n\ge 1\). The derivative \(u_t(t_{n+\sigma })\) is approximated (to get the stability property) by \(\displaystyle \frac{(2\sigma +1)u(t_{n+1})-4\sigma u(t_n)+ (2\sigma -1)u(t_{n-1})}{2k}\). Using a suitable Taylor expansion yields
where \(\displaystyle \vert {\mathbb T}_4^{n+1}\vert \le Ck^{2}\Vert u\Vert _{\mathcal {C}^3([0,T])}\).
The system (19) is used for instance in [8] to establish a finite difference scheme in one space dimension. Such scheme is based on a Crank-Nicolson method.
5 Formulation of a Second Order Time Accurate Finite Volume Scheme and Statement of Its Convergence
After having explained the principles of the finite volume scheme for problem (1)–(5), we are able now to set its definition. We will denote by \(\displaystyle \left( \cdot , \cdot \right) _{L^2(\varOmega )}\) the \(\displaystyle L^2(\varOmega )\)-inner product and by \(v^{n+\sigma }\) the barycentric element given by \(\displaystyle v^{n+\sigma }=\sigma v^{n+1}+(1-\sigma )v^{n}\).
Definition 1
(Definition of a finite volume scheme for (1)–(5)). Let \(\displaystyle \langle \cdot ,\cdot \rangle \) be the inner product given by (7):
1. Discretization of initial conditions (4): Find \(u^0_\mathcal {D}, \overline{u}^0_{\mathcal {D}} \in \mathcal {X}_{\mathcal {D},0}\) such that, for all \(v\in \mathcal {X}_{\mathcal {D},0}\)
2. Discretization of Eq. (22): For any \(n\in \llbracket 0,N \rrbracket \), find \(u^{n+1}_\mathcal {D},\overline{u}^{n+1}_\mathcal {D}\in \mathcal {X}_{\mathcal {D},0}\) such that
3. Discretization of the second equation of (19):
We now state one of the main results of this note, that is the convergence of scheme (24)–(26).
Theorem 1
(Error estimates for scheme (24)–(26)). Let \(\varOmega \) be a polyhedral open bounded subset of \({\mathrm{I \! R}}^d\), where \(d \in {\mathrm{I \! N}}\setminus \{0\}\). Assume that the solution of (1)–(5) satisfies \( u \in \mathcal {C}^4([0,T];\mathcal {C}^2(\overline{\varOmega }))\) and \(\theta _{\mathcal {D}}\) satisfies \(\theta \ge \theta _{\mathcal {D}}\). Let \(\nabla _\mathcal {D}\) be the discrete gradient defined as in (6) and \(\displaystyle \langle \cdot ,\cdot \rangle \) be the inner product given by (7). Let \( k=\frac{T}{N+1}\), with \(N \in {\mathrm{I \! N}}^\star \), and denote by \(t_n=nk\), for \(n \in \llbracket 0,N+1 \rrbracket \). Let \(\sigma \) be defined by (8) with \(\beta =\alpha -1\). For any \(n\in \llbracket 0,N \rrbracket \), for any \(j\in \llbracket 0,n \rrbracket \), we define the coefficients \(\lambda _j^{n+1}\) as in (14).
Then there exists a unique solution \(\left( \overline{u}_\mathcal {D}^n\right) _{n=0}^{N+1}, \left( u_\mathcal {D}^n\right) _{n=0}^{N+1} \in \mathcal {X}_{\mathcal {D},0}^{N+2}\) for scheme (24)–(26) and the following error estimates in \(L^\infty (H^1)\) and \(H^1(L^2)\) discrete semi-norms hold:
The proof of Theorem 1 is based on the following new a priori estimate result:
Theorem 2 (A priori estimate for the discrete problem)
Under the same hypotheses of Theorem 1, assume that there exists \(\displaystyle \left( \overline{\eta }^n\right) _{n=0}^{N+1}, \left( \eta ^n\right) _{n=0}^{N+1}\in \left( \mathcal {X}_{\mathcal {D},0}\right) ^{N+2}\) such that \(\eta _\mathcal {D}^0=\overline{\eta }^0=0\) and for all \(n\in \llbracket 0,N \rrbracket \)
where \(\mathcal {S}^{n+1} \in L^2(\varOmega )\), for all \(n\in \llbracket 0,N \rrbracket \). Then, the following estimate holds:
where
An Overview on the Proof of Theorem 2: In addition to Lemma 1, the proof of Theorem 2 is based on the following inequality:
where
In addition to this \(\displaystyle \mathbb {E}^{n+1}\ge \frac{1}{2\sigma }\Vert \nabla _\mathcal {D}\eta ^{n+1}_\mathcal {D}\Vert _{L^2(\varOmega )^d}^2\). However, Theorem 2 demands a rather longer proof. We will detail this in a future paper. \(\square \)
Sketch of the proof of Theorem 1
The uniqueness for schemes (24) stems from the fact that \(\Vert \nabla _\mathcal {D}\cdot \Vert _{L^2(\varOmega )^d}\) is a norm on \(\mathcal {X}_{\mathcal {D},0}\). This uniqueness implies the existence since the matrix involved is square. The uniqueness for scheme (25) with (26) can be justified using a priori estimate (29). This uniqueness implies the existence since the matrix involved in (25) is square. To prove estimate (27), we compare (24)–(26) with the following auxiliary schemes: For any \(n\in \llbracket 0,N+1 \rrbracket \), find \(\varXi _\mathcal {D}^n, \varUpsilon _\mathcal {D}^n \in \mathcal {X}_{\mathcal {D},0}\) such that
Taking \(n=0\) in (32), using the fact that \(u(0)=u^0\) and \(u_t(0)=u^1\) (subject of (4)), and comparing with scheme (24), we get \(\displaystyle \overline{\eta }^0_\mathcal {D}=\eta ^0_\mathcal {D}=0\), where, for all \(n\in \llbracket \,0,N+1 \rrbracket \), \(\overline{\eta }^n_\mathcal {D}, \eta ^n_\mathcal {D}\in \mathcal {X}_{\mathcal {D},0}\) are given by \(\displaystyle \eta _\mathcal {D}^n=u^{n}_\mathcal {D}-\varXi ^n_\mathcal {D}\) and \(\displaystyle \overline{\eta }_\mathcal {D}^n=\overline{u}^{n}_\mathcal {D}-\varUpsilon ^n_\mathcal {D}\).
First step: Comparison between \((u,u_t)\) and \((\varXi _\mathcal {D}^n, \varUpsilon _\mathcal {D}^n)\). We have (see [4, 5])
and
Second step: Comparison between \((\varXi _\mathcal {D}^n, \varUpsilon _\mathcal {D}^n)\) and \((u_\mathcal {D}^n,\overline{u}_\mathcal {D}^n)\). From (25), (22), and (32), we deduce that
where \(\displaystyle \mathcal {S}^{n+1}=\sum _{j=0}^nk\lambda _j^{n+1}\partial ^1 \left( u_t(t_{j+1})-\Pi _\mathcal {M}\varUpsilon ^{j+1}_\mathcal {D}\right) -{\mathbb T}_3^{n+1}\). Using the a priori estimate (29) yields
where
Using the triangle inequality, (16), and (34) yields (recall that \({\mathbb T}_3^{n+1}\) is of order two, see (22)) \(\displaystyle \mathcal {S}\le C(h_\mathcal {D}+k^2)\Vert u\Vert _{\mathcal {C}^4(0,T;\,\mathcal {C}^2(\overline{\varOmega }))}\). Using (26) implies that \(\displaystyle \overline{\eta }^\frac{1}{2}_\mathcal {D}-\partial ^1 \eta ^{1}_\mathcal {D}=-\varUpsilon ^\frac{1}{2}_\mathcal {D}+\partial ^1 \varXi ^{1}_\mathcal {D}\). On the other hand, using (32) implies that
\(\displaystyle \left( \nabla _\mathcal {D}\left( \partial ^1 \varXi ^{1}_\mathcal {D}-\varUpsilon ^\frac{1}{2}_\mathcal {D}\right) ,\nabla _\mathcal {D}v\right) _{L^2(\varOmega )^d}=-\left( \varDelta \left( \partial ^1 u(t_1)-u_t^\frac{1}{2}\right) ,\Pi _\mathcal {M}v\right) _{L^2(\varOmega )}\). By taking \(v=\partial ^1 \varXi ^{1}_\mathcal {D}-\varUpsilon ^\frac{1}{2}_\mathcal {D}\) in this equation and using the Cauchy Schwarz inequality and the Poincaré inequality [5, Lemma 5.4] imply that \(\displaystyle \left\| \nabla _\mathcal {D}\left( \overline{\eta }^\frac{1}{2}_\mathcal {D}-\partial ^1 \eta ^{1}_\mathcal {D}\right) \right\| _{L^2(\varOmega )^d}\le Ck^2\Vert u\Vert _{\mathcal {C}^3(0,T;\,\mathcal {C}^2(\overline{\varOmega }))}\). In the same manner, we justify that the first term in (37) is bounded above by \(Ck^2\Vert u\Vert _{\mathcal {C}^3(0,T;\,\mathcal {C}^2(\overline{\varOmega }))}\). These estimates for the terms of (37) and estimate (36) imply that \(\displaystyle \max _{n=0}^{N+1}\Vert \nabla _\mathcal {D}\eta ^{n}_\mathcal {D}\Vert _{L^2(\varOmega )^d}\) and \(\displaystyle \left( \sum _{n=0}^{N+1}k\Vert \Pi _\mathcal {M}\overline{\eta }^{n}_\mathcal {D}\Vert _{L^2(\varOmega )}^2\right) ^\frac{1}{2}\) are bounded above by \(C(h_\mathcal {D}+k^2)\Vert u\Vert _{\mathcal {C}^4(0,T;\,\mathcal {C}^2(\overline{\varOmega }))}\). This with the triangle inequality and estimates (33)–(34) imply the required estimate (27). This completes the proof of Theorem 1. \(\square \)
6 Some Concluding Remarks and Perspectives
Using an equivalent system of low order equations for TFDWE, we established a second order time accurate finite volume scheme using the discrete gradient of [5]. The time discretization uses the approximation of Caputo derivative of order \(0<\beta <1\) developed in [1, 6]. We sketched a proof for the convergence under the strong regularity assumption \(\mathcal {C}^4(\mathcal {C}^2)\). This regularity can be weakened to \(\mathcal {C}^3(H^2)\) in the particular cases when \(d=2\) or \(d=3\), see [5, Remark 4.9, Pages 1033–1034]. Strong regularity assumptions are usually needed when we would like to improve the convergence, see for instance the regularity \(\mathcal {C}^3(\mathcal {C}^4)\) in [1, Lemma 5]. The convergence stated in this note includes a convergence in \(L^\infty (H^1)\) and \(H^1(L^2)\) discrete semi-norms. As mentioned in Abstract and Introduction, the present notes improve [3]. We plan in the near future to detail these notes and to address for instance the technique of graded meshes to get high order approximations.
References
Alikhanov, A.A.: A new difference scheme for the fractional diffusion equation. J. Comput. Phys. 280, 424–438 (2015)
Bradji, A.: Convergence order of gradient schemes for time-fractional partial differential equations. C. R. Math. Acad. Sci. Paris 356(4), 439–448 (2018)
Bradji, A.: Some convergence results of a multi-dimensional finite volume scheme for a time-fractional diffusion-wave equation. In: Cancès, C., Omnes, P. (eds.) FVCA 2017. Springer Proceedings in Mathematics & Statistics, vol. 199, pp. 391–399. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57397-7_32
Bradji, A.: An analysis of a second-order time accurate scheme for a finite volume method for parabolic equations on general nonconforming multidimensional spatial meshes. Appl. Math. Comput. 219(11), 6354–6371 (2013)
Eymard, R., Gallouët, T., Herbin, R.: Discretization of heterogeneous and anisotropic diffusion problems on general nonconforming meshes. IMA J. Numer. Anal. 30(4), 1009–1043 (2010)
Gao, G.-H., Sun, Z.-Z., Zhang, H.-W.: A new fractional numerical differentiation formula to approximate the Caputo fractional derivative and its applications. J. Comput. Phys. 259, 33–50 (2014)
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, A146–A170 (2016)
Sun, Z.-Z., Wu, X.: A fully discrete difference scheme for a diffusion-wave system. Appl. Numer. Math. 56, 193–209 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Benkhaldoun, F., Bradji, A. (2020). A Second Order Time Accurate Finite Volume Scheme for the Time-Fractional Diffusion Wave Equation on General Nonconforming Meshes. In: Lirkov, I., Margenov, S. (eds) Large-Scale Scientific Computing. LSSC 2019. Lecture Notes in Computer Science(), vol 11958. Springer, Cham. https://doi.org/10.1007/978-3-030-41032-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-41032-2_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-41031-5
Online ISBN: 978-3-030-41032-2
eBook Packages: Computer ScienceComputer Science (R0)