Skip to main content
Scientific Reports logoLink to Scientific Reports
. 2023 Jan 27;13:1549. doi: 10.1038/s41598-023-28741-7

A new implicit high-order iterative scheme for the numerical simulation of the two-dimensional time fractional Cable equation

Muhammad Asim Khan 1,, Norma Alias 1, Ilyas Khan 2, Fouad Mohammad Salama 3,, Sayed M Eldin 4
PMCID: PMC9883294  PMID: 36707653

Abstract

In this article, we developed a new higher-order implicit finite difference iterative scheme (FDIS) for the solution of the two dimension (2-D) time fractional Cable equation (FCE). In the new proposed FDIS, the time fractional and space derivatives are discretized using the Caputo fractional derivative and fourth-order implicit scheme, respectively. Moreover, the proposed scheme theoretical analysis (convergence and stability) is also discussed using the Fourier analysis method. Finally, some numerical test problems are presented to show the effectiveness of the proposed method.

Subject terms: Applied mathematics, Computational science

Introduction

In the past few years, the popularity of fractional calculus increased due to its application in various branches of science and technology15. Many physical problems arise from different fields of sciences are mostly mathematically model using the fractional partial differential equations (FPDEs). These FPDEs are solved either using analytical or numerical methods but due to the complexity of FPDEs mostly it is difficult to solve using analytical methods610. Therefore, different numerical methods are used to solve these FPDEs e.g., finite difference, finite element, finite volume methods6,9,11. In these numerical methods, the finite difference method (FDM) is seen more in the literature because it is a simple and explicit method as compared to the other methods, especially the higher-order FDMs which converge fast as compared to the standard second-order FDMs.

In this article, the 2D-FCE is analyzed for the numerical solution using the higher-order FDM. The 2D-FCE is

0CDtγw(x,y,t)=2wx2+2wy2-μ0w(x,y,t)+g(x,y,t),(x,y)(Q1,Q2)×(Q3,Q4),t(0,T), 1

where Caputo fractional derivative is represented by 0CDtγw, (0<γ<1) and defined as12

0CDtγw(x,y,t)=1Γ(1-γ)0tw(τ)(t-τ)γdτ,

where Γ(.) is Gamma function.

The FCE is modeled from Nernst–Planck equation or obtained from relating electrical properties in cell membrane and used for the approximation of complex microscopic motions of ions in nerve cells13. Throughout the course of recent years research on neuronal dendrites has increased14 because of the revelation that dendrites are profoundly dynamic, with complex electrical and bio-compound flagging relying upon both nearby spine structure and density15, and on voltage-gated particle channels16. These methods present challenges to the cable equation17. But due to the complexity of FCE various researchers solve FCE using different numerical methods, for instance, Liu et al.18 used implicit numerical method having second-order spatial accuracy for one dimensional (1-D) FCE. Similarly, Chen et al.19 solved 1-D variable-order FCE using the numerical method with higher-order spatial accuracy. Zhang et al.20 computed the numerical solution spline collocation methods for the 2-D FCE. They analyze the theoretical analysis (convergence and stability) is discussed using the Fourier analysis method. Furthermore, Balasim and Ali21 solved 2-D FCE using the implicit schemes having the spatial accuracy of second-order. Bhrawy and Zaky22 used spectral collocation method for both 1-D and 2-D FCE which is based on shifted Jacobi collocation method combined with the Jacobi operational matrix for fractional derivative. Ömer23 discussed the numerical solution for 2-D FCE using a meshless numerical method which is based on the hybridization of Gaussian and cubic kernels. Moreover, the FCE is solved on both regular and irregular domains. Nasrin and Abbas24 used the collocation numerical method for the solution of 1-D FCE where the proposed method is based on the combination of Bernoulli polynomials and Sinc functions which reduce the time FCE to the set of algebraic equations. Minghui et al.25 solved the FCE using local discontinuous Galerkin method in which the fractional time and spatial derivatives are discretized using the BDF2 with the L2 formula and local discontinuous Galerkin method, respectively. Ying and Lizhen26 used finite difference/spectral method for the numerical solution of generalized FCE in which backward difference and the Galerkin spectral methods are used for the time and space derivative, respectively. Also, the theoretical analysis (stability and convergence analysis) of proposed method is also analyzed which shows that the proposed method is unconditional stable and convergent. Xiaolin and Shuling27 proposed a mesh-less finite point method for the solution of FCE, in which moving least squares approximation and mesh-less smoothed gradient are combined with the proposed method to increase the rate of accuracy and convergence in space. Moreover the theoretical analysis of the proposed method are also discussed. However, the higher order numerical computationally efficient methods for the solution of the FCE are still in their early infancy. Therefore, the main objective of this article is to propose an unconditional stable and convergent higher order FDIS for the solution of 2-D FCE.

The content of the article is organized as follows; the proposed implicit numerical scheme development is discussed in “Formulation of the FDIS”, similarly, in “Stability” and “Convergence”, the theoretical analysis (stability and convergence) of the FDIS. The numerical examples are presented in “Numerical experiements”. Finally, the summary of the article is discussed in “Conclusion”.

