Publication Cover
Mathematical and Computer Modelling of Dynamical Systems
Methods, Tools and Applications in Engineering and Related Sciences
Volume 30, 2024 - Issue 1
306
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Non-polynomial spline approach for solving system of singularly perturbed delay differential equations of large delay

&
Pages 179-201 | Received 11 Oct 2023, Accepted 31 Jan 2024, Published online: 21 Mar 2024

ABSTRACT

A computational technique for analysing coupled system of singularly perturbed convection-diffusion delay differential equations with large delay is presented in this study. We solve this problem using non-polynomial spline technique and arrive at a system that can potentially be solved. To show the theoretical investigation, an example is solved for different perturbation parameter values, and the computational results are shown in tables. The model we have proposed is of first order convergent, and this technique indicated that the acquired findings were more accurate than earlier results.

1. Introduction

A singularly perturbed delay differential equation is one in which the highest order derivative term is multiplied by a positive small parameter and at least one delay or advance term, or both, is involved. The study of singular perturbations has come a long way in mathematics and has important potential applications in many areas of science and technology. Different types of real-world phenomena such as in the modelling of the pupil-light reflex in humans (Longtin and Milton Citation1988), predator-prey model (Gourley and Kuang Citation2004), HIV infection model (Culshaw and Ruan Citation2000), variational problem in control theory (Glizer Citation2000), determination of the behaviour of a neuron to random synaptic input (Lange and Miura Citation1982), optically bistable device (Mayer et al. Citation1995),the dynamics of two identical amplifier networks (Chen and Wu Citation2001), the first exit-time problem (Kot Citation2001), hydrodynamics of liquid helium (Kuang Citation1993), various physiological process models (Mackey and Glass Citation1977) and numerous other applied mathematical problems can be modelled mathematically by singularly perturbed delay differential equations. These differential equations are used to solve problems in which the future is dependent on the present as well as past states of the system being investigated under consideration.

In singular perturbation problems, the convection-diffusion type is referred to when the perturbation parameter equals zero and the order is lowered by one, whereas the reaction-diffusion type is referred to when the order is lowered by two. As a result, second-order singularly perturbed delay differential equations can be either convection-diffusion or reaction-diffusion in nature. In the first type of problem, the left or right-boundary layer is only determined by the sign of the coefficients in the diffusion and convection terms. On the other hand, in reaction-diffusion delay differential equations, there are two boundary layers. As a result, numerous researchers have been working to create various numerical techniques for handling these kinds of problems. When normal numerical methods are used, it is widely known that these types of problems yield inaccurate results for small values of the perturbation parameter. As a result, it is essential to develop numerical techniques that can provide improved accuracy regardless of parameter values. Another crucial aspect of these types of problems is the investigation of the effect of shift parameters on the solution’s boundary layer behaviour. Consequently, there has been a rise in interest in numerical techniques for singularly perturbed delay differential equations in recent years.

In problems involving control systems, the state of the system is observed and adjustments are incorporated to control the outcomes. Due to the impossibility of instantaneous adjustment, there is always a delay between observation and control action. Differential equations with delay arguments govern this type of system. For a single singularly perturbed delay differential equation, robust numerical techniques have been developed by Lange and Miura (Lange and Miura Citation1994) investigated a class of boundary-value problems and discussed an asymptotic method to approximately solve this type of differential equations. Phaneendra and Lalu (Phaneendra and Lalu Citation2019) had carried out a quadrature technique for the solution of this type of problems. They used a neutral delay differential equation which is equivalent to the SPDDE. Chakravarthy and Kumar (Chakravarthy and Kumar Citation2021) proposed Numerov’s method which uses a fitted operator finite difference technique. Sekar and Tamilselvan (Erdogan et al. Citation2020) suggested a piecewise Shishkin type mesh to solve the problem by using finite difference method. Erdogan and Sakar (Woldaregay and Liu Citation2022) suggested a numerical technique based on a piecewise uniform Shishkin mesh with an exponentially fitted difference scheme for each time-subinterval. Woldaregay and Durressa (Sekar and Tamilselvan Citation2019) used Taylor series approximation to approximate the delay terms, and the obtained singularly perturbed boundary value problem is solved with an exponentially fitted operator mid-point upwind finite difference method. But for systems of equations, only a small number of results have been reported. Subburayan and Ramanujam (Subburayan and Ramanujam Citation2014) proposed an asymptotic computational technique for convection diffusion type equations. The authors in (Selvi and Ramanujam Citation2017) applied a computational technique to solve a system of singularly perturbed delay differential equations of large delay that was weakly coupled. Chakravarthy and Gupta (Chakravarthy and Gupta Citation2020) focus on the use of cubic splines in tension approximation techniques to solve system of singularly perturbed convection diffusion equation.

We developed a fitted non-polynomial spline technique for the numerical solution of the system of second-order singularly perturbed delay differential equations with large delay. When the perturbation parameter is small compared to the mesh width used to discretize the given problem, it is well known that the conventional techniques fail. Our goal is to demonstrate that, when epsilon is small or large in relation to step size h, accurate numerical approximations can be obtained using a non-polynomial spline. Here, we take a non-polynomial spline approach using the fitted operator method to solve this kind of problem. In Sect. 2, we define the problem and assumptions on the parameter ε and stability analysis is discussed in Sect. 3. In Sect. 4 we employ the non-polynomial spline to arrive at its numerical solution by Gauss elimination method. In Sect. 5, we perform the error and convergence analysis of the method. In Sect. 6 we took some examples and compared the results with (Subburayan and Ramanujam Citation2014; Selvi and Ramanujam Citation2017; Chakravarthy and Gupta Citation2020) and their results are shown. Conclusion follows in Sect. 7.

