542
Views
1
CrossRef citations to date
0
Altmetric
Pure Mathematics

A novel algorithm for singularly perturbed parabolic differential-difference equations

ORCID Icon & ORCID Icon | (Reviewing editor:)
Article: 2133211 | Received 19 Aug 2022, Accepted 30 Sep 2022, Published online: 04 Dec 2022

ABSTRACT

In this study, numerical treatment of singularly perturbed parabolic partial differential-difference equations with small mixed shifts arising in computational neuroscience is presented. Due to the simultaneous presence of a singular perturbation parameter and shifts in the problem applying classical numerical methods to solve such a problem on a uniform mesh are unable to provide oscillation-free results unless they are applied with very fine meshes inside the region. The main objective of the work is to develop and analyze an oscillation-free higher order numerical scheme, which plays a vital role in applications. A uniformly convergent computational scheme is proposed using the implicit Euler method in temporal discretization and the cubic spline in tension method in spatial discretization. The stability and convergence analysis of the method are investigated. The scheme is uniformly convergent with linear order of convergence before Richardson extrapolation and second-order convergent after Richardson extrapolation technique. Three test problems are considered to validate the applicability of the scheme. The efficiency of the proposed scheme is demonstrated by comparing some methods available in the literature. It is observed that the proposed scheme provides more accurate results and higher order of convergence than methods available in the literature.

1 Introduction

In the past and recent years, singularly perturbed parabolic differential-difference equations (SPPDDEs) have attracted considerable attention in the scientific community. Such types of equations have prominent roles in many practical models in population dynamics (Kuang, Citation1993), the study of bistable devices (Derstine et al., Citation1982), human pupil-light reflex (Andre Longtin, Citation1988), immune response (Mayer et al., Citation1995), variational problem in control theory (V.Y. Glizer, Citation2000; Valery Y. Glizer, Citation2003), model of colorbluehuman immunodeficiency virus (HIV) infection (Culshaw & Ruan, Citation2000; Nelson & Perelson, Citation2002), activation of neuronal variability (Edward et al., Citation1980; John Wilbur & Rinzel, Citation1982; Lánskỳ, Citation1984; Musila & Lánskỳ, Citation1991; Stein, Citation1967), the modelling of biological oscillators (Murray, Citation2007), mathematical ecology (Kot, Citation2001), models for physiological process (John Mallet-Paret, Citation1989; Mackey & Glass, Citation1977), blood cell production (Wazewska-Czyzewska & Lasota, Citation9176) and so on.

The solution of SPPDDE exhibits sharp boundary and/or interior layers as singular perturbation parameter goes small (i.e.,ε0). This multi-scale character makes the numerical treatment of the SPPDDE is very tough to obtain ε uniform approximate solutions. To overcome this difficulty, various ε-uniform numerical methods have been developed using fitted operator and layer-adaptive meshes.

In (Bansal & Kapil, Citation2017; Bansal & Pratima Rai, Citation2017; Daba, Citation2022a, Citation2021a, Citation2022b, Citation2021c, Citation2021d; Kumar, Citation2018; Mesfin M. Woldaregay & Duressa, Citation2019; Nageshwar Rao & Pramod Chakravarthy, Citation2019; Ramesh & Priyanga, Citation2019; Woldaregay & Duressa, Citation2022), authors have suggested various numerical methods based on the fitting approaches to approximate SPPDDE with shift parameter(s). Recently, developing suitable numerical methods for applications of differential equations have received remarkable attention from scholars. For instance, Kostikov and Romanenkov (Kostikov & Romanenkov, Citation2020) suggested numerical algorithm for solving the optimal control problem for the three-dimensional heat equation. Tene et al (Tene et al., Citation2021) discussed the analysis of COVID-19 outbreak in Ecuador using the logistic model. Mihajlovic and Zivkovic , Citation2020 studied sieving extremely wet earth mass by means of oscillatory transporting platform.

Nevertheless, numerical methods to solve SPPDDE in the spatial variable with small and general shift arguments having second order in both directions for the past decade are still few. This drawback initiates us to formulate and analyze almost second-order ε uniform numerical algorithm in both directions for solving SPPDDE with mixed parameters. The main purpose of this work is to construct and analyze an ε uniformly convergent numerical method for solving SPPDDE with mixed shifts in the spatial variable. A parameter uniform computational scheme is proposed using the implicit Euler method in time discretization and the cubic spline in tension method in space discretization. The novelty of the presented algorithm, unlike Shishkin and Bakhvalov mesh types, does not require a priori information about the location and width of the boundary layer.

The methods developed by (Bansal & Kapil, Citation2017; Bansal & Pratima Rai, Citation2017; Kumar, Citation2018; Nageshwar Rao & Pramod Chakravarthy, Citation2019; Ramesh & Priyanga, Citation2019) for SPPDDE with mixed parameters are based on finite difference method. In comparison with the finite difference methods, spline solution has its own advantages. For instance, once the solution has been computed, the information required for spline interpolation between mesh points is available (Khan et al., Citation2004). Also, splines are a simpler and more practical way to solve boundary-value problems than finite difference methods (Kumar & Gupta, Citation2010). This is particularly important when the solution of the boundary-value problem is required at various locations in the interval [a,b]. This provides the motivation for our work on using fitted exponential spline method for solving the problem under consideration.

A brief description of the proposed method and its corresponding error analysis are treated in the subsequent sections.

2 The continuous problem

Consider SPPDDE of the form on the domain =x×t=(0,1)×(0,T] for some fixed number T>0:

where 0<ε1 is a singular perturbation parameter, δ is delay and η is advance parameter satisfying δ,η<ε. For the existence and uniqueness of the solution, the functions ω(x),ϖ(x),ρ(x),φ(x), ζ(x,t),ς1(x,t),ς2(x,t) and ζ0(x) are assumed to be sufficiently smooth and bounded with ϖ(x)+ρ(x)+φ(x)θ>0,forallxx and for some positive constant θ.

On applying Taylor’s series approximation for ζ(xδ,t) and ζ(x+η,t) yields

