Abstract
This paper is concerned with unconditionally optimal error estimates of linearized Galerkin finite element methods to numerically solve some multi-dimensional fractional reaction–subdiffusion equations, while the classical analysis for numerical approximation of multi-dimensional nonlinear parabolic problems usually require a restriction on the time-step, which is dependent on the spatial grid size. To obtain the unconditionally optimal error estimates, the key point is to obtain the boundedness of numerical solutions in the \(L^\infty \)-norm. For this, we introduce a time-discrete elliptic equation, construct an energy function for the nonlocal problem, and handle the error summation properly. Compared with integer-order nonlinear problems, the nonlocal convolution in the time fractional derivative causes much difficulties in developing and analyzing numerical schemes. Numerical examples are given to validate our theoretical results.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
We design stable numerical schemes and prove unconditionally optimal error estimates for multi-dimensional nonlinear fractional reaction–subdiffusion equations given by
with the boundary condition
and the initial condition
Here \(f\in C^2(\mathbb {R})\) represents the nonlinear source, the computational domain \(\Omega \subset \mathbb {R}^d\) (\(d=2\) or 3) is a bounded, smooth and convex polygon/polyhedron, the given constant parameters satisfy \(0<\gamma _1,~\gamma _2<1\) and \(\mu >0\), and \(~_0^{RL}\mathcal {D}_t^{1-\gamma }u\) stands for the Riemann-Liouville fractional derivative of order \(1-\gamma \) defined by
Fractional reaction–subdiffusion equation (1.1) is believed to provide a powerful tool for modeling plenty of nature phenomena in physics [2, 4], biology [11, 32, 33] and chemistry [34, 40, 41]. Due to potential applications, the numerical simulation and analysis of fractional differential equations have received much attentions. For example, Lin et al. [26] presented a finite difference/Legendre spectral scheme for solving the linear time fractional cable equation. Yu and Jiang [39] studied stability and convergence of a fourth-order compact finite difference scheme. Langlands and Henry [18] considered accuracy and stability of an implicit solution method for the fractional diffusion equation. Jin et al. [14] presented error analysis of a Galerkin method for fractional diffusion equations. For more development of numerical methods and analysis for the fractional reaction–subdiffusion equations, we refer the readers to [6, 10, 15, 16, 23,24,25, 30, 31, 44]. The works in above are interesting and instructive, but most of them focus on the analysis of numerical schemes for linear problems or one-dimensional problems.
The error estimate for high-dimensional nonlinear problems generally requires to prove the boundedness of numerical solutions in \(L^\infty \)-norm. For this, the usual analysis may lead to certain stepsize restriction condition \(\tau = O(h^{c})\), where \(\tau \) is the temporal stepsize, h is the spacial stepsize and c is a constant. One important reason is the application of induction methods with the following inverse inequality to bound the numerical solution, namely,
Here and below, \(R_h\) represents the projection operator, d is the dimension, p and \(r+1\) are the convergence orders in the temporal and spacial directions, respectively, \(u^n\) and \(U^n_h\) are the exact and numerical solution, respectively. The above inequality results in the stepsize restriction condition \(\tau = o(h^{\frac{d}{2p}})\). For more error estimates of high-dimensional nonlinear problems, various stepsize restriction conditions often appear in literatures, see [1, 5, 7, 28, 29, 42]. The time step restrictions (i.e., \(\tau = o(h^{c})\)) may lead to the use of an unnecessarily small time step and make the computations much more time-consuming. The issue could become more serious when numerical methods are applied to simulate the nonlinear time fractional problems.
On the other hand, many works on error estimates of high-dimensional nonlinear time fractional differential equations [27, 43, 45, 46] based on the assumption that the nonlinear term satisfies the lipschitz condition, i.e.,
The above assumption is equivalent to
where the mean value theorem is used and \(\xi \) depends on exact solutions \(u^n\) and numerical solutions \(U^n_h\) in \(L^\infty \)-norm. It implies that the stepsize restriction \(\tau = O(h^{c})\) is also required while the boundedness of \(\Vert U^n_h\Vert _{L^\infty }\) is obtained by the inequality (1.4).
The goal of this paper is to advance the numerical analysis of a linearized Galkerin method for the multi-dimensional nonlinear fractional reaction–subdiffusion equation (1.1) to the same level as that obtaining for linear problems. Our analysis will show that the convergence order of the fully discrete numerical method is of \(\mathcal {O}(\tau +h^{r+1})\), and the error estimate holds without any time-step restriction \(\tau = \mathcal {O}(h^c)\). In order to estimate optimal error estimates, we adopt the idea for the integer order parabolic equations by first introducing a time-discrete fractional system, and prove suitable regularities of the solution \(U^n\) to the time discrete fractional system, with which, the boundedness of the finite element approximation \(U^n_h\) in \(L^\infty \)-norm is obtained via
when \(\tau \) and h are sufficiently small, respectively. After that, the unconditional optimal error estimates are obtained by using temporal-spatial error splitting argument proposed in [19] for the convergence analysis of the nonlinear integer-order parabolic problem.
While the temporal-spatial error splitting argument has very recently and successfully been applied to the integer-order PDEs, see [8, 19,20,21,22, 36, 37], to avoid certain stepsize restriction condition \(\tau = O(h^{c})\), the extension of the spirit of this methodology to the numerical analysis for fractional nonlinear problems has so far received little attention. The main difficulty is due to the weakly singular kernel in the fractional derivative and the non-locality of the problems. The error estimates for fractional equations rely heavily on the some special constructed energy functions and rigorous study of error summation. The derivation is sharp contrast to that of the integer-order PDEs.
The outline of the paper is organized as follows. In Sect. 2, we present the linearized scheme and the main convergence result. In Sect. 3, we introduce the temporal discrete system and proved a priori estimate of the temporal and spatial errors. In Sect. 4, we present a detailed proof of the main result. In Sect. 5, numerical tests are given to verify the theoretical results of our method. Finally, conclusions and discussions are summarized in Sect. 6.
2 Fully Discrete Methods and Main Results
In this section, we present a fully discrete linearized Galerkin method for the fractional nonlinear equation (1.1) and, report the error estimate of the proposed scheme.
Let \(\Omega \) be a bounded and convex domain with the smooth boundary \(\partial \Omega \) in \(C^2\). We denote \(\mathfrak {I}_h\) by a quasi-uniform partition of \(\Omega \) into triangles \(\mathcal {K}_j\), \(j=1,\dots ,M\) in \(\mathbb {R}^2\) or tetrahedrons in \(\mathbb {R}^3\), and let \(h=\max _{1\le j\le M}\{\hbox {diam}\mathcal {K}_j\}\) be the mesh size. For a triangle \(\mathcal {K}_j\) with two nodes (or a tetrahedron with three nodes) on the boundary, we denote by \(\widetilde{\mathcal {K}}_j\) the triangle with one curved edge (or a tetrahedron with one curved face) with the same nodes as \(\mathcal {K}_j\). For an interior element, \(\widetilde{\mathcal {K}}_j = \mathcal {K}_j\). Let \(\Omega _h=\cup _1^M \mathcal {K}_j\) and \(x = G(\hat{x})\) be a map from \(\Omega _h\) to \(\Omega \) such that for each triangle \(\mathcal {K}_j\), G maps \(\mathcal {K}_j\) one-to-one onto \(\widetilde{\mathcal {K}}_j\) [47]. For a given partition of \(\Omega \), we denote by
the standard finite element space on \(\Omega _h\), where \(P_{r}(\mathcal {K}_j)\) is the space of polynomials of degree r (\(r\ge 1\)) on \(\mathcal {K}_j\). Moreover, we define an operator \(\mathcal {G}\) on \(\widehat{V}_h^r\) by \(\mathcal {G}v_h(x):=v_h(G^{-1}(x))\) for \(x\in \Omega \). Then, the finite element space is defined by
For the time discretization, we divide the interval [0, T] into N equally subintervals with a time step size \(\tau =T/N\). Denote by \(t_n=n\tau \) and \(u^n=u(x,t_n)\), \(0\le n\le N\). The numerical approximation of the Riemann–Liouville fractional derivative is given by
where \(b_j^{(\gamma )} = (j+1)^\gamma -j^\gamma \), \(j=1,\dots ,n-1\), and the local truncation error \(Q^n\) satisfies [46]
where C is a constant depends on u and t.
For a sequence of functions \(\{\omega ^n \}_{n=0}^N\), define
With these notations, the fully discrete linearized Galerkin method for the nonlinear problem (1.1) is to find \(U_h^n\in V_h\), \(n=1,2,\dots ,N\), such that
for any \(v\in V_h\). The initial value is calculated by \(U_h^0=\Pi _h u_0\), where \(\Pi _h\) denotes the interpolation operator.
In this paper, we assume that the solution of problem (1.1) satisfies
where K is a constant.
Remark
The goal of this work is to prove the optimal error bound for our linearized scheme without the time step-restriction (unconditional) in terms of spatial steps. For simplify, we only make the assumption (2.4), which does not involve the regularity of the solution at the initial value at \(t=0\). It will be more complicate if the singularity at \(t=0\) is analyzed for the nonuniform mesh, such as graded mesh.
The main results are addressed as follows.
Theorem 1
Suppose that the problem (1.1)–(1.3) has a unique solution u satisfying (2.4) and \(\frac{1}{2}\le \gamma _2<1\). Then, there exist positive constants \(\tau _0\), \(h_0\) such that when \(\tau \le \tau _0\) and \(h\le h_0\), the finite element system (2.3) admits a unique solution \(U_h^n\), such that
We point out that the error estimate (2.5) holds without time-step restrictions dependent on the spatial mesh size, i.e., \(\tau =\mathcal {O}(h^c)\), and the detailed proof is presented in two sections below. In what follows, we denote by C a generic constant, independent of \(n,h,\tau \) and \(C_0\), and could be different in different places.
3 Boundedness of FEM Approximations
We now introduce a time-discrete system for (1.1) and prove the boundedness of its numerical solution in \(L^\infty \)-norm.
3.1 Preliminaries
Define Ritz projection operator \(R_h: H_0^1(\Omega )\rightarrow V_h\) by
According to the classical FEM theory [35], we have
and the inverse inequality
as well as the classical interpolation theory
The following lemmas will play an important role in proving our main results.
Lemma 1
([9]) Let \(b_n^{(\gamma )}=(1+n)^\gamma -n^\gamma \) with \(0<\gamma <1\). Then
Lemma 2
([12]) Let \(\tau \), B and \(a_k\), \(b_k\), \(c_k\), \(\gamma _k\), for integers \(k>0\), be nonnegative numbers such that
Suppose that \(\tau \gamma _k<1\), for all k, and set \(\sigma _k=(1-\tau \gamma _k)^{-1}\). Then,
Lemma 3
(Friedrichs’ inequality) Let \(\Omega \) be a bounded subset of Euclidean space \(\mathbb {R}^d\) with diameter . Suppose that \(v:~\Omega \rightarrow R\) lies in the sobolev space \(W_0^{k,p}(\Omega )\), and the trace of v on the boundary \(\partial \Omega \) is zero. Then
where \(D^\alpha \) is the mixed partial derivative \(D^\alpha v = \frac{\partial ^{|\alpha |}v }{\partial _{x_1}^{\alpha _1}\cdots \partial _{x_n}^{\alpha _n}}.\)
In order to obtain the unconditionally optimal error estimates of linearized fully discrete schemes (2.3), we now introduce a time-discrete system
with the boundary and initial conditions given by
Applying solutions of the time discrete system, we split the errors into two parts
In the next two subsections, we shall respectively show the estimates \(\Vert u^n-U^n\Vert _{H^2}\) and \(\Vert U^n-U_h^n\Vert _{L^2}\).
3.2 A Primary Error Estimate of Time Discrete System
The exact solution of problem (1.1) satisfies
where the truncation error is given by
By applying (2.2) and Taylor expansion, we have
where \(C_R\) is a constant.
Let \(e^n=u^n-U^n\). Subtracting (3.5) from (3.9) gives
Define
We now present error estimates of \(u^n-U^n\) in different norms.
Theorem 2
Suppose that the problem (1.1)–(1.3) has a unique solution u satisfying (2.4) and \(\frac{1}{2}\le \gamma _2<1\). Then the time-discrete system (3.5)–(3.7) has a unique solution \(U^n\). Moreover, there exists \(\tau _1^*>0\) such that when \(\tau \le \tau _1^*\),
where \(C_1^*\) is a positive constant independent of \(\tau \), h and \(C_0\) (appeared in Theorem 1).
Proof
The existence and uniqueness of the solution \(U^n\) can be easily obtained since (3.5)–(3.7) is a linear elliptic problem. We begin to prove (3.12) by using mathematical induction. First, (3.12) holds obviously for \(n=0\). Then, we assume that (3.12) hold for \(n =0,1,\dots , k-1\). Therefore, for \(n=0,1,\dots ,k-1\), we have
when \(\tau \le \tau _1=\frac{1}{(CC_1^*)^2}\).
Therefore, by mean value theorem,
where \(\xi _1\) is determined by \(u^{n-1}\) and \(\Vert U^{n-1}\Vert _{L^\infty }\) and \(C_{K_1}\) is a constant independent of n and \(\tau \).
Now, let \(n=k\) in (3.11). Multiplying both sides of (3.11) by \( e^k\) and integrating the result over \(\Omega \) yields
where we have used the fact \(b_{j-1}^{(\gamma )}>b_{j}^{(\gamma )}\), \(\gamma =\gamma _1\) or \(\gamma _2\), \(j=1,2,\dots ,k\).
Let
Then, (3.15) can be rewritten as
where we have used Lemma 3 in the second inequality (i.e., there exists a constant \(C_1\) such that \( -\Vert \nabla e^k\Vert ^2_{L^2} \le -C_1\Vert e^k\Vert ^2_{L^2} \) ).
Noting that
and by Lemma 1, there exists a constant \(C_2\) such that
From (3.17), (3.18), (3.19) and (3.20), we arrive at
Summing over the above formula from 1 to k and using Lemma 2, we have that there exists a \(\tau _2\) such that when \(\tau \le \tau _2\),
where
Therefore, we obtain
Next, let \(n=k\) in (3.11). Multiplying both sides of (3.11) by \(-\Delta e^k\) and integrating the result over \(\Omega \) yields
Let
Similar to the derivation of (3.21), there exists a \(\tau _3\) such that when \(\tau \le \tau _3\),
where \(\overline{C}_{K_1} \) and \(\overline{C}_R\) are constants independent of \(\tau \) and the induction variable k.
Summing over the above formula from 1 to k and using Lemma 2, we have that there exists a \(\tau _3\) such that when \(\tau \le \tau _3\),
where
Hence, we arrive at
and
Together with (3.23), (3.26) and (3.28), we have
and
Now, taking \(C_1^*=\sqrt{3T C_3\exp (2C_{K_1}T)+3T \overline{C}_3\exp (2 \overline{C}_{K_1}T)+\frac{3T \overline{C}_3\exp (2 \overline{C}_{K_1}T)}{C_2}}\), we conclude that (3.12) holds for \(n=k\). This completes the mathematical induction.
Further, we have
and
Moreover, it follows from (3.27) that
By the theory of elliptic equation, \(\Vert D_\tau e^n\Vert _{H^2}\le C \Vert \triangle D_\tau e^n\Vert _{L^2}\) for \(n=1,2,\dots ,N\), we have
which further implies
This completes the proof. \(\square \)
3.3 A Primary Error Estimate of Fully Discrete System
The weak form of time-discrete system (3.5) satisfies
for any \(v\in V_h\), \(n=1,2,\dots ,N\).
Let
Subtracting (2.3) from (3.33), we have the error equation for \(\theta _h^n\),
where
Moreover, by (3.2), (3.12) and (3.13), we obtain
By Theorem 2, we have
Then, we can define
Now, we are ready to present a primary error estimate of \(U^n-U_h^n\) in \(L^2\)-norm.
Theorem 3
Suppose that the problem (1.1)–(1.3) has a unique solution u satisfying (2.4). Then the finite element system (2.3) has a unique solution \(U_h^n\), \(n=1,\dots ,N\), and there exist \(\tau _2^*>0\), \(h_1^*>0\) such that when \(\tau \le \tau _2^*\), \(h\le h_1^*\),
Proof
The existence and uniqueness of the FEM solution \(U_h^n\) hold because the coefficient matrices of system (2.3) are diagonally dominant. Next, we prove (3.36) by using mathematical induction. It is clear that (3.36) holds for \(n=0\). Next, we assume that (3.36) holds for \(n\le k-1\). Therefore, for \(n=1,2,\dots ,k-1\),
for \(d=2,3\), and \(h\le h_1=C^{-\frac{4}{7-2d}}\). Thanks to the boundedness of \(\Vert U^{k-1}\Vert _{L^{\infty }}\) and \( \Vert U_h^{k-1}\Vert _{L^{\infty }}\), we have
where we have used the mean value theorem and (3.4).
Now, let \(n=k\) and set \( v= \theta ^k_h\) in (4.2). Using (3.38), we have
Let
Then, (3.39) can be rewritten as
\(\square \)
Summing over (3.41) from 1 to k and then using (3.35) and Lemma 2, there exists a \(\tau _4\) such that when \(\tau \le \tau _4\),
which further implies
when \(h\le h_2= C^{-4}\).
Therefore, (3.36) holds for \(n=k\) by using the triangle inequality. Moreover, we have the following estimate,
when \(\tau \le \tau _5= \frac{1}{(2CC_1^*)^2}\) and \(h\le h_3=(2C)^{-\frac{4}{7-2d}} \). Taking \(\tau _2^* = \min \{\tau _1^*, \tau _4, \tau _5 \}\) and \(h_1^*=\min \{ h_1,h_2,h_3 \}\) we conclude that (3.36) and (3.37) hold. The proof is complete.
4 Proof of Theorem 1
We now prove the unconditionally optimal error estimate (2.5) in Theorem 1.
Proof
The weak form of problem (1.1) satisfies: for any \(v\in V_h\), \(n=1,2,\dots ,N\)
Let
Subtracting (2.3) from (4.1), the error equation for \(\eta _h^n\) satisfies
where
Now, setting \( v= \eta ^n_h\) in (4.2), we have
Let
Then, (4.4) can be rewritten as
where, again, we used the result in Lemma 3 (i.e., there exists a constant \(C_4\) such that \( -\Vert \nabla \eta ^n_h\Vert ^2_{L^2} \le - C_4 \Vert \eta ^n_h\Vert ^2_{L^2} \)).
We now turn to estimate \(\tau (R_4^n,\eta ^n_h)\), where \(R_4^n\) is defined in (4.3).
By using the boundedness of \(\Vert U_h^n\Vert _{L^\infty }\) in Theorem 3 and (3.2), we have
and
Substituting the estimates (4.6)–(4.9) into (4.5) yields
Summing over the above formula from 1 to n and using Lemma 2, there exists a \(\tau _6\) such that when \(\tau \le \tau _6\),
which further implies
Therefore, taking \(\tau _0= \min \{ \tau _2^*, \tau _6 \}\) and \(h_0=h_1^*\), the finite element system (2.3) admits a unique solution \(U_h^n\), such that
This completes the proof. \(\square \)
5 Numerical Examples
In this section, several numerical experiments are carried out to illustrate the theoretical results. All the computations are performed by using the software FreeFEM++.
Example 1
Consider two dimensional Michaelis–Menten reaction equation [40, 45]
where the function g, the initial and boundary conditions are determined by the exact solution
We present the accuracy tests by using a uniform triangular partition with \(M+1\) nodes in each spatial direction here and below. In the simulations, we set \(\gamma =0.6\), let \(N=M^2\) and \(N=M^3\) when the linear and quadratic element approximation are applied, respectively. The \(L^2\)-errors at time \(T=1\) and convergence rates for the two dimensional problem are shown in Table 1. These results imply that the numerical solutions converge to the exact solution in the order of \(O(\tau + h^{r+1})\) for the r-th degree finite element methods.
To verify unconditional convergence, we solve the problem by fixing \(\tau \) and changing spatial mesh size h. The \(L^2\)-norm errors at time \(T=1\) for two and three dimensional problems are shown in Figs. 1 and 2, respectively. One can learn from these two figures that for a fixed \(\tau \), the errors in \(L^2\)-norm asymptotically convergence to a constant, which implies that the time step restriction \(\tau =h^c\) is unnecessary.
Example 2
Consider three dimensional nonlinear fractional cable equation [3, 26, 46], given by
where the function g, initial and boundary conditions are determined by
In this numerical experiment, we set the parameter \(\gamma _1=0.2\), \(\gamma _2=0.8\), \(N=M^2\) and \(N=M^3\) when the linear and quadratic element approximation are applied, respectively. The \(L^2\)-errors at time \(T=1\) and convergence rates for the three dimensional problems are listed in Table 2. These results further illustrate convergence of the proposed methods
Again, to verify unconditional convergence, we solve the problems with fixed \(\tau \) by changing spatial mesh sizes. The \(L^2\)-norm errors at time \(T=1\) for three dimensional problems are shown in Fig. 2. For a fixed \(\tau \), the errors in \(L^2\)-norm asymptotically convergence to a constant. It implies that the time step restriction is unnecessary.
6 Conclusions
In this paper, a fully discrete linearized Galerkin finite element method is proposed to solve the multi-dimensional fractional reaction–subdiffusion equations. By introducing the time-discrete elliptic equations and constructing the energy functions, we obtain the \(H_2\) boundedness of the solution of the time-discrete system and \(L^\infty \) boundedness of the corresponding finite element solution. Then, the optimal error estimates are proved without any stepsize restriction, i.e., \(\tau =O(h^c)\). Numerical examples in both two and three dimensional cases are presented to confirm our theoretical results.
Several issues are deserving further investigation. First, due to the non-locality of the problem, it is difficult to get the boundedness of \(\Vert D_\tau ^{\gamma _2} U^n\Vert _{H^2}\) when \(0< \gamma _2<\frac{1}{2}\). Therefore, it is still an open problem to prove the unconditional error estimate under the assumption \(0< \gamma _2<\frac{1}{2}\). Second, in view of the regularity of the solution to the problem (1.1), it is interesting to develop nonuniform time-step schemes to approximate the time-fractional derivative and provide rigorous error analysis. Third, the computational storage and cost are huge for long time simulations of high-dimensional problems, this motivates us to consider high-order accuracy scheme with fast evaluation of the time-fractional derivative. The resulting fast algorithm should not only keep the same accuracy as the direct evaluation of the fractional derivative, but also reduce significantly the computational storage and cost, see relative works [13, 17, 38]. In addition, it is interesting to investigate the global existence of the solution for the nonlinear problem (1.1).
References
Akrivis, G., Crouzeix, M., Makridakis, C.: Implicit–explicit multistep methods for quasilinear parabolic equations. Numer. Math. 82, 521–541 (1999)
Amblard, F., Maggs, A.C., Yurke, B., Pargellis, A.N., Leibler, S.: Subdiffusion and anomalous local viscoelasticity in actin networks. Phys. Rev. Lett. 77, 4470 (1996)
Bhrawy, A.H., Zaky, M.A.: Numerical simulation for two-dimensional variable-order fractional nonlinear cable equation. Nonlinear Dyn. 80, 101–116 (2015)
Bouchaud, J., Georges, A.: Anomalous diffusion in disordered media: statistical mechanisms: models and physical applications. Phys. Rep. 195, 127–293 (1990)
Cannon, J.R., Lin, Y.: Nonclassical H1 projection and Galerkin methods for nonlinear parabolic integro-differential equations. SIAM. J. Numer. Anal. 25, 187–201 (1988)
Chen, C.M., Liu, F., Turner, I., Anh, V.: A Fourier method for the fractional diffusion equation describing sub-diffusion. J. Comput. Phys. 227, 886–897 (2007)
Ford, N.J., Rodrigues, M.M., Vieira, N.: A numerical method for the fractional Schrödinger type equation of spatial dimension two. Frac. Cacl. Appl. Anal. 16, 1–15 (2013)
Gao, H.: Optimal error analysis of Galerkin FEMs for nonlinear joule heating equations. J. Sci. Comput 58, 627–647 (2014)
Gao, G.H., Sun, Z.Z.: A compact difference scheme for the fractional sub-diffusion equations. J. Comput. Phys. 230, 586–595 (2011)
Gu, Y., Zhuang, P., Liu, F.: An advanced implicit meshless approach for the non-linear anomalous subdiffusion equation. Comput. Model. Eng. Sci. 56(3), 303–334 (2010)
Henry, B.I., Langlands, T.A.M., Wearne, S.L.: Fractional cable models for spiny neuronal dendrites. Phys. Rev. Lett. 100, 128103 (2008)
Heywood, J.G., Rannacher, R.: Finite element approximation of the nonstationary Navier–Stokes problem IV: error analysis for second-order time discretization. SIAM. J. Numer. Anal. 27, 353–384 (1990)
Jiang, S., Zhang, J., Zhang, Q., Zhang, Z.: Fast evaluation of the Caputo fractional derivative and its applications to fractional diffusion equations. Commun. Comput. Phys. 21, 650–678 (2017)
Jin, B., Lazarov, R., Zhou, Z.: Error estimates for a semidiscrete finite element method for fractional order parabolic equations. SIAM. J. Numer. Anal. 51, 445–466 (2013)
Jin, B., Li, B., Zhou, Z.: Numerical analysis of nonlinear subdiffusion equations. arXiv:1705.07398
Jin, B., Li, B., Zhou, Z.: An analysis of the Crank–Nicolson method for subdiffusion. IMA J. Numer. Anal. (2017). https://doi.org/10.1093/imanum/drx019
Ke, R., Ng, M., Sun, H.: A fast direct method for block triangular Toeplitz-like with tridiagonal block systems from time-fractional partial differential equations. J. Comput. Phys. 303, 203–211 (2015)
Langlands, T.A.M., Henry, B.I.: The accuracy and stability of an implicit solution method for the fractional diffusion equation. J. Comput. Phys. 205, 719–736 (2005)
Li, B.: Mathematical modeling, analysis and computation for some complex and nonlinear flow problems. Ph.D. Thesis, City University of Hong Kong, Hong Kong, July, 2012
Li, B., Sun, W.: Unconditional convergence and optimal error estimates of a Galerkin-mixed FEM for incompressible miscible flow in porous media. SIAM J. Numer. Anal. 51, 1959–1977 (2013)
Li, B., Gao, H., Sun, W.: Uncondtional optimal error estimates of a Crank–Nicolson Galerkin method the nonlinear thermistor equations. SIAM J. Numer. Anal. 52, 933–954 (2014)
Li, D., Wang, J.: Unconditionally optimal error analysis of Crank–Nicolson Galerkin FEMs for a strongly nonlinear parabolic system. J. Comput. Sci 72, 892–915 (2017)
Li, D., Wang, J., Zhang, J.: Unconditionally convergent \(L1\)-Galerkin FEMs for nonlinear time-fractional Schrödinger equations. SIAM J. Sci. Comput. 39, A3067–A3088 (2017)
Li, D., Zhang, J.: Efficient implementation to numerically solve the nonlinear time fractional parabolic problems on unbounded spatial domain. J. Comput. Phys. 322, 415–428 (2016)
Li, D., Zhang, C., Ran, M.: A linear finite difference scheme for generalized time fractional Burgers equation. Appl. Math. Model. 40, 6069–6081 (2016)
Lin, Y., Li, X., Xu, C.: Finite difference/spectral approximations for the fractional cable equation. Math. Comput. 80, 1369–1396 (2011)
Liu, Y., Du, Y., Li, H., He, S., Gao, W.: Finite difference/finite element method for a nonlinear time-fractional fourth-order reaction–diffusion problem. Comput. Math. Appl. 70, 573–591 (2015)
López-Marcos, J.C., Sanz-serna, J.M.: A definition of stability for nonlinear problems. In: Strehmel, K. (ed.) Numerical Treatment of Differential Equations, Teubner-Texte zur Mathematik, Band 104, Leipzig, pp. 216–226 (1988)
Luskin, M.: A Galerkin method for nonlinear parabolic equations with nonlinear boundary conditions. SIAM J. Numer. Anal. 16, 284–299 (1979)
Mustapha, K.: A second-order accurate numerical method for a semilinear integro-differential equation with a weakly singular kernel. IMA J. Numer. Anal. 30, 555–578 (2010)
Mustapha, K.: Uniform convergence for a discontinuous Galerkin, time-stepping method applied to a fractional diffusion equation. IMA J. Numer. Anal. 32, 906–925 (2012)
Podlubny, I.: Fractional Differential Equations. Academic Press, San Diego (1999)
Samko, S.G., Kilbas, A.A., Marichev, O.I.: Fractional Integrals and Derivatives—Theory and Applications. Gordon and Breach Science Publishers, New York (1993)
Seki, K., Wojcik, M., Tachiya, M.: Fractional reaction–diffusion equation. J. Chem. Phys. 119, 2165–2174 (2003)
Thomée, V.: Galerkin Finite Element Methods for Parabolic Problems. Springer, Berlin (1997)
Wang, J., Si, Z., Sun, W.: A new error analysis of characteristics-mixed FEMs for miscible displacement in porous media. SIAM J. Numer. Anal. 52, 3000–3020 (2014)
Wang, J.: A new error analysis of Crank–Nicolson Galerkin FEMs for a generalized nonlinear Schrödinger equation. J. Sci. Comput. 52, 390–407 (2014)
Yan, Y., Sun, Z., Zhang, J.: Fast evaluation of the caputo fractional derivative and its applications to fractional diffusion equations: a second-order scheme. Commun. Comput. Phys. 22(4), 1028–1048 (2017)
Yu, B., Jiang, X.: Numerical identification of the fractional derivatives in the two-dimensional fractional cable equation. J. Sci. Comput. 68, 252–272 (2016)
Yuste, S.B., Lindenberg, K.: Reaction front in an \(A+B\rightarrow C\) reaction–subdiffusion process. Phys. Rev. E. 69, 036126 (2004)
Yuste, S.B., Lindenberg, K.: Subdiffusion-limited reactions. Chem. Phys. 284, 169–180 (2002)
Zhao, X., Sun, Z., Hao, Z.: A fourth-order compact ADI scheme for two-dimensional nonlinear space fractional Schödinger equation. SIAM. J. Sci. Comput. 36(6), 2865–2886 (2014)
Zhang, X., He, Y., Wei, L., Tang, B., Wang, S.: A fully discrete local discontinuous Galerkin method for one-dimensional time-fractional Fisher’s equation. Int. J. Comput. Math. 91, 2021–2038 (2014)
Zhuang, P., Liu, F., Anh, V., Turner, I.: New solution and analytical techniques of the implicit numerical method for the anomalous subdiffusion equation. SIAM J. Numer. Anal. 46, 1079–1095 (2008)
Zhuang, P., Liu, F., Anh, V., Turner, I.: Stability and convergence of an implicit numerical methods for nonlinear fractional reaction–subdiffusion process. IMA J. Appl. Math. 6, 1–23 (2009)
Zhuang, P., Liu, F., Turner, I., Anh, V.: Galerkin finite element method and error analysis for the fractional cable equaiton. Numer. Algorithm 72, 447–466 (2016)
Zlámal, M.: Curved elements in the finite element method. I. SIAM J. Numer. Anal. 10, 229–240 (1973)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is partially supported by NSFC under Grant Nos. 11771035, 11771162, 11571128, 91430216 and U1530401.
Rights and permissions
About this article
Cite this article
Li, D., Zhang, J. & Zhang, Z. Unconditionally Optimal Error Estimates of a Linearized Galerkin Method for Nonlinear Time Fractional Reaction–Subdiffusion Equations. J Sci Comput 76, 848–866 (2018). https://doi.org/10.1007/s10915-018-0642-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10915-018-0642-9