2. Statement of the problem

Consider the following class of system of singularly perturbed delay differential equation on the domain Γ=(0,2),

(1) L1z(t)εz ′′1(t)+p1(t)z 1(t)+k=12q1k(t)zk(t)+k=12r1k(t)zk(t1)=s1(t),t(0,2)L2z(t)εz ′′2(t)+p2(t)z 2(t)+k=12q2k(t)zk(t)+k=12r2k(t)zk(t1)=s2(t),t(0,2)(1)

with boundary conditions,

(2) z1(t)=ϕ1(t),t[1,0],z1(2)=γ1,z2(t)=ϕ2(t),t[1,0],z2(2)=γ2,(2)

where the perturbation parameter satisfy 0<ε<<1.

It is also assumed that the functions p1(t),p2(t),q11(t),q12(t),q21(t),q22(t),\breakr11(t),r12(t),r21(t),r22(t),s1(t) and s2(t) are sufficiently smooth functions on Γˉ=[0,2] together with the following conditions:

p1(t)l1>0andp2(t)l2>0

and

mintΓˉk=12q1k(t),k=12q2k(t)λ1>0,
mintΓˉk=12r1k(t),k=12r2k(t)λ2>0.

The differential operator in (1) can be written as:

Lz=L1z,L2zT=εd2zdt2+P(t)dzdt+Q(t)z+R(t)z(t1),

where the coefficient matrices are given by,

ε=ε00ε,P(t)=p1(t)00p2(t),Q(t)=q11q12q21q22,R(t)=r11r12r21r22.

Also the functions pi,qik,rik,siC4(Γˉ),i=1,2,k=1,2. In addition, the boundary conditions ϕ=ϕ1,ϕ2T,γ=γ1,γ2T and the source term s=s1,s2T are smooth functions on Γ, where Γ=(0,2),Γˉ=[0,2],Γ=[1,0]. In this context, Cn(Γ) refers to the class of n times continuously differentiable functions in Γ. Also, the problem (1) and (2) shows a weak boundary layer at t=1 and a strong layer at t=2.

3. Stability analysis

Theorem 3.1.

Let the function z=z1,z2T,z1,z2C0ΓˉC2(Γ) satisfying zj(0)0,zj(2)0,Ljz0,j=1,2,∀tΓ and z j(1+)zj (1)=[z j](1)0,j\break=1,2. Then zj(t)0,∀tΓˉ,j=1,2.

Proof.

Define r=(r1,r2), where

r1(t)=r2(t)=18+t2,t[0,1]38+t4,t[1,2]

Here ri(t) is positive for all xΓˉ,Lir>0,tΓ and [r i](1)<0,i=1,2. Let

μ=maxmaxtΓˉz1(t)r1(t),maxtΓˉz2(t)r2(t).

Then there exists t0Γˉ satisfying z1(t0)+μr1(t0)=0 or z2(t0)+μr2(t0)=0 or both and zj(t)+μrj(t)0,∀tΓˉ,j=1,2. Without loss of generality, we assume that z1(t0)+μr1(t0)=0. Hence z1+μr1 attains its minimum. Suppose the theorem does not hold true, then μ>0.

Case 1: t0Γ=(0,1).

Then, for j=1,2,

0<Lj(z+μr)(t0)=ε(zj+μrj) ′′(t0)+pj(t0)(zj+μrj) (t0)+i=12qji(t0)(zj+μrj)(t0)0,

which is a contradiction to our assumption.

Case 2: t0Γ+=(1,2).

Then, for j=1,2,

0<Lj(z+μr)(t0)=ε(zj+μrj) ′′(t0)+pj(t0)(zj+μrj) (t0)+i=12qji(t0)(zj+μrj)(t0)+i=12rji(t0)(zj+μrj)(t01)0,

which is a contradiction to our assumption.

Case 3: t0=1.

Then, for j=1,2,

0[(zj+μrj) ](1)=[z j](1)+μ[r j](1)<0,

which is a contradiction to our assumption.

From this, it is clear that in all the three cases we arrived a contradiction. Therefore μ>0 is not possible. This shows that,

zj(t)0,∀tΓˉ,j=1,2.

Theorem 3.2.

Let z=(z1,z2),z1,z2C0(Γˉ)C1(Γ)C2(Γ) be any function. Then

|zj(t)|Kmaxmaxi=1,2|zi(0)|,maxi=1,2|zi(2)|,maxi=1,2LizΓ

for all tΓˉ,j=1,2.

Proof. Let K>0 be a constant. Define τ±=(τ1±,τ2±), where,

τj±(t)=KKˉrj(t)±zj(t),∀tΓˉ,j=1,2,

where,

Kˉ=maxmaxi=1,2|zi(0)|,maxi=1,2|zi(2)|,maxi=1,2LizΓ.

By appropriate choice of K, we obtain,

τj±(0)=KKˉrj(0)±zj(0)>0andτj±(1)=KKˉrj(1)±zj(1)>0,j=1,2,

Let tΓ, then by appropriate choice of K and j=1,2, we obtain,

Ljτ±=KKˉLjr±Ljz0.