(2.2) ζ(xδ,t)=ζ(x,t)δζ(x,t)x+O(δ2),(2.2)
(2.3) ζ(x+η,t)=ζ(x,t)+ηζ(x,t)x+O(η2).(2.3)

Taking EquationEquation (2.2) and EquationEquation (2.3) into Equation (2.1) gives

(2.4) \poundεζ(x,t)=ζx,ttε22ζx,tx2+ξ(x)ζx,tx+ν(x)ζ(x,t)=μ(x,t),ζ(x,0)=ζ0(x),xx,ζ(0,t)=ς1(0,t),tt,ζ(1,t)=ς2(1,t),tt,(2.4)

where ξ(x)=ω(x)δϖ(x)+ηφ(x),ν(x)=ϖ(x)+ρ(x)+φ(x). Since ξ(x)ξ>0 and ν(x)ν>0, the solution of EquationEq. (2.4) reveals boundary layer near x=1. For small δ and η, EquationEq. (2.4) is gives asymptotically equivalent results to Eq. (2.1).

To secure that the data matches at the two end corners (0,0) and (1,0), we impose compatibility conditions (Ladyzhenskaia et al., Citation1968) as

(2.5) ζ0(0)=ς1(0,0),ζ0(1)=ς2(1,0),(2.5)

and

(2.6) ς1(0,0)tε22ζ0(0)x2+ξ(0)ζ0(0)x+ν(0)ζ0(0)=μ(0,0),ς2(1,0)tε22ζ0(1)x2+ξ(1)ζ0(1)x+ν(1)ζ0(1)=μ(1,0).(2.6)

The differential operator \poundε in EquationEq. (2.4) satisfies the lemmas.

Lemma 2.1 (Continuous Maximum Principle) If Υ|0 and \poundεΥ|0, then Υ|0.

Proof See, (Daba, Citation2022a)

Lemma 2.2 (Continuous Stability Estimate) The solution ζ(x,t) of EquationEq. (2.4) is bounded as

ζν1μ+max|ζ0x|,max|ς10,t|,|ς21,t|,

Proof See, (Daba, Citation2022b).

3 Description of the numerical method

We derive the numerical method employing the implicit Euler method and the cubic spline in tension method for the time and space variable derivative, respectively. Consider the partition of the solution domain [0,1]×[0,T] as

τM= jτ,0<jMandN=i,0<iN,

with the temporal and spatial mesh sizes τ=T/M and =1/N, respectively. Here, M and N denote the number of nodal points in the temporal and spatial directions.

3.0.1 Temporal semi-discretization

On applying the implicit Euler method on EquationEq. (2.4) in temporal variable yields:

(3.1) \poundεMζj+1(x)=βj+1(x),ζ0(x)=ζ0(x),xx,ζj+1(0)=φ1j+1(0),tt,ζj+1(1)=φ2j+1(1),tt,(3.1)

where

\poundεM=ε2d2ζj+1(x)dx2+ξ(x)dζj+1(x)dx+ϑ(x)ζj+1(x),ϑ(x)=ν(x)+1τ,
βj+1(x)=μj+1(x)+ζj(x)τ.

ζj+1(x)=ζ(x,tj+1),βj+1(x)=β(x,tj+1) and μj+1(x)=μ(x,tj+1).

Lemma 3.1 (Daba, Citation2022a). In the solution of EquationEq. (3.1), the local truncation error estimate ej+1=ζ(x,tj+1)ζj+1(x) is bounded by

ej+1C1τ2,

and the global error estimate Ej=ζ(x,tj)ζj(x) is given by

EjC2(τ),jT/τ,

where C1,C2 are a positive constant independent of ε and τ.

Lemma 3.2 The solution ζj+1(x) of the EquationEq. (3.1) is bounded by

(3.2) iζ(x,t)xnC1+(ε2)nexp(ξ(1x))ε2,(x,t),0n4(3.2)

Proof See, (Kumar, Citation2018).

3.0.2 Spatial semi-discretization

Here, we approximate the resulting EquationEq. (3.1) by applying the cubic spline in tension method as described below. A function Sj+1(x,γ)C2[0,1] which interpolates ζj+1(x) at the mesh points xi, i=0,1,,N depends on a parameter γ>0 reduces to cubic spline in [0,1] as γ0 is called parametric cubic spline function. In [xi,xi+1], the parametric cubic spline function Sj+1(x,γ)=Sj+1(x) satisfies the differential equation (Pramod Chakravarthy et al., Citation2017):

(3.3) d2Sj+1(x)dx2+γSj+1(x)=d2Sj+1(xi)dx2+γSj+1(xi)xi+1x+d2Sj+1(xi+1)dx2+γSj+1(xi+1)xxi,(3.3)

where Sj+1(xi)=ζij+1 and γ>0 is known to be cubic spline in tension.

Solving EquationEq. (3.3), we obtain

(3.4) Sj+1(x)=Aeλx+Beλx+Zij+1γζij+1γxxi+1+Zi+1j+1γζi+1j+1xix.(3.4)

The arbitrary constants A and B can be determined using interpolatory conditions

Sj+1(xi+1)=ζi+1j+1,Sj+1(xi)=ζij+1.

Putting λ=γ1/2 and Zkj+1=d2Sj+1(xk)dx2,k=i,i±1, we have

(3.5) Sj+1(x)=2λ2sinhλZi+1j+1sinhλxxi+Zij+1sinhλxi+1x2λ2xxiZi+1j+1λ2ζi+1j+1+xi+1xZij+1λ2ζij+1.(3.5)

Differentiating Equationequation (3.5) and taking xxi, we obtain

(3.6) dSj+1(xi+)dx=ζi+1j+1ζij+1λ21λsinhZi+1j+11λcothλZij+1.(3.6)

Proceeding similarly in the interval xi1,xi, we get

(3.7) dSj+1(xi)dx=ζi+1j+1ζij+1+λ21λcothλZij+1+1λsinhλZi+1j+1.(3.7)