Formulation of the FDIS

To formulate the FDIS, the time and space dimensions are discretized as

x=ihx,y=jhy,hx=hy=h=1m,tk=τk,τ=1nsuch that,i,j=0,1,2,,m,k=0,1,2,,n.

where time and space steps are represented by τ and h respectively. Let δx2w=wi+1,jk-2wi,jk+wi-1,jk, then from Taylor series expansion

δx2wi,jk=2wx2|i,jk+h2124wx4|i,jk+h43606wx6|i,jk+O(h6), 2
δy2wi,jk=2wy2|i,jk+h2124wy4|i,jk+h43606wy6|i,jk+O(h6). 3

From (2) and (3)

2wx2|i,jk=1+112δx2-1δX2h2wi,jk+O(h4), 4
2wy2|i,jk=1+112δy2-1δy2h2wi,jk+O(h4). 5

The fractional discretization is28

γw(xi,yj,tk)tγ=τ-γΓ(2-γ)r=0k-1br(wi,jk-r-wi,jk-r-1)+O(τ2-γ),br=(r+1)1-γ-r1-γ,r={0,1,2,}. 6

By using (4), (5) and (6) , the FCE become

τ-γΓ(2-γ)r=0kbr(wi,jk+1-r-wi,jk-r)=1+112δx2-1δX2h2wi,jk+1+1+112δy2-1δy2h2wi,jk+1-μ0wi,jk+1+gi,jk+1+O(τ2-γ+h4),×1+112δx21+112δy2r=0kbr(wi,jk+1-r-wi,jk-r)=τγΓ(2-γ)h2δx2+δy2+16δx2δy2wi,jk+1-μ0τγΓ(2-γ)×1+112δx2wi,jk+1+τγΓ(2-γ)1+112δx21+112δy2gi,jk+1.

After simplification, the FDIS is

a0wi,jk+1=a1wi+1,jk+1+wi-1,jk+1+wi,j+1k+1+wi,j-1k+1+a2wi+1,j+1k+1+wi-1,j+1k+1+wi+1,j-1k+1+wi-1,j-1k+1+h22536wi,jk+572wi+1,jk+wi-1,jk+wi,j+1k+wi,j-1k+1144wi+1,j+1k+wi-1,j+1k+wi+1,j-1k+wi-1,j-1k+Gi,jk+1-h2r=1kbr2536wi,jk+1-r+572wi+1,jk+1-r+wi-1,jk+1-r+wi,j+1k+1-r+wi,j-1k+1-r+1144wi+1,j+1k+1-r+wi-1,j+1k+1-r+wi-1,j+1k+1-r+wi-1,j-1k+1-r-(2536wi,jk-r+572wi+1,jk-r+wi-1,jk-r+wi,j+1k-r+wi,j-1k-r+1144wi+1,j+1k-r+wi-1,j+1k-r+wi-1,j+1k-r+wi-1,j-1k-r), 7

where