Similarly we can prove for Ljτ±0 in Γ+. Therefore Ljτ±0 in Γ. Also by proper choice of K, we obtain,

τj± (1)=KKˉ[r j](1)+[z j](1)<0,j=1,2.

Then by Theorem 3.1, we obtain τj±(t)0,tΓˉ,j=1,2. Therefore,

|zj(t)|Kmaxmaxi=1,2|zi(0)|,maxi=1,2|zi(2)|,maxi=1,2LizΓ,

for all tΓˉ,j=1,2.

4. Derivation of the method

The objective of this section is to introduce the uniform mesh and the numerical approach that is being examined in this article. Let Γˉ2N={ti}i=02N be the discretized domain with 2N mesh – intervals on the domain Γˉ=[0,2], where N is as an even positive integer. Let 0=t0,t1,,tN=1,tN+1,,t2N=2 be the mesh points obtained while dividing [0,2], such that the step size hi=titi1 for i=1,2,,2N1.

4.1. Numerical algorithm

The following algorithm is proposed to obtain the numerical solution:

Step 1: Introduce the uniform mesh by discretizing the domain [0,2] with 2N mesh intervals.

Step 2: Non-polynomial spline method is applied to the statement problem to obtain the scheme.

Step 3: We use Taylor series approximations for the derivatives in the scheme obtained in Step 2 to arrive at two systems for Z1 and Z2.

Step 4: Introduce fitting factor to the schemes obtained in Step 3, and we derive the schemes into a system of equations in different mesh intervals, incorporating history functions.

Step 5: Finally, we employ Gauss elimination method to solve the system obtained in Step 4 by using MATLAB R2022a mathematical software.

4.2. The proposed numerical scheme

The non-polynomial spline MΔj(t) is of the following form:

(3) MΔj(t)=aj,isinω(tti)+bj,icosω(tti)+cj,ieω(tti)eω(tti)+dj,ieω(tti)+eω(tti),(3)

for j=1,2andi=1,2,,2N1, where the coefficients aj,i,bj,i,cj,i,dj,i are unknown and ω0 is an arbitrary parameter that will be utilized to improve the methods accuracy.

In order to calculate the coefficients which are unknown in (3), we use the conditions,

MΔj(ti)=Zj,i,MΔj(ti+1)=Zj,i+1,
M ′′Δj(ti)=Mj,i,M ′′Δj(ti+1)=Mj,i+1,

to determine aj,i,bj,i,cj,i and dj,i.

We get aj,i,bj,i,cj,i and dj,i in (3) as,

(4) aj,i=ω2Zj,i+1Mj,i+1+Mj,icosφZj,iω2cosφ(2sinφ)ω2,bj,i=Zj,iω2Mj,i2ω2,cj,i=ω2Zj,i+1+Mj,ieφ+eφ2Zj,i+1ω22Mj,i+14(eφeφ)ω2,dj,i=Zj,iω2+Mj,i4ω2,(4)

where φ=ω(tti).

Applying the first derivative continuity condition at ti, M Δj(ti)=M Δj+(ti), we get,

(5) aj,i1cosφaj,i+cj,i1eφeφ2cj,i=bj,i1sinφdj,i1eφeφ.(5)

We obtain the following equation by reducing indices in (4) by one and putting them into (5),

(6) 1eφeφ12sinφZj,i1+cotφ+eφ+eφeφeφZj,i+1eφeφ12sinφZj,i+1=h2φ2eφeφh22φ2sinφMj,i1+h2cotφφ2+h2eφ+eφφ2eφeφMj,i+h2φ2eφeφh22φ2sinφMj,i+1.(6)

Multiplying with 2eφeφsinφeφeφ+2sinφ in both sides of (6), we get,

(7) Zj,i1+ρZj,i+Zj,i+1=h2α1Mj,i1+α2Mj,i+α1Mj,i+1,(7)

where,

ρ=2cosφ+sinφeφ+2sinφcosφeφeφeφ2sinφ,
α1=eφeφ2sinφeφeφ+2sinφφ2,
α2=2cosφsinφeφ2sinφ+cosφeφeφeφ2sinφφ2.

As h0,φ0. We get α1,α2,ρ16,46,2 by applying L’Hospital’s rule. Substituting M ′′Δj(ti)=Z ′′j,i=Mj,i into (1). The boundary conditions can be written as,

Zj,i=ϕj,i,Ni0,
Zj,2N=γj,

where j=1,2.

For i=1,2,,2N1,k=1,2, we consider the notations,

p1(ti)=p1,i,p2(ti)=p2,i,q1k(ti)=q1k,i,q2k(ti)=q2k,i,c1k(ti)=c1k,i,c2k(ti)=c2k,i,s1(ti)=s1,i,s2(ti)=s2,i.

From Equationequation (1), we obtain,

εM1,k=p1,kZ 1,k+q11,kZ1,k+q12,kZ2,k+r11,kZ1(tk1)+r12,kZ2(tk1)s1,k,
εM2,k=p2,kZ 2,k+q21,kZ2,k+q22,kZ2,k+r21,kZ1(tk1)+r22,kZ2(tk1)s2,k.

Substituting M1,k and M2,k with k=1,1+i,1i and using the following approximations for the first derivative of Z,

Z j,i=Zj,i+1Zj,i12h,j=1,2,
Z j,i+1=3Zj,i+14Zj,i+Zj,i12h,j=1,2,
Z j,i1=Zj,i+1+4Zj,i3Zj,i12h,j=1,2.