Equating EquationEq. (3.6) and EquationEq. (3.7) at xi, we obtain

(3.8) ζij+1ζi1j+1+λ21λcothλZij+1+1λsinhλZi1j+1=ζi+1j+1ζij+1λ21λsinhZi+1j+11λcothλZij+1.(3.8)

Rearranging, we get the following tridiagonal system

(3.9) λ1Zi+1j+1+2λ2Zij+1+λ1Zi1j+1=ζi+12ζi+ζi12,i=1,2,N1,(3.9)

where λ1=1λ21λsinhλ,λ2=1λ2λcothλ1.

For the choice of parameters λ1+λ2=1/2 is consistent and suitable for solving the given differential equation.

Now, from EquationEq. (3.1), we have

(3.10) ε2Zi1j+1=ξi1dζi1j+1dx+ϑi1ζi1j+1βi1j+1,ε2Zij+1=ξidζij+1dx+ϑiζij+1βij+1,ε2Zi+1j+1=ξi+1dζi+1j+1dx+ϑi+1ζi+1j+1βi+1j+1,(3.10)

where we approximate dζi+1j+1dx,dζij+1dx and dζi1j+1dx as

(3.11) dζi1j+1dxζi+1j+1+4ζij+13ζi1j+12.dζij+1dxζi+1j+1ζi1j+12,dζi+1j+1dx3ζi+1j+14ζij+1+ζi1j+12.(3.11)

Substituting EquationEq. (3.11) into (3.10), we have

(3.12) ε2Zi1j+1=ξi1ζi+1j+1+4ζij+13ζi1j+12+ϑi1ζi1j+1βi1j+1,ε2Zij+1=ξiζi+1j+1ζi1j+12+ϑiζij+1βij+1,ε2Zi+1j+1=ξi+13ζi+1j+14ζij+1+ζi1j+12+ϑi+1ζi+1j+1βi+1j+1.(3.12)

Substituting EquationEq. (3.12) into EquationEq. (3.9) and rearranging, we get

(3.13) ε2ζi1j+12ζij+1+ζi+1j+12=3λ1ξi12+λ1ϑi1λ2ξi+λ1ξi+12ζi1j+1+2λ1ξi1+2λ2ϑi+2λ1ξi+1ζij+1+λ1ξi12+λ2ξi+3λ1ξi+12+λ1ϑi+1ζi+1j+1λ1βi1j+12λ2βij+1λ1βi+1j+1.(3.13)

To handle the effect of ε a constant fitting factor σ(ρ) is multiplied on the term containing ε as

(3.14) σ(ρ)ε2ζi1j+12ζij+1+ζi+12=3λ1ξi12+λ1ϑi1λ2ξi+λ1ξi+12ζi1j+1+2λ1ξi1+2λ2ϑi+2λ1ξi+1ζij+1+λ1ξi12+λ2ξi+3λ1ξi+12+λ1ϑi+1ζi+1j+1λ1βi1j+12λ2βij+1λ1βi+1j+1.(3.14)

Multiplying Eq. (3.14) by and taking the limit as 0, we get

(3.15) limh0σ(ρ)ε2ζi1j+12ζij+1+ζi+1j+1ξ(0)2ζi+1j+1ζi1j+1=0.(3.15)

For problems with a layer at the right end of the interval, from the theory of singular perturbations, the solution of EquationEq. (3.1) is of the form (O’Malley, Citation1991)

(3.16) ζj+1(x)ζ0j+1(x)+ξ(1)ξ(x)ςj+1(2)ζ0j+1(x)expξ(x)1xε2+O(ε),(3.16)

where ζ0j+1(x) is the solution of the reduced problem

ξ(x)dζ0j+1(x)dx+ϑ(x)ζ0j+1(x)=βj+1(x)withςj+1(1)=ςj+1(2).

Taking Taylor’s series expansion for ξ(x) about the point x=1 and restricting to their first terms, EquationEq. (3.16) becomes

(3.17) ζj+1(x)ζ0j+1(x)+ςj+1(2)ζ0j+1(1)expξ(1)1xε2+O(ε).(3.17)

Now, from the EquationEq. (3.17), we have

where ρ=ε2. Plugging the above equations into EquationEq. (3.15) gives the required fitting factor

(3.18) σρ=ξ(0)ρ2cothξ(1)ρ2.(3.18)

Finally, from EquationEquation (3.14) and (Equation3.18), we get

(3.19) \poundεN,Mζij+1=Hij+1,i=1,2,,N1,(3.19)

where

\poundεN,Mζij+1=χiζi1j+1+χicζij+1+χi+ζi+1j+1χi=σ(ρ)ε223λ1ξi12hλ2ξi+λ1ξi+12h+λ1ϑi1,χic=2σ(ρ)ε222λ1ξi1+2λ2ϑi+2λ1ξi+1,χi+=σ(ρ)ε22λ1ξi12+λ2ξi+3λ1ξi+12+λ1ϑi+1,Hij+1=λ1βi1j+1+2λ2βij+1+λ1βi+1j+1.

For sufficiently small , the above matrix is non-singular and |χic||χi|+|χi+| (i.e., the matrix are diagonally dominant). Hence, by (Nichols, Citation1989), the matrix χ is M-matrix and have an inverse. Therefore, the system of equations can be solved by matrix inverse.

4 Convergence analysis

Lemma 4.1 (Discrete Maximum Principle) If the discrete function Υij+1 satisfies Υij+1|0 and \poundεN,MΥij+1|0, then Υij+1|0.

Proof Proof follows from the Like quarrels as secondhand in Lemma 2.1.

Lemma 4.2 (Discrete Uniform Stability) The solution ζij+1 of the EquationEq. (3.19) at (j+1)th time level and Γ=min0iNϑi, where Γ is some positive constant is bounded as

ζij+1\poundεN,Mζij+1Γ+max|ζ0j+1|,|ζNj+1|.

Proof Let define barrier functions Θij+1± as Θij+1±=Ξ±ζij+1,where Ξ=\poundεN,Mζij+1Γ+max|ζ0j+1|,|ζNj+1|. On the boundary points, we obtain