g0=τγΓ(2-γ),a0=103g0+2536h2(1+g0),a1=23g0-572h2(1+g0),a2=g06-1144h2(1+g0),br=(r+1)1-γ-(r)1-γ,andGi,jk+1=g0h22536gi,jk+1+572(gi+1,jk+1+gi-1,jk+1+gi,j+1k+1+gi,j-1k+1+1144(gi+1,j+1k+1+gi-1,j+1k+1+gi+1,j-1k+1+gi-1,j-1k+1).

Figure 1 shows nine points on the grid, while In Fig. 2, the computational molecule of FDIS (7) is presented , where n0=2518b2g0, n1=536b2g0, n2=172b2g0, n3=2518bkg0, n4=536bkg0 and n5=172bkg0.

Figure 1.

Figure 1

Grid points for the proposed scheme (8).

Figure 2.

Figure 2

Computational molecule for the proposed scheme (7).

Stability

Let the approximate and exact solutions are presented by wi,jk and Wi,jk for the FDIS (7), respectively, and ϑi,jk=Wi,jk-wi,jk then from (7) we get

a0ϑi,jk+1=a1(ϑi+1,jk+1+ϑi-1,jk+1+ϑi,j+1k+1+ϑi,j-1k+1)+a2(ϑi+1,j+1k+1+ϑi-1,j+1k+1+ϑi+1,j-1k+1+ϑi-1,j-1k+1)+h2[2536ϑi,jk+572(ϑi+1,jk+ϑi-1,jk+ϑi,j+1k+ϑi,j-1k)+1144(ϑi+1,j+1k+ϑi-1,j+1k+ϑi+1,j-1k+ϑi-1,j-1k)]-h2r=1kbr[2536ϑi,jk+1-r+572(ϑi+1,jk+1-r+ϑi-1,jk+1-r+ϑi,j+1k+1-r+ϑi,j-1k+1-r)+1144(ϑi+1,j+1k+1-r+ϑi-1,j+1k+1-r+ϑi-1,j+1k+1-r+ϑi-1,j-1k+1-r)-(2536ϑi,jk-r+572(ϑi+1,jk-r+ϑi-1,jk-r+ϑi,j+1k-r+ϑi,j-1k-r)+1144(ϑi+1,j+1k-r+ϑi-1,j+1k-r+ϑi-1,j+1k-r+ϑi-1,j-1k-r))], 8

having initial and boundary conditions

ϑi,j0=ϑm,0k=ϑ0,mk=0,ϑi,mk=ϑm,jk=0,i,j=1,2,,m-1,k=1,2,,n-1. 9

The error function is described as

ϑk(x,y)=ϑi,jkwhenx(xi-h2,xi+h2],x(yi-h2,yi+h2],0whenx[0,h2]orx[L-h2,L],0wheny[0,h2]orL-y[h2,L]. 10

The error function ϑi,jk in terms of Fourier series29

ϑk(x,y)=l0,l1=-ρk(l0,l1)exp(2-1π(l0xL0+l1yL0)), 11

where

ρk(l0,l1)=1L020L00L0ϑk(x,y)exp(-2-1π(l0xL0+l1yL0))dxdy. 12

The l2-norm definition for ϑi,jk is

ϑkl22=h2i=1mj=1mϑi,jk2. 13

The relationship between Parseval equality and l2-norm is

ϑkl22=i=1mj=1mh2ϑi,jk2=l0,l1=-ρk(l0,l1)2. 14

Suppose

ϑi,jk=ρke-1(φ1ih+φ2jh), 15

where φ1=2πl0L0, φ2=2πl1L0.

a0ρk+1=a1(ρk+1eI(φ1h)+ρk+1e-I(φ1h)+ρk+1eI(φ2h)+ρk+1e-I(φ2h))+a2(ρk+1eI(φ1+φ2)h+ρk+1eI(φ2-φ1)h+ρk+1eI(φ1-φ2)h+ρk+1eI(-φ1-φ2)h)+25h236ρk+5h272(ρkeI(φ1h)+ρkeI(-φ1h)+ρkeI(φ2h)+ρkeI(-φ2h))+h2144(ρkeI(φ1+φ2)h+ρke(I(φ2-φ1)h+ρkeI(φ1-φ2)h+ρkeI(-φ1-φ2)h)-h2r=1kbr2536ρk+1-r+572(ρk+1-reI(φ1h)+ρk+1-reI(-φ1h)+ρk+1-reI(φ2h)+ρk+1-reI(-φ2(h)|Bigg)+1144(ρr+1eI(φ1+φ2)h+ρk+1-reI(φ2-φ1)h+ρk+1-reI(φ1-φ2)h+ρk+1-reI(-φ1-φ2)h)-(2536ρk-r+572(ρk-reI(φ1h)+ρk-reI(-φ1h)+ρk-reI(φ2h)+ρk-reI(-φ2(h))+1144(ρk-reI(φ1+φ2)h+ρk-reI(φ2-φ1)h+ρk-reI(φ1-φ2)h+ρk-reI(-φ1-φ2)h)). 16

By using Euler’s formula for exponential function

eI(φ1h)+e-I(φ1h)+eI(φ2h)+e-I(φ2h)=2(cos(φ1h)+cos(φ2h))andeI(φ1+φ2)h+eI(φ2-φ1)h+eI(φ1-φ2)h+eI(-φ1-φ2)h=4cos(φ1h)cos(φ2h). 17

Substituting Eq. (17) in Eq. (16), we have

a0ρk+1=2a1ρk+1(cos(φ1h)+cos(φ2h))+4a2ρk+1cos(φ1h)cos(φ2h)+25h236ρk+5h236ρk(cos(φ1h)+cos(φ2h))+h236ρkcos(φ1h)cos(φ2h)-r=1k-1(ak-r+1-ak-r)25h236(ρk+1-r-ρk-r)+5h236(ρk+1-r-ρk-r)(cos(φ1h)+cos(φ2h))+h236(ρk+1-r-ρk-r)cos(φ1h)cos(φ2h). 18

Then simplifying Eq. (18) for ρk+1

ρk+1=h236(25+5m0+m1a0-2a1m0-4a2m1)ρk-h236r=1kbr(25+5m0+m1a0-2a1m0-4a2m1)ρk+1-r-25+5m0+m1a0-2a1m0-4a2m1)ρk-r, 19

where m0=cos(φ1h)+cos(φ2h) and m1=cos(φ1h)cos(φ2h).

Proposition 1

Suppose ρk+1 satisfies (19), then ρk+1ρ0.

Proof

When k=0, then from (19)

ρ1=h23625+5m0+m1a0-2a1m0-4a2m1ρ0. 20

Since, the maximum value of cos(x) is 1, therefore

|ρ1|11+g0|ρ0|, 21

where g0=τγΓ(2-γ)>0. therefore

ρ1ρ0.

Let

ρmρ0;m=1,2,,k, 22

then for m=k+1

ρk+1=h236(25+5m0+m1a0-2a1m0-4a2m1)ρk-h236r=1kbr25+5m0+m1a0-2a1m0-4a2m1ρk+1-r-25+5m0+m1a0-2a1m0-4a2m1ρk-r. 23

Taking absolute function on both sides

ρk+1h23625+5m0+m1a0-2a1m0-4a2m1ρk+h23625+5m0+m1a0-2a1m0-4a2m1r=1kbr|ρk+1-r-ρk-r|,

using (22)

ρk+1h23625+5m0+m1a0-2a1m0-4a2m1|1+(b1+b2++bk)||ρ0|,ρk+1h23625+5m0+m1a0-2a1m0-4a2m1|2(k+1)1-γ-1||ρ0|

Substituting the values of m0 and m1, and after simplifying we get

ρk+12((k+1)1-γ-1)(1+g0)|ρ0|,

if g02(k+1)1-γ, then 0<2h2((k+1)1-γ-1)24g0+11h2(1+g0)1, thus

ρk+1|ρ0|.

Hence

||ρk+1||||ρ0||.

Therefore, the numerical solution satisfies

||ϑk+1||||ϑ0||.

Convergence

Suppose k+1 represents the truncation error at w(xi,yi,tk+1), then

k+1=τ-γΓ(2-γ)r=0kbr(wi,jk+1-r-wi,jk-r)-1+112δx2-1δX2h2wi,jk+1-1+112δy2-1δy2h2wi,jk+1-U0wi,jk+1-gi,jk+1=τ-γΓ(2-γ)r=0kbr(wi,jk+1-r-wi,jk-r)-γwtγ|i,jk+1+2wx2|i,jk+1-1+112δx2-1δX2h2wi,jk+1+2wy2|i,jk+1-1+112δy2-1δy2h2wi,jk+1=τ-γΓ(2-γ)r=0kbr(wi,jk+1-r-wi,jk-r)-γwtγ|i,jk+1+2wx2|i,jk+1-1+112δx2-1δX2h2wi,jk+1+2wy2|i,jk+1-1+112δy2-1δy2h2wi,jk+1,=O(τ2-γ)-h43606ux6+-h43606uy6+=O(τ2-γ+h4)
k+1f1(τ2-γ+h4), 24

where f1 is a constant. Let ϑi,jk=Wi,jk-wi,jk, where W and w represent the exact and approximate respectively, then from Eq. (7)

a0ϑi,jk+1=a1ϑi+1,jk+1+ϑi-1,jk+1+ϑi,j+1k+1+ϑi,j-1k+1+a2ϑi+1,j+1k+1+ϑi-1,j+1k+1+ϑi+1,j-1k+1+ϑi-1,j-1k+1+h22536ϑi,jk+572ϑi+1,jk+ϑi-1,jk+ϑi,j+1k+ϑi,j-1k+1144ϑi+1,j+1k+ϑi-1,j+1k+ϑi+1,j-1k+ϑi-1,j-1k-h2r=1kbr2536ϑi,jk+1-r+572ϑi+1,jk+1-r+ϑi-1,jk+1-r+ϑi,j+1k+1-r+ϑi,j-1k+1-r+1144(ϑi+1,j+1k+1-r+ϑi-1,j+1k+1-r+ϑi-1,j+1k+1-r+ϑi-1,j-1k+1-r)-(2536ϑi,jk-r+572ϑi+1,jk-r+ϑi-1,jk-r+ϑi,j+1k-r+ϑi,j-1k-r+1144ϑi+1,j+1k-r+ϑi-1,j+1k-r+ϑi-1,j+1k-r+ϑi-1,j-1k-r)+k+1, 25

with initial and boundary conditions

ϑi,j0=ϑm,0k=ϑ0,mk=0,ϑi,mk=ϑm,jk=0, 26

i,j=1,2,,m-1,k=1,2,,n-1.

Define the truncation error function Rk(x,y) as,

k(x,y)=i,jkwhenx(xi-h2,xi+h2],x(yi-h2,yi+h2],0whenx[0,h2],x[L-h2,L],0wheny[0,h2],y[L-h2,L].

Express ϑk and k functions as Fourier series

ϑi,jk=ρkeI(φ1ih+φ2jh),I=-1, 27
i,jk=μkeI(φ1ih+φ2jh),I=-1, 28

where φ1=2πl1L, φ2=2πl2L.

Substituting (27) and (28) into (25), we have

a0ρk+1=a1(ρk+1eI(φ1h)+ρk+1e-I(φ1h)+ρk+1eI(φ2h)+ρk+1e-I(φ2h))+a2(ρk+1eI(φ1+φ2)h+ρk+1eI(φ2-φ1)h+ρk+1eI(φ1-φ2)h+ρk+1eI(-φ1-φ2)h)+25h236ρk+5h272(ρkeI(φ1h)+ρkeI(-φ1h)+ρkeI(φ2h)+ρkeI(-φ2h))+h2144(ρkeI(φ1+φ2)h+ρke(I(φ2-φ1)h+ρkeI(φ1-φ2)h+ρkeI(-φ1-φ2)h)-h2r=1kbr2536ρk+1-r+572(ρk+1-reI(φ1h)+ρk+1-reI(-φ1h)+ρk+1-reI(φ2h)+ρk+1-reI(-φ2(h))+1144(ρr+1eI(φ1+φ2)h+ρk+1-reI(φ2-φ1)h+ρk+1-reI(φ1-φ2)h+ρk+1-reI(-φ1-φ2)h)-(2536ρk-r+572(ρk-reI(φ1h)+ρk-reI(-φ1h)+ρk-reI(φ2h)+ρk-reI(-φ2(h))+1144(ρk-reI(φ1+φ2)h+ρk-reI(φ2-φ1)h+ρk-reI(φ1-φ2)h+ρk-reI(-φ1-φ2)h))+μk+1. 29

Substituting (17) into (29), we get

a0ρk+1=2a1ρk+1(cos(φ1h)+cos(φ2h))+4a2ρk+1cos(φ1h)cos(φ2h)+25h236ρk+5h236ρk(cos(φ1h)+cos(φ2h))+h236ρkcos(φ1h)cos(φ2h)-r=1k-1(ak-r+1-ak-r)25h236(ρk+1-r-ρk-r)+5h236(ρk+1-r-ρk-r)(cos(φ1h)+cos(φ2h))+h236(ρk+1-r-ρk-r)cos(φ1h)cos(φ2h+μk+1. 30

Simplifying (30) for ρk+1, we obtain

ρk+1=h236(25+5m0+m1a0-2a1m0-4a2m1)ρk-h236r=1kbr(25+5m0+m1a0-2a1m0-4a2m1)ρk+1-r-25+5m0+m1a0-2a1m0-4a2m1)ρk-r+μk+1a0-2a1m0-4a2m1. 31

Proposition 2

Let ρk+1 satisfies (31), then ρk+1μk+1 where k=0,1,2,,n-1.

Proof

We know from (9) and (11)

ρ0=ρ0(l1,l2)=0. 32

From (24)

|μs+1||μ|,s={0,2,k-1}. 33

When k=0 in (31)

ρ=μa0-2a1m0-4a2m1, 34
ρ=1|a0-2a1m0-4a2m1|μ,taking absolute 35
ρ=1h2(1+g0)μ, 36

but h2(1+g0)>0, so

ρμ.

Suppose

ρsμs,s={1,2,,k}. 37

From (30)

|ρk+1|=|h236(25+5m0+m1a0-2a1m0-4a2m1)ρk-h236r=1kbr(25+5m0+m1a0-2a1m0-4a2m1)ρk+1-r-25+5m0+m1a0-2a1m0-4a2m1)ρk-r+μk+1a0-2a1m0-4a2m1|.

By using (37) and (33)

|ρk+1|2((k+1)1-β-1)+36/h21+g0|μk+1|.

If g02(k+1)1-γ+36/h2-1 then 0<2((k+1)1-β-1)+36/h21+g01, hence

ρk+1μk+1.

Hence proof.

Now from (24) and (14), we have

k+12Mhf1(τ2-γ+h4)=Lf1(τ2-γ+h4). 38

Using Proposition 2, and (14)

ϑk+1k+12Lf1(τ2-γ+h4),ϑk+1f1L(τ2-γ+h4),

hence, we get

ϑk+1T(τ2-γ+h4), 39

where T=f1L.

Hence, the FDIS (7) is conditionally convergent with convergence order O(τ2-γ+h4).

Numerical experiements

In current section, two examples are discussed to confirm the effectiveness of the FDIS for 2D FCE. In the proposed iterative method combined method is executed over the different time and mesh sizes. The numerical simulation is done using the PC with 4GB RAM, core i3, Windows 7, 3.40 GHz, and Mathematica software. The numerical examples are performed with the tolerance (ω) for the maximum error (l). The proposed method convergence orders are found using the following formula30.

1-order=log2L(2τ,h)L(τ,h),2-order=Log2||l(16τ,2h)||||l(τ,h)||.

Example 1

Consider the model problem31

0CDtγw(x,y,t)=2wx2+2wy2-u+2Γ(3-γ)t2-γ+t2(1+2π2)sin(πx)sin(πy),

having analytical solution

w(x,y,t)=t2sin(πx)sin(πy).

Example 2

Consider the model problem22

0cDtγu=2ux2+2uy2-u+ex+y2t2-γΓ(3-γ)-t2,

having analytical solution

u(x,y,t)=t2ex+y.

Tables 1, 2, 3 and 4 numerical results shows that the errors (maximum error ”M_E”, average error ”A_E”) are reduced with decreasing mesh size. Also, Tables 5 and 6 show that the proposed method gives better results as compared to the32 and20, which shows the effectiveness of the proposed method. Furthermore, in Tables 7 and 8, the spatial variable order of convergence is presented for different values of γ which depict the spatial variable order of convergence in agreement with the theoretical spatial accuracy of the proposed scheme for examples 1 and 2. Similarly, Tables 9 and 10 consist of the temporal variable order of convergence for the different values of γ which show that the theoretical and experimental temporal variable convergence accuracy is also in agreement. Moreover, the graphical representation in 3-D graphs of the proposed scheme is presented in Figs. 2, 3, 4, 5 and 6, which affirms FDIS effectiveness.

Table 1.

Numerical results for the Example 1, where γ=0.1.

τ h Iteration M_E A_E
15 15 44 6.9757×10-4 4.5350×10-4
110 110 40 8.9688×10-5 4.3799×10-5
115 115 40 3.2365×10-5 1.5531×10-6
120 120 42 1.6872×10-5 8.2234×10-6
130 130 40 4.3668×10-5 9.0917×10-6

Table 2.

Numerical results for the Example 1, where γ=0.5.

τ h Iteration M_E A_E
15 15 45 2.1487×10-3 7.2797×10-5
110 110 30 6.8921×10-3 1.4044×10-3
115 115 40 3.5734×10-4 3.3747×10-4
120 120 44 1.0562×10-4 2.3659×10-4
130 130 40 9.3649×10-5 6.0262×10-5

Table 3.

Numerical results for the Example 2, where γ=0.1.

τ h Iteration M_E A_E
15 15 52 7.0901×10-4 4.6764×10-5
110 110 52 2.1412×10-4 1.1986×10-4
115 115 48 1.0695×10-4 5.4370×10-5
120 120 54 6.3901×10-5 3.2475×10-5
130 130 65 3.0330×10-5 1.5141×10-5

Table 4.

Numerical results for the Example 2, where γ=0.5.

τ h Iteration M_E A_E
15 15 53 7.5742×10-3 5.0433×10-3
110 110 53 2.7558×10-3 1.5618×10-3
115 115 48 1.5230×10-3 8.1342×10-4
120 120 55 9.9445×10-4 5.1590×10-4
130 130 65 5.4703×10-4 2.7411×10-4

Table 5.

Comparison of the proposed scheme Eq. (7) with32 and20 for the Example 1, where γ=0.5.

τ h M_E 32 20
15 15     2.1487×10-3      8.8496×10-3      3.8921×10-2
110 110      6.8921×10-4      2.2508×10-3     1.4625×10-2
120 120     2.3659×10-4      5.8320×10-4     5.3241×10-3
130 130     1.3649×10-4      2.6199×10-4      2.9349×10-3

Table 6.

Comparison of the proposed scheme Eq. (7) with32 and20 for the Example 1, where γ=0.6.

τ h M_E 32 20
15 15     2.8893×10-3      9.2673×10-3      9.7966×10-3
110 110      1.0360×10-3      2.3281×10-3     3.2412×10-3
120 120     3.8988×10-4      5.9869×10-4     1.0054×10-3
130 130     2.2034×10-4      2.6804×10-4      5.0562×10-4

Table 7.

Space variable convergence order for the Example 1.

h/τ γ=0.1 γ=0.25
M_E 2-order M_E 2-order
h=τ=12 2.6172×10-2 2.7699×10-2
h=14,τ=132 1.4687×10-3 4.38 1.4820×10-3 4.25
h=τ=14 1.7141×10-3 2.2530×10-3
h=18,τ=164 8.7578×10-5 4.70 9.0833×10-4 4.33
γ=0.5 γ=0.75
h/τ M_E 2-order M_E 2-order
h=τ=12 3.1809 ×10-2 3.8695×10-2
h=14,τ=132 1.5616 ×10-3 4.34 3.9160 ×10-3 4.43
h=τ=14 1.8538×10-3 1.0527×10-2
h=18,τ=164 1. 2965 ×10-4 4.91 2.7630×10-4 4.38

Table 8.

Space variable convergence order for the Example 2.

h/τ γ=0.25 γ=0.5
M_E 2-order M_E 2-order
h=τ=12 1.00571×10-2 2.7664×10-2
h=14,τ=132 6.0059×10-4 4.06 8.7258×10-4 4.98
h=τ=14 3.2472×10-3 1.0060×10-2
h=18,τ=164 9.3560×10-5 5.11 1.7833×10-4 5.81
γ=0.75 γ=0.9
h/τ M_E 2-order M_E 2-order
h=τ=12 5.6346 ×10-2 8.0570 ×10-2
h=14,τ=132 1.7955 ×10-3 4.97 3.8020 ×10-3 4.40
h=τ=14 2.3634 ×10-2 3.7141 ×10-2
h=18,τ=164 7. 727 ×10-4 4.93 1.8113 ×10-3 4.35

Table 9.

Temporal variable convergence order for the Example 1, when h=18.

τ γ=0.75 γ=0.9
L 1-Order L 1-Order
τ=110 1.9523×10-3     – 3.4198×10-3     –
τ=120 8.7950 ×10-4     1.15 1.6413 ×10-3     1.05
τ= 140 4.2234 ×10-4     1.05 8.1259 ×10-4     1.01
τ=180 2.3416×10-4     0.85 4.1987×10-4     0.95

Table 10.

Temporal variable convergence order for the Example 2, when h=18Temporal variable convergence order for the Example 2, when h=18.

τ γ=0.5 γ=0.9
L 1-Order L 1-Order
τ=110 2.7254×10-3     – 1.3956×10-2     –
τ=120 9.879 ×10-4     1.46 6.5285 ×10-3     1.09
τ= 140 3.5286 ×10-4     1.48 3.0520 ×10-3     1.09
τ=180 1.3016×10-4     1.43 1.4177×10-3     1.10

Figure 3.

Figure 3

The Example 1 absolute error, when h=τ=125 and γ=0.1.

Figure 4.

Figure 4

The Example 2 absolute error when h=τ=125 and γ=0.1.

Figure 5.

Figure 5

Analytical and numerical solution for example 1, when h=τ=125.

Figure 6.

Figure 6

Analytical and numerical solution for example 1, when h=τ=125.

Conclusion

The higher-order FDIS is established and analyzed for the 2-D FCE. The theoretical analysis of the proposed method shows that the proposed method is unconditionally stable and convergent with the fourth-order of convergence. Moreover, the proposed method is reliable and effective for the numerical solutions of 2-D FCE. Furthermore, The proposed method’s theoretical convergence order is O(τ2-γ+h4), and C2-order shows that the theoretical and numerical spatial order of convergence is in agreement.

Author contributions

M.A.K.: writing final draft, software, analyzed the results, and analysis. N.A.: supervise and proofread. I.K.: discussed the results, methodology. F.M.S.: conceptualization. S.M.E.: sofware, revision.

Data availability

The data presented in this work is available from the corresponding author on reasonable request.

Competing interests

The authors declare no competing interests.

Footnotes

Publisher's note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Contributor Information

Muhammad Asim Khan, Email: asim.afg@gmail.com.

Fouad Mohammad Salama, Email: fuadmohd321@gmail.com.

References

  • 1.Kb O. ldham. J. S panier: The fractional Calculus ( Academic Press, New York; 1974. [Google Scholar]
  • 2.Khan, M.A., Akbar, M.A., & binti Abd Hamid, NN. Traveling wave solutions for space-time fractional cahn hilliard equation and space-time fractional symmetric regularized long-wave equation. Alex. Eng. J.60, 1317–1324 (2021)
  • 3.Du R, Cao W, Sun Z. Appl. Math. Model. 2010;10:2998–3007. doi: 10.1016/j.apm.2010.01.008. [DOI] [Google Scholar]
  • 4.Miller, K.S., & Ross, B. An introduction to the fractional calculus and fractional differential equations (Wiley, 1993)
  • 5.Khan, M.A., Ali, N.H.M., & Abd Hamid, N.N. The design of new high-order group iterative method in the solution of two-dimensional fractional cable equation. Alex. Eng. J.60, 3553–3563 (2021)
  • 6.Lin Y, Xu C. J. Comput. Phys. 2007;2:1533–1552. doi: 10.1016/j.jcp.2007.02.001. [DOI] [Google Scholar]
  • 7.Jiang Y, Ma J. J. Comput. Appl. Math. 2011;235:3285–3290. doi: 10.1016/j.cam.2011.01.011. [DOI] [Google Scholar]
  • 8.Khan MA, Ali NH, Hamid NNA, et al. A new fourth-order explicit group method in the solution of two-dimensional fractional rayleigh-stokes problem for a heated generalized second-grade fluid. Adv. Diff. Equ. 2020;2020:1–22. [Google Scholar]
  • 9.Gresho PM, Chan ST, Lee RL, Upson CD. Int. J. Numer. Meth. Fluids. 2011;6:557–598. [Google Scholar]
  • 10.Khan MA, Ali NHM. Adv. Diff. Equ. 2013;2020:1–21. [Google Scholar]
  • 11.Liu F, Zhuang P, Turner I, Burrage K, Anh V. A new fractional finite volume method for solving the fractional diffusion equation. Appl. Math. Model. 2014;38:3871–3878. doi: 10.1016/j.apm.2013.10.007. [DOI] [Google Scholar]
  • 12.Karatay I, Kale N, Bayramoglu SR. Fractional Calculus and Applied Analysis. 2013;4:892–910. doi: 10.2478/s13540-013-0055-2. [DOI] [Google Scholar]
  • 13.Langlands T, Henry B, Wearne S. Fractional cable equation models for anomalous electrodiffusion in nerve cells: infinite domain solutions. J. Math. Biol. 2009;59:761–808. doi: 10.1007/s00285-009-0251-1. [DOI] [PubMed] [Google Scholar]
  • 14.Matus A, Shepherd GM. The millennium of the dendrite? Neuron. 2000;27:431–434. doi: 10.1016/S0896-6273(00)00054-4. [DOI] [PubMed] [Google Scholar]
  • 15.Nimchinsky EA, Sabatini BL, Svoboda K. Structure and functions of dendritic spines. Annu. Rev. Physiol. 2002;64:313. doi: 10.1146/annurev.physiol.64.081501.160008. [DOI] [PubMed] [Google Scholar]
  • 16.Stuart GJ, Sakmann B. Active propagation of somatic action potentials into neocortical pyramidal cell dendrites. Nature. 1994;367:69–72. doi: 10.1038/367069a0. [DOI] [PubMed] [Google Scholar]
  • 17.Koch, C. Biophysics of computation: information processing in single neurons (Oxford university press, 2004)
  • 18.Liu, F., Yang, Q., & Turner, I. Two new implicit numerical methods for the fractional cable equation. J. Comput. Nonlinear Dyn.6 (2011).
  • 19.Chen C-M, Liu F, Burrage K. Numerical analysis for a variable-order nonlinear cable equation. J. Comput. Appl. Math. 2011;236:209–224. doi: 10.1016/j.cam.2011.06.019. [DOI] [Google Scholar]
  • 20.Zhang H, Yang X, Han X. Discrete-time orthogonal spline collocation method with application to two-dimensional fractional cable equation. Comput. Math. Appl. 2014;68:1710–1722. doi: 10.1016/j.camwa.2014.10.019. [DOI] [Google Scholar]
  • 21.Balasim, A.T., & Ali, N.H.M. A comparative study of the point implicit schemes on solving the 2d time fractional cable equation, in AIP Conference Proceedings, Vol. 1870 (AIP Publishing LLC, 2017) p. 040050
  • 22.Bhrawy A, Zaky M. Numerical simulation for two-dimensional variable-order fractional nonlinear cable equation. Nonlinear Dyn. 2015;80:101–116. doi: 10.1007/s11071-014-1854-7. [DOI] [Google Scholar]
  • 23.Oruç Ö. A local hybrid kernel meshless method for numerical solutions of two-dimensional fractional cable equation in neuronal dynamics. Num. Methods Partial Diff. Equ. 2020;36:1699–1717. doi: 10.1002/num.22499. [DOI] [Google Scholar]
  • 24.Moshtaghi N, Saadatmandi A. Numerical solution of time fractional cable equation via the sinc-bernoulli collocation method. J. Appl. Comput. Mech. 2021;7:1916–1924. [Google Scholar]
  • 25.Song, M., Wang, J., Liu, Y., & Li, H. Local discontinuous galerkin method combined with the l2 formula for the time fractional cable model. J. Appl. Math. Comput. 1–22 (2022).
  • 26.Ma Y, Chen L. Error bounds of a finite difference/spectral method for the generalized time fractional cable equation. Fractal Fract. 2022;6:439. doi: 10.3390/fractalfract6080439. [DOI] [Google Scholar]
  • 27.Li X, Li S. A finite point method for the fractional cable equation using meshless smoothed gradients. Eng. Anal. Boundary Elem. 2022;134:453–465. doi: 10.1016/j.enganabound.2021.10.018. [DOI] [Google Scholar]
  • 28.Mohyud-Din ST, Akram T, Abbas M, Ismail AI, Ali NH. A fully implicit finite difference scheme based on extended cubic b-splines for time fractional advection-diffusion equation. Adv. Diff. Equ. 2018;2018:1–17. doi: 10.1186/s13662-018-1537-7. [DOI] [Google Scholar]
  • 29.Chen C-M, Liu F, Turner I, Anh V. Numerical schemes and multivariate extrapolation of a two-dimensional anomalous sub-diffusion equation. Num. Algorithms. 2009;54:1–21. doi: 10.1007/s11075-009-9320-1. [DOI] [Google Scholar]
  • 30.Abbaszadeh M, Mohebbi A. A fourth-order compact solution of the two-dimensional modified anomalous fractional sub-diffusion equation with a nonlinear source term. Comput. Math. Appl. 2013;66:1345–1359. doi: 10.1016/j.camwa.2013.08.010. [DOI] [Google Scholar]
  • 31.Cui M. Convergence analysis of high-order compact alternating direction implicit schemes for the two-dimensional time fractional diffusion equation. Num. Algorithms. 2013;62:383–409. doi: 10.1007/s11075-012-9589-3. [DOI] [Google Scholar]
  • 32.Li MZ, Chen LJ, Xu Q, Ding XH. An efficient numerical algorithm for solving the two-dimensional fractional cable equation. Adv. Diff. Equ. 2018;2018:1–18. doi: 10.1186/s13662-018-1883-5. [DOI] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

The data presented in this work is available from the corresponding author on reasonable request.


Articles from Scientific Reports are provided here courtesy of Nature Publishing Group

RESOURCES