We obtain the following linear system of equations for Z1,i and Z2,i,

ε3α1hp1,i12+α1h2q11,i1α2hp1,i2+α1hp1,i+12Z1,i1+ερ+2α1hp1,i1+α2h2q11,i2α1hp1,i+1Z1,i+εα1hp1,i12+α2hp1,i2+3α1hp1,i+12+α1h2q11,i+1Z1,i+1+α1h2q12,i1Z2,i1+α2h2q12,iZ2,i+α1h2q12,i+1Z2,i+1=h2α1s1,i1+α2s1,i+α1s1,i+1h2α1r11,i1Z1(ti11)+α2r11,iZ1(ti1)+α1r11,i+1Z1(ti+11)h2α1r12,i1Z2(ti11)+α2r12,iZ2(ti1)+α1r12,i+1Z2(ti+11),
ε3α1hp2,i12+α1h2q22,i1α2hp2,i2+α1hp2,i+12Z2,i1+ερ+2α1hp2,i1+α2h2q22,i2α1hp2,i+1Z2,i+εα1hp2,i12+α2hp2,i2+3α1hp2,i+12+α1h2q22,i+1Z2,i+1+α1h2q21,i1Z1,i1+α2h2q21,iZ1,i+α1h2q21,i+1Z1,i+1=h2α1s2,i1+α2s2,i+α1s2,i+1h2α1r22,i1Z2(ti11)+α2r22,iZ2(ti1)+α1r22,i+1Z2(ti+11)h2α1r21,i1Z1(ti11)+α2r21,iZ1(ti1)+α1r21,i+1Z1(ti+11),
(8) fori=1,2,,2N1.(8)

4.3. Calculation of fitting parameter

An estimate for the solution of the homogeneous problem (1) is of the form:

(9) zj(t)=zj0(t)+pj(0)pj(t)αzj0(0)e0tpj(t)ϵdt+O(ε),(9)

j=1,2, which is derived from the theory of singular perturbations. Here zj0(t) is the solution of the reduced problem.

We may assume that the coefficients are locally constant because we are examining the differential equations on suitably small subintervals. By applying the Taylor’s series expansion for pj(t),bj1(t) and bj2(t) about the point t=0 and restricting to their first terms, the above Equationequation (9) becomes,

(10) zj(t)=zj0(t)+αzj0(0)epj(0)εx+O(ε),j=1,2.(10)

From (10), taking the limit as h0, and ρ=hε, we obtain,

limh0zj(ih)=zj0(0)+αzj0(0)epj(0),
limh0zj(ih+h)=zj0(0)+αzj0(0)epj(0)(+ρ),
limh0zj(ihh)=zj0(0)+αzj0(0)epj(0)(ρ).

Substituting these limiting values in (1), we get the fitting parameter,

σj=pj(t)ρ2cothpj(t)ρ2,j=1,2.

The scheme in (8) with the fitting factor can be rewritten as:

εσ13α1hp1,i12+α1h2q11,i1α2hp1,i2+α1hp1,i+12Z1,i1+ερσ1+2α1hp1,i1+α2h2q11,i2α1hp1,i+1Z1,i+εσ1α1hp1,i12+α2hp1,i2+3α1hp1,i+12+α1h2q11,i+1Z1,i+1+α1h2q12,i1Z2,i1+α2h2q12,iZ2,i+α1h2q12,i+1Z2,i+1=h2α1s1,i1+α2s1,i+α1s1,i+1h2α1r11,i1Z1(ti11)+α2r11,iZ1(ti1)+α1r11,i+1Z1(ti+11)h2α1r12,i1Z2(ti11)+α2r12,iZ2(ti1)+α1r12,i+1Z2(ti+11),
εσ23α1hp2,i12+α1h2q22,i1α2hp2,i2+α1hp2,i+12Z2,i1+ερσ2+2α1hp2,i1+α2h2q22,i2α1hp2,i+1Z2,i+εσ2α1hp2,i12+α2hp2,i2+3α1hp2,i+12+α1h2q22,i+1Z2,i+1+α1h2q21,i1Z1,i1+α2h2q21,iZ1,i+α1h2q21,i+1Z1,i+1=h2α1s2,i1+α2s2,i+α1s2,i+1h2α1r22,i1Z2(ti11)+α2r22,iZ2(ti1)+α1r22,i+1Z2(ti+11)h2α1r21,i1Z1(ti11)+α2r21,iZ1(ti1)+α1r21,i+1Z1(ti+11),
(11) fori=1,2,,2N1.(11)

By incorporating history functions in interval conditions, the above scheme (11) can be rewritten as follows:

E1,iZ1,i1+F1,iZ1,i+G1,iZ1,i+1+A2,iZ2,i1+B2,iZ2,i+C2,iZ2,i+1=D1,iH1,iϕ1,i1NI1,iϕ1,iNJ1,iϕ1,i+1NK2,iϕ2,i1NL2,iϕ2,iNM2,iϕ2,i+1N,for1iN1,
E1,iZ1,i1+F1,iZ1,i+G1,iZ1,i+1+A2,iZ2,i1+B2,iZ2,i+C2,iZ2,i+1+J1,iZ1,i+1N+M2,iZ2,i+1N=D1,iH1,iϕ1,i1NI1,iϕ1,iNK2,iϕ2,i1NL2,iϕ2,iN,fori=N,
E1,iZ1,i1+F1,iZ1,i+G1,iZ1,i+1+A2,iZ2,i1+B2,iZ2,i+C2,iZ2,i+1+J1,iZ1,i+1N+M2,iZ2,i+1N+I1,iZ1,iN+L2,iZ2,iN=D1,iH1,iϕ1,i1NK2,iϕ2,i1Nfori=N+1,
E1,iZ1,i1+F1,iZ1,i+G1,iZ1,i+1+A2,iZ2,i1+B2,iZ2,i+C2,iZ2,i+1+J1,iZ1,i+1N+M2,iZ2,i+1N+I1,iZ1,iN+L2,iZ2,iN+H1,iZ1,i1N+K2,iZ2,i1N=D1,iforN+2i2N1,