Θ0j+1± =Ξ±ζ0j+1=£εN,Mζij+1Γ +max{|ζ0j+1|,|ζNj+1|}±ς1j+1(0)0,
ΘNj+1±=Ξ±ζNj+1=\poundεN,Mζij+1Γ\break+max|ζ0j+1|,|ζNj+1|±ς2j+1(N)0.

Now, on the discretized spatial domain N, we have

\poundεN,MΘij+1±=\poundεN,MΞ±ζij+1=σ(ρ)ε223λ1ξi12λ2ξi+λ1ξi+12+λ1ϑi1Ξ±ζi1j+1+2σ(ρ)ε222λ1ξi1+2λ2ϑi+2λ1ξi+1Ξ±ζij+1+σ(ρ)ε22λ1ξi12+λ2ξi+3λ1ξi+12+λ1ϑi+1Ξ±ζi+1j+1,
=±σ(ρ)ε223λ1ξi12λ2ξi+λ1ξi+12+λ1ϑi1ζi1j+1±2σ(ρ)ε222λ1ξi1+2λ1ξi+1+2λ2ϑiζij+1±σ(ρ)ε22λ1ξi12+λ2ξi+3λ1ξi+12+λ1ϑi+1ζi+1j+1+λ1ϑi1+2λ2ϑi+λ1ϑi+1Ξ,,±λ1βi1j+1+2λ2βij+1+λ1βi+1j+1+λ1ϑi1+2λ2ϑi+λ1ϑi+1Ξ,=λ1ϑi1+2λ2ϑi+λ1ϑi+1\poundεN,Mζij+1Γ+max|ζ0j+1|,|ζNj+1|(λ1βi1j+1+2λ2βij+1+λ1βi+1j+1)0,sinceϑ(xi)Γ>0.

On applying Lemma 4.1, we obtain Θij+1±0,forallxiN. Hence, the desired bound is obtained.

Lemma 4.3 The local truncation error in space discretization of the discrete problem (3.19) is given as

maxi,j|ζj+1(xi)ζij+1|C2,

where C is a constant independent of ε and .

Proof From the truncation error of EquationEq. (3.11), we have

(4.1) e i+1=dζj+1(xi+1)dxdζi+1j+1dx=23d3ζj+1(xi)dx3+312d4ζj+1(xi)dx4+430d5ζj+1(ξi)dx5,e i=dζj+1(xi)dxdζij+1dx=26d3ζj+1(xi)dx34120d5ζj+1(ξi)dx5,e i+1=dζj+1(xi+1)dxdζi+1j+1dx=23d3ζj+1(xi)dx3+312d4ζj+1(xi)dx4+430d5ζj+1(ξi)dx5,(4.1)

where xi1<ψ<xi+1. Substituting

σε2Zkj+1=ξkdζkj+1dx+ϑkζkj+1βkj+1,k=i,i±1

into EquationEq. (3.9), we get

(4.2) σε2ζi1j+12ζij+1+ζi+1j+1=2λ1ξi1dζi1j+1dx+ϑi1ζi1j+1βi1j+1+22λ2ξidζij+1dx+ϑiζij+1βij+1+2λ1ξi+1dζi+1j+1dx+ϑi+1ζi+1j+1βi+1j+1.(4.2)

Considering the corresponding exact solution to EquationEq. (4.2), we have

Subtracting EquationEq. (4.2) from EquationEq. (4.3) and denoting ek=ζj+1(xk)ζkj+1 for k=i,i±1 we arrive at

(4.4) σε22λ1ϑi1ei1+2σε222λ2ϑiei+σε22λ1ϑi+1ei+1=2λ1ξi1e i1+2λ2ξie i+λ1ξi+1e i+1.(4.4)

Inserting EquationEq. (4.1) in EquationEq. (4.4), we obtain

(4.5) σε22λ1ϑi1ei1+2σε222λ2ϑiei+σε22λ1ϑi+1ei+1=43λ1ξi1λ2ξi+λ1ξi+1d3ζj+1(xi)dx3+512λ1ξi1+λ1ξi+1d4ζj+1(xi)dx4+6602λ1ξi1λ2ξi+2λ1ξi+1d5ζj+1(ξi)dx5.(4.5)

Using the expressions ξi1=ξiξi+22!ξ(2)(ξi) and ξi+1=ξi+ξ i+22!ξ(2)(ξi) in EquationEq. (4.5), we have

(4.6) σε22λ1ϑi1ei1+2σε222λ2ϑiei\break+σε22λ1ϑi+1ei+1=Ti(),(4.6)

where Ti=432λ1λ2ξid3ζj+1(xi)dx3+O(6). Therefore, Ti=O4 for the choice of parameters λ1+λ2=1/2. EquationEq. (4.6) can be written as a matrix form:

(4.7) ΛΠE=Tˆ,(4.7)

where Λ=tridσε2,2σε2,σε2, Π=trid2λ1ϑi1,22λ1ϑi,2λ1ϑi+1,

E=e1,e2,,eN1T and Tˆ=T1(),T2(),,TN1()T.

Following (Ravi Kanth et al., Citation2017), it can be shown that

(4.8) EC2×O4=C2,(4.8)

where C is a constant, independent of and ε.

Theorem 4.1 Let ζ(x,t) be the solution of problem (2.4) at each grid point xi,tj+1 and ζij+1 be its approximate solution obtained by the proposed scheme given in EquationEq. (3.19). Then, the error estimate for the fully discrete method is given by

maxi,j|ζ(xi,tj+1)ζij+1|Cτ+2.

Proof From the triangular inequality, we have

(4.9) maxi,j|ζ(xi,tj+1)ζij+1|=maxi,j|ζ(xi,tj+1)ζj+1(xi)+ζj+1(xi)ζij+1|maxi,j|ζ(xi,tj+1)ζj+1(xi)|+maxi,j|ζj+1(xi)ζij+1|.(4.9)

Using Lemmas 3.1 and 4.3 into EquationEq. (4.9), the proof completed.

