α(t) | MEN in [26] | MEN in [27] | ME36 | ME64 |
0.5 | 8.82×10−4 | 1.99×10−4 | 1.41×10−5 | 4.18×10−6 |
0.8 | 8.50×10−4 | 1.87×10−4 | 7.16×10−6 | 4.61×10−6 |
0.01 | 1.43×10−5 | 4.09×10−6 | ||
0.99 | 2.95×10−5 | 6.03×10−6 |
The purpose of this paper is to establish a numerical method for solving time-fractional diffusion equations. To obtain the numerical solution, a binary reproducing kernel space is defined, and the orthonormal basis is constructed based on Legendre polynomials in this space. In order to find the ε-approximation solution of time-fractional diffusion equations, which is defined in this paper, the algorithm is designed using the constructed orthonormal basis. Some numerical examples are analyzed to illustrate the procedure and confirm the performance of the proposed method. The results faithfully reveal that the presented method is considerably accurate and effective, as expected.
Citation: Yingchao Zhang, Yingzhen Lin. An ε-approximation solution of time-fractional diffusion equations based on Legendre polynomials[J]. AIMS Mathematics, 2024, 9(6): 16773-16789. doi: 10.3934/math.2024813
[1] | Yingchao Zhang, Yuntao Jia, Yingzhen Lin . An ε-approximate solution of BVPs based on improved multiscale orthonormal basis. AIMS Mathematics, 2024, 9(3): 5810-5826. doi: 10.3934/math.2024282 |
[2] | Liangcai Mei, Boying Wu, Yingzhen Lin . Shifted-Legendre orthonormal method for high-dimensional heat conduction equations. AIMS Mathematics, 2022, 7(5): 9463-9478. doi: 10.3934/math.2022525 |
[3] | Hui Zhu, Liangcai Mei, Yingzhen Lin . A new algorithm based on compressed Legendre polynomials for solving boundary value problems. AIMS Mathematics, 2022, 7(3): 3277-3289. doi: 10.3934/math.2022182 |
[4] | Xiaoyong Xu, Fengying Zhou . Orthonormal Euler wavelets method for time-fractional Cattaneo equation with Caputo-Fabrizio derivative. AIMS Mathematics, 2023, 8(2): 2736-2762. doi: 10.3934/math.2023144 |
[5] | Obaid Algahtani, M. A. Abdelkawy, António M. Lopes . A pseudo-spectral scheme for variable order fractional stochastic Volterra integro-differential equations. AIMS Mathematics, 2022, 7(8): 15453-15470. doi: 10.3934/math.2022846 |
[6] | Zihan Yue, Wei Jiang, Boying Wu, Biao Zhang . A meshless method based on the Laplace transform for multi-term time-space fractional diffusion equation. AIMS Mathematics, 2024, 9(3): 7040-7062. doi: 10.3934/math.2024343 |
[7] | A.S. Hendy, R.H. De Staelen, A.A. Aldraiweesh, M.A. Zaky . High order approximation scheme for a fractional order coupled system describing the dynamics of rotating two-component Bose-Einstein condensates. AIMS Mathematics, 2023, 8(10): 22766-22788. doi: 10.3934/math.20231160 |
[8] | Yones Esmaeelzade Aghdam, Hamid Mesgarani, Zeinab Asadi, Van Thinh Nguyen . Investigation and analysis of the numerical approach to solve the multi-term time-fractional advection-diffusion model. AIMS Mathematics, 2023, 8(12): 29474-29489. doi: 10.3934/math.20231509 |
[9] | Bin Fan . Efficient numerical method for multi-term time-fractional diffusion equations with Caputo-Fabrizio derivatives. AIMS Mathematics, 2024, 9(3): 7293-7320. doi: 10.3934/math.2024354 |
[10] | Dina Abdelhamid, Wedad Albalawi, Kottakkaran Sooppy Nisar, A. Abdel-Aty, Suliman Alsaeed, M. Abdelhakem . Mixed Chebyshev and Legendre polynomials differentiation matrices for solving initial-boundary value problems. AIMS Mathematics, 2023, 8(10): 24609-24631. doi: 10.3934/math.20231255 |
The purpose of this paper is to establish a numerical method for solving time-fractional diffusion equations. To obtain the numerical solution, a binary reproducing kernel space is defined, and the orthonormal basis is constructed based on Legendre polynomials in this space. In order to find the ε-approximation solution of time-fractional diffusion equations, which is defined in this paper, the algorithm is designed using the constructed orthonormal basis. Some numerical examples are analyzed to illustrate the procedure and confirm the performance of the proposed method. The results faithfully reveal that the presented method is considerably accurate and effective, as expected.
In the past few decades, more and more diffusion processes have been shown to not satisfy Fickian laws, such as signal transduction in biological cells, foraging behavior of animals, viscoelastic and viscoplastic flow, and solute migration in groundwater. However, fractional partial differential equations (FPDEs) play a very important role in describing anomalous diffusion Ref. [1,2,3], so in recent years, FPDEs have attracted extensive attention. In this paper, we study one type of time-fractional diffusion equation (TFDE), which can be obtained from the standard diffusion equation by replacing the first-order time derivative with a fractional derivative of order α, 0<α<1.
{Dαtu(x,t)=uxx(x,t)+f(x,t),(x,t)∈(0,b)×(0,T],u(x,0)=u0(x),x∈[0,b],u(0,t)=0),u(b,t)=0,t∈[0,T]. | (1.1) |
Where u0(x) is a smooth function and Dαtu(x,t) is the Caputo fractional derivative defined by Definition 2.1.
The exact solutions of most fractional differential equations are difficult to obtain analytically, and even if they can be obtained, most of them contain special functions that are difficult to calculate. In recent years, many numerical methods have been proposed. For example, Ref. [4,5] used finite difference to solve the fractional diffusion equation. Yang et al. [6] used the finite volume method to solve the nonlinear fractional diffusion equation. Jin et al. studied the finite element method for solving the homogeneous fractional diffusion equation in [7]. Some scholars have developed meshless methods [8,9,10,11] and spectral methods [12,13,14,15] to solve fractional diffusion equations.
The reproducing kernel space and its related theories are the ideal spatial framework for function approximation [16,17]. The function approximation in this space has uniform convergence, while the Caputo-type fractional derivative of the approximate function still has uniform convergence. Therefore, the reproducing kernel space is also the ideal spatial framework for the numerical processing of Caputo-type fractional derivatives. Numerical solutions to differential equations based on orthogonal polynomials are commonly used. For example, quartic splines and cubic splines are used, respectively, to solve numerical solutions of differential equations in Ref. [18,19,20]. In Ref. [21,22,23], based on the idea of wavelet, a multi-scale orthonormal basis is constructed in the reproducing kernel space by using piecewise polynomials, and ε-approximate solutions of integer-order differential equations are obtained.
For TFDE, most methods use the finite difference method to deal with time variables. Due to the non-singularity of fractional differentiation, the difference scheme at the initial time needs to be further transformed. And the results are not ideal; when the step size reaches 0.001, the error is only 10−5 in Ref. [10]. So, the main motivation of this paper is to obtain the ε-approximation solution of TFDE. By constructing a multiscale orthonormal basis in the multiple reproducing kernel space, a numerical algorithm is designed to obtain the approximate solution of TFDE. In order to avoid the influence of fractional non-singularity, this paper constructs the orthonormal basis by using Legendre polynomials, which can be operated by the property of fractional differentiation. In addition, the method in this paper has a good convergence order.
The paper is organized as follows: In Section 2, the fundamental definitions are provided, and Legendre polynomials and related spaces are introduced. In Section 3, the ε-approximation solutions are given. In Section 4, convergence analysis and time complexity are presented for the proposed method. In Section 5, numerical solutions for several fractional diffusion equations are presented. The paper concludes by stating the advantages of the method.
In this section, the Caputo fractional derivative and its properties are introduced. Legendre polynomials and their associated spaces are also discussed. This knowledge will be used when constructing the basis.
Definition 2.1. The Caputo fractional derivative is defined as follows [24]:
Dαtu(t)=1Γ(n−α)∫t0(t−s)n−α−1u(n)(s)ds,n=[α]+1,n−1<α<n. |
For ease of calculation, a property of the Caputo differential needs to be given here.
Property 2.1.
Dα(tγ)={Γ(γ+1)Γ(γ+1−α)tγ−α,γ≠0,0,γ=0. | (2.1) |
Proof. According to the definition of Caputo differentiation, the conclusion can be obtained using integration by parts.
Legendre polynomials are known to be orthogonal on L2[−1,1]. Since the variables being analyzed are often defined in different intervals, it is necessary to transform Legendre polynomials on [0,b]. Legendre polynomials defined on [0, b] are shown below
l0(x)=1,l1(x)=2xb−1,lj+1(x)=2j+1j+1(2xb−1)lj(x)−jj+1lj−1(x),j=1,2,⋯ |
Clearly, {lj(x)}∞j=0 is orthogonal on L2[0,b], and
∫bxli(x)lj(x)dx={b2j+1,i=j,0,i≠j. |
Let pj(x)=√2j+1blj(x), {pj(x)}∞j=0 is an orthonormal basis on L2[0,b].
Consider Eq (1.1); this section gives the following reproducing kernel space. For convenience, the absolutely continuous function is denoted as AC.
Definition 2.2. W1[0,T]={u(t)∣u(0)=0,uisAC,u′∈L2[0,T]}, and
⟨u,v⟩W1=∫T0u′v′dt,u,v∈W1[0,T]. |
If b=T and Tj(t)=pj(t), note that Tj(t)=j∑k=0cktk. Let
J0Tj(t)=∫t0Tj(τ)dτ=j∑k=0cktk+1k+1. |
Theorem 2.1. {J0Tj(t)}∞j=0 is an orthonormal basis on W1[0,T].
Definition 2.3. W2[0,b]={u(x)∣u(0)=u(b)=0,uisAC,u′′∈L2[0,b]}, and
⟨u,v⟩W2=∫b0u′′v′′dx,u,v∈W2[0,b]. |
Similarly, denote pj(x)=j∑k=0dkxk. Integrating pj(x) twice yields J20pj(x), if J20pj(x)∈W2[0,b], then
J20pj(x)=j∑k=0dkxk+2−bk+1x(k+1)(k+2). |
Obviously, {J20pj(x)}∞j=0 is an orthonormal basis on W2[0,b].
Put Ω=[0,b]×[0,T], and let's define the space W(Ω).
Definition 2.4. W(Ω)={u(x,t)∣u(x,0)=0,u(0,t)=u(b,t)=0,∂u∂x is continuous functions, ∂3u∂t∂x2∈L2(Ω)}.
Clearly, W(Ω) is an inner product space, and
⟨u,v⟩W(Ω)=∬Ω∂3u∂t∂x2∂3v∂t∂x2dσ,u,v∈W(Ω). |
Theorem 2.2. If u(x,t),v(x,t)∈W(Ω), and v(x,t)=v1(x)v2(t), then
⟨u,v⟩W(Ω)=⟨⟨u,v2⟩W1,v1⟩W2=⟨⟨u,v1⟩W2,v2⟩W1. |
Proof. Clearly,
⟨u,v⟩W(Ω)=∬Ω∂3u∂t∂x2∂3v∂t∂x2dσ=∬Ω∂∂t(∂2u∂x2)∂v2∂t∂2v1∂x2dσ=∫b0∂2∂x2(⟨u,v2⟩W1)∂2v1∂x2dx=⟨⟨u,v2⟩W1,v1⟩W2. |
Similarly, ⟨u,v⟩W(Ω)=⟨⟨u,v1⟩W2,v2⟩W1.
Note
ϕij(x,t)=J20pi(x)J0Tj(t),i,j=0,1,2,⋯. |
Theorem 2.3. {ϕij(x,t)}∞i,j=0 is an orthonormal basis on W(Ω).
Proof. First of all, orthogonality. For ∀ϕij(x,t),ϕmn(x,t)∈W(Ω), according to Theorem 2.2,
⟨ϕij(x,t),ϕmn(x,t)⟩W(Ω)=⟨J20pi(x),J20pm(x)⟩W2⟨J0Tj(t),J0Tj(t)⟩W1={1,i=m,j=n,0,others. |
Second, completeness. ∀u∈W(Ω), if ⟨u,ϕij⟩W(Ω)=0 means u≡0. In fact, by Theorem 2.4,
⟨u,ϕij⟩W(Ω)=⟨u,J20pi(x)J0Tj(t)⟩W(Ω)=⟨⟨u,J20pi(x)⟩W2,J0Tj(t)⟩W1=⟨⟨u,J0Tj(t)⟩W1,J20pi(x)⟩W2=0. |
Since {J20pi(x)}∞i=0 and {J0Tj(t)}∞j=0 are complete systems of W2[0,b] and W1[0,T], respectively, ⟨u,J20pi(x)⟩W2=0 and ⟨u,J0Tj(t)⟩W1=0. So u≡0.
Let L:W(Ω)→L2(Ω),
Lu=Dαtu−uxx. |
Then Eq (1.1) is
Lu=f. | (3.1) |
Theorem 3.1. Operator L is a bounded and linear operator.
Proof. Clearly, L is linear, and one only needs to prove boundedness. According to Cauchy Schwartz's inequality, we derive that
‖Lu‖L2≤‖Dαtu‖L2+‖uxx‖L2. |
Put K(x,t,y,s)=r(x,y)q(t,s) be the RK function in W(Ω), then
|uxx|=|⟨u(x,t),∂2K∂x2⟩W(Ω)|=|⟨u(x,t),∂2r(x,y)∂x2q(t,s)⟩W(Ω)|≤‖∂2r(x,y)∂x2q(t,s)‖W(Ω)‖u‖W(Ω). | (3.2) |
Similarly
|ut|≤‖∂q(t,s)∂tr(x,y)‖W(Ω)‖u‖W(Ω). | (3.3) |
By Eq (3.2), there exists positive constants M1 such that
‖uxx‖2L2=∬Ω(uxx)2dσ≤‖∂2r(x,y)∂x2q(t,s)‖2W(Ω)SΩ‖u‖2W(Ω)=M1‖u‖2W(Ω), | (3.4) |
where M1=‖∂2r(x,y)∂x2q(t,s)‖2W(Ω)SΩ, SΩ represents the area of the region Ω.
By Eq (3.3), there exist positive constants M2,M3, such that
|Dαtu|=|1Γ(1−α)∫t0(t−s)−αut(x,s)ds|≤1Γ(1−α)∫t0(t−s)−α|ut(x,s)|ds≤1Γ(1−α)∫t0(t−s)−α‖∂q(t,s)∂tr(x,y)‖W(Ω)‖u‖W(Ω)ds≤‖u‖W(Ω)Γ(1−α)‖∂q(t,s)∂tr(x,y)‖W(Ω)∫t0(t−s)−αds≤t1−αΓ(2−α)‖∂q(t,s)∂tr(x,y)‖W(Ω)‖u‖W(Ω)=M2‖u‖W(Ω), |
and
‖Dαtu‖2L2=∬Ω(Dαtu)2dσ≤M22SΩ‖u‖2W(Ω)=M3‖u‖2W(Ω). | (3.5) |
From Eqs (3.4) and (3.5), we can get
‖Lu‖L2≤M‖u‖W(Ω), |
where M=√M1+√M3.
Definition 3.1. uε is named the ε-approximate solution for Eq (3.1), ∀ε>0, if
‖Luε−f‖2L2<ε2. |
Ref. [21,22] proved the existence of ε−approximate solutions to boundary value problems of linear ordinary differential equations. Using the same method, we can prove that the ε-approximate solution of Eq (3.1) exists.
Theorem 3.2. ∀ε>0, ∃N1,N2>0, when n1>N1,n2>N2,
uεn1n2(x,t)=n1∑i=0n2∑j=0c∗ijϕij(x,t) |
is the ε-approximate solution of Eq (3.1), where c∗ij satisfies
‖n1∑i=0n2∑j=0c∗ijLϕij(x,t)−f(x,t)‖2L2=mincij‖n1∑i=0n2∑j=0cijLϕij(x,t)−f(x,t)‖2L2. |
Proof. Let u(x,t) be the solution of Eq (3.1),
u(x,t)=∞∑i=0∞∑j=0cijϕij(x,t), |
where cij=⟨u,ϕij⟩W(Ω), and un1n2(x,t)=∑n1i=0∑n2j=0cijϕij(x,t).
Because L is a bounded operator, ∀ε>0, ∃N1,N2>0, when n1>N1,n2>N2,
‖u−un1n2‖2W(Ω)=‖∞∑i=n1+1∞∑j=n2+1cijϕij(x,t)‖2W(Ω)≤ε‖L‖2, |
so
‖Luεn1n2−f‖2L2=‖n1∑i=0n2∑j=0c∗ijLϕij−f‖2L2=mindij‖n1∑i=0n2∑j=0dijLϕij−f‖2L2≤‖n1∑i=0n2∑j=0cijLϕij−f‖2L2≤‖Lun1n2−Lu‖2L2≤‖L‖2‖un1n2−u‖2L2≤ε. |
From Theorem 3.2, note
J(c00,c01,c02,⋯,cN1N2)=‖n1∑i=0n2∑j=0cijLϕij(x,t)−f(x,t)‖2L2, |
J is a quadratic form about c=(cij)n1,n2i,j=0, and c∗=(c∗ij)n1,n2i,j=0 is the minimum value of J. To find c∗, just need ∂J∂cij=0. That is
∂J∂cij=2n1∑i=0n2∑k=0cik⟨Lϕij,Lϕkl⟩L2−2cij⟨Lϕij,f⟩L2, |
so
n1∑i=0n2∑k=0cik⟨Lϕij,Lϕkl⟩L2=⟨Lϕij,f⟩L2. | (3.6) |
Put N=(n1+1)×(n2+1), and the N-order matrix A and the N-order vector b,
A=(⟨Lϕij,Lϕkl⟩L2)N×N,b=(⟨Lϕij,f⟩L2)N, |
so Eq (3.6) is
Ac=b. | (3.7) |
From Property 2.1,
Lϕij=Dαtϕij−∂2ϕij∂x2=J20pi(x)DαtJ0Tj(t)−pi(x)J0Tj(t)=J20pi(x)j∑k=0ckk+1Γ(k+2)tk+1−αΓ(k+2−α)−pi(x)J0Tj(t). |
From Ref. [21], if L is reversible, then Eq (3.7) exists and is unique.
Let u(x,t) be the exact solution to Eq (3.1), and
u(x,t)=∞∑i=0∞∑j=0cijϕij(x,t). |
Fourier truncation of u(x,t) is uN1,N2(x,t), and
uN1N2(x,t)=N1∑i=0N2∑j=0cijϕij(x,t). |
In Ref. [25], if u(m)(x)∈L2[0,b], then
‖u−un‖L2≤Cn−m(m∑k=min{m,n+1}‖u(k)‖2L2)12. | (4.1) |
Theorem 4.1. Assume ∂m+nu(x,t)∂tm∂xn∈L2(Ω), then
‖u(x,t)−uN1(x,t)‖W(Ω)≤C1N−m1,‖u(x,t)−uN2(x,t)‖W(Ω)≤C2N−n2, |
where C1,C2 are constants.
Proof. Recalling the definition of W(Ω), we get
‖u(x,t)−uN1(x,t)‖2W(Ω)=∬Ω∂3(u−uN1)∂t∂x2∂3(u−uN1)∂t∂x2dxdt=∫b0∫T0∂∂t(∂2(u−uN1)∂x2)∂∂t(∂2(u−uN1)∂x2)dtdx=∫b0‖∂2u∂x2−∂2uN1∂x2‖2W1dx. |
According to Eq (4.1), it follows that
‖∂2u∂x2−∂2uN1∂x2‖W1=‖∂3u∂x2∂t−∂3uN1∂x2∂t‖L2[0,T]≤C(x)N−m1(m∑k=min{m,N1+1}‖u(k+1)xx‖2L2[0,T])1/2, |
so
‖u(x,t)−uN1(x,t)‖2W(Ω)≤∫b0C2(x)N−2m1(m∑k=min{m,N−1+1}‖u(k+1)xx‖2L2[0,T])dx≤N−2m1∫b0C2(x)(m∑k=min{m,N1+1}‖u(k+1)xx‖2L2[0,T])dx≤C0N−2m1, |
where C0=∫baC2(x)(m∑k=min{m,N1+1}‖u(k+1)xx‖2L2[0,T])dx. Assume C1=√C0; that is
‖u(x,t)−uN1(x,t)‖W1≤C1N−m1. |
Similarly,
‖u(x,t)−uN2(x,t)‖W(Ω)≤C2N−n2. |
Theorem 4.2. Assume ∂m+nw(x,t)∂tm∂xn∈L2(Ω), uεN1N2(x,t) is the approximate solution of Eq (3.1), then
‖u(x,t)−uεN1N2(x,t)‖W(Ω)≤CN−γ, |
where C=2M2max{C1,C2}, N=min{N1,N2}, and γ=min{m,n}.
Proof. We know
‖u(x,t)−uεN1,N2(x,t)‖W(Ω)=‖L−1‖‖L‖‖u(x,t)−uN1,N2(x,t)‖W(Ω)≤M2‖N1∑i=0∞∑j=N1+1cijϕij(x,t)+∞∑i=N1+1∞∑j=0cijϕij(x,t)‖W(Ω)=M2(N1∑i=0∞∑j=N1+1c2ij+∞∑i=N1+1∞∑j=0c2ij), |
where M2=‖L−1‖‖L‖. Moreover,
‖u(x,t)−uN1(x,t)‖W(Ω)=‖∞∑i=0∞∑j=0cijϕij(x,t)−N1∑i=0∞∑j=0cijϕij(x,t)‖W(Ω)=‖∞∑i=N1+1∞∑j=0cijϕij(x,t)‖W(Ω)=∞∑i=N1+1∞∑j=0c2ij. |
‖u(x,t)−uN2(x,t)‖W(Ω)=‖∞∑i=0∞∑j=0cijϕij(x,t)−∞∑i=0N2∑j=0cijϕij(x,t)‖W(Ω)=‖∞∑i=0∞∑j=N2+1cijϕij(x,t)‖W(Ω)=∞∑i=0∞∑j=N2+1c2ij. |
So
‖u(x,t)−uεN1,N2(x,t)‖W(Ω)≤M2(N1∑i=0∞∑j=N1+1c2ij+∞∑i=N1+1∞∑j=0c2ij)≤M2(∞∑i=0∞∑j=N1+1c2ij+∞∑i=N1+1∞∑j=0c2ij)=M2(‖u(x,t)−uN2(x,t)‖W(Ω)+‖u(x,t)−uN1(x,t)‖W(Ω))≤M2(C1N−m1+C2N−n2)≤CNγ. |
So, the proposed method is γ-order convergence, and the convergence rate depends on N.
The proposal of an algorithm requires not only a reliable theory but also the feasibility of calculation. The huge calculation process is costly. Next, the time complexity of the algorithm will be analyzed.
According to the analysis in Section 3, the complexity of the algorithm depends on Eqs (3.6) and (3.7). Next, the algorithm can be illustrated in four steps, as follows:
(1) A of Eq (3.7). We know A=(⟨Lϕij,Lϕkl⟩L2)N×N, and
⟨Lϕij,Lϕkl⟩L2=∫10J20pi(x)J20pk(x)dx∫10J0Tj(t)J0Tl(t)dt. |
Set the number of multiplications required to compute ⟨Lϕij,Lϕkl⟩L2 as C1, where C1 is constant. Clearly, the computing time needed for A is Num1=C1N2.
(2) b of Eq (3.7). We know b=(⟨Lϕij,f⟩L2)N×N, and
⟨Lϕij,f⟩L2=∫10∫10J20pi(x)J0Tj(t)dtdx. |
Set the number of multiplications required to compute ⟨Lϕij,f⟩L2 as C2, where C1 is constant. Clearly, the computing time needed for b is Num2=C2N.
(3) We use the Gaussian elimination method to solve Eq (3.7). From my mathematical knowledge, Gaussian elimination requires operations
Num3=N(N+1)(2N+1))6. |
(4) To the ε−approximation solution uεN(x,t), the number of computations is N.
In summary, the multiplication times of this algorithm in the execution process are
Num=Num1+Num2+Num3+N=O(N3). |
This section discusses three numerical examples to reveal the accuracy of the proposed algorithm. Compared with Ref. [26,27,28,29], the results demonstrate that our method is remarkably effective. All the results are calculated using the mathematical software Mathematica 13.0.
In this paper, N=N1×N2 is the number of bases, and eN(x)=|u(x)−uN(x)| is the absolute error. MEN denotes the maximum absolute error when the number of bases is N. The convergence order can be calculated as follows:
C.R.=LogNMmax|eM|max|eN|. |
Example 5.1. Consider the test problem suggested in [26,27]
{Dαtu(x,t)=uxx(x,t)+f(x,t),(x,t)∈(0,1)×(0,1],u(x,0)=0,x∈(0,1),u(0,t)=0,u(1,t)=0, |
where f(x)=3√π4Γ(2.5−α)x4(x−1)t1.5−α−(20x3−12x2)t1.5, and the analytical solution is given by u(x,t)=x4(x−1)t1.5. The numerical results are shown in Tables 1 and 2. Table 1 shows that when α is 0.5 or 0.8, respectively, our results are better than those in Ref. [26,27]. Meanwhile, we also show the results when α=0.01 and α=0.99 in Table 1 and find that the results are not much different from those when a = 0.5 and a = 0.8, demonstrating the robustness of our method. Table 2 indicates that the absolute error gets better as the number of bases increases. Figures 1 and 2 shows the absolute errors when α=0.01 and α=0.99, respectively. Figures 3 and 4 show the absolute errors at different times when α=0.01 and α=0.99.
α(t) | MEN in [26] | MEN in [27] | ME36 | ME64 |
0.5 | 8.82×10−4 | 1.99×10−4 | 1.41×10−5 | 4.18×10−6 |
0.8 | 8.50×10−4 | 1.87×10−4 | 7.16×10−6 | 4.61×10−6 |
0.01 | 1.43×10−5 | 4.09×10−6 | ||
0.99 | 2.95×10−5 | 6.03×10−6 |
n | α=0.5 | C.R. | α=0.8 | C.R. |
9 | 8.08×10−3 | 7.75×10−3 | ||
16 | 6.07×10−4 | 4.50 | 6.12×10−5 | 8.41 |
25 | 2.75×10−5 | 6.93 | 2.76×10−5 | 1.78 |
36 | 1.41×10−5 | 1.83 | 1.41×10−5 | 1.84 |
49 | 8.10×10−6 | 1.80 | 8.04×10−6 | 1.82 |
64 | 4.18×10−6 | 2.48 | 4.61×10−6 | 2.08 |
Example 5.2. We consider the same FDEs as that in [28]
{Dαtu(x,t)=uxx(x,t)+f(x,t),(x,t)∈(0,1)×(0,1],u(x,0)=0,x∈(0,1),u(0,t)=0,u(1,t)=0. |
With f(x,t)=2Γ(3−α)t2−αsin(2πx)+4π2t2sin(2πx), the exact solution of the problem is given by u(x,t)=t2sin(2πx). Tables 3–5, respectively, show the comparison of absolute error and convergence order with Ref. [28] when α is 0.2, 0.5, or 0.8. Obviously, the proposed method is superior to Ref. [28]. N×L denotes the number of bases in Ref.[28].
[28] | Our method | |||||
N×L | ME | C.R. | N1×N2 | MEN | C.R. | |
25×L | 2.06×10−6 | 4.00 | 4×8 | 1.95×10−5 | ||
30×L | 1.00×10−6 | 4.00 | 4×10 | 3.11×10−7 | 18.54 | |
35×L | 5.39×10−7 | 4.00 | 4×12 | 2.72×10−9 | 25.99 | |
40×L | 3.15×10−7 | 4.01 | 4×14 | 3.21×10−11 | 28.79 |
[28] | Our method | |||||
N×L | ME | C.R. | N1×N2 | MEN | C.R. | |
25×L | 2.65×10−6 | 4.01 | 4×8 | 1.95×10−5 | ||
30×L | 9.96×10−7 | 4.03 | 4×10 | 3.10×10−7 | 18.56 | |
35×L | 5.35×10−7 | 4.06 | 4×12 | 3.72×10−9 | 24.25 | |
40×L | 3.11×10−7 | 4.11 | 4×14 | 1.29×10−10 | 36.74 |
[28] | Our method | |||||
N×L | ME | C.R. | N1×N2 | MEN | C.R. | |
25×L | 2.03×10−6 | 4.13 | 4×8 | 1.93×10−5 | ||
30×L | 9.65×10−7 | 4.30 | 4×10 | 3.08×10−7 | 18.54 | |
35×L | 5.04×10−7 | 4.61 | 4×12 | 3.08×10−9 | 24.69 | |
40×L | 2.85×10−7 | 5.18 | 4×14 | 4.80×10−10 | 13.11 |
Example 5.3. Considering the following problem with f(x,t)=Γ(4+α)6sin(πx)+π2t3+αsin(πx)+πt3+αcos(πx) [29]:
{Dαtu(x,t)=uxx(x,t)−ux+f(x,t),(x,t)∈(0,1)×(0,1],u(x,0)=0,x∈(0,1),u(0,t)=0,u(1,t)=0. |
The exact solution of the problem is given by u(x,t)=t3+αsin(πx). Table 6 shows the comparison of absolute error and convergence order with Ref. [29] when α is 0.1. Obviously, the proposed method is superior to Ref. [29]. Figures 5–7 show the absolute errors when α=0.1, α=0.01 and α=0.99 respectively.
[29] | Our method | |||||
N×L | ME | C.R. | N1×N2 | MEN | C.R. | |
20×20 | 1.44×10−3 | – | 3×3 | 1.40×10−3 | – | |
40×40 | 3.66×10−4 | 1.98 | 5×5 | 1.83×10−5 | 4.01 | |
80×80 | 9.15×10−5 | 1.98 | 7×7 | 2.89×10−6 | 3.09 | |
160×160 | 2.31×10−5 | 1.98 | 9×9 | 2.83×10−7 | 4.62 |
In this paper, an effective numerical algorithm based on Legendre polynomials is proposed for TFDE. Based on Legendre polynomials, an orthonormal basis is constructed in the reproducing kernel spaces W1[0,1] and W2[0,b]. Then we define the multiple reproducing kernel space and develop the orthonormal basis in this space. The ε-approximate solution of TFDE is obtained. From the above analysis and the numerical examples, it is clear that the presented method is successfully employed for solving TFDE. The numerical results show that our method is much more accurate than other algorithms. In this paper, because the orthonormal basis constructed in the binary reproducing kernel space contains power terms, the properties of fractional differentiation can be used to calculate fractional differentiation, so as to eliminate the influence of the non-singularity of fractional differentiation. However, the method presented in this paper is suitable for the case where the initial boundary value condition is 0, and for the non-zero case, it needs to be further simplified to the cases where the initial boundary value condition is 0. We are also trying to design methods for cases where initial boundary values are non-zero.
Yingchao Zhang: Conceived of the study, designed the study, and proved the convergence of the algorithm; Yingzhen Lin: Reviewed the full text. All authors were involved in writing the manuscript. All authors read and approved the final manuscript.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This study was supported by the Characteristic Innovative Scientific Research Project of Guangdong Province (2023KTSCX181, 2023KTSCX183) and Basic and Applied Basic Research Project Zhuhai City (2320004002520)
The authors have no conflicts of interest to declare.
[1] |
D. A. Benson, S. W. Wheatcraft, M. M. Meerschaert, The fractional-order governing equation of Levy motion, Water Resour. Res., 36 (2000), 1413–1423. https://doi.org/10.1029/2000WR900032 doi: 10.1029/2000WR900032
![]() |
[2] |
R. L. Magin, Fractional calculus in bioengineering, Crit. Rev. Biomed. Eng., 32 (2004), 1–104. https://doi.org/10.1615/critrevbiomedeng.v32.i1.10 doi: 10.1615/critrevbiomedeng.v32.i1.10
![]() |
[3] |
M. Raberto, E. Scalas, F. Mainardi, Waiting-times and returns in high-frequency financial data: An empirical study, Phys. A, 314 (2002), 749–755. https://doi.org/10.1016/S0378-4371(02)01048-8 doi: 10.1016/S0378-4371(02)01048-8
![]() |
[4] |
A. M. Vargas, Finite difference method for solving fractional differential equations at irregular meshes, Math. Comput. Simul., 193 (2022), 204–216. https://doi.org/10.1016/j.matcom.2021.10.010 doi: 10.1016/j.matcom.2021.10.010
![]() |
[5] |
M. Cui, Compact finite difference method for the fractional diffusion equation, J. Comput. Phys., 228 (2009), 7792–7804. https://doi.org/10.1016/j.jcp.2009.07.021 doi: 10.1016/j.jcp.2009.07.021
![]() |
[6] |
X. H. Yang, Q. Zhang, G. W. Yuan, Z. Q. Sheng, On positivity preservation in nonlinear finite volume method for multi-term fractional subdiffusion equation on polygonal meshes, Nonlinear Dyn., 92 (2018), 595–612. https://doi.org/10.1007/s11071-018-4077-5 doi: 10.1007/s11071-018-4077-5
![]() |
[7] |
B. T. Jin, R. Lazarov, Z. Zhou, Error estimates for a semidiscrete finite element method for fractional order parabolie equations, SIAM J. Numer. Anal., 51 (2013), 445–466. https://doi.org/10.1137/120873984 doi: 10.1137/120873984
![]() |
[8] |
A. Mardani, M. R. Hooshmandasl, M. H. Heydari, C. Cattani, A meshless method for solving the time fractional advection-diffusion equation with variable coefficients, Comput. Math. Appl., 75 (2018), 122–133. https://doi.org/10.1016/j.camwa.2017.08.038 doi: 10.1016/j.camwa.2017.08.038
![]() |
[9] |
M. Dehghan, M. Abbaszadeh, A. Mohebbi, Analysis of a meshless method for the time fractional diffusion-wave equation, Numer. Algor., 73 (2016), 445–476. https://doi.org/10.1007/s11075-016-0103-1 doi: 10.1007/s11075-016-0103-1
![]() |
[10] |
V. R. Hosseini, M. Koushki, W. N. Zou, The meshless approach for solving 2D variable-order time-fractional advection–diffusion equation arising in anomalous transport, Eng. Comput., 38 (2022), 2289–2307. https://doi.org/10.1007/s00366-021-01379-7 doi: 10.1007/s00366-021-01379-7
![]() |
[11] |
W. N. Zou, Y. Tang, V. R. Hosseini, The numerical meshless approachfor solving the 2D time nonlinear multiterm fractional cable equation in complex geometries, Fractals, 30 (2022), 2240170. https://doi.org/10.1142/S0218348X22401703 doi: 10.1142/S0218348X22401703
![]() |
[12] |
F. Zeng, F. Liu, C. Li, K. Burrage, I. Turner, V. Anh, Crank-Nicolson ADI spectral method for the two-dimensional Riesz space fractional nonlinear reaction-diffusion equation, SIAM J. Numer. Anal., 52 (2014), 2599–2622. https://doi.org/10.1137/130934192 doi: 10.1137/130934192
![]() |
[13] |
Z. Mao, G. E. Karniadakis, A spectral method (of exponential convergence) for singular solutions of the diffusion equation with general two-sided fractional derivative, SIAM J. Numer. Anal., 56 (2018), 24–49. https://doi.org/10.1137/16M1103622 doi: 10.1137/16M1103622
![]() |
[14] |
Y. Lin, C. Xu, Finite difference/spectral approximations for the time-fractional diffusion equation, J. Comput. Phys., 225 (2007), 1533–1552. https://doi.org/10.1016/j.jcp.2007.02.001 doi: 10.1016/j.jcp.2007.02.001
![]() |
[15] |
E. H. Doha, A. H. Bhrawy, S. S. Ezz-Eldien, Efficient Chebyshev spectral methods for solving multi-term fractional orders differential equations, Appl. Math. Model., 35 (2011), 5662–5672. https://doi.org/10.1016/j.apm.2011.05.011 doi: 10.1016/j.apm.2011.05.011
![]() |
[16] |
N. Aronszain, Theory of reproducing kernels, Trans. Amer. Math. Soc., 68 (1950), 337–404. https://doi.org/10.1090/S0002-9947-1950-0051437-7 doi: 10.1090/S0002-9947-1950-0051437-7
![]() |
[17] | M. Cui, B. Wu, Numerical analysis of reproducing kernel spaces, (Chinese), Beijing: Science Press, 2004. |
[18] |
Fazal-i-Haq, Siraj-ul-Islam, I. A. Tirmizi. A numerical technique for solution of the MRLW equation using quartic B-splines, Appl. Math. Model., 34 (2010), 4151–4160. https://doi.org/10.1016/j.apm.2010.04.012 doi: 10.1016/j.apm.2010.04.012
![]() |
[19] |
A. Iqbala, N. N. Abd Hamida, A. I. Md. Ismaila, Cubic B-spline Galerkin method for numerical solution of the coupled nonlinear Schrodinger equation, Math. Comput. Simula., 174 (2020), 32–44. http://dx.doi.org/10.1016/j.matcom.2020.02.017 doi: 10.1016/j.matcom.2020.02.017
![]() |
[20] |
A. Iqbala, N. N. Abd Hamida, A. I. Md. Ismaila, Soliton solution of Schrodinger equation using Cubic B-spline Galerkin method, Fluids, 4 (2019), 108. https://doi.org/10.3390/fluids4020108 doi: 10.3390/fluids4020108
![]() |
[21] |
Y. C. Zhang, H. B. Sun, Y. T. Jia, Y. Z. Lin, An algorithm of the boundary value problem based on multiscale orthogonal compact base, Appl. Math. Lett., 101 (2020), 106044. https://doi.org/10.1016/j.aml.2019.106044 doi: 10.1016/j.aml.2019.106044
![]() |
[22] |
Y. C. Zhang, L. C. Mei, Y. Z. Lin, A new method for high-order boundary value problems, Bound. Value Probl., 2021 (2021), 48. https://doi.org/10.1186/s13661-021-01527-4 doi: 10.1186/s13661-021-01527-4
![]() |
[23] |
Y. C. Zhang, L. C. Mei, Y. Z. Lin, A novel method for nonlinear boundary value problems based on multiscale orthogonal base, Int. J. Comp. Methods, 18 (2021), 2150036. https://doi.org/10.1142/S0219876221500365 doi: 10.1142/S0219876221500365
![]() |
[24] | F. Liu, P. Zhuang, Q. Liu, Numerical methods of fractional partial differential equations and applications, (Chinese), Beijing: Science Press, 2015. |
[25] | C. Canuto, M. Y. Hussaini, A. Quarteroni, T. A. Zang, Spectral methods: Fundamentals in single domains, Heidelberg: Springer Berlin, 2006. https://doi.org/10.1007/978-3-540-30726-6 |
[26] |
B. P. Moghaddam, J. A. T. Machado, A stable three-level explicit spline finite difference scheme for a class of nonlinear time variable order fractional partial differential equations, Comput. Math. Appl., 73 (2017), 1262–1269. https://doi.org/10.1016/j.camwa.2016.07.010 doi: 10.1016/j.camwa.2016.07.010
![]() |
[27] |
H. Liao, Y. Zhang, Y. Zhao, H. Shi, Stability and convergence of modified du fort-frankel schemes for solving time-fractional subdiffusion equations, J. Sci. Comput., 61 (2014), 629–648. https://doi.org/10.1007/s10915-014-9841-1 doi: 10.1007/s10915-014-9841-1
![]() |
[28] |
Y. Jiang, J. Ma, High-order finite element methods for time-fractional partial differential equations, J. Comput. Appl. Math., 235 (2011), 3285–3290. https://doi.org/10.1016/j.cam.2011.01.011 doi: 10.1016/j.cam.2011.01.011
![]() |
[29] |
J. Liu, J. Zhang, X. D. Zhang, Semi-discretized numerical solution for time fractional convection-diffusion equation by RBF-FD, Appl. Math. Lett., 128 (2022), 107880. https://doi.org/10.1016/j.aml.2021.107880 doi: 10.1016/j.aml.2021.107880
![]() |
1. | Yaroslav Pyanylo, Sofiya Tvardovska, Halyna Pyanylo, 2024, The Spectral Methods of Investigation the Processes of Heterodiffusion in the Terms of Fractional Derivatives, 979-8-3503-5004-3, 186, 10.1109/ACIT62333.2024.10712458 | |
2. | Hui Zhu, Lei Yang, Ruimin Zhang, Yingchao Zhang, Yingzhen Lin, A new coupling algorithm for fractional diffusion equations based on multiscale functions, 2025, 121, 11100168, 379, 10.1016/j.aej.2025.02.041 |
n | α=0.5 | C.R. | α=0.8 | C.R. |
9 | 8.08×10−3 | 7.75×10−3 | ||
16 | 6.07×10−4 | 4.50 | 6.12×10−5 | 8.41 |
25 | 2.75×10−5 | 6.93 | 2.76×10−5 | 1.78 |
36 | 1.41×10−5 | 1.83 | 1.41×10−5 | 1.84 |
49 | 8.10×10−6 | 1.80 | 8.04×10−6 | 1.82 |
64 | 4.18×10−6 | 2.48 | 4.61×10−6 | 2.08 |
[28] | Our method | |||||
N×L | ME | C.R. | N1×N2 | MEN | C.R. | |
25×L | 2.06×10−6 | 4.00 | 4×8 | 1.95×10−5 | ||
30×L | 1.00×10−6 | 4.00 | 4×10 | 3.11×10−7 | 18.54 | |
35×L | 5.39×10−7 | 4.00 | 4×12 | 2.72×10−9 | 25.99 | |
40×L | 3.15×10−7 | 4.01 | 4×14 | 3.21×10−11 | 28.79 |
[28] | Our method | |||||
N×L | ME | C.R. | N1×N2 | MEN | C.R. | |
25×L | 2.65×10−6 | 4.01 | 4×8 | 1.95×10−5 | ||
30×L | 9.96×10−7 | 4.03 | 4×10 | 3.10×10−7 | 18.56 | |
35×L | 5.35×10−7 | 4.06 | 4×12 | 3.72×10−9 | 24.25 | |
40×L | 3.11×10−7 | 4.11 | 4×14 | 1.29×10−10 | 36.74 |
[28] | Our method | |||||
N×L | ME | C.R. | N1×N2 | MEN | C.R. | |
25×L | 2.03×10−6 | 4.13 | 4×8 | 1.93×10−5 | ||
30×L | 9.65×10−7 | 4.30 | 4×10 | 3.08×10−7 | 18.54 | |
35×L | 5.04×10−7 | 4.61 | 4×12 | 3.08×10−9 | 24.69 | |
40×L | 2.85×10−7 | 5.18 | 4×14 | 4.80×10−10 | 13.11 |
[29] | Our method | |||||
N×L | ME | C.R. | N1×N2 | MEN | C.R. | |
20×20 | 1.44×10−3 | – | 3×3 | 1.40×10−3 | – | |
40×40 | 3.66×10−4 | 1.98 | 5×5 | 1.83×10−5 | 4.01 | |
80×80 | 9.15×10−5 | 1.98 | 7×7 | 2.89×10−6 | 3.09 | |
160×160 | 2.31×10−5 | 1.98 | 9×9 | 2.83×10−7 | 4.62 |
α(t) | MEN in [26] | MEN in [27] | ME36 | ME64 |
0.5 | 8.82×10−4 | 1.99×10−4 | 1.41×10−5 | 4.18×10−6 |
0.8 | 8.50×10−4 | 1.87×10−4 | 7.16×10−6 | 4.61×10−6 |
0.01 | 1.43×10−5 | 4.09×10−6 | ||
0.99 | 2.95×10−5 | 6.03×10−6 |
n | α=0.5 | C.R. | α=0.8 | C.R. |
9 | 8.08×10−3 | 7.75×10−3 | ||
16 | 6.07×10−4 | 4.50 | 6.12×10−5 | 8.41 |
25 | 2.75×10−5 | 6.93 | 2.76×10−5 | 1.78 |
36 | 1.41×10−5 | 1.83 | 1.41×10−5 | 1.84 |
49 | 8.10×10−6 | 1.80 | 8.04×10−6 | 1.82 |
64 | 4.18×10−6 | 2.48 | 4.61×10−6 | 2.08 |
[28] | Our method | |||||
N×L | ME | C.R. | N1×N2 | MEN | C.R. | |
25×L | 2.06×10−6 | 4.00 | 4×8 | 1.95×10−5 | ||
30×L | 1.00×10−6 | 4.00 | 4×10 | 3.11×10−7 | 18.54 | |
35×L | 5.39×10−7 | 4.00 | 4×12 | 2.72×10−9 | 25.99 | |
40×L | 3.15×10−7 | 4.01 | 4×14 | 3.21×10−11 | 28.79 |
[28] | Our method | |||||
N×L | ME | C.R. | N1×N2 | MEN | C.R. | |
25×L | 2.65×10−6 | 4.01 | 4×8 | 1.95×10−5 | ||
30×L | 9.96×10−7 | 4.03 | 4×10 | 3.10×10−7 | 18.56 | |
35×L | 5.35×10−7 | 4.06 | 4×12 | 3.72×10−9 | 24.25 | |
40×L | 3.11×10−7 | 4.11 | 4×14 | 1.29×10−10 | 36.74 |
[28] | Our method | |||||
N×L | ME | C.R. | N1×N2 | MEN | C.R. | |
25×L | 2.03×10−6 | 4.13 | 4×8 | 1.93×10−5 | ||
30×L | 9.65×10−7 | 4.30 | 4×10 | 3.08×10−7 | 18.54 | |
35×L | 5.04×10−7 | 4.61 | 4×12 | 3.08×10−9 | 24.69 | |
40×L | 2.85×10−7 | 5.18 | 4×14 | 4.80×10−10 | 13.11 |
[29] | Our method | |||||
N×L | ME | C.R. | N1×N2 | MEN | C.R. | |
20×20 | 1.44×10−3 | – | 3×3 | 1.40×10−3 | – | |
40×40 | 3.66×10−4 | 1.98 | 5×5 | 1.83×10−5 | 4.01 | |
80×80 | 9.15×10−5 | 1.98 | 7×7 | 2.89×10−6 | 3.09 | |
160×160 | 2.31×10−5 | 1.98 | 9×9 | 2.83×10−7 | 4.62 |