and

E2,iZ2,i1+F2,iZ2,i+G2,iZ2,i+1+A1,iZ1,i1+B1,iZ1,i+C1,iZ1,i+1=D2,iH2,iϕ2,i1NI2,iϕ2,iNJ2,iϕ2,i+1NK1,iϕ1,i1NL1,iϕ1,iNM1,iϕ1,i+1Nfor1iN1,
E2,iZ2,i1+F2,iZ2,i+G2,iZ2,i+1+A1,iZ1,i1+B1,iZ1,i+C1,iZ1,i+1+J2,iZ2,i+1N+M1,iZ1,i+1N=D2,iK2,iϕ2,i1NI2,iϕ2,iNK1,iϕ1,i1NL1,iϕ1,iNfori=N,
E2,iZ2,i1+F2,iZ2,i+G2,iZ2,i+1+A1,iZ1,i1+B1,iZ1,i+C1,iZ1,i+1+J2,iZ2,i+1N+M1,iZ1,i+1N+I2,iZ2,iN+L1,iZ1,iN=D2,iH2,iϕ2,i1NK1,iϕ1,i1Nfori=N+1,
E2,iZ2,i1+F2,iZ2,i+G2,iZ2,i+1+A1,iZ1,i1+B1,iZ1,i+C1,iZ1,i+1+J2,iZ2,i+1N+M1,iZ1,i+1N+I2,iZ2,iN+L1,iZ1,iN+H2,iZ2,i1N+K1,iZ1,i1N=D2,iforN+2i2N1,

where,

E1,i=εσ13α1hp1,i12+α1h2q11,i1α2hp1,i2+α1hp1,i+12,
F1,i=ερσ1+2α1hp1,i1+α2h2q11,i2α1hp1,i+1,
G1,i=εσ1α1hp1,i12+α2hp1,i2+3α1hp1,i+12+α1h2q11,i+1,
D1,i=h2α1s1,i1+α2s1,i+α1s1,i+1,
A1,i=h2α1q12,i1,B1,i=h2α2q12,i,C1,i=h2α1q12,i+1,H1,i=h2α1r11,i1,I1,i=h2α2r11,i,J1,i=h2α1r11,i+1,K1,i=h2α1r12,i1,L1,i=h2α2r12,i,M1,i=h2α1r12,i+1,

and,

E2,i=εσ23α1hp2,i12+α1h2q22,i1α2hp2,i2+α1hp2,i+12,
F2,i=ερσ2+2α1hp2,i1+α2h2q22,i2α1hp2,i+1,
G2,i=εσ2α1hp2,i12+α2hp2,i2+3α1hp2,i+12+α1h2q22,i+1,
D2,i=h2α1s2,i1+α2s2,i+α1s2,i+1,
A2,i=h2α1q21,i1,B2,i=h2α2q21,i,C2,i=h2α1q21,i+1,H2,i=h2α1r22,i1,I2,i=h2α2r22,i,J2,i=h2α1r22,i+1,K2,i=h2α1r21,i1,L2,i=h2α2r21,i,M2,i=h2α1r21,i+1.

5. Error and convergence analysis

By Taylor series expansion,

zj,i+1=zj,i+hz j,i+h22z ′′j,i+h36zj,i3+O(h4),
zj,i1=zj,ihz j,i+h22z ′′j,ih36zj,i3+O(h4).

For j=1,2, the truncation error obtained is

τj,i=h33α1pj,i1zj,i3h36α2pj,izj,i3+h33α1pj,i+1zj,i3+O(h4).

We combine the equations derived from (11) for the system of two equations to arrive at a matrix form as follows:

(12) XZ=V,(12)

where X=(xij) is a matrix of order 4N2 such that,

xi,i=F1,i,i=1to2N1F2,i,i=2Nto4N1;
xi,i+1=G1,i,i=1to2N1G2,i,i=2N+1to4N2;
xi,i1=E1,i,i=2to2N1E2,i,i=2Nto4N2;
xi,i+2N=C2,i,i=1to2N2;xi,i+2N1=B2,i,i=1to2N1;xi,i+2N2=A2,i,i=2to2N1;xi,iN=I1,i,i=N+1to2N1;xi,iN+1=J1,i,i=N+1to2N1;xi,iN1=H1,i,i=N+2to2N1;xi,i+N=M2,i,i=N+1to2N1;xi,i+N1=L2,i,i=N+1to2N1;xi,i+N2=K2,i,i=N+2to2N1;xi,i2N=A1,i,i=2N+1to4N2;xi,i2N+1=B1,i,i=2Nto4N2;xi,i2N+2=C1,i,i=2Nto4N2;xi,i2N2=M1,i,i=2N+3to4N2;xi,i2N3=L1,i,i=2N+4to4N2;xi,i2N4=K1,i,i=2N+5to4N2;xi,i3=J2,i,i=2N+3to4N2;xi,i4=I2,i,i=2N+4to4N2;xi,i5=H2,i,i=2N+5to4N2,