4.1 Temporal Richardson extrapolation

In this section, we use the Richardson extrapolation technique to improve the accuracy and order of convergence of the discrete method (3.19) in the time direction. For that, we consider the tensor product meshes N,τ and N,τ/2, where both the meshes N,τ and N,τ/2 are uniform and identical in spatial direction and uniform in time with step sizes τ and τ/2, respectively. Let 0N,τ=N,τN,τ/2. It is clear that 0N,τ=N,τ. Further, let ζ1(xi,tj+1),forall(xi,tj+1)N,τ and ζ2(xi,tj+1),(xi,tj+1)N,τ/2 be the solutions of the discrete (3.19). Then, we define

(4.10) ζexp(xi,tj+1)=2ζ2(xi,tj+1)ζ1(xi,tj+1),(xi,tj+1)0N,τ,(4.10)

where ζexp is the Richardson extrapolation of u, which has an improved order of convergence by one in time. This technique to improve the accuracy is known as Richardson extrapolation technique.

Theorem 4.2 (Error After Extrapolation) Assume that NN0 satisfies the assumptions (3.19). Let ζ be the solution of the continuous problem (2.4) and ζexp be the solution obtained via the Richardson extrapolation technique by solving the discrete problem (3.19) on the two nested meshes N,τ and 2N,τ/2. Then, we have the following error bound associated with ζexp.

(ζζexp)(xi,tj+1)C(τ)2+2.

Proof We consider the expansion of ζk(xi,tj+1),(xi,tj+1)N,τ/kfor k=1,2 as

(4.11) ζk(xi,tj+1)=ζ(xi,tj+1)2(k1)τξk(xi,tj+1)+ξk(xi,tj+1),(4.11)

where ζk is the approximate solution and ξk,k=1,2, is the remainder term. The function ξ is the solution of the problem

(4.12) \poundεξ(xi,tj+1)=212t2ζ(xi,tj+1),(x,t)ξ(x,t)=0,(x,t).(4.12)

To prove the convergence of the Richardson scheme, we need to derive the estimate for the remainder term ξk on N,τ/kfork=1,2. It is clear that ξk(xi,tj+1)=0forall(xi,tj+1)N,τ/k, where N,τ/k denotes the boundary of N,τ/k. Also forallxi,tj+1N,τ/kwherek=1,2 we have

|\poundN,τ/kξk(xi,tj+1)|=|\poundN,τ/kUku(xi,tj+1)2(k1)Δτ\break\poundN,τ/kξ(xi,tj+1)|C(τ)2+2.

Then applying discrete maximum principle, we get |ξkxi,tj+1|C(Δτ)2+2. Then, this estimate for ξk, together with the EquationEquation (4.10) and (Equation4.11), yields

(4.13) ζζexpxi,tj+1=ζxi,tj+12ζ2(xi,tj+1)\breakζ1(xi,tj+1),(xi,tj+1)=O(τ)2+2.(4.13)

EquationEquation (4.13) gives the following error bound for the Richardson extrapolate scheme

(ζζexp)(xi,tj+1)C(τ)2+2.

5 Numerical examples, results and discussion

Several model examples have been presented to illustrate the efficiency of the proposed method. In all cases, we performed the numerical experiments by taking λ1=1e08 and λ2=4.9999999e01. As the exact solutions of the considered examples are not known, we calculate the maximum pointwise error for each ε,δ,η given in (Vikas Gupta & Kadalbajoo, Citation2019) by

Eε,δ,ηN,τ=max(xi,tj+1)N,M|ζN,τ(xi,tj+1)ζ2N,τ/2(xi,tj+1)|,\break(Beforeextrapolation),
(Eε,δηN,τ)extp=max(xi,tj+1)N,M|ζextpN,τ(xi,tj+1)ζextp2N,τ/2(xi,tj+1)|,\break(Afterextrapolation),

where ζxi,tj+1 and ζextpxi,tj+1 denote the numerical solution obtained before and after extrapolation in N,M with N mesh intervals in the spatial direction and M mesh intervals in the temporal direction. The corresponding order of convergence for each ε,δ,η is calculated by

rε,δ,ηN,τ=log2Eε,δ,ηN,τ/Eε,δ,η2N,τ/2,(Beforeextrapolation),(rε,δ,ηN,τ)extp=log2(Eε,δ,ηN,τ)extp/(Eε,δ,η2N,τ/2)extp,\break(After extrapolation).

For each N and M, the parameter uniform maximum absolute error and uniform rate of convergence are computed using

EN,τ=maxε,δ,ηEε,δ,ηN,τ,(Before extrapolation),EextpN,τ=maxε,δ,ηEε,δ,η,extpN,τ,(After extrapolation),rN,τ=log2EN,Δt/E2N,τ/2,(Before extrapolation),rextpN,τ=log2EextpN,τ/Eextp2N,τ/2,(After extrapolation).

Example 5.1 (Kumar, Citation2018) Consider the following SPPDDEs of the form in (2.1), ω(x)=2x2,ϖ(x)=2,ρ(x)=x3,φ(x)=1,μ(x,t)=10t2exp(t)x(1x) with x,t0,1×0,1, ζ0(x)=0,ς1(0,t)=ς2(1,t)=0.

Example 5.2 (Woldaregay & Duressa, Citation2022) Consider the following SPPDDEs of the form in (2.1), ω(x)=1,ϖ(x)=2x2,ρ(x)=1+x2,φ(x)=exp(x),μ(x,t)\break=50(x(1x))3 with x,t0,1×0,2, ζ0(x)=0,ς1(0,t)=ς2(1,t)=0.

Example 5.3 (Bansal & Kapil, Citation2017) Consider the following SPDDEs of the form in (2.1), ω(x)=2x2,ϖ(x)=1,ρ(x)=x+4,φ(x)=2,μ(x,t)=10t2exp(t)\breakx(1x) with x,t0,1×0,1, ζ0(x)=0,ς1(0,t)=t2,ς2(1,t)=t3

