269
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Parameter uniform hybrid numerical method for time-dependent singularly perturbed parabolic differential equations with large delay

ORCID Icon &
Article: 2328254 | Received 31 Oct 2023, Accepted 02 Mar 2024, Published online: 13 Mar 2024

ABSTRACT

In this study, to solve the singularly perturbed delay convection–diffusion–reaction problem, we proposed a hybrid numerical scheme that converges uniformly. Parabolic right boundary layer outcomes from the presence of the small perturbation parameter. To grip this layer behaviour, the problem is solved by Bakhvalov–Shishkin mesh for spatial domain discretization and uniform mesh for temporal domain discretization. A hybrid scheme consisting of a non-polynomial spline scheme for fine mesh and a midpoint upwind scheme for coarse mesh is used to discretize the spatial derivative, while an implicit Euler scheme is used to discretize the time derivative. To make computed solutions more accurate and increase rate of convergence of the scheme, we applied Richardson extrapolation technique. The stability and convergence of the scheme are established. The scheme has a second order of convergence in the discrete supreme norm and is parametric uniformly convergent. The scheme's application is demonstrated through two test problems.

MATHEMATICS SUBJECT CLASSIFICATIONS:

1. Introduction

Differential equations that have their highest-order derivatives multiplied by a perturbation parameter ε are said to be singularly perturbed equations. The perturbation parameter takes an arbitrary value in (0,1] which forms interior and/or boundary layers, that is, narrow subdomains on which the solution has a steep gradient. In these subdomains, when ε approaches zero, the derivatives of the solution increase rapidly. Singularly perturbed delay partial differential equations are singularly perturbed problems that involve one or more delay terms. The modelling of many real-world phenomena, including physical, chemical, and biological systems, which are characterized by variables that are both temporal and spatial, uses these equations [Citation1–4]. Particularly, in a better way to comprehend how singularly perturbed delay parabolic differential equations are applied, one can see the example given in [Citation3] , which is being used to model a furnace that processes metal sheet. In the example,the controller's finite speed is the cause of the delay.

Because of the boundary layer's existence in the singularly perturbed problem solution, the classical finite difference methods provide an unsatisfactory numerical result. So various numerical approaches have been developed for solving these problems, which need the so-called uniformly convergent method regardless of the perturbation parameter's value [Citation5,Citation6]. Fitted mesh and fitted operator are the two main numerical methods for constructing a uniformly convergent scheme. Fitted mesh methods use layer-adapted non-uniform mesh, which is dense in the layer(s), while the fitted operator uses an exponentially fitted scheme. There are also other parameter-uniform numerical approximations approaches for singularly perturbed problems, such as domain decomposition [Citation7,Citation8] and grid equidistribution [Citation9]. One can read literature on singularly perturbed delay problems in [Citation10–15]. Richardson extrapolation technique is a numerical method used to improve the accuracy of numerical solutions of differential equations. In the context of singularly perturbed problems, the Richardson extrapolation technique has been used to improve the accuracy of numerical schemes. The reader can get an exposition of this approach in [Citation16–19].

Using spline approximation methods, many authors developed uniformly convergent numerical methods for singularly perturbed delay convection–diffusion–reaction boundary value problems with Dirichlet boundary conditions. To name a few, a second-order exponentially fitted spline and B-spline collocation non-standard method on uniform mesh by a Negero [Citation20,Citation21], a second-order exponentially fitted tension spline on a uniform mesh, a reaction–diffusion version by Megiso et al. [Citation22], and essentially second-order tension spline on shishkin mesh but a reaction-diffusion version by Murali [Citation23]. A singularly perturbed problem with a large delay is one where the delay parameter exceeds the perturbation parameter; otherwise, it is said to be a singularly perturbed problem with small delay [Citation24,Citation25].To the best of our knowledge, the problem under consideration has not been solved using hybrid finite difference, which comprises midpoint upwind and the non-polynomial spline method on the Bakhvalov–Shishkin (B-S) mesh, till date. Motivated by articles [Citation23,Citation26], we developed a uniformly convergent numerical method for solving singularly perturbed parabolic convection–diffusion boundary value problem with a large time delay. The present work has novelties in terms of the existing work. The proposed method is free from convergency spoiled by a logarithmic factor, unlike using the method on Shishkin method. Additionally, the integration of Bakhvalov mesh and the non-polynomial spline method in the layer region potentially provide stability and an accurate numerical solution for singularly perturbed delay parabolic differential equations and allow for more flexibility in choosing the basis function used to approximate the function.

The rest of the paper is structured as follows: In Section 2 continuous problem formulation is described. Section 3 describes bounds on the continuous solution and its derivatives. In Section 4, the numerical scheme is implemented. Section 5 discusses the method's uniform convergence analysis. In Section 6, The technique of Richardson extrapolation has been explained. In Section 7, numerical experiments are illustrated in order to verify the theoretical result. The main conclusions are summarized in the last section.

Throughout the paper, C,C1, and C2, have been taken as generic positive constants that are independent of mesh size, mesh point, and perturbation parameter.

In the following sections g denote standard supremum norm and defined as g=sup(x,t)D|g(x,t)| defined on domain D.

2. Statement of the problem

The class of singularly perturbed delay parabolic convection–diffusion problems that we examine is as follows. (1) (t+Lε)z(x,t)+c(x,t)z(x,tτ)=f(x,t),(x,t)D,(1) with the subsequent interval and boundary conditions: (2) z(x,t)=ψb(x,t),(x,t)Γb=[0,1]×[τ,0],z(0,t)=ψl(t),(0,t)Γl={(0,t),0tT},z(1,t)=ψr(t),(1,t)Γr={(1,t),0tT},(2) where, Lε=ε2x2+a(x)x+b(x,t).Here D=Ω×Λ,Λ=(0,T],Ω=(0,1) and Γ=ΓrΓbΓl. Also 0<ε1 and τ>0 are respectively, perturbation and delay parameters. The functions f(x,t),c(x,t), and b(x,t) in D¯, a(x) in Ω¯, and ψl(t),ψb(x,t), and ψr(t) in Γ are assumed to be sufficiently smooth, bounded and independent of ε, that satisfy a(x)α>0,c(x,t)γ>0,b(x,t)β>0,(x,t)D¯.It is assumed that the terminal time T satisfies the condition T=, where k is positive integer. Under the aforementioned circumstances, the boundary layer of width O(ε) along x = 1 is displayed in the boundary value problem Equations (Equation1)–(Equation2) solution. The problem under consideration occurs in fluid dynamics. In this engineering field, the coefficient of the convective term represents the f mass transfer rate [Citation27]. If this transfer rate is influenced by external factors such as temperature gradient or fluid velocity variation, the convective flow is more spatially dependent, i.e. it is time-invariant a(x). However, it is important to note that there are situations where there is both significant temporal and spatial variation occurs, so the coefficient of the convection term is a(x,t). In such cases, the convergence analysis is general and is covered in [Citation28,Citation29].

3. Bounds on the solution and its derivatives

If the data are sufficiently smooth in their domain of definition and meet the following compatibility conditions at the corner points (0,τ),(1,τ),(0,0), and (1,0), then the existence and uniqueness of the Equations (Equation1)–(Equation2) solution can be guaranteed. (3) ψb(0,0)=ψl(0),ψb(1,0)=ψr(0),dψldt|t=0ε2ψbx2|(0,0)+a(0)ψbx|(0,0)+b(0,0)ψb(0,0)+c(0,0)ψb(0,τ)=f(0,0),dψrdt|t=0ε2ψbx2|(1,0)+a(1)ψbx|(1,0)+b(1,0)ψb(1,0)+c(1,0)ψb(1,τ)=f(1,0).(3)

Lemma 3.1

Maximum Principle

Assume η(x,t)C2,1(D¯), such that η(x,t)0, for all (x,t)Γ and (t+Lε)η(x,t)0 for all (x,t)D. Then η(x,t)0, for all (x,t)D¯.

Proof.

Let (x,t)D¯ such that η(x,t)=min(x,t)D¯η(x,t), assume η(x,t)<0, clearly (x,t)Γ and (x,t)D.

From Calculus we have,η(x,t)x=0=η(x,t)t and 2η(x,t)x20 then from Equations (Equation1)–(Equation2) we have (t+Lε)η(x,t)<0 which contradicts to (t+Lε)η(x,t)0. Hence η(x,t)0, for all (x,t)D¯.