and all the remaining entries of X are zero and V=(vi) is a column vector such that

vi=D1,iH1,iϕ1,i1NI1,iϕ1,iNJ1,iϕ1,i+1NK2,iϕ2,i1NL2,iϕ2,iNM2,iϕ2,i+1N,for1iN1,D1,iH1,iϕ1,i1NI1,iϕ1,iNK2,iϕ2,i1NL2,iϕ2,iN,fori=N,D1,iH1,iϕ1,i1NK2,iϕ2,i1Nfori=N+1,D1,iforN+2i2N1,D2,iH2,iϕ2,i1NI2,iϕ2,iNJ2,iϕ2,i+1NK1,iϕ1,i1NL1,iϕ1,iNM1,iϕ1,i+1Nfor2Ni3N1,D2,iK2,iϕ2,i1NI2,iϕ2,iNK1,iϕ1,i1NL1,iϕ1,iN,fori=3N,D2,iH2,iϕ2,i1NK1,iϕ1,i1Nfori=3N+1,D2,i,for3N+2i4N2,
andZ=Z1,1(h)...Z1,2N1(h)Z2,1(h)...Z2,2N1(h)t.

Let

Y(h)=Y1,1(h)...Y1,2N1(h)Y2,1(h)...Y2,2N1(h)t

be the truncation error, where

Yj,i(h)=h33α1pj,i1zj,i3α2pj,izj,i3+α1pj,i+1zj,i3+O(h4).

Then (12) can be written as XZˉY(h)=V, where

Zˉ=Zˉ1,1(h)...Zˉ1,2N1(h)Zˉ2,1(h)...Zˉ2,2N1(h)t

is the exact solution. It follows that XEˉr=Y(h), where

Eˉr=ZˉZ=Eˉr=e1,1...e1,2N1e2,1...e2,2N1t

Let Rˉi denote the ith row sum of the matrix X. Then

Rˉ1=F1,1+G1,1+B2,1+C2,1=εσ1+32α1hp1,i1+α2hp1,i2α1hp1,i+12+α2h2q11,i+α1h2q11,i+1+h2α2q21,i+h2α1q21,i+1,Rˉi=E1,iF1,i+G1,i+A2,i+B2,i+C2,i=h2[α1q11,i1+α2q11,i+α1q11,i+1+α1q21,i1+α2q21,i+α1q21,i+1]=h2Qi,fori=2toN,Rˉi=I1,i+J1,i+E1,i+F1,i+G1,i+L2,i+M2,i+A2,i+B2,i+C2,i=h2α1q11,i1+α2q11,i+α1q11,i+1+α1q21,i1+α2q21,i+α1q21,i+1+α2r11,i+α1r11,i+1+α2r21,i+α1r21,i+1=h2Qi,fori=N+1,Rˉi=I1,i+J1,i+E1,i+F1,i+G1,i+L2,i+M2,i+A2,i+B2,i+C2,i=h2α1q11,i1+α2q11,i+α1q11,i+1+α1q21,i1+α2q21,i+α1q21,i+1+α2r11,i+α1r11,i+1+α2r21,i+α1r21,i+1+α1r11,i1+α2r21,i1=h2Qi,fori=N+2to2N2,Rˉi=H1,i+I1,i+J1,i+E1,i+F1,i+K2,i+L2,i+M2,i+A2,i+B2,i=εσ1+α1hp1,i12+α2h2q11,i+α1h2q11,i132α1hp1,i+1α2hp1,i2+h2α1r11,i1+α2r11,i+α1r11,i+1+α1r21,i1+α2r21,i+α1r21,i+1+α1q21,i1+α2q21,i,fori=2N1,Rˉi=B1,i+C1,i+F2,i+G2,i=h2[α2q12,i+α1q12,i+1+α2q22,i+α1q22,i+1]+εσ2+3h2α1p2,i1+h2α2p2,ih2α1p2,i+1,fori=2N,
Rˉi=E2,iF2,i+G2,i+A1,i+B1,i+C1,i=h2[α1q22,i1+α2q22,i+α1q22,i+1+α1q12,i1+α2q12,i+α1q12,i+1]=h2Qi,fori=2N+1to3N2,Rˉi=J2,i+E2,i+F2,i+G2,i+M1,i+A1,i+B1,i+C1,i=h2[α1q22,i1+α2q22,i+α1q22,i+1+α1q12,i1+α2q12,i+α1q12,i+1+α1r12,i+1+α1r22,i+1]=h2Qi,fori=3N1,Rˉi=I2,i+J2,i+E2,i+F2,i+G2,i+L1,i+M1,i+A1,i+B1,i+C1,i=h2α1q22,i1+α2q22,i+α1q22,i+1+α1q12,i1+α2q12,i+α1q12,i+1+α1r12,i+1+α1r22,i+1+α2r12,i+α2r22,i=h2Qi,fori=3N,Rˉi=H2,i+I2,i+J2,i+E2,i+F2,i+G2,i+K1,i+L1,i+M1,i+A1,i+B1,i+C1,i=h2α1q22,i1+α2q22,i+α1q22,i+1+α1q12,i1+α2q12,i+α1q12,i+1+α1r12,i+1+α1r22,i+1+α2r12,i+α2r[22,i]+α1r12,i1+α1r22,i1=h2Qi,fori=3N+1to4N1,Rˉi=H2,i+I2,i+J2,i+E2,i+F2,i+K1,i+L1,i+M1,i+A1,i+B1,i=εσ2+3α1hp2,i12h2α2p2,i3h2α1p2,i+h2α1r12,i1+α2r12,i+α1r12,i+1+α1r22,i1+α2r22,i+α1r22,i+1+α1q22,i1+α2q22,i+α1q12,i1+α2q12,i,fori=4N2.