The calculated Eε,δ,ηN,τ,rε,δ,ηN,τ EN,τ, rN,τ (Eε,δ,ηN,τ)extp (rε,δ,ηN,τ)extp, (EN,τ)extp and (rN,τ)extp for the test Examples 5.1–5.3 with the different values of N,τ and ε with δ=η=0.5×ε are presented in . From these tables, we can easily see that maximum absolute error decreases as the step sizes decrease for all values of ε, which reveals an ε uniform convergence of the proposed algorithm. Also, one can observe that the numerical results before the Richardson extrapolation technique of the proposed method (3.19) is almost equal to one and does not shows the actual theoretical order of convergence in space as stated in Theorem 4.1. This arose due to much effect of the temporal error than the spatial error as using the proposed method (3.19). To enhance the order of convergence of the proposed method (3.19) in the temporal direction, we combine the proposed method (3.19) with the Richardson extrapolation technique (4.10) applied only in the temporal direction and resulting numerical method is almost second-order ε uniform convergence in both the temporal and spatial variables. The numerical results show that the proposed method gives more accurate results and higher order of convergence than methods in (Kumar, Citation2018; Mesfin M. Woldaregay & Duressa, Citation2019; Woldaregay & Duressa, Citation2020, Citation2022) From Figures , one can observe that as ε goes small strong boundary layer is created near x=1. As the size of δ increases, the thickness of the layer increases (see, Figures ), whereas when the size of η increases, the thickness of the layer decreases (see, Figures ). Figures , and depict the 3D view of the numerical solution profiles for Examples 5.1, 5.2 and 5.3, respectively, which indicates the existence of the boundary layer near x = 1. In ,(7) 7 (7), we have plotted the maximum pointwise errors (before and after extrapolation) in a log-log plot for Examples 5.1–5.3, which show that the expected numerical order of convergence is correct in practice.

Table 1. Eε,δ,ηN,τ,rε,δ,ηN,τ EN,τ, rN,τ (Eε,δ,ηN,τ)extp (rε,δ,ηN,τ)extp, (EN,τ)extp and (rN,τ)extp for Example, 5.1 using method (3.19) and scheme(3.19) with Richardson extrapolation (4.10) with δ=η=0.5×ε

Table 2. Eε,δ,ηN,τ,rε,δ,ηN,τ EN,τ, rN,τ (Eε,δ,ηN,τ)extp (rε,δ,ηN,τ)extp, (EN,τ)extp and (rN,τ)extp for Example, 5.2 using method (3.19) and scheme(3.19) with Richardson extrapolation (4.10) with δ=η=0.5×ε,M=N

Table 3. Eε,δ,ηN,τ,rε,δ,ηN,τ EN,τ, rN,τ (Eε,δ,ηN,τ)extp (rε,δ,ηN,τ)extp, (EN,τ)extp and (rN,τ)extp for Example, 5.3 using method (3.19) and method (3.19) with Richardson extrapolation (4.10) with T=1.0,δ=η=0.5×ε

Table 4. (Eε,δ,ηN,τ)extp (rε,δ,ηN,τ)extp, (EN,τ)extp and (rN,τ)extp for Example, 5.1 using proposed method (3.19) with Richardson extrapolation (4.10) and results in (Mesfin M. Woldaregay & Duressa, Citation2019) and (Woldaregay & Duressa, Citation2020) with T=3,δ=0.6×ε,η=0.5×ε

Figure 1. The effect of ε on the solution profiles at δ=0.6×ε and η=0.5×ε.

Figure 1. The effect of ε on the solution profiles at δ=0.6×ε and η=0.5×ε.

Figure 2. The effect of δ on the solution profiles at ε=24,η=0.5×ε.

Figure 2. The effect of δ on the solution profiles at ε=2−4,η=0.5×ε.

Figure 3. The effect of η on the solution profiles with ε=24,δ=0.6×ε.

Figure 3. The effect of η on the solution profiles with ε=2−4,δ=0.6×ε.

Figure 4. Numerical solution profiles for Example, 5.1 at δ=0.6×ε,η=0.5×ε,N=M=512.

Figure 4. Numerical solution profiles for Example, 5.1 at δ=0.6×ε,η=0.5×ε,N=M=512.

Figure 5. Numerical solution profiles for Example, (5.2) at T=2.0,δ=0.6×ε,η=0.5×ε and N=M=512.

Figure 5. Numerical solution profiles for Example, (5.2) at T=2.0,δ=0.6×ε,η=0.5×ε and N=M=512.

Figure 6. Numerical solution profiles for Example, 5.3 at T=1.0,δ=0.6×ε,η=0.5×ε and N=M=512.

Figure 6. Numerical solution profiles for Example, 5.3 at T=1.0,δ=0.6×ε,η=0.5×ε and N=M=512.

Figure 7. Log-log plot for the maximum absolute errors before and after the Richardson extrapolation technique.

Figure 7. Log-log plot for the maximum absolute errors before and after the Richardson extrapolation technique.

6 Conclusion

In this paper, a higher-order robust numerical scheme has been proposed to solve singularly perturbed parabolic differential-difference equations with mixed shifts in the space variable. The scheme comprises of the implicit Euler method to discretize the temporal variable and the cubic spline in tension method to discretize the spatial variable on a uniform step length. Besides this, Richardson’s extrapolation technique has been implemented to enhance the accuracy in the temporal direction. Stability and uniform convergence of the proposed scheme have been investigated. The scheme has been shown uniformly convergent with linear order of convergence before Richardson extrapolation and second order convergent after Richardson extrapolation. Several model examples have been presented to illustrate the efficiency of the proposed method. It has been observed that the proposed scheme gives high accurate numerical results and higher order of convergence than the methods in (Kumar, Citation2018; Mesfin M. Woldaregay & Duressa, Citation2019; Woldaregay & Duressa, Citation2020, Citation2022). The proposed method is can be successfully applied for similar singularly perturbed parabolic partial differential problems with shift parameter(s) and without delay parameter. But, the proposed scheme is not a layer resolving method. In future works, we extend the proposed scheme for singularly perturbed problems with degenerate coefficients and singularly perturbed problems with nonlocal boundary conditions.

