1.
Introduction
We focus on the following nonlinear time fractional partial differential equation (TFPDE):
where J=(0,T] and Ω⊂R2 is a convex polygonal with boundary ∂Ω, the nonlinear function f(y) fulfills
The Caputo derivative [1] Dαt defined as follows:
Here, Γ(z)=∫+∞0κz−1e−κdκ is the usual Gamma function.
Due to the excellent performance in describing memory and genetic properties, TFPDEs have been widely used to model anomalous diffusion, electromagnetic wave, hydrodynamics, signal processing, material science etc. Unfortunately, the analytical solutions of most TFPDEs are almost impossible to calculate. For the past twenty years, many researchers proposed extensive numerical methods of TFPDEs. Related books can be found in [2,3,4]. In the current literatures, we can see finite difference [5,6,7,8], spectral method [9,10], finite volume [11], finite element (FE) [12,13,14], weak FE [15], mixed finite element (MFE) [16,17,18,19], virtual element method [20], fast algorithm [21,22,23], higher-order schemes [24,25,26,27] and so on, which mostly focused on the linear fractional differential equation case. Recently, Zheng et al. [28] established the stability and error estimates of fully discrete FE for a hidden-memory variable-order time-fractional optimal control model.
In recent years, scholars pay much attention to nonlinear TFPDEs. In [29], Li et al. considered a numerical approximation of nonlinear TFPDEs. In [30], the authors introduced a Newton linearized Galerkin FE approximation for nonlinear TFPDEs with non-smooth solutions. The two-grid method was first proposed by Xu [31] for solving nonsymmetric and nonlinear partial differential equations (PDEs) under finite element approximation. As an effective numerical method, it has been expanded to solve various nonlinear fractional PDEs [32,33,34,35].
For the classic MFE, its discrete space pairs must satisfy the Ladyženskaja-Babuška-Brezzi (LBB) condition. To avoid the LBB constraints, Pehlivanov et al. [36] developed a least-squares MFE, Pani [37] presented an H1-Galerkin mixed finite element (HMFE) approximation by requiring extra regularity on the solution and Yang [38] proposed a splitting positive definite MFE by separating the pressure equation from flux equation. Recently, Liu and Hou investigated the HMFE approximation of one-dimensional TFPDEs [39,40] and semilinear parabolic integro-differential equations [41], respectively. Our aim of this article is to provide a two-grid algorithm (TGA) for the nonlinear problem (1.1) by HMFE combined with L1 scheme discretization and analyze its stability and convergence.
The layout of the paper is as follows. We give a fully discrete HMFE approximation scheme (FDHAS) of the problem (1.1) in Section 2. The stability and convergence of the discrete scheme is analyzed in Section 3. The TGA of (1.1) and its stability and convergence are discussed in Section 4. In Section 5, we give several examples to verify our theoretical findings.
2.
FDHAS of nonlinear TFPEDs
The FDHAS of the nonlinear TFPDE (1.1) will be constructed in this section. Throughout this article, we use standard notations for Sobolev spaces Wm,q(Ω) with a semi-norm |w|m,q and a norm ‖w‖m,q. For q=2, let Hm(Ω)=Wm,2(Ω), Hm0(Ω)={w∈Hm(Ω):w|∂Ω=0}, ‖⋅‖=‖⋅‖0,2,‖⋅‖m=‖⋅‖m,2. Lp(J;Wm,q(Ω)) be all Lp integrable function space from J into Wm,q(Ω) with norm ‖w‖Lp(J;Wm,q(Ω))=(∫T0||w||pWm,q(Ω)dt)1/pforp∈[1,∞), and the standard modification for p=∞. In addition, c>0 and C>0 are generic constant.
Let us assume that the Eq (1.1) has a solution y(t,x) such that
Set W=H10(Ω) and VV=H(div,Ω) with
Like in [42], an H1-Galerkin mixed variational formulation of (1.1) is: Find {y,YY}:(0,T]→W×VV, for any vv∈VV and w∈W, such that
Let Th be a uniform rectangular partition of Ω, where h=maxe∈Th{he} denotes the spatial mesh size and he deotes the diameter of element e. Associated with the rectangular partition Th of Ω, we define subspaces Wh×VVh⊂W×VV as follows [43]:
where Qm,n(e) be the space of polynomials with degree no more than m and n in the x1 direction and the x2 direction, respectively.
Then a semidiscrete HMFE approximation of (1.1) is: Find {yh,YYh}:(0,T]→Wh×VVh, for any vvh∈VVh and wh∈Wh, such that
where [41] Ph:W→Wh, which fulfills: For any wh∈Wh and φ∈W
We introduce [43,44] Πh:VV→VVh, which fulfills: For any vvh∈VVh and ψψ∈VV
Since the solution may be weakly singular at t=0, we use the graded mesh for time discretization. For n=0,1,⋯,N with N∈Z+, let tn=T(n/N)γ, where γ≥1 will be adapted to the strength of the singularity and chosen by the user and the temporal mesh size τ=max{τn}Nn=1 with τn=tn−tn−1. We set φn=φ(tn,x) for n=0,1,⋯,N. The L1 approximation scheme is given by [2]:
where
Lemma 2.1. ([22]) If |φ′′(t)|≤Ctα−2,0<t≤T, there exists a constant C independent of τ, such that
where r=min{2−α,γα}.
Then the FDHAS of (1.1) is as follows: Find (ynh,YYnh)∈Wh×VVh,n=1,2,⋯,N for any vvh∈VVh and wh∈Wh, such that
3.
Stability and convergence analysis of the FDHAS
The stability and convergence of the FDHAS (2.13)–(2.15) will be analyzed in this section. The discrete Grönwall lemma will be used in the following analysis.
Lemma 3.1. ([26,45]) Let {ξn}Nn=1, {gn}Nn=1 and {λn}N−1n=0 be given nonnegative sequences. If there is a constant Λ independent of τ satisfies
Then, for any nonnegative sequence {Vk}Nk=0 and 1≤n≤N such that
it holds that
where Eα(z)=∞∑k=0zkΓ(1+kα) is the Mittag-Leffler function.
3.1. Stability analysis
We first show the stability of the solution to (2.13)–(2.15).
Theorem 3.1. Let (yh,YYh) be the solution of (2.13)–(2.15) and all the conditions in Lemma 3.1 are valid. Then
Proof. Choosing vvh=2YYnh in (2.13) leads to
where we have used the Taylor's formula, ε-Cauchy inequality and the condition (1.2).
From the definition of DαNYYnh and Hölder inequality, we can derive
Taking wh=ynh in (2.14) and using Hölder's inequality, we have
Employing the Poincaré inequality and (3.5)–(3.7), we obtain
Then (3.3) follows from Lemma 3.1 and (3.8). From (3.3) and (3.7), we can easily arrive at (3.4). □
3.2. Convergence analysis
From (2.1)–(2.3), (2.11) and (2.13)–(2.15), we obtain error equations
For convenience, we set
Theorem 3.2. Let (y,YY) and (yh,YYh) be the solutions of (2.1)–(2.3) and (2.13)–(2.15), respectively. Suppose that y∈L∞(J;H2(Ω))∩H2(J;L2(Ω)), YY∈(L∞(J;H1(Ω))2∩(H2(J;H1(Ω)2 and all the conditions in Lemma 2.1 and Theorem 3.1 are valid. Then for n=1,2,⋯,N, there hold
Proof. From the definitions of the projection operators Ph and Πh and error Eqs (3.9)–(3.10). For any vvh∈VVh and wh∈Wh, we have
Taking vvh=ϑϑn in (3.13), then there yields
According to the mean-value theorem, the conditions (1.2) and (2.7), we obtain
It follows from Hölder's inequality and (2.12) that
From (2.10) and Poincaré inequality, we have
Using (3.15)–(3.18), Hölder's inequality and ε-Cauchy inequality, we get
Noting that (DαNϑϑn,ϑϑn)≥12DαN‖ϑϑn‖2, from (3.16)–(3.19), we have
Choosing wh=ηn in (3.14), we get
Using (3.21), Cauchy-Schwartz inequality, (2.9) and Poincaré inequality, we derive
According to (3.22), YY∈(L∞(J;H2(Ω))2 and Poincaré inequality, we get
Combining (3.20) and (3.23) yields
By (3.24) and Lemma 3.1, we obtain
Noting that YY∈(L∞(J;H2(Ω))2 and using triangle inequality, (2.8) and (3.25), we derive
From (3.23) and (3.25), we have
It follows from (2.7), triangle inequality and (3.27) that
Thus, the proof is completed. □
4.
TGA and error estimates
A two-grid HMFE algorithm to solve the nonlinear TFPDE (1.1) will be proposed in this section. Let TH and Th be two uniform rectangular partitions of Ω with different size H and h(h≪H). The fine mesh Th is obtained by uniformly refined the coarse mesh TH. Associated with TH and Th are HMFE spaces WH×VVH and Wh×VVh, respectively. It is obvious that WH×VVH⊂Wh×VVh. We show the TGA as follows:
Two-grid algorithm (TGA).
Step 1. On TH: Find (ynH,YYnH)∈WH×VVH for n=0,1,⋯,N and any vvH∈VVH, wH∈WH, such that
Step 2. On Th: Given ynH for n=1,2,⋯,N, find (y∗,nh,YY∗,nh)∈Wh×VVh for n=0,1,⋯,N and any vvh∈VVh, wh∈Wh, such that
4.1. Stability analysis
Now, we analyze the stability of the TGA.
Theorem 4.1. Let (y∗h,YY∗h) be the solution of the two-grid algorithm (4.1)–(4.6) and all the conditions in Lemma 3.1 are valid. Then we have
Proof. Setting vvh=2YY∗,nh in (4.4), we get
where we have used the Taylor's formula, ε-Cauchy inequality and the condition (1.2).
Choosing wh=y∗,nh in (4.5) and using Hölder's inequality, we obtain
Noting 2(DαNYY∗,nh,YY∗,nh)≥DαN‖YY∗,nh‖2 for n=1,2,⋯,N. Applying the Poincaré inequality, (3.7), (4.9) and (4.10), we derive
Then (4.7) follows from (4.11) and Lemma 3.1. According to (4.7) and (4.10), it is easy to get (4.8).□
4.2. Error estimates
Subtracting (4.4) and (4.5) from (2.1) and (2.2), for any vvh∈VVh and wh∈Wh, we can obtain equations
In order to conveniently derive error estimation results, we set
Theorem 4.2. Let (y,YY) and (y∗h,YY∗h) be the solutions of (2.1)–(2.3) and (4.1)–(4.6), respectively. Suppose that y∈L∞(J;H2(Ω))∩H2(J;L2(Ω)), YY∈(L∞(J;H2(Ω))2∩(H2(J;L2(Ω)2 and all the conditions in Theorem 3.2 and Theorem 4.1 are valid. Then for n=1,2,⋯,N, there hold
Proof. Subtracting (4.2) from (2.2) and utilizing the definition of PH, we have
Choosing wH=PHyn−ynH in (4.16), we derive
From Poincaré inequality, (4.17) and Theorem 3.2, we obtain
According to triangle inequality, (2.7) and (4.18), we arrive at
Using (4.12) and (4.13) and the definitions of Ph and Πh, for any vvh∈VVh and wh∈Wh, we get
From the Taylor expansion formula, we have
where δ between yn and ynH.
Substituting (4.22) into (4.20) and choosing vvh=ρρn yields
We can estimate the right-hand side of (4.23) as follows:
and
and
where we have used (2.7), (2.10), Lemma 2.1, Hölder inequality, embedding theorem, Theorem 3.2 and Poincaré inequality.
Taking wh=ξn in (4.21), we get
From (2.9), (4.27) and Cauchy-Schwartz inequality, we derive
By (4.28) and Poincaré inequality, we have
Combining (4.23)–(4.29) and using (a+b)4≤8(a4+b4) with a,b>0, we yield
It follows from Lemma 3.1 and (4.30) that
Using triangle inequality, (2.8) and (4.31), we arrive at
From (4.29) and (4.31), we have
It follows from (2.7), triangle inequality and (4.33) that
We complete the proof of Theorem 4.2. □
5.
Numerical experiment
Several examples are provided to demonstrate our theoretical findings in this section. All numerical examples will be solved by the FDHAS described as (2.13)–(2.15) and TGA described as (4.1)–(4.6), where the program codes are based on AFEPack [46]. Let J=(0,1] and Ω=(0,1)2. We numerically solve the following nonlinear time fractional equation:
For simplicity, we define |||ψ|||=max0≤n≤N{‖ψn‖}. The convergence rate are computed by Rate=ln(|||ψk+1|||)−ln(|||ψk|||)ln(sk+1)−ln(sk), where |||ψk+1|||(|||ψk|||) is the error with the spatial or temporal mesh step sk+1(sk).
Example 1. The initial condition and the right function g(t,x) are suitably chosen such that y(t,x)=t2sin(πx1)sin(πx2) and the nonlinear term f(y)=y(1−y).
When the spatial step h=1100 and H=√h=110 are fixed, in Table 1, we present the errors |||YYh−YY||| and |||YY∗h−YY|||, the temporal convergence orders and the CPU time for α=0.4,0.5 and 0.8 by using the general FDHAS (2.13)–(2.15) and TGA (4.1)–(4.6), respectively.
The numerical results in Table 1 show that the TGA (4.1)–(4.6) can save significant computational costs compared with FDHAS (2.13)–(2.15) without losing accuracy. Fixed N=1000, γ=2−αα and h=H2, the results in Table 2 reflect |||YYh−YY|||=O(h), |||yh−y|||=O(h2) and |||YY∗h−YY|||=O(h). The convergence rate results in time and space direction are consistent with our theoretical results.
Example 2. The initial condition and the right function g(t,x) are suitably chosen such that y(t,x)=(Eα(−tα)+t3)x1(1−x1)x2(1−x2) and the nonlinear term f(y)=y3.
In Table 3, we also give the numerical results with the fixed spatial step h=1100 and H=√h=110 for α=0.4,0.5 and 0.8 by utilizing the general FDHAS (2.13)–(2.15) and TGA (4.1)–(4.6), respectively. For fixed N=1000, γ=2−αα and h=H2, we show the numerical results in Table 4. The numerical results demonstrate that the TGA is more efficient than the FDHAS. It is agreement with our theoretical analysis.
6.
Conclusions
In this paper, we proposed the TGA for the nonlinear TFPDEs (1.1) discretized by H1-Galerkin mixed finite element on spatial rectangular mesh combined with L1 scheme on temporal graded mesh. The stability and optimal convergence of the TGA are rigorously proved. Our theoretical results seem to be new in the literature. Numerical experimental results show that the TGA (4.1)–(4.6) can save a lot of computing cost compared with FDHAS (2.13)–(2.15) without losing accuracy. Although our TGA in this paper focuses on a two-dimensional case, it can be directly applied to three-dimensional problems. Future work includes the developments of two-grid finite element methods combined with some higher-order schemes or fast algorithm for nonlinear TFPDEs.
Use of AI tools declaration
The authors declare that they have not used Artificial Intelligence (AI) tools in the creation of this article.
Acknowledgments
This work is supported by the Scientific Research Foundation of Hunan Provincial Department of Education (20A211) and the Natural Science Foundation of Hunan Province (2020JJ4323).
Conflict of interest
The authors declare that there are no conflicts of interest.