It can be easily verified that the matrix X is monotone and irreducible when h is sufficiently small and hence X1 exists and its elements are non-negative. From Eˉr=X1Y(h) which implies

||Eˉr||=||X1||||Y(h)||

Let xˉj,i be the (j,i)th element of X1. Then i=14N2xˉj,iRˉi=1 for j=1(1)(4N2). This gives

i=14N2xˉj,i1min1i4N2Rˉi1h2|Qi|

Then we can conclude that, for j=1,2 and i=1,2,,2N1

ej,i1h2|Qi|h3L3=O(h)

Hence ||Eˉ||=O(h)

6. Numerical experiments and discussions

Some numerical experiments are taken into consideration to illustrate the applicability of the proposed method. The tabulated solution of some problems with varying ε is presented. Our theoretical approaches have been validated by solving the following examples numerically. MATLAB R2022a is utilized to plot the estimated findings. For the problems with no exact solution, maximum absolute errors are determined by applying the double mesh principle to the provided examples.

(13) Ei,εN=max0jN|Zi,jNZi,2j2N|,(13)

for i=1,2, where Zi,jN and Zi,2j2N are the jth and 2jth components of the numerical solutions of meshes of N and 2N points, respectively. We compute the uniform error by,

EiN=maxεEi,εN.

Example 1

εz ′′1(t)+11z1 (t)+6z1(t)2z2(t)z1(t1)=et,t[0,2],εz ′′2(t)+16z2 (t)2z1(t)+5z2(t)z2(t1)=t2,t[0,2],z1(t)=1,t[1,0],z1(2)=1,z2(t)=1,t[1,0],z2(2)=1.

The maximum pointwise errors are presented in for different values of ε and the numerical results compared with the results in (Subburayan and Ramanujam Citation2014; Selvi and Ramanujam Citation2017; Chakravarthy and Gupta Citation2020). shows the maximum absolute errors for different values of ε. As the step size h=1/N tends to zero for all values of the perturbation parameter epsilon, the maximum absolute errors decrease with the linear rate of convergence, as shown by the results presented in for different values of N with ε=0.1.

Table 3. The maximum absolute error of the example 1 for different values of ε.

Table 1. The maximum absolute error of the example 1 and results in (Subburayan and Ramanujam Citation2014; Selvi and Ramanujam Citation2017; Chakravarthy and Gupta Citation2020).

Table 2. Rate of convergence ρ of the example 1 for ϵ=28.

The graph of the computed solution of two components for different values of ε is given in . represents the graphs of maximum absolute error of both components for different values ε, whereas represents the graphs of point-wise absolute errors for different values of N with ε=0.1. The loglog plot of the maximum pointwise error is also given in .

Figure 1. The numerical solution of example 1 with ε=0.1 and N=100.

Figure 1. The numerical solution of example 1 with ε=0.1 and N=100.

Figure 2. The point-wise absolute errors of example 1 for different values of N, with ε=0.1.

Figure 2. The point-wise absolute errors of example 1 for different values of N, with ε=0.1.

Figure 3. The maximum absolute error of example 1 for different values of ε.

Figure 3. The maximum absolute error of example 1 for different values of ε.

Figure 4. Loglog plot of maximum point-wise errors of example 1 for different values of ε.

Figure 4. Loglog plot of maximum point-wise errors of example 1 for different values of ε.

6.2.

Example 2

εz ′′1(t)+11z1 (t)+6z1(t)2z2(t)z1(t1)=0,t[0,2],εz ′′2(t)+16z2 (t)2z1(t)+5z2(t)z2(t1)=0,t[0,2],z1(t)=1,t[1,0],z1(2)=1,z2(t)=1,t[1,0],z2(2)=1.

The maximum pointwise errors are presented in for different values of ε and the numerical results are compared with the results in (Selvi and Ramanujam Citation2017). As the step size h=1/N tends to zero for all values of the perturbation parameter epsilon, the maximum absolute errors decrease with the linear rate of convergence, as shown by the results presented in for different values of N with ε=28.

Table 4. The maximum absolute error of the example 2 and result in (Selvi and Ramanujam Citation2017).

Table 5. Rate of convergence ρ of the example 2 for ε=28.

The graph of the computed solution of two components for different values of ε is given in . represents the graphs of maximum absolute error of both components for different values ε, whereas represents the graphs of point-wise absolute errors for different values of N with ε=0.1. The loglog plot of the maximum pointwise error is also given in .

Figure 5. The numerical solution of example 2 with ε=0.1 and N=100.

Figure 5. The numerical solution of example 2 with ε=0.1 and N=100.

Figure 6. The maximum absolute error of example 2 for different values of ε.

Figure 6. The maximum absolute error of example 2 for different values of ε.

Figure 7. The point-wise absolute errors of example 2 for different values of N, with ε=0.1.

Figure 7. The point-wise absolute errors of example 2 for different values of N, with ε=0.1.