Acknowledgements

The authors thankfully acknowledge the prolific comments from the anonymous referees.

Disclosure statement

No potential conflict of interest was reported by the author(s).

Data availability statement

No data were used to support the study.

Additional information

Funding

This research did not receive any funding.

Notes on contributors

Imiru Takele Daba

Imiru Takele Daba received his Ph.D. in Mathematics from Wollega University in 2021. Currently, he is working at Dilla University, Department of Mathematics as a researcher and assistant professor. His research interests span the areas of numerical solution of partial differential equations, focusing on singularly perturbed problems. He has published more than seven research articles in reputable journals. He also made numerous contributions in serving as a reviewer. So far, he has supervised five M.Sc. students to completion and currently supervising six M.Sc. students.

Gemechis File Duressa

Gemechis File Duressa received his Ph.D. in Mathematics from the National Institute of Technology Warangal, India, in 2014. He is presently working at Jimma University as a full professor of Mathematics and Dean, College of Natural Sciences, Jimma University, Ethiopia. His research interests span on the areas of numerical solution of differential equations, mainly, on singularly perturbed ordinary and partial differential equations. He published more than 130 research articles in national and international reputable journals. In addition, he made numerous contributions in serving as reviewer, assistant editor, and editor for various national and international reputable journals. So far, he has supervised 40 M.Sc. and 7 Ph.D. graduates to completion and currently supervising five M.Sc. students and 15 Ph.D. scholars.