We divide the time interval [0,T] using the delay term τ, such as [0,τ], [τ,2τ] and so forth, based on the available method of steps [Citation30–33]. On the interval [0,τ], in (Equation1)–(Equation2) becomes the expression f(x,t)c(x,t)z(x,tτ) becomes f(x,t)c(x,t)ψb(x,tτ),which is independent of ε in Ω×[0,τ]. Hence, for t[0,τ], (Equation1)–(Equation2) becomes (4) {(t+Lε)z(x,t)+c(x,t)ψb(x,tτ)=f(x,t),(x,t)Ω×(0,τ],z(x,0)=ψb(x,0),x[0,1],z(0,t)=ψl(t),z(1,t)=ψr(t)t(0,τ].(4) Now, we decompose the solution z(x,t) in to its singular w(x,t) and regular v(x,t) components as z(x,t)=v(x,t)+w(x,t). The two terms asymptotic expansion for v(x,t) is v(x,t)=v0(x,t)+εv1(x,t), where v0(x,t) satisfies (5) {v0(x,t)t+a(x)v0(x,t)x+b(x,t)v0(x,t)+c(x,t)ψb(x,tτ)=f(x,t),(x,t)Ω×(0,τ],z(x,0)=ψb(x,0),x[0,1],(5) and v1(x,t) satisfies (6) {(t+Lε)v1(x,t)=2v0(x,t)x2,(x,t)Ω×(0,τ],v1(x,0)=0,x[0,1],v1(0,t)=0,v1(1,t)=0t(0,τ].(6) Thus, the regular component v(x,t) satisfies (7) {(t+Lε)v(x,t)+c(x,t)ψb(x,tτ)=f(x,t),(x,t)Ω×(0,τ],v(x,0)=ψb(x,0),x[0,1],v(0,t)=v0(0,t),v(1,t)=v0(1,t),t(0,τ].(7) The singular component w(x,t) satisfy the homogeneous problem: (8) {(t+Lε)w(x,t)=0,(x,t)Ω×(0,τ],w(x,0)=0,x[0,1],w(0,t)=ψl(t)v0(0,t),t(0,τ],w(1,t)=ψr(t)v0(1,t),t(0,τ].(8) Now, for t[τ,2τ], (Equation1)–(Equation2) becomes (9) {(t+Lε)z(x,t)+c(x,t)c(x,tτ)=f(x,t),(x,t)Ω×(τ,2τ],z(x,t)=z(x,t),(x,t)[0,1]×[0,τ],z(0,t)=ψl(t),z(1,t)=ψr(t)t(τ,2τ].(9) Again, we decompose the solution z(x,t) in to its singular w(x,t) and regular v(x,t) components as z(x,t)=v(x,t)+w(x,t). The two terms asymptotic expansion for v(x,t) is v(x,t)=v0(x,t)+εv1(x,t), where v0(x,t) satisfies the reduced problem (10) {v0(x,t)t+a(x)v0(x,t)x+b(x,t)v0(x,t)+c(x,t)v0(x,tτ)=f(x,t),(x,t)Ω×(τ,2τ],v0(x,t)=z(x,t),(x,t)[0,1]×[0,τ],(10) and v1(x,t) satisfies (11) {(t+Lε)v1(x,t)+c(x,t)v1(x,tτ)=2v0(x,t)x2,(x,t)Ω×(τ,2τ],v1(x,t)=0,(x,t)[0,1]×[0,τ],v1(0,t)=0=v1(1,t),t(τ,2τ].(11) Clearly the regular component v(x,t) satisfies the following problem (12) {(t+Lε)v(x,t)+c(x,t)v(x,tτ)=f(x,t),(x,t)Ω×(τ,2τ],v(x,t)=z(x,t),(x,t)[0,1]×[0,τ],v(0,t)=v0(0,t),v(1,t)=v0(1,t),t(τ,2τ].(12) The singular component w(x,t) satisfy the homogeneous problem: (13) {(t+Lε)w(x,t)+c(x,t)w(x,tτ)=0,(x,t)Ω×(τ,2τ],w(x,t)=0,(x,t)[0,1]×[0,τ],w(0,t)=ψl(t)v0(0,t),t(τ,2τ],w(1,t)=ψr(t)v0(1,t),t(τ,2τ].(13) In the same way, to get the decomposition on [0,T], we extend the decomposition approaches at every partition. This method of steps yields the existence and uniqueness results for all (x,t)D¯. For the interval [0,τ], z(x,tτ) is known function,i.e. f(x,t)c(x,t)ψb(x,tτ) is independent of ε, and thus (Equation1)–(Equation2) becomes a classical singularly perturbed parabolic problem, which can be solved the existing theories [Citation34,Citation35]. In addition, for [τ,2τ] the existence and uniqueness of a solution of (Equation1)–(Equation2) is considered in [Citation30,Citation36–38].

Lemma 3.2

[Citation39],Lemma 3.2.

The solution z(x,t) of Equations (Equation1)–(Equation2) satisfies the following bound:

|z(x,t)ψb(x,0)|Ct,(x,t)D¯, where C is independent of ε.

Lemma 3.3

The solution z(x,t) of Equations (Equation1)–(Equation2) satisfies the following estimate: |z(x,t)|C,for (x,t)D¯.

Proof.

Since t[0,T] and from Lemma 3.2 we have |z(x,t)|Ct, it follows that |z(x,t)|C.

Lemma 3.4

Uniform Stability Estimate

The ε-uniform bound on the solution z(x,t) of continuous problem equations (Equation1)–(Equation2) satisfies |z(x,t)|1β(t+Lε)z(x,t)+max{|ψl(t)|,|ψr(t)|,|ψb(x,t)|}.

Proof.

For the barrier functions Ξ±(x,t)=1β(t+Lε)z(x,t)+max{|ψl(t)|,|ψr(t)|,|ψb(x,t)|}±z(x,t),(x,t)D¯,we have,on Γl Ξ±(0,t)=1β(t+Lε)z(x,t)+max{|ψl(t)|,|ψr(t)|,|ψb(x,t)|}±z(0,t)max{|ψl(t)|,|ψr(t)|,|ψb(x,t)|}±z(0,t)0,on Γr Ξ±(1,t)=1β(t+Lε)z(x,t)+max{|ψl(t)|,|ψr(t)|,|ψb(x,t)|}±z(1,t)max{|ψl(t)|,|ψr(t)|,|ψb(x,t)|}±z(1,t)0,on Γb Ξ±(x,t)=1β(t+Lε)z(x,t)+max{|ψl(t)|,|ψr(t)|,|ψb(x,t)|}±z(x,t)max{|ψl(t)|,|ψr(t)|,|ψb(x,t)|}±z(x,t)0.Furthermore, for all (x,t)D, (t+Lε)Ξ±(x,t)=b(x,t)(1β(t+Lε)z(x,t)+max{|ψl(t)|,|ψr(t)|,|ψb(x,t)|})±(t+Lε)z(x,t)(t+Lε)z(x,t)+b(x,t)max{|ψl(t)|,|ψr(t)|,|ψb(x,t)|}±(t+Lε)z(x,t)(t+Lε)z(x,t)±(t+Lε)z(x,t)0.Therefore, by using maximum principle stated in Lemma 3.1, we obtain Ξ±(x,t)0. for all (x,t)D¯. Accordingly, we get the required bound.

Theorem 3.1

The derivatives of exact solution z(x,t) of Equations (Equation1)–(Equation2) satisfy |n+mz(x,t)xntm|C(1+εnexp(α(1x)/ε)),forall(x,t)D,where m and n are integers that are non-negative, such that 0n+m4.

Proof.

Refer in [Citation40]

Bounds on the derivatives of Equations (Equation1)–(Equation2) solution given Theorem in 3.1 are not adequate for proofing ε-uniform convergence. Strong bounds on the solution are therefore required.

Theorem 3.2

For non-negative integers n, m providing 0n+m5, with suitable compatibility conditions at the corners the regular v(x,t) and singular component w(x,t) satisfies the following estimate (14) |n+mv(x,t)xntm|C(1+ε4n),(14) (15) |n+mw(x,t)xntm|Cεnexp(α(1x)/ε),(x,t)D.(15)

Proof.

The details of the proof are found in [Citation26,Citation41].

4. Numerical scheme formulation

Since the model problem equation (Equation1)–(Equation2) exhibit boundary layer at x = 1, we have to made more mesh points there. We use uniform mesh for time domain and Bakhvalov–Shishkin mesh for space domain.

4.1. Time discretization

The time domain [0,T] is discretize with time step Δt as ΛM={ti=iΔt,i=0,1,,M,Δt=T/M},where M denote mesh interval numbers in the direction on [0,T] and Δt satisfies qΔt=T for some positive integer q. If Λp is the set of all mesh points from p to 0: Λp={ti=iΔt,i=0,1,,p,Δt=τ/p}.For the time derivative, we employ the implicit Euler method to obtain semi-discretized problem for Equation (Equation1)–(Equation2) (16) Zi+1(x)Zi(x)Δtεd2Zi+1(x)dx2+a(x)dZi+1(x)dx+bi+1(x)Zi+1(x)=ci+1(x)Zi+1p(x)+fi+1(x),(16) under the subsequent boundary and interval conditions (17) Zi(x)=ψb(x,ti),i=0,1,,p,xΩ¯,Zi+1(0)=ψl(ti+1),i=0,1,,M1,Zi+1(1)=ψr(ti+1),i=0,1,,M1,(17) where Zi+1(x) is the approximate solution of z(x,ti+1) at (i+1)th time level. Equations (Equation16)–(Equation17) can be written as (18) {(I+ΔtLεΔt)Zi+1(x)=di(x),i=0,1,,M1,xΩ¯,Zi+1(0)=ψl(ti+1),i=0,1,,M1,Zi+1(1)=ψr(ti+1),i=0,1,,M1,Zi(x)=ψb(x,ti),i=0,1,,p,xΩ¯,(18) where di(x)=Zi(x)+Δt(ci+1(x)Zi+1p(x)+fi+1(x)),LεΔtZi+1(x)=εd2Zi+1(x)dx2+a(x)dZi+1(x)dx+bi+1(x)Zi+1(x).The operator (I+ΔtLεΔt) satisfy the following maximum principle.

Lemma 4.1

Semi-discrete maximum principle

Let μi+1(x) be sufficiently smooth function on Ω, such that μi+1(0)0 and μi+1(1)0. Then (I+ΔtLεΔt)μi+1(x)0 for all xΩ implies μi+1(x)0 for all xΩ¯.

Proof.

Let ζ be such that μi+1(ζ)=minxΩ¯μi+1(x) and assume that μi+1(ζ)<0. From the assumption made,clearly ζ{0,1}. From calculus, we have dμi+1(ζ)dx=0, and d2μi+1(ζ)dx20. Then (I+ΔtLεΔt)μi+1(ζ)=μi+1(ζ)+Δt(ε)d2μi+1(ζ)dx2+a(ζ)dμi+1(ζ)dx+bi+1(ζ)μi+1(ζ)<0,which contradicts to the assumption (I+ΔtLεΔt)μi+1(x)0. Therefore μi+1(x)0 for all xΩ¯.

The local truncation error of the time semi-discretized problem equation (Equation18) is given by ei+1=z(x,ti+1)Zi+1(x).

Lemma 4.2

If |mz(x,t)tm|C for all (x,t)D¯ and m=0,1,2, then the local truncation error associated to Equation (Equation18) satisfies ei+1C(Δt)2.

Proof.

Applying Taylor's series expansion on z(x,ti); z(x,ti)=z(x,ti+11),=z(x,ti+1)Δtz(x,ti+1)t+O((Δt)2).Thus, (19) z(x,ti+1)Δtz(x,ti+1)t=z(x,ti)+O((Δt)2).(19) At t=ti+1, we have (20) z(x,ti+1)t=ε2z(x,ti+1)x2+a(x)z(x,ti+1)x+b(x,ti+1)z(x,ti+1)(c(x,ti+1)z(x,ti+1p)+f(x,ti+1)),(20) substituting Equation (Equation20) in to Equation (Equation19) we get (21) (I+ΔtLε)z(x,ti+1)=z(x,ti)+Δt(c(x,ti+1)z(x,ti+1p)+f(x,ti+1))+O((Δt)2).(21) From Equation (Equation18), Zi+1(x) satisfies (22) (I+ΔtLεΔt)Zi+1(x)=Zi(x)+Δt(ci+1(x)Zi+1p(x)+fi+1(x)).(22) From Equations (Equation21) and (Equation22), clearly the local truncation error ei+1 is the solution of boundary value problem of type (I+ΔtLεΔt)ei+1=O((Δt)2),ei+1(0)=0=ei+1(1).Applying the semi-discrete maximum principle now yields ei+1C(Δt)2.

Local truncation error measures the contribution of each time step to the global error of the time semidiscretization, which is defined at ti, given as Ei=z(x,ti)zi(x).

Theorem 4.1

Global error estimate,denoted by Ei, of Equation (Equation18) satisfy EiC(Δt),i=1,2,,M.

Proof.

Ei=m=1iem,e1+e2++ei,C(iΔt)Δt,fromLemma4.2,CTΔt,sinceiΔtT,C(Δt),C is a positive constant independent of ε and Δt.

Lemma 4.3

The semi-discretized solution Zi(x) of Equation (Equation18) satisfy |dnZi(x)dxn|C(1+εnexp(α(1x)/ε)),0n4,xΩ¯.

Proof.

In Theorem 3.1 make m = 0 and t=ti.

The strong bounds can obtained by decomposing the solution of semi-disctrized problem (Equation18) in to regular Vi+1 and singular Wi+1 component as Zi+1(x)=Vi+1(x)+Wi+1(x),with the following properties and condition (23) {(I+ΔtLεΔt)Vi+1(x)=di+1(x),xΩ¯,i=0,1,,M1,Vi+1(0)=Zi+1(0)i=0,1,,M1,Vi+1(1)=Zi+1(1)i=0,1,,M1.(23) (24) {(I+ΔtLεΔt)Wi+1(x)=0,xΩ¯,i=0,1,,M1,Wi+1(0)=0i=0,1,,M1,Wi+1(1)=Zi+1(1)Vi+1(1)i=0,1,,M1.(24)

Lemma 4.4

[Citation26]

The regular Vi+1 and singular Wi+1 components of Zi+1(x) and their derivatives satisfy the following bounds: (25) |dnVi+1(x)dxn|C(1+ε4n),n=0,1,2,3,4,|dnWi+1(x)dxn|Cεnexp(α(1x)/ε),n=0,1,2,3,4.(25)

4.2. Full discretization

On the spatial domain Ω¯=[0,1], we choose B-S mesh which divides it in two intervals [0,1σ] and (1σ]. Each interval is divided in to N/2 equal sub intervals, where N(4)Z+. B-S mesh in one of the Shishkin type mesh, where the boundary layer function exp(α(1x)/ε) in inverted on (1σ] so that the mesh is graded. On [0,1σ] the mesh is coarse and uniform. The transition parameter σ is defined as σ=min{0.5,σ0εlnN},σ02/α.We shall assume σ=σ0εlnN otherwise N is exponentially smaller than ε. The mesh ΩN={xj}0N is given by [Citation26,Citation42] (26) xj={2(1σ)Nj,j=0,1,,N/2,1+σ0εln(N22(Nj)(N1)N2)j=N/2+1,,N.(26) For j1 we set xj1/2=(xj1+xj)/2 and hj=xj+1xj for j=0,1,,N. Given a function Zji+1 defined on ΩN, define the forward Dx+ and backward Dx difference operator as (27) Dx+Zji+1=Zj+1i+1Zji+1hj,DxZji+1=Zji+1Zj1i+1hj1.(27) The approximation of second-order derivative at xj is defined as (28) Dx+DxZji+1=2hj+hj1[Zj+1i+1Zji+1hjZji+1Zj1i+1hj1].(28)

4.2.1. Hybrid numerical scheme

Midpoint upwind method [Citation43,Citation44] Rewriting Equation (Equation18), we get (29) εd2Zi+1(x)dx2+a(x)dZi+1(x)dx+ki+1(x)Zi+1(x)=gi(x),(29) where ki+1(x)=1Δt+bi+1(x),gi(x)=1ΔtZi(x)+{ci+1(x)Zi+1p(x)+fi+1(x)}.The midpoint upwind scheme for Equation (Equation29) is (30) {LmuN,ΔtZji+1εDx+DxZji+1+aj1/2DxZji+1+kj1/2i+1Zji+1=gj1/2i,j=1,2,,N/2,Z0i+1=ψl(ti+1),i=0,1,,M1,ZNi+1=ψr(ti+1),i=0,1,,M1,Zjn=ψb(xj,tn),n=0,1,,p,j=1,,N1,(30) where aj1/2=aj1+aj2,kj1/2i+1=kj1i+1+kji+12,gj1/2i=1ΔtZji+{cj1/2i+1Zji+1p+fj1/2i+1}.Substituting Equations ((Equation27)–(Equation28)) in to Equation (Equation30), we obtain (31a) {LmuN,ΔtZji+1SjZj1i+1+Sj0Zji+1+Sj+Zj+1i+1=gj1/2i,j=1,2,,N/2,Z0i+1=ψl(ti+1),i=0,1,,M1,ZNi+1=ψr(ti+1),i=0,1,,M1,Zjn=ψb(xj,tn),n=0,1,,p,j=1,,N1,(31a) where (31b) {Sj=2εhj1(hj+hj1)aj1/2hj1,Sj0=2εhj1(hj)+aj1/2hj1+kj1/2i+1,Sj+=2εhj(hj+hj1).(31b) Non-polynomial spline scheme There have been literatures that propose the use of spline-based approaches for solving singularly perturbed problems with unform convergence analysis (e.g. [Citation45]). In this work we use the non-polynomial spline. For each segment [xj,xj+1],j=N/2+1,,N1, the non-polynomial spline function Si+1(x)C2[0,1] which interpolate Zi+1(xj),j=N/2+1,,N1 has the following form (32) Si+1(x)=Aj+Bj(xxj)+Cjsin(ω(xxj))+Djcos(ω(xxj)),(32) where Aj,Bj,Cj,Dj are the unknown constant coefficients, that are to be determined and ω(0) is free parameter such that Si+1(x) reduces to ordinary cubic spline as ω0. To obtain these coefficients, the necessary conditions are : Si+1(x) should satisfy interpolation conditions at xj and xj+1, and first derivative continuity at common nodes. Therefor to derive the coefficients in Equation (Equation32) in terms of Zji+1,Zj+1i+1,Mji+1,and,Mj+1i+1 we define (33) Si+1(xj)=Zji+1,Si+1(xj+1)=Zj+1i+1,(Si+1)(xj)=Mji+1,(Si+1)(xj+1)=Mj+1i+1.(33) From Equation (Equation32) we obtain (34) (Si+1)(x)=Cjω2sin(ω(xxj))Djω2cos(ω(xxj)).(34) From Equations (Equation32)–(Equation34), we obtain (35) Aj=Zji+1+Mji+1ω2,Bj=Zj+1i+1Zji+1hj+Mj+1i+1Mji+1hjω2=Zj+1i+1Zji+1hj+Mj+1i+1Mji+1hjω2,Cj=Mji+1cosθω2sinθMj+1i+1ω2sinθ,Dj=Mji+1ω2,(35) where θ=ωhj. From the first derivative continuity of Si+1(x),we have (Si+1)(xj)=(Si+1)(xj+). That is (36) Bj1+Cj1ωcosθDj1ωsinθ=Bj+ωCj.(36) Substituting Equation (Equation35) in to Equation (Equation36) we obtain the following relation at i + 1 time level (37) Zj+1i+1Zji+1hjZji+1Zj1i+1hj1=λ1hj1Mj1i+1+λ2(hj+hj1)Mji+1+λ1hjMj+1i+1,(37) where λ1=1θ2(θcscθ1),λ2=1θ2(1θcotθ). We have λ1+λ2=1/2 by equating the coefficients of Mi from Equation (Equation37). When h0(i.eθ0),(λ1,λ2)(1/6,1/3).

Using Taylor series,let us derive first-order approximation (38) z(xj1)=z(xj)hj1dz(xj)dx+hj122d2z(xj)dx2+O(hj13).(38) Then (39) Zi+1(xj1)=Zi+1(xj)hj1dZi+1(xj)dx+hj122d2Zi+1(xj)dx2.(39) (40) z(xj+1)=z(xj)+hjdz(xj)dx+hj22d2z(xj)dx2+O(hj3).(40) Then (41) Zi+1(xj+1)=Zi+1(xj)+hjdZi+1(xj)dx+hj22d2Zi+1(xj)dx2.(41) Taking d2Zi+1(xj)dx2 and dZi+1(xj)dx as variables, then solving them from Equations (Equation39) and (Equation41), we get (42) dZi+1(xj)dx=1hjhj1(hj+hj1)[hj2Zi+1(xj1)+(hj2hj12)Zi+1(xj)+hj12Zi+1(xj+1)],(42) and (43) d2Zi+1(xj)dx2=2hjhj1(hj+hj1)[hjZi+1(xj1)(hj+hj1)Zi+1(xj)+hj1Zi+1(xj+1)].(43) Differentiation Equations (Equation39) and (Equation41) both sides, we get (44) dZi+1(xj1)dx=dZi+1(xj)dxhj1d2Zi+1(xj)dx2+hj122d3Zi+1(xj)dx3,(44) (45) dZi+1(xj+1)dx=dZi+1(xj)dx+hjd2Zi+1(xj)dx2+hj22d3Zi+1(xj)dx3.(45) After substituting Equations (Equation42) and (Equation43) in to Equations (Equation44) and (Equation45), we obtain (46) dZi+1(xj1)dx=1hjhj1(hj+hj1)[(hj2+2hjhj1)Z(xj1)+(hj+hj1)2Z(xj)hj12Z(xj+1)],(46) (47) dZi+1(xj+1)dx=1hjhj1(hj+hj1)[hj2Z(xj1)(hj+hj1)2Z(xj)+(hj12+2hjhj1)Z(xj+1)].(47) From Equation (Equation29) we can have (48) Mji+1=d2Zi+1(xj)dx2=ε1[ajdZi+1(xj)dx+kji+1Zji+1gji].(48) Now substitute Equation (Equation48) in to Equation (Equation37) to get (49) ε[Zj+1i+1Zji+1hjZji+1Zj1i+1hj1]=λ1hj1[aj1dZi+1(xj1)dx+kj1i+1Zj1i+1gj1i]+λ2(hj+hj1)[ajdZi+1(xj)dx+kji+1Zji+1gji]+λ1hj[aj+1dZi+1(xj+1)dx+kj+1i+1Zj+1i+1gj+1i].(49) By substituting Equations (Equation42),(Equation46) and (Equation47) in to (Equation49) at i + 1 time level we obtain (50a) {LnpsN,ΔtZji+1RjZj1i+1+Rj0Zji+1+Rj+Zj+1i+1=Gji,Z0i+1=ψl(ti+1),i=0,1,,M1,ZNi+1=ψr(ti+1),i=0,1,,M1,Zjn=ψb(xj,tn),n=0,1,,p,j=1,,N1,(50a) where (50b) {Rj=εhj1+λ1hj1(kj1i+1aj1hj+2hj1hj1(hj+hj1))λ2ajhjhj1+λ1hj2aj+1hj1(hj+hj1),Rj0=ε(1hj+1hj1)+λ1aj1(hj+hj1)hj+λ2(hj+hj1)(aj(hjhj1)hjhj1+kji+1)λ1aj+1(hj+hj1)hj1,Rj+=εhj+λ1hj(kj+1i+1+aj+12hj+hj1hj(hj+hj1))+λ2ajhj1hjλ1hj12aj1hj(hj+hj1),Gji=λ1hj1gj1i+λ2(hj+hj1)gji+λ1hjgj+1i.(50b) Combining Equation (Equation31a) and (Equation50a), we obtain fully discretized scheme (51) {LHybN,ΔtZji+1={LmuN,ΔtZji+1=gj1/2i,j=1,2,,N/2i=0,1,,M1,LnpsN,ΔtZji+1=Gji,j=N/2+1,,N1i=0,1,,M1,Z0i+1=ψl(ti+1),i=0,1,,M1,ZNi+1=ψr(ti+1),i=0,1,,M1,Zjn=ψb(xj,tn),n=0,1,,p,j=1,,N1.(51) Equation (Equation51) gives system of equations as (52) EjZj1i+1+Ej0Zji+1+Ej+Zj+1i+1=Fji,j=1,2,,N1,i=0,1,,M1,(52) where Ej={2εhj1(hj+hj1)aj1/2hj1,forj=1,2,,N/2,εhj1+λ1hj1(kj1i+1aj1hj+2hj1hj1(hj+hj1))λ2ajhjhj1+λ1hj2aj+1hj1(hj+hj1),forj=N/2+1,,N1.Ej0={2εhj1(hj)+aj1/2hj1+kj1/2i+1,forj=1,2,,N/2,ε(1hj+1hj1)+λ1aj1(hj+hj1)hj+λ2(hj+hj1)(aj(hjhj1)hjhj1+kji+1)λ1aj+1(hj+hj1)hj1,forj=N/2+1,,N1.Ej+={2εhj(hj+hj1),forj=1,2,,N/2,εhj+λ1hj(kj+1i+1+aj+12hj+hj1hj(hj+hj1))+λ2ajhj1hjλ1hj12aj1hj(hj+hj1)forj=N/2+1,,N1.Fji={1ΔtZji+{cj1/2i+1Zji+1p+fj1/2i+1},forj=1,2,,N/2,λ1hj1(g)j1i+λ2(hj+hj1)(g)ji+λ1hj(g)j+1iforj=N/2+1,,N1.In Fji, (g)j1i=1ΔtZj1icj1i+1Zj1i+1p+fj1i+1,(g)ji=1ΔtZjicji+1Zji+1p+fji+1,(g)j+1i=1ΔtZj+1icj+1i+1Zj+1i+1p+fj+1i+1.The matrix representation of Equation (Equation52) is (53) EZ=F.(53) The matrix E is tridiagonal matrix and |Ej0||Ej|+|Ej+| ; diagonally dominant matrix. In addition, Ej0>0,Ej<0 and Ej+<0. Thus at each time level ti+1 the coefficient matrix E is irreducibly diagonally dominant M-matrix [Citation46] which assures the invertibility of the matrix.

Lemma 4.5

Discrete Maximum Principle

Let ΩN={xi}0N be any mesh on Ω¯. Assume the discrete function Θji+1 satisfy Θ0i+10,ΘNi+10. Then LHybN,ΔtΘji+10 for j=1,2,,N1 implies Θji+10 for j=0,1,,N.

Proof.

Follow the same technique used in Lemma 4.1.

5. Convergence analysis of the method

In this section, the convergence is examined by induction on the subintervals [(κ1)τ,κτ], 2κT/κ for positive integer κ.

Lemma 5.1

Discrete uniform stability estimate

The solution Zji+1 of Equation (Equation51) satisfy Zji+1LHybN,ΔtZji+1β+Cmax{|Z0i+1|,|ZNi+1|,|Zj0|},whereβkji+1>0.

Proof.

Let =LHybN,ΔtZji+1β+Cmax{|Z0i+1|,|ZNi+1|,|Zj0|}. Define barrier functions (Y±)ji+1 such that (Y±)ji+1=±Zji+1. By applying Lemma 4.5, we can obtain the required result.

Lemma 5.2

[Citation47] Discrete comparison principle

If {uji+1}j=0N and {ϑji+1}j=0N are two mesh functions that satisfy |LHybN,Δtuji+1|LHybN,Δtϑji+1,j=1,2,,N1,u0i+1ϑ0i+1 and uNi+1ϑNi+1, then |uji+1|ϑji+1 for j=0,1,2,,N.

Lemma 5.3

Let yji+1=1+xj for j=0,1,2,,N. Then there exists a positive constant C such that LHybN,Δtyji+1C for j=1,2,,N1.

Proof.

For [0,1σ] LmuN,Δtyji+1=εDx+Dxyji+1+aj1/2Dxyji+1+kj1/2i+1yj1/2i+1=εDx+Dx(1+xj)+aj1/2Dx(1+xj)+kj1/2i+1(1+xj1/2)=aj1/2+kj1/2i+1(1+xj1/2)C.For [1σ,1], use the technique as done for [0,1σ].

Lemma 5.4

Let ϕi+1(xj) be a smooth function defined on Ω¯ and ϕji+1 on ΩN. The following estimate holds true

(a)

For j=1,2,,N/2 |LmuN,Δtϕi+1(xj)LmuN,Δtϕji+1|C{εxj1xj+1|(ϕi+1)(3)(s)|ds+bj1/2xj1xj|(ϕi+1)(2)(s)|ds}.

(b)

For j=N/2+1,,N1 |LnpsN,Δtϕi+1(xj)LnpsN,Δtϕji+1|C{εxj1xj+1|(ϕi+1)(3)(s)|ds+bjxj1xj+1|(ϕi+1)(2)(s)|ds}.

Proof.

One may refer [Citation35,Citation48] for the details.

Lemma 5.5

For j=0,1,,N, define a mesh function Gji+1=r=1j(1+αhr2ε),with convention that if j=0,G0i+1=1. Then,for j=1,,N1, there exist a positive constant C such that LHybN,ΔtGji+1Cmax{ε,hj}Gji+1.

Proof.

Refer [Citation6].

The error in numerical solution can be decomposed in to singular and regular component as Zi+1(xj)Zji+1=(Vi+1(xj)+Wi+1(xj))(Vji+1+Wji+1)=(Vi+1(xj)Vji+1)+(Wi+1(xj)Wji+1).Next we estimate the error of each component in the intervals [0,1σ] and (1σ,1].

Theorem 5.1

The error in the regular component satisfy the following bound |Vi+1(xj)Vji+1|CN1,j=1,2,,N1.

Proof.

First consider [0,1σ]. Let H=xj+1xj,j=0,,N/21. Then we can have N1H2N1. Using Lemmas 4.4 and 5.4(a),as the derivatives of Vi+1 are bounded |LmuN,Δt(Vi+1(xj)Vji+1)|=|LmuN,ΔtVi+1(xj)LmuN,ΔtVji+1|xj1xj+1|(Vi+1)(3)(s)|ds+bj1/2xj1xj|(Vi+1)(2)(s)|dsC(1+ε2)(xj+1xj1)C(xj+1xj1)C(2H)C(4N1)CN1.For the interval [1σ,1], by applying Lemmas 4.4 and 5.4(b) for the same technique we get the same result for LnpsN,Δt. Now set χj=CN1(1+xj) for j=0,1,,N, where C chosen so that {χj} is barrier function for (Vi+1(xj)Vji+1). By applying Lemma 5.3, we have LmuN,Δtχj=CN1LmuN,Δt(1+xj)CN1 given that C is a large enough constant. Clearly χ0=CN10=|Vi+1(0)V0i+1| and χN=2CN1|Vi+1(xN)VNi+1|. So Lemma 5.2 can be applied and we get |Vi+1(xj)Vji+1|χj2CN1CN1 for all j.

Theorem 5.2

The error in the singular component satisfy the following bound |Wi+1(xj)Wji+1|CN1,j=1,2,,N1.

Proof.

As done for regular component first let us consider [0,1σ]. Recall we assumed σ=σ0εlnN(>(2/α)εlnN),which yield ασ/ε<lnN2 From Lemma 4.4, we have (54) |Wi+1(xj)|Cexp(α(1xj)/ε)Cexp(ασ/ε)CN2CN1.(54) Now we want to show |Wji+1|CN1 for a constant C. Let Gi+1=G. From Taylor series ex1+x, so for the mesh function Gj (55) GN=r=1N(1+αhr2ε)=r=1j(1+αhr2ε)r=j+1N(1+αhr2ε)=Gjr=j+1N(1+αhr2ε),Gj/GN=r=j+1N(1+αhr2ε)1r=j+1Neαhr/(2ε)=eα(1xj)/(2ε).(55) Let Gj=CGj/GN for j=0,1,,N. Then by using definition of Wi+1 and Lemma 5.5 (56) LmuN,ΔtGj=(C/GN)LmuN,ΔtGj(C/GN)Gj/max{ε,hj}0=|LmuN,ΔtWji+1|.(56) For sufficiently large value of constant C, we have (57) G0=CG0/GNCeα/(2ε)Ceα/(ε)|W0i+1|,(57) (58) GN=C|WNi+1|.(58) From Equations (Equation56)–(Equation58), by discrete comparison principle ,Lemma 5.2, we have (59) |Wji+1|Gj=CGj/GN.(59) But for j=0,1,,N/2 (60) Gj/GNr=1+N/2N(1+αH2ε)1=(1+2N1lnN)N/2.(60) After some manipulation of applying the Taylor series ln(1+x)>xx2/2,x>0 to the right end expression of Equation (Equation60), we obtain (61) |Wji+1|CN1.(61) Combining Equations (Equation54) and (Equation61), gives the required result for [0,1σ].

Now consider the interval [1σ,1].

Let h=max{hj},j=N/2+1,,N1. For the bounds on |Wi+1(x)| in Lemma 4.4 an error analysis for j=N/2+1,,N1 is (62) |LnpsN,Δt(Wi+1(xj)Wji+1)|=|LnpsN,ΔtWi+1(xj)LnpsN,ΔtWji+1|xj1xj+1|(Wi+1)(3)(s)|ds+bjxj1xj+1|(Wi+1)(3)(s)|dsCxj1xj+1ε2eα(1s)/εds=Cε1eα(1xj)/εsinh(αh/ε)C1ε1N1eα(1xj)/ε,(62) for sufficiently large value of C,sinh(αh/ε)CN1, for all N4. Set ηj=CN1(1+Gj/GN) for j=N/2,,N. Then by using Equation (Equation55) and Lemma 5.5 (63) LnpsN,ΔtηjCN1(1/GN)LnpsN,ΔtGjCε1N1Gj/GNC2ε1N1eα(1xj)/ε,(63) (64) ηN/2=CN1(1+GN/2/GN)>|Wi+1(xN/2)WN/2i+1|,(64) (65) ηN=2CN1>|Wi+1(xN)WNi+1|.(65) By discrete comparison principle Lemma 5.2 and Equations (Equation62)–(Equation65) we obtain |Wi+1(xj)Wji+1|ηjCN1.

Theorem 5.3

Error in the totally discrete scheme

Let z(x,t) be the solution of continuous problem given by Equations (Equation1)–(Equation2) and Z(xj,ti) be the approximation to the solution z(xj,ti) of the fully discretized problem equation (Equation52). Then, the error estimate for the total discrete scheme is given |z(xj,ti)Z(xj,ti)|C(Δt+N1),j=0,1,,N,i=0,1,,M.

proof.

By combining the estimates provided in Theorems 4.1,5.1 and 5.2, the proof can be readily obtained.

6. Richardson extrapolation

In this section, we use the Richardson extrapolation technique to improve the scheme's rate of convergence and computed solution accuracy. Let us define a mesh D2N,2M=Ω2N×Λ2M={(x~j,ti~)} with 2N and 2M mesh intervals in spatial and temporal directions respectively. Here Ω2N is a Bakhvalov–Shishkin mesh possessing the same transition point 1σ as used in ΩN. The discrete spatial domain Ω2N and temporal domain Λ2M are obtained from bisecting of each intervals of ΩN and ΛM, respectively.

Let Z(xj,ti) be the numerical solution of the fully disretized scheme Equation (Equation51). Then from Theorem 5.3, one can write (66) z(xj,ti)Z(xj,ti)=C(Δt+N1)+RN,M,(xj,ti)DN,M=ΩN×ΛM.(66) Similarly assume Z~(xj,ti) be the numerical solution of the fully disretized scheme Equation (Equation51) on D2N,2M. Then (67) z(x~j,ti~)Z~(xj~,ti~)=C(Δt2+(2N)1)+R2N,2M,(xj~,ti~)D2N,2M.(67) The two remainders R2N,2M and RN,M are O((Δt)2+N2). From Equations (Equation66)–(Equation67) using the approaches in [Citation49–51], we get (68) z(xj,ti)(2Z~(xj,ti)Z(xj,ti))C((Δt)2+N2),(xj,ti)DN,M.(68) Now, we define the extrapolation formula as (69) Zext(xj,ti)=2Z~(xj,ti)Z(xj,ti),(xj,ti)DN,M,(69) which gives a better approximation of z(xj,ti) than Z(xj,ti) or Z~(xj,ti). The truncation error of spatial discretization when approximating (Equation69) can be written as follows: (70) z(xj,ti)Zext(xj,ti)=z(xj,ti)(2Z~(xj,ti)Z(xj,ti)),(xj,ti)DN,M=2(z(xj,ti)Z~(xj,ti))(z(xj,ti)Z(xj,ti)).(70)

Theorem 6.1

Error After Richardson Extrapolation

Let z(xj,ti) be the exact solution of Equations (Equation1)–(Equation2) and Zext(xj,ti) be the extrapolated solution as defined in Equation (Equation69). Then |z(xj,ti)Zext(xj,ti)|C((Δt)2+N2),j=1,,N1,i=0,1,,M.

Proof.

Like the exact solution z(xj,ti) of Equations (Equation1)–(Equation2) and the numerical solution Z(xj,ti) of Equation (Equation51), the numerical solution Z~(xj,ti) of Equation (Equation51) on D2N,2M can be decomposed in to regular V~(xj,ti) and singular W~(xj,ti) components such that (71) Z~(xj,ti)=V~(xj,ti)+W~(xj,ti).(71) Therefore, at the point (xj,ti), we have (72) z(xj,ti)Z~(xj,ti)=v(xj,ti)V~(xj,ti)+w(xj,ti)W~(xj,ti),z(xj,ti)Z(xj,ti)=v(xj,ti)V(xj,ti)+w(xj,ti)W(xj,ti).(72) The combination of Equations (Equation70) and (Equation72) gives (73) z(xj,ti)Zext(xj,ti)=2(v(xj,ti)V~(xj,ti))(v(xj,ti)V(xj,ti))+2(w(xj,ti)W~(xj,ti))(w(xj,ti)W(xj,ti))=v(xj,ti)Vext(xj,ti)+w(xj,ti)Wext(xj,ti),(73) where Vext(xj,ti) is a regular component, and Wext(xj,ti) is a singular component such that Zext(xj,ti)=Vext(xj,ti)+Wext(xj,ti). First we consider the regular components in outer layer region and interior layer region, i.e. boundary layer region. From Theorem 5.1 and the techniques used in [Citation52,Citation53], on the mesh D2N,2M, we have (74) v(xj,ti)V~(xj,ti)={C((Δt)/2+(2N)1)+R12N,2M,1jN/2,C((Δt)/2+(2N)1)+R22N,2M,N/2+1jN1,(74) where R12N,2M is O(((Δt)/2)2+(H/2)2) and R22N,2M is O(((Δt)/2)2+(hj/2)2). For 1jN/2, by using Theorem 5.1 and Equation (Equation74), we have 2(v(xj,ti)V~(xj,ti))(v(xj,ti)V(xj,ti))=C((Δt)/2+(2N)1)+O(((Δt)/2)2+(N1)2)C(Δt+N1)+O(((Δt)/2)2+(N1)2)=O((Δt)2+N2).Thus (75) v(xj,ti)Vext(xj,ti)=O((Δt)2+N2).(75) For N/2+1jN1, using the same procedure employed above, we can get the same result (Equation75). Now consider the singular components in outer layer region and interior layer region. First consider the estimate in the outer layer region [0,1σ]. From Theorem 3.2, we have (76) |w(xj,ti)|Cexp(α(1xj)/ε)Cexp(α(1(1σ))/ε)=Cexp(ασ/ε)CN2,sinceweassumedσ=σ0εlnN.(76) For a given time level ti, we consider the following barrier function in order to determine the bound of |W(xj,ti)|. s(xj)=Cr=1j(1+αhrε)[r=1N(1+αhrε)1].By the same technique used in [Citation44], we obtain |W(xj,ti)|CN2. Therefore (77) |w(xj,ti)W(xj,ti)|CN2.(77) In a similar approach, we can get (78) |w(xj,ti)W~(xj,ti)|CN2.(78) From Equations (Equation77)–(Equation78) for outer layer region, we obtain (79) |w(xj,ti)Wext(xj,ti)|CN2.(79) For interior layer region [1σ,1], by following the same procedure in [Citation17,Citation53,Citation54], we obtain w(xj,ti)W~(xj,ti)=O((Δt)2+N2),w(xj,ti)W(xj,ti)=O((Δt)2+N2).Therefore, for inner layer region, we get (80) |w(xj,ti)Wext(xj,ti)|CN2.(80) Hence the combination of Equations (Equation75),(Equation79) and (Equation80) gives the required result.

7. Numerical examples, results and discussion

In this section, we present the numerical results obtained by the proposed numerical scheme for the problems type Equations (Equation1)–(Equation2). In all case, the numerical experiments performed by taking constant σ0=2.

Example 7.1

[Citation55]

Consider singularly perturbed delay parabolic initial boundary value problem: {z(x,t)tε2z(x,t)x2+(2x2)z(x,t)x+xz(x,t)=z(x,t1),+10t2exp(t)x(1x),(x,t)(0,1)×(0,2],z(x,t)=0,(x,t)[0,1]×[1,0],z(0,t)=0,z(1,t)=0,t[0,2].

Example 7.2

[Citation56]

Now consider the following singularly perturbed time-delay parabolic convection–diffusion problem {z(x,t)tε2z(x,t)x2+(2x2)z(x,t)x+(1+x)(1+t)z(x,t)=z(x,t1),+10t2exp(t)x(1x),(x,t)(0,1)×(0,2],z(x,t)=0,(x,t)[0,1]×[1,0],z(0,t)=0,z(1,t)=0,t(0,2].

Example 7.3

[Citation54]

Consider the following singularly perturbed delay parabolic initial boundary value problem: {z(x,t)tε2z(x,t)x2+(1+x(1x))z(x,t)x+(1+exp(x))z(x,t)=z(x,t1)+f(x,t),(x,t)(0,1)×(0,2],z(x,t)=ψb(x,t),(x,t)[0,1]×[1,0],z(0,t)=2t/3,z(1,t)=t,t[0,2].We choose the initial data ψb(x,t) and the source function f(x,t) to fit with the exact solution z(x,t)=exp(t)(C1+C2xexp((1x)/ε))+(2x+4)t/6,where C1=exp(1/ε) and C2=1C1.

The numerical solution profile for Examples 7.1, 7.2 and 7.3 are shown in Figures , and , respectively. These figures confirm existence of the boundary layer in the solution near x = 1 and show effects of the parameter ε on gradient of the boundary layer. The exact solutions to Examples 7.1 and 7.2 are unknown, so we use double mesh principle to compute the absolute maximum point wise error. Let Zj,i2N,(Δt)/2 be the computed numerical solution on the fine mesh D2N,2M=Ω2N×Λ2M with 2M and 2N mesh intervals in the temporal and spatial directions respectively. We obtain D2N,2M from DN,M by adding M and N additional points in the temporal and spatial directions respectively by including the mid-points xj+1/2=(xj+1+xj)/2 and ti+1/2=(ti+1+ti)/2 into the mesh points. Therefore, for each value of ε, we estimate the absolute maximum point wise error as EεN,Δt=maxj,i|Zj,iN,ΔtZj,i2N,(Δt)/2|,(BeforeRichardsonExtrapolation),(EεN,Δt)ext=maxj,i|(Zext)j,iN,Δt(Zext)j,i2N,(Δt)/2|,(AfterRichardsonExtrapolation).Since we know the exact solution to Example 7.3, we can use the following to find the maximum pointwise error for each ε. EεN,Δt=maxj,i|z(xj,ti)Zj,iN,Δt|,(BeforeRichardsonExtrapolation),(EεN,Δt)ext=maxj,i|z(xj,ti)(Zext)j,iN,Δt|,(AfterRichardsonExtrapolation).The corresponding order of convergence is estimated by PεN,Δt=log2(EεN,ΔtEε2N,(Δt)/2),(BeforeRichardsonExtrapolation),(PεN,Δt)ext=log2((EεN,Δt)ext(Eε2N,(Δt)/2)ext),(AfterRichardsonExtrapolation).The ε uniform error is estimated by using EN,Δt=maxεEεN,Δt,(BeforeRichardsonExtrapolation),EextN,Δt=maxε(EεN,Δt)ext,(AfterRichardsonExtrapolation),and the corresponding ε uniform order of convergence is estimated by PN,Δt=log2(EN,ΔtE2N,(Δt)/2),(BeforeRichardsonExtrapolation),PextN,Δt=log2(EextN,ΔtEext2N,(Δt)/2),(AfterRichardsonExtrapolation).Tables  show the maximum point wise error before and after extrapolation for various values of ε and order of convergence. From these tables, it can be observed that EεN,Δt decreases as N increases for each value of ε and the errors are stabilized as ε0. Thus, the proposed numerical scheme is ε-uniformly convergent on Bakhvalov–Shishkin mesh. The convergence order is nearly linear.After using Richardson extrapolation, we are getting second-order convergence, which is almost double before extrapolation technique and the accuracy of computed results improved. Tables  and  display comparison of the proposed scheme with the previous works. It is observed the proposed scheme is better than those considered in [Citation57] and [Citation58].

Figure 1. Numerical Solution of Example 7.1, with N = 64, M = 80. (a) ε=24 (b) ε=214.

Figure 1. Numerical Solution of Example 7.1, with N = 64, M = 80. (a) ε=2−4 (b) ε=2−14.

Figure 2. Numerical Solution of Example 7.2, with N = 64 = M. (a) ε=24 (b) ε=214.

Figure 2. Numerical Solution of Example 7.2, with N = 64 = M. (a) ε=2−4 (b) ε=2−14.

Figure 3. Numerical Solution of Example 7.3, with N = 64. (a) ε=28.

Figure 3. Numerical Solution of Example 7.3, with N = 64. (a) ε=2−8.

Table 1. EεN,Δt,PεN,Δt,EN,Δt,PN,Δt, for Example 7.1 on Bakhvalov–Shishkin mesh.

Table 2. EεN,Δt,PεN,Δt,EN,Δt,PN,Δt, for Example 7.2 on Bakhvalov–Shishkin mesh,with N = M.

Table 3. EεN,Δt,PεN,Δt,EN,Δt,PN,Δt, for Example 7.3 on Bakhvalov–Shishkin mesh,with N = M.

Tables  and  display that, as values of ε goes to zero, the proposed scheme does not achieve uniform convergence if we use uniform mesh,as the error EεN,Δt(and also EN,Δt) increase when the number of mesh points increases. This drawback is solved by using one of the Shishkin type mesh called Bakhvalov–Shishkin mesh.

Table 4. EεN,Δt,EN,Δt, for Example 7.1 on Uniform mesh with λ1=1/12 and λ2=5/12.

Table 5. EεN,Δt,EN,Δt, for Example 7.2 on Uniform mesh with λ1=1/12, λ2=5/12 and N=M.

Table 6. Comparison of EεN,Δt for Example 7.1 when N = M.

Table 7. Comparison of EεN,Δt for Example 7.2 when N = M.

The maximum point wise errors for the solutions also plotted on log–log scale in Figures , and , before and after extrapolation. The straight line that the plots follow demonstrates to us that one variable changes as a constant power of another; the maximum absolute point-wise error changes as a constant power of mesh parameter N. In addition, according to the negative slope, the maximum absolute error decreases as the number of grid points rises. In these figures the plots are parallel and overlap as ε0. This shows that the proposed scheme converges regardless of the value of the perturbation parameter ε. Further, we note that all computations have been performed using MATLAB® R2022b software.

Figure 4. log–log plot of maximum point wise error for Example 7.1. (a) Before Extrapolation (b) After Extrapolation.

Figure 4. log–log plot of maximum point wise error for Example 7.1. (a) Before Extrapolation (b) After Extrapolation.

Figure 5. log–log plot of maximum point wise error for Example 7.2 (a) Before Extrapolation (b) After Extrapolation.

Figure 5. log–log plot of maximum point wise error for Example 7.2 (a) Before Extrapolation (b) After Extrapolation.

Figure 6. log–log plot of maximum point wise error for Example 7.3 (a) Before Extrapolation (b) After Extrapolation.

Figure 6. log–log plot of maximum point wise error for Example 7.3 (a) Before Extrapolation (b) After Extrapolation.

8. Conclusion

A numerical scheme for solving a class of singularly perturbed delay parabolic partial differential equations with Dirichlet boundary conditions is investigated. The scheme comprises implicit Euler for time discretization on uniform mesh and a hybrid scheme for spatial discretization on Bakhvalov–Shishkin mesh. The hybrid scheme is composed of midpoint upwind for coarse mesh and non-polynomial spline on fine mesh. Richardson extrapolation technique has been used to improve the accuracy of computed solutions and rate of convergence of the scheme. The delay term is treated by making the delay argument as one of nodal points. It has been shown that the present method is uniformly convergent with respect to the perturbation parameter ε and achieves second-order accuracy. Three test examples are presented that numerically validate the theoretical result. Further, it has been shown by the first two examples that the scheme is not convergent on a uniform mesh. The proposed method combined the unconditional stability and flexibility in choosing the basis function advantages from midpoint upwind and non-polynomial spline scheme respectively. These advantages are significant for solving singularly perturbed delay differential equations involving boundary layer phenomenon. Accordingly, as future directions of this research we extend the proposed scheme for solving time fractional singularly perturbed convection–diffusion problems with a delay in time.

Disclosure statement

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

References

  • Arino O, Hbid ML, Dads EA. Delay differential equations and applications: Proceedings of the nato advanced study institute held in marrakech, morocco: September 2002. Vol. 205. Springer Science & Business Media; 2007. p. 90–21.
  • Murray JD. Mathematical biology: I an introduction. New York, NY: Springer; 2002.
  • Wu J. Theory and applications of partial functional differential equations. Vol.119. New York: Springer Science & Business Media; 1996.
  • Musila M, Lánskỳ P. Generalized stein's model for anatomically complex neurons. BioSystems. 1991;25(3):179–191. doi: 10.1016/0303-2647(91)90004-5
  • Farrell P, Hegarty A, Miller JM, et al. Robust computational techniques for boundary layers. Boca Raton: Chapman and hall/CRC; 2000.
  • Roos HG, Stynes M, Tobiska L. Robust numerical methods for singularly perturbed differential equations: convection–diffusion–reaction and flow problems. Vol. 24. Berlin, Heidelberg: Springer Science & Business Media; 2008.
  • Singh J, Kumar S, Kumar M. A domain decomposition method for solving singularly perturbed parabolic reaction-diffusion problems with time delay. Numer Methods Partial Differ Equ. 2018;34(5):1849–1866. doi: 10.1002/num.v34.5
  • Rao SCS, Kumar S. An almost fourth order uniformly convergent domain decomposition method for a coupled system of singularly perturbed reaction–diffusion equations. J Comput Appl Math. 2011;235(11):3342–3354. doi: 10.1016/j.cam.2011.01.047
  • Kumar S. A parameter-uniform grid equidistribution method for singularly perturbed degenerate parabolic convection–diffusion problems. J Comput Appl Math. 2022;404:113273. doi: 10.1016/j.cam.2020.113273
  • Kumar S, Kumar M. High order parameter-uniform discretization for singularly perturbed parabolic partial differential equations with time delay. Comput Math Appl. 2014;68(10):1355–1367. doi: 10.1016/j.camwa.2014.09.004
  • Hailu WS, Duressa GF. Parameter-uniform cubic spline method for singularly perturbed parabolic differential equation with large negative shift and integral boundary condition. Res Math. 2022;9(1):2151080. doi: 10.1080/27684830.2022.2151080
  • Hailu WS, Duressa GF. Uniformly convergent numerical method for singularly perturbed parabolic differential equations with non-smooth data and large negative shift. Res Math. 2022;9(1):2119677. doi: 10.1080/27684830.2022.2119677
  • Kumar S. Layer-adapted methods for quasilinear singularly perturbed delay differential problems. Appl Math Comput. 2014;233:214–221.
  • Hassen ZI, Duressa GF. New approach of convergent numerical method for singularly perturbed delay parabolic convection–diffusion problems. Res Math. 2023;10(1):2225267. doi: 10.1080/27684830.2023.2225267
  • Hassen ZI, Duressa GF. Parameter-uniformly convergent numerical scheme for singularly perturbed delay parabolic differential equation via extended b-spline collocation. Front Appl Math Stat. 2023;9:1255672. doi: 10.3389/fams.2023.1255672
  • Natividad MC, Stynes M. Richardson extrapolation for a convection–diffusion problem using a Shishkin mesh. Appl Numer Math. 2003;45(2-3):315–329. doi: 10.1016/S0168-9274(02)00212-X
  • Mukherjee K, Natesan S. Richardson extrapolation technique for singularly perturbed parabolic convection–diffusion problems. Computing. 2011;92(1):1–32. doi: 10.1007/s00607-010-0126-8
  • Clavero C, Gracia JL. A higher order uniformly convergent method with richardson extrapolation in time for singularly perturbed reaction–diffusion parabolic problems. J Comput Appl Math. 2013;252:75–85. doi: 10.1016/j.cam.2012.05.023
  • Majumdar A, Natesan S. Second-order uniformly convergent richardson extrapolation method for singularly perturbed degenerate parabolic pdes. Int J Appl Comput Math. 2017;3(S1):31–53. doi: 10.1007/s40819-017-0380-y
  • Negero NT, Duressa GF. An exponentially fitted spline method for singularly perturbed parabolic convection–diffusion problems with large time delay. Tamkang J Math. 2022;54:313–338.
  • Negero NT, Duressa GF. Uniform convergent solution of singularly perturbed parabolic differential equations with general temporal-lag. Iran J Sci Technol, Trans A: Sci. 2022;46(2):507–524. doi: 10.1007/s40995-021-01258-2
  • Megiso EA, Woldaregay MM, Dinka TG. Fitted tension spline method for singularly perturbed time delay reaction diffusion problems. Math Probl Eng. 2022;2022:1–10.doi: 10.1155/2022/8669718
  • Kumar P, Ravi Kanth A. Computational study for a class of time-dependent singularly perturbed parabolic partial differential equation through tension spline. Comput Appl Math. 2020;39(1):1–19. doi: 10.1007/s40314-019-0964-8
  • Ejere AH, Duressa GF, Woldaregay MM, et al. A uniformly convergent numerical scheme for solving singularly perturbed differential equations with large spatial delay. SN Appl Sci. 2022;4(12):324. doi: 10.1007/s42452-022-05203-9
  • Rao RN, Chakravarthy PP. A fitted numerov method for singularly perturbed parabolic partial differential equation with a small negative shift arising in control theory. Numer Math: Theory, Methods Appl. 2014;7(1):23–40.
  • Govindarao L, Mohapatra J. A second order numerical method for singularly perturbed delay parabolic partial differential equation. Eng Comput. 2018;36(2):420–444. doi: 10.1108/EC-08-2018-0337
  • Niyogi P. Introduction to computational fluid dynamics. Don Mills: Pearson Education Canada; 2006.
  • Das P, Mehrmann V. Numerical solution of singularly perturbed convection–diffusion–reaction problems with two small parameters. BIT Numerl Math. 2016;56:51–76. doi: 10.1007/s10543-015-0559-8
  • Chandru M, Das P, Ramos H. Numerical treatment of two-parameter singularly perturbed parabolic convection diffusion problems with non-smooth data. Math Methods Appl Sci. 2018;41(14):5359–5387. doi: 10.1002/mma.v41.14
  • Saini S, Das P, Kumar S. Computational cost reduction for coupled system of multiple scale reaction diffusion problems with mixed type boundary conditions having boundary layers. Rev De La Real Acad De Cienc Exactas, Fís Y Nat Serie A Mat. 2023;117(2):66. doi: 10.1007/s13398-023-01397-8
  • Shiromani R, Shanthi V, Das P. A higher order hybrid-numerical approximation for a class of singularly perturbed two-dimensional convection–diffusion elliptic problem with non-smooth convection and source terms. Comput Math Appl. 2023;142:9–30. doi: 10.1016/j.camwa.2023.04.004
  • Saini S, Das P, Kumar S. Parameter uniform higher order numerical treatment for singularly perturbed robin type parabolic reaction diffusion multiple scale problems with large delay in time. Appl Numer Math. 2024;196:1–21. doi: 10.1016/j.apnum.2023.10.003
  • Das P, Rana S, Ramos H. On the approximate solutions of a class of fractional order nonlinear volterra integro-differential initial value problems and boundary value problems of first kind and their convergence analysis. J Comput Appl Math. 2022;404:113116. doi: 10.1016/j.cam.2020.113116
  • Ladyzhenskaia OA, Solonnikov VA, Ural'tseva NN. Linear and quasi-linear equations of parabolic type. Vol. 23, Providence, RI: American Mathematical Soc.; 1968.
  • Miller J, O'Riordan E, Shishkin G. Fitted numerical methods for singular perturbation problems: error estimates in the maximum norm for linear problems in one and two dimensions. Singapore: World Scientific; 2012.
  • Das P, Rana S, Vigo-Aguiar J. Higher order accurate approximations on equidistributed meshes for boundary layer originated mixed type reaction diffusion systems with multiple scale nature. Appl Numer Math. 2020;148:79–97. doi: 10.1016/j.apnum.2019.08.028
  • Das P, Rana S, Ramos H. A perturbation-based approach for solving fractional-order volterra–fredholm integro differential equations and its convergence analysis. Int J Comput Math. 2020;97(10):1994–2014. doi: 10.1080/00207160.2019.1673892
  • Choudhary R, Singh S, Das P, et al. A higher order stable numerical approximation for time-fractional non-linear kuramoto–sivashinsky equation based on quintic b-spline. Math Methods Appl Sci. 2024. doi: 10.1002/mma.9778
  • Negero NT, Duressa GF. A method of line with improved accuracy for singularly perturbed parabolic convection–diffusion problems with large temporal lag. Res Appl Math. 2021;11:100174. doi: 10.1016/j.rinam.2021.100174
  • Das A, Natesan S. Uniformly convergent hybrid numerical scheme for singularly perturbed delay parabolic convection–diffusion problems on shishkin mesh. Appl Math Comput. 2015;271:168–186.
  • Shishkin GI, Shishkina LP. Difference methods for singular perturbation problems. Boca Raton: Chapman and Hall/CRC; 2008.
  • Linß T. An upwind difference scheme on a novel Shishkin-type mesh for a linear convection–diffusion problem. J Comput Appl Math. 1999;110(1):93–104. doi: 10.1016/S0377-0427(99)00198-3
  • Ramesh V, Kadalbajoo MK. Upwind and midpoint upwind difference methods for time-dependent differential difference equations with layer behavior. Appl Math Comput. 2008;202(2):453–471.
  • Stynes M, Roos HG. The midpoint upwind scheme. Appl Numer Math. 1997;23(3):361–374. doi: 10.1016/S0168-9274(96)00071-2
  • Santra S, Mohapatra J, Das P, et al. Higher order approximations for fractional order integro-parabolic partial differential equations on an adaptive mesh with error analysis. Comput Math Appl. 2023;150:87–101. doi: 10.1016/j.camwa.2023.09.008
  • Varga RS. Matrix iterative analysis. 2nd ed. Berlin: Springer; 2009. (Springer series in computational mathematics; 27).
  • Woldaregay M, Duressa G. Exponentially fitted tension spline method for singularly perturbed differential difference equations. Iran J Numer Anal Optim. 2021;11(2):261–282.
  • Kellogg T, Tsan A. Analysis of some difference approximations for a singular perturbation problem without turning points. Math Comput. 1978;32(144):1025–1039. doi: 10.1090/mcom/1978-32-144
  • Das P. A higher order difference method for singularly perturbed parabolic partial differential equations. J Differ Equ Appl. 2018;24(3):452–477. doi: 10.1080/10236198.2017.1420792
  • Das P. An a posteriori based convergence analysis for a nonlinear singularly perturbed system of delay differential equations on an adaptive mesh. Numer Algorithms. 2019;81(2):465–487. doi: 10.1007/s11075-018-0557-4
  • Das P. Comparison of a priori and a posteriori meshes for singularly perturbed nonlinear parameterized problems. J Comput Appl Math. 2015;290:16–25. doi: 10.1016/j.cam.2015.04.034
  • Das A, Govindarao L, Mohapatra J. A second order weighted monotone numerical scheme for time-delayed parabolic initial-boundary-value problem involving a small parameter. Int J Math Model Numer Optim. 2022;12(3):233–251.
  • Bala S, Govindarao L, Das A, et al. Numerical scheme for partial differential equations involving small diffusion term with non-local boundary conditions. J Appl Math Comput. 2023;69(6):4307–4331. doi: 10.1007/s12190-023-01927-y
  • Das A, Natesan S. Second-order uniformly convergent numerical method for singularly perturbed delay parabolic partial differential equations. Int J Comput Math. 2018;95(3):490–510. doi: 10.1080/00207160.2017.1290439
  • Kumar K, Podila PC, Das P, et al. A graded mesh refinement approach for boundary layer originated singularly perturbed time-delayed parabolic convection diffusion problems. Math Methods Appl Sci. 2021;44(16):12332–12350. doi: 10.1002/mma.v44.16
  • Kumar D. A parameter-uniform scheme for the parabolic singularly perturbed problem with a delay in time. Numer Methods Partial Differ Equ. 2021;37(1):626–642. doi: 10.1002/num.v37.1
  • Negero N, Duressa G. An efficient numerical approach for singularly perturbed parabolic convection-diffusion problems with large time-lag. J Math Model. 2022;10(2):173–110.
  • Babu G, Bansal K. A high order robust numerical scheme for singularly perturbed delay parabolic convection diffusion problems. J Appl Math Comput. 2022;68(1):363–389. doi: 10.1007/s12190-021-01512-1