Figure 8. Loglog plot of maximum point-wise errors of example 1 for different values of ε.

Figure 8. Loglog plot of maximum point-wise errors of example 1 for different values of ε.

The Rate of Convergence (RiN)

The computational rate of convergence RiN is also obtained by using the double mesh principle defined as:

RiN=log(EiN)log(Ei2N)log2,i=1,2

7. Conclusion

This work presents an effective numerical approach for handling a system of SPDDEs (convection-diffusion problems) with large delay. To demonstrate the efficacy of this technique, various values of ε have been applied to some model examples (which do not have an actual solution). It is apparent from the tables that the methodology provides an approximation to the solution. The numerical solutions are summarized in terms of maximum absolute errors , and it is discovered that the discussed method gives an improvement compared to (Subburayan and Ramanujam Citation2014; Selvi and Ramanujam Citation2017; Chakravarthy and Gupta Citation2020). The findings demonstrate convergence of the obtained solution by showing that the maximum absolute errors decline with decreasing grid size and the convergence is of order one with this method. The graphs represent the numerical solution of the problem. represent the rate of convergence RiN.

Acknowledgments

The authors express their sincere thanks to the editor and reviewers for their valuable comments and suggestions that improved the quality of the manuscript.

Disclosure statement

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

Data availability statement

No data was used for the research described in the article.

Additional information

Funding

This work was supported by the VIT University.

References

  • Chakravarthy PP, Gupta T. 2020. Numerical solution of a weakly coupled system of singularly perturbed delay differential equations via cubic spline in tension. Natl Acad Sci Lett. 43:259–262. doi: 10.1007/s40009-019-00806-0.
  • Chakravarthy PP, Kumar K. 2021. A novel method for singularly perturbed delay differential equations of reaction-diffusion type. Differ Equ Dyn Syst. 29(3):723–734. doi: 10.1007/s12591-017-0399-x.
  • Chen Y, Wu J. 2001. The asymptotic shapes of periodic solutions of a singular delay differential system. J Differ Equ. 169(2):614–632. doi: 10.1006/jdeq.2000.3910.
  • Culshaw RV, Ruan S. 2000. A delay-differential equation model of HIV infection of CD4+ T-cells. Math Biosci. 165(1):27–39. doi: 10.1016/S0025-5564(00)00006-7.
  • Erdogan F, Sakar MG, Saldır O. 2020. A finite difference method on layer-adapted mesh for singularly perturbed delay differential equations. Appl Math & Nonlin Sci. 5(1):425–436. doi: 10.2478/amns.2020.1.00040.
  • Glizer VY. 2000. Asymptotic solution of a boundary-value problem for linear singularly-perturbed functional differential equations arising in optimal control theory. J Optim Theory Appl. 106(2):309–335. doi: 10.1023/A:1004651430364.
  • Gourley SA, Kuang Y. 2004. A stage structured predator-prey model and its dependence on maturation delay and death rate. J Math Biol. 49(2):188–200. doi: 10.1007/s00285-004-0278-2.
  • Kot M. 2001. Elements of mathematical ecology. Cambridge, United Kingdom: Cambridge University Press.
  • Kuang Y. 1993. Delay differential equations: with applications in population dynamics. Cambridge, Massachusetts, United States: Academic press.
  • Lange CG, Miura RM. 1982. Singular perturbation analysis of boundary value problems for differential-difference equations. SIAM J Appl Math. 42(3):502–531. doi: 10.1137/0142036.
  • Lange CG, Miura RM. 1994. Singular perturbation analysis of boundary-value problems for differential-difference equations. VI. Small shifts with rapid oscillations. SIAM J Appl Math. 54(1):273–283. doi: 10.1137/S0036139992228119.
  • Longtin A, Milton JG. 1988. Complex oscillations in the human pupil light reflex with mixed and delayed feedback. Math Biosci. 90(1–2):183–199. doi: 10.1016/0025-5564(88)90064-8.
  • Mackey MC, Glass L. 1977. Oscillation and chaos in physiological control systems. Science. 197(4300):287–289. doi: 10.1126/science.267326.
  • Mayer H, Zaenker KS, An Der Heiden U. 1995. A basic mathematical model of the immune response. Chaos: An Interdisciplinary J Nonlinear Sci. 5(1):155–161. doi: 10.1063/1.166098.
  • Phaneendra K, Lalu M. 2019. Numerical solution of singularly perturbed delay differential equations using gaussion quadrature method. J Phys Conf Ser. 1344(1):012013. doi: 10.1088/1742-6596/1344/1/012013.
  • Sekar E, Tamilselvan A. 2019. Singularly perturbed delay differential equations of convection–diffusion type with integral boundary condition. J Appl Math Comput. 59(1–2):701–722. doi: 10.1007/s12190-018-1198-4.
  • Selvi PA, Ramanujam N. 2017. An iterative numerical method for a weakly coupled system of singularly perturbed convection–diffusion equations with negative shifts. Int J Appl Comput Math. 3(S1):147–160. doi: 10.1007/s40819-017-0346-0.
  • Subburayan V, Ramanujam N. 2014. An asymptotic numerical method for singularly perturbed weakly coupled system of convection–diffusion type differential difference equations. Novi Sad J Math. 44(2):53–68.
  • Woldaregay MM, Liu L. 2022. Solving singularly perturbed delay differential equations via fitted mesh and exact difference method. Res Math. 9(1):2109301. doi: 10.1080/27684830.2022.2109301.