References

  • Andre Longtin, J. G. M. (1988). Complex oscillations in the human pupil light reflex with mixed and delayed feedback. Mathematical Biosciences, 90(1–2), 183–16. https://doi.org/10.1016/0025-5564(88)90064-8
  • Bansal, K., & Kapil, K. (2017). Sharma Parameter uniform numerical scheme for time dependent singularly perturbed convection-diffusion-reaction problems with general shift arguments. Numerical Algorithms, 75(1), 113–145. https://doi.org/10.1007/s11075-016-0199-3
  • Bansal, K., & Pratima Rai, K. K. S. (2017). Numerical treatment for the class of time dependent singularly perturbed parabolic problems with general shift arguments. Differential Equations and Dynamical Systems, 25(2), 327–436. https://doi.org/10.1007/s12591-015-0265-7
  • Culshaw, R. V., & Ruan, S. (2000). A delay-differential equation model of HIV infection of CD4+ T-cells. Mathematical Biosciences, 165(1), 27–39. https://doi.org/10.1016/S0025-5564(00)00006-7
  • Daba, I. (2021a). Takele and Duressa, gemechis file, extended cubic B-spline collocation method for singularly perturbed parabolic differential-difference equation arising in computational neuroscience. International Journal for Numerical Methods in Biomedical Engineering, 37(2), e3418. https://doi.org/10.1002/cnm.3418
  • Daba, I. (2021b). Takele and Duressa, gemechis file,hybrid algorithm for singularly perturbed delay parabolic partial differential equations. Applications and Applied Mathematics: An International Journal (AAM), 16(1), 21. http://pvamu.edu/aam.
  • Daba, I. (2021c). Takele and Duressa, Gemechis file, A hybrid numerical scheme for singularly perturbed parabolic differential-difference equations arising in the modeling of neuronal variability. Computational and Mathematical Methods, 3(5), e1178. https://doi.org/10.1002/cmm4.1178
  • Daba, I. (2021d). Takele and Duressa, Gemechis file, uniformly convergent numerical scheme for a singularly perturbed differential-difference equations arising in computational neuroscience. Journal of Applied Mathematics and Informatics, 39(5–6), 655–676. https://doi.org/10.1002/cmm4.1178
  • Daba, I. (2022a). Takele and Duressa, Gemechis file. Collocation Method Using Artificial Viscosity for Time Dependent Singularly Perturbed differential–difference Equations Mathematics and Computers in Simulation, 192, 201–220,. https://doi.org/10.1002/cmm4.1178
  • Daba, I. (2022b). Takele and Duressa, Gemechis File,A Robust computational method for singularly perturbed delay parabolic convection-diffusion equations arising in the modeling of neuronal variability. Computational Methods for Differential Equations, 10(2), 475–488. https://cmde.tabrizu.ac.ir/article_12797.html
  • Derstine, M. W., Gibbs, H. M., Hopf, F. A., & Kaplan, D. L. (1982). Bifurcation gap in a hybrid optically bistable system. Physical Review A, 26(6), 3720–3722. https://doi.org/10.1103/PhysRevA.26.3720
  • Edward, P. D., John, J. H., & Miller, Willy, H. A. (1980). Schilders, Uniform numerical methods for problems with initial and boundary layers. Boole Press.
  • Glizer, V. Y. (2000). Asymptotic solution of a boundary-value problem for linear singularly-perturbed functional differential equations arising in optimal control theory. Journal of Optimization Theory and Applications, 106(2), 309–335. https://doi.org/10.1023/A:1004651430364
  • Glizer, V. Y. (2003). Blockwise estimate of the fundamental matrix of linear singularly perturbed differential systems with small delay and its application to uniform asymptotic solution. Journal of Mathematical Analysis and Applications, 278(2), 409–433. https://doi.org/10.1016/S0022-247X(02)00715-1
  • John Mallet-Paret, R. D. (1989). Nussbaum. A differential-delay Equation Arising in Optics and Physiology, SIAM Journal on Mathematical Analysis, 20(2), 249–292. https://doi.org/10.1137/0520019
  • John Wilbur, W., & Rinzel, J. (1982). An analysis of Stein’s model for stochastic neuronal excitation. Biological Cybernetics, 45(2), 107–114. https://doi.org/10.1007/BF00335237
  • Khan, A., Khan, I., & Tariq Aziz, M. (2004). Stojanovic. A variable-mesh Approximation Method for Singularly Perturbed boundary-value Problems Using Cubic Spline in Tension, International Journal of Computer Mathematics, 81(12), 1513–1518. https://doi.org/10.1080/00207160412331284169
  • Kostikov, Y. A., & Romanenkov, A. M. (2020). Approximation of the multidimensional optimal control problem for the heat equation (applicable to computational fluid dynamics (CFD)). Civil Engineering Journal, 6(4), 743–768. https://doi.org/10.28991/cej-2020-03091506
  • Kot, M. (2001). Elements of mathematical ecology. Cambridge University Press.
  • Kuang, Y. (1993). Delay differential equations: With applications in population dynamics. cademic press.
  • Kumar, D. (2018). An implicit scheme for singularly perturbed parabolic problem with retarded terms arising in computational neuroscience. Numerical Methods for Partial Differential Equations, 34(6), 1933–1952. https://doi.org/10.1002/num.22269
  • Kumar, M., & Gupta, Y. (2010). Methods for solving singular boundary value problems using splines: A review. Journal of Applied Mathematics and Computing, 32(1), 265–278. https://doi.org/10.1007/s12190-009-0249-2
  • Ladyzhenskaia, O. A., Solonnikov, V. A., & Nina, N. (1968). Ural’tseva, Linear and quasi-linear equations of parabolic type, 23. American Mathematical Soc.
  • Lánskỳ, P. (1984). On approximations of Stein’s neuronal model. Journal of Theoretical Biology, 107(4), 631–647. https://doi.org/10.1016/S0022-5193(84)80136-8
  • Mackey, M. C., & Glass, L. (1977). Oscillation and chaos in physiological control systems. Science, 197(4300), 287–289. https://doi.org/10.1126/science.267326
  • Mayer, H., Zaenker, K. S., & An Der Heiden, U. (1995). A basic mathematical model of the immune response, Chaos: An interdisciplinary. Journal of Nonlinear Science, 5(1), 155–161. https://aip.scitation.org/doi/abs/10.1063/1.166098
  • MihajloviC, G., & Zivkovic, M. (2020). Sieving extremely wet earth mass by means of oscillatory transporting platform. Emerging Science Journal, 4(3), 172–182. https://doi.org/10.28991/esj-2020-01221
  • Murray, J. D. (2007). Mathematical biology: I. An Introduction, 17. https://link.springer.com/content/pdf/10.1007/b98868.pdf%20http://www.ulb.tu-darmstadt.de/tocs/127987207.pdf
  • Musila, M., & Lánskỳ, P. (1991). Generalized Stein’s model for anatomically complex neurons. BioSystems, 25(3), 179–191. https://doi.org/10.1016/0303-2647(91)90004-5
  • Nageshwar Rao, R., & Pramod Chakravarthy, P. (2019). Fitted numerical methods for singularly perturbed one-dimensional parabolic partial differential equations with small shifts arising in the modelling of neuronal variability. Differential Equations and Dynamical Systems, 27(1–3), 1–18. https://doi.org/10.1007/s12591-017-0363-9
  • Nelson, P. W., & Perelson, A. S. (2002). Mathematical analysis of delay differential equation models of HIV-1 infection. Mathematical Biosciences, 179(1), 73–94. https://doi.org/10.1016/S0025-5564(02)00099-8
  • Nichols, N. K. (1989). On the numerical integration of a class of singular perturbation problems. Journal of Optimization Theory and Applications, 60(3), 439–452. https://doi.org/10.1007/BF00940347
  • O’Malley, R. E. (1991). Singular perturbation methods for ordinary differential equations. New York: Springer.
  • Pramod Chakravarthy, P., Dinesh Kumar, S., & Nageshwar Rao, R. (2017). Numerical solution of second order singularly perturbed delay differential equations via cubic spline in tension. International Journal of Applied and Computational Mathematics, 3(3), 1703–1717. https://doi.org/10.1007/s40819-016-0204-5
  • Ramesh, V. P., & Priyanga, B. (2019). Higher order uniformly convergent numerical algorithm for time-dependent singularly perturbed differential-difference equations, (pp. 1–25). Differential Equations and Dynamical Systems.
  • Ravi Kanth, A. S. V., Murali, P., & Mohan, K. (2017). A numerical approach for solving singularly perturbed convection delay problems via exponentially fitted spline method. Calcolo, 54(3), 943–961. https://doi.org/10.1007/s10092-017-0215–6
  • Stein, R. B. (1967). Some models of neuronal variability. Biophysical Journal,7(1), 7(1), 37–68. https://doi.org/10.1016/S0006-3495(67)86574-3
  • Tene, T., Guevara, M., Svozil, J., Tene-Fernandez, R., & Gomez, C. V. (2021). Analysis of covid-19 outbreak in Ecuador using the logistic model. Emerging Science Journal, 5, 105–118. https://doi.org/10.28991/esj-2021-SPER-09
  • Vikas Gupta, M. K., & Kadalbajoo, R. K. (2019). Dubey. A parameter-uniform Higher Order Finite Difference Scheme for Singularly Perturbed time-dependent Parabolic Problem with Two Small Parameters, International Journal of Computer Mathematics, 96(3), 474–499. https://doi.org/10.1080/00207160.2018.1432856
  • Wazewska-Czyzewska, M., & Lasota, A. (9176). Mathematical models of the red cell system. Matematyta Stosowana, 6(1), 25–40.
  • Woldaregay, M. M., & Duressa, G. F. (2019). Parameter uniform numerical method for singularly perturbed parabolic differential difference equations. Journal of the Nigerian Mathematical Society, 38(2), 223–245. https://ojs.ictp.it/jnms/index.php/jnms/article/view/474
  • Woldaregay, M. M., & Duressa, G. F. (2020). Uniformly convergent numerical scheme for singularly perturbed parabolic delay differential equations. ITM Web of Conferences, 34, 02011. https://doi.org/10.1051/itmconf/20203402011
  • Woldaregay, M. M., & Duressa, G. F. (2022). Uniformly convergent numerical method for singularly perturbed delay parabolic differential equations arising in computational neuroscience. Kragujevac Journal of mathematics, 46(1), 65–84.