285
Views
0
CrossRef citations to date
0
Altmetric
Pure Mathematics

Layer adapted finite element method for two-parameter singularly perturbed delay parabolic problems

ORCID Icon & | (Reviewing editor:)
Article: 2333626 | Received 29 Dec 2023, Accepted 19 Mar 2024, Published online: 05 Apr 2024

ABSTRACT

A layer-adapted finite element method is applied to solve a singularly perturbed delay parabolic differential equation with two perturbation parameters. The numerical method involves two steps of discretization in the decoupled approach. First, the temporal variable is discretized uniformly and approximated by a finite element piecewise linear continuous function. The time derivative of this approximation in each mesh is constant in the time direction. It is a function of the space variable. Then, the time derivative term in the equation is approximated by the equivalent Crank-Nicholson finite difference method. Next, for the semi-discretized problem, a fitted mesh (layer-adapted) finite element method is applied using the Shishkin mesh for the spatial discretization. The solution in the spatial elements is approximated by piecewise quadratic polynomial functions. Finally, the finite element solution is presented as a linear combination of the piecewise linear temporal FE approximate functions and the piecewise quadratic spatial FE approximate functions. That is, a piece wise smooth continuous function in the given domain, which empowers finding an approximation solution at any desired point of the domain. It is proven that the numerical method is convergent with the second order of convergence in the temporal direction and with almost the second order of convergence in the spatial direction. Using the MATLAB software, some numerical experiments are performed to verify the applicability of the numerical method.

1. Introduction

Two-parameter singularly perturbed delay parabolic differential equations refer to a class of mathematical equations that involve partial derivatives, delay in the time variable, and underlying parameters that multiply the two higher spatial derivative terms that characterize the degree of perturbation. The solution to such problems possesses a highly steep or descent gradient, especially when the perturbation parameters are very small. Standard finite difference methods (FDM) and finite element methods (FEM) lead to unsuitable approximations in these areas unless an unacceptably large number of meshes are used, which is not practical due to the limited memory capacity of computers and their exposure to rounding errors (M. K. Kadalbajoo & Gupta, Citation2010). A class of these types of equations, which involve two perturbation parameters and a delay term, arise in different science and engineering fields.

Two-parameter singularly perturbed differential equations have an important role in the application of fluid flow through unsaturated porous media such as soils and industrial filters (Bhathawala & Verma, Citation1975), computational fluid dynamics of incomprehensible Navier-Stokes equation (Heywood & Rannacher, Citation1990), and oscillating drop in an electric field (Feng, Citation1990). Professor Robert E. O’Malley is the first researcher to study two-parameter perturbation problems. In his 1967 paper, he considers the boundary value problems of the form ϵy+μa(x)y+b(x)y=0 for 0x1, where ϵ and µ are small positive interrelated parameters (O’Malley, Citation1967). The behavior of the asymptotic solution to the problem is well studied for different parities of the coefficient functions a(x) and b(x) in different prescribed cases of initial and boundary conditions. It is also mentioned that the existence of the solution and appearance of boundary layers are mostly based on the condition whether ϵμ20 as μ0 or μ2ϵ0 as ϵ0 (Gao et al., Citation2023; M. K. Kadalbajoo & Gupta, Citation2010; O’Malley, Citation1967). The findings of his studies serve as a foundation for further and extended literary works like two-dimensional partial differential equations and parabolic problems. Many studies have been done on the topic of two-parameter singularly perturbed parabolic differential equations (Bullo et al., Citation2019; P. Das & Mehrmann, Citation2016; A. Das & Natesan, Citation2015; Jha & Kadalbajoo, Citation2015; M. Kadalbajoo & Yadaw, Citation2012; Munyakazi, Citation2015; O’Riordan et al., Citation2006) that applied different numerical approaches to solve the problem. But all the mentioned papers did not consider the delay case.

There are mathematical models of singularly perturbed differential equations that depend not only on the instant but also on the past state. The delay term represents the effect of the past state of the solution on the current state. This delay term makes the equation more complex but realistic. Time-delay parabolic problems with a perturbation parameter are applicable in different areas of science and engineering. For example, a respiratory control system in the case of unstable patterns of ventilation, monitoring the temperature distribution in a metal sheet, population dynamics, and chemical reactions or pollution in fluids are some areas of application that characterize the delay term in the model of the differential equation. These kinds of problems are addressed by some literature (Bashier & Patidar, Citation2011; Mbroh et al., Citation2020; Salama & Al-Amery, Citation2017; Woldaregay et al., Citation2021).

According to our recent review, singularly perturbed parabolic differential equations that involve two perturbation parameters and a time delay have been studied by several authors. Some applied the fitted mesh (layer-adapted) finite difference method, and others used the fitted operator finite difference method to develop a uniformly convergent scheme independent of the parameters. Govindarao et al. (Citation2019) solved the problem by applying implicit Euler finite difference approximation on uniform mesh in the direction of time and upwind finite difference approximation on Shishkin and Bakhvalov-Shishkin mesh as well in the space direction. They proved that their scheme is parameter-uniform with O(h+k), where h and k are spatial and temporal mesh sizes, respectively. Kumar et al. (Citation2020) improved the spatial order of convergence to almost second order by implementing a hybrid monotone finite difference scheme in the direction of space. Singh et al. (Citation2022) applied the Crank-Nicolson scheme in temporal direction and the B-spline collocation method using piecewise uniform mesh for spatial direction. Ayele et al. (Citation2023) found a numerical solution to the problem by using a combination of the fitted operator scheme of a cubic spline with θ - method on a uniform mesh grid. The other two articles, Negero et al. (Citation2023) and Mohye et al. (Citation2023), also applied the nonstandard finite difference method. Both articles followed the Crank-Nicolson approach for temporal discretization and the nonstandard finite difference scheme for spatial discretization on uniform mesh grids. Worku et al. (Citation2023) considered this problem when the diffusion term is dominant, using a finite difference scheme to obtain almost a second order accuracy.

The finite element method (FEM) is more advantageous than FDM in terms of its ability to provide more precise and continuous approximations in the given domain, especially when the domain is irregular (Li et al., Citation2017). The finite element model of such time-dependent problems can be developed in two ways: the coupled formulation, in which the time t is treated as an additional coordinate along with the spatial coordinate x, and the decoupled formulation, where the time and spatial variations are assumed to be separable (Reddy, Citation2019). This study aims to develop a parameter uniform convergent scheme to solve a two-parameter singularly perturbed delay parabolic differential equation numerically by applying a layer-adapted Galerkin finite element method (GFEM). The decoupled formulation approach will be employed, which is a two-step process. To control the perturbation effect in the boundary layers, a piecewise uniform (Shishkin) mesh discretization is used in the spatial direction, followed by a uniform discretization along the temporal direction.

This article consists of the following structure: the existence and uniqueness of the analytical solution, and necessary bounds for its derivatives are discussed in Section 2. In Section 3, the discretization of the domain and the development of the numerical scheme derived. In Section 4, the convergence of the finite element solution is proved. Section 5 presents theoretical results using numerical solutions of counter-examples with tables and graphs. Finally, a brief conclusion is given in Section 6.

Notations: M and N represents the number of meshes in time and space direction, respectively, C denotes the generic positive constant independent of perturbation parameters and mesh sizes. For a given continuous functions f(x) and g(x) on D¯, ||f|| denotes the supreme(maximum) norm, max(x)D¯{|f(x)|} or max1iN|f(xi)| if f is discrete function on the discrete domain D¯N.

The inner product operator . is given by

f(x),g(x)=D¯f(x).g(x)dx.

We consider two-parameters singularly perturbed large time-delay one-dimensional parabolic problem defined on the rectangular domain,

D=Dx×Dt,forDx=(0,1),Dt=(0,T]

given by

(1) ∂tu(x,t)ε2x2u(x,t)μa(x,t)∂xu(x,t)+b(x,t)u(x,t)=c(x,t)u(x,tτ)+f(x,t)(1)

with initial and boundary conditions

(2) {u(x,t)=γb(x,t),(x,t)Γb=[0,1]×[τ,0],u(x,t)=0,(x,t)Γl={(0,t):τtT},u(x,t)=0,(x,t)Γr={(1,t):τtT},(2)

where ɛ and µ are perturbation parameters such that 0<ε1 and 0<μ1, considering the large time-delay parameter τ, such that the terminal time, T= for some positive integer k. The functions a(x,t), b(x,t), c(x,t), and f(x,t), are assumed to be sufficiently smooth and bounded; those satisfy

a(x,t)α>0,b(x,t)β>0andc(x,t)ϑ>0onD¯=[0,1]×[0,T].

Let Γ=Γb  Γl  Γr and define the differential operator, Lε,μ by

(3) Lε,μ∂tε2x2μa(x,t)∂x+b(x,t).(3)

2. Behavior of the analytical solution

For all (x,t)[0,1]×[0,τ], the delay term u(x,tτ) is given by the initial condition. Then, the problem is treated as a non-delay two-parameter singularly perturbed parabolic problem (P. Das & Mehrmann, Citation2016; M. Kadalbajoo & Yadaw, Citation2012). The computation extends for (x,t)[0,1]×[τ,2τ] after solving u(x,t) in [0,1]×[0,τ]. Repeating the method step by step, completes the solution for the whole domain [0,1]×[0,T].

Problem (Equation1)-(Equation2) become a kind of reaction-diffusion when µ = 0 and convection-diffusion when µ = 1. These problems gives important clues about the properties of the solutions in our concern where 0<ε,μ1 and both ε,μ0. The analysis for two parameters problems mainly started by O’Malley, based on asymptotic expansion methods (O’Malley, Citation1967). His study notated two basic cases, when μ2 and μ2. In the first case, the problem resembles properties of the case when µ = 0 and hence O(ε) width layers appear in the neighborhood of x = 0 and x = 1. For the second case different layer widths O(εμ) and O(μ) appear in the neighborhood of x = 0 and x = 1 respectively.

The existence and uniqueness of problem (Equation1)-(Equation2) is established assuming that the data is Holder’s continuous and imposing appropriate compatibility conditions at its boundary (Li et al., Citation2017; Woldaregay et al., Citation2021). Therefore, the following hold at the corner points (0,0), (1,0),(0,τ) and (1,τ).

(4) γb(0,0)=0,(4)
(5) γb(1,0)=0,(5)
(6) Lε,μ(u(0,0))=c(0,0)u(0,τ)+f(0,0)and(6)
(7) Lε,μ(u(1,0))=c(1,0)u(1,τ)+f(1,0).(7)

In addition to that, the continuity and boundedness of the solution and its derivatives have to be certain. To show this, it is necessary to first validate that the differential operator, Lε,μ holds the maximum principle.

Lemma.

2.1. Continuous maximum principle:

Suppose χ(x,t)C2,1(D)C0,0(D¯), such that χ(x,t)0, (x,t)Γ and Lε,μ(χ(x,t))0, (x,t)D, then χ(x,t)0, (x,t)D¯.

Proof.

Suppose (x,t)D¯, χ(x,t)=min(x,t)D¯{χ(x,t)} and χ(x,t)<0.

By the hypothesis, χ(x,t)0, (x,t)Γ, which implies (x,t)Γ. Since the minimum is at (x,t), χx(x,t)=χt(x,t)=0 and χxx(x,t)0.

Lε,μ(χ(x,t))=χt(x,t)εχxx(x,t)μa(x)χx(x,t)+b(x,t)χ(x,t)<0.

This contradicts the given hypothesis. Therefore, χ(x,t)0,(x,t)D¯.

Lemma 2.2.

Let u(x,t) be the solution of problem (Equation1) - (Equation2), then u(x,t) satisfies the following bounds.

(8) |u(x,t)γb(x,0)|Ct,(8)
(9) u(x,t)C,(9)

for some constant C independent of ɛ and µ.

Proof.

Set two functions s and q defined as

(10) s(x,t)={u(x,t)γb(x,0),0tT,u(x,t)γb(x,t),τt0,(10)

and

(11) q(x,t)={Ct,0tT,0.τt0.(11)

Applying the differential operator, Lε,μ,

Lε,μ[s(x,t)]={c(x,t)γb(x,tτ)+f(x,t)+εd2dx2γb(x,0)+μaddxγb(x,0)bγb(x,0),0tT,0,τt0.Lε,μ[q(x,t)]={C(bt+1),0tT,0.τt0.

For sufficiently large C, we have

|Lε,μ[s(x,t)]|Lε,μ[q(x,t)].

Since Lε,μ satisfies the maximum principle, it holds the relation

|s(x,t)|q(x,t). That\ is|u(x,t)γb(x,0)|Ct

The comparisons |u(x,t)||γb(x,0)||u(x,t)γb(x,0)|Ct and tT,∀t[0,T] imply |u(x,t)|Ct+|γb(x,0)|CT+|γb(x,0)|.

Then, taking the supreme of all (x,t)D¯, gives u(x,t)C.

Lemma 2.3.

For non-negative integers i and j, such that 0i+2j4 the derivatives of solution of problem (Equation1)-(Equation2) satisfies the following bounds

(12) i+juxitj{Cε12i,αμ2ςε,C(με)i(μ2ε)j,αμ2ςε,whereς=min(x,t)D¯{b(x,t)a(x,t)}.(12)

Proof.

Refer (O’Riordan et al., Citation2006)

The bounds of the regular and singular component solutions and their derivatives are necessary for later error estimation. The decompositions of the solution u(x,t) of the problem (Equation1) - (Equation2) are the regular component v(x,t), which characterizes the solution behavior outside the boundary layers, and a singular component w(x,t), which characterizes the solution behavior inside the boundary layers. Further, we decompose the singular component into the sum of the left and right singular parts, w(x,t)=wL(x,t)+wR(x,t), so that u(x,t)=v(x,t)+wL(x,t)+wR(x,t). Each components satisfy

(13) {(Lε,μ)(v)=c(x,t)v(x,tτ)+f(x,t),v(x,t)=u(x,t),on Γb,v(0,t)=φol(t),(conveniently chosen),v(1,t)=φor(t),(conveniently chosen),(13)
(14) {(Lε,μ)(wL)=c(x,t)wL(x,tτ),wL(x,t)=0,on Γb,wL(1,t)=0,wL(0,t)=u(0,t)v(0,t),(14)
(15) {(Lε,μ)(wR)=c(x,t)wR(x,tτ),wR(x,t)=0,on Γb,wR(0,t)=0,wR(1,t)=u(1,t)v(1,t).(15)

Lemma 2.4.

The bounds of singular components have given by

(16) |wL|{Cexp(αςεx),αμ2ςε,Cexp(αμεx),αμ2ςε,and |wR|{Cexp(ας2ε(1x)),αμ2ςε,Cexp(ς2μ(1x)),αμ2ςε.(16)

Proof.

Refer (Kumar et al., Citation2020; O’Riordan et al., Citation2006)

Lemma 2.5.

The derivative of regular and singular components of u(x,t) satisfy the bounds.

i. If αμ2ςε,then

(17) i+jvxitjC(1+(εμ)3i(μ2ε)j),for0i+2j4,(17)
(18) iwLxiC(με)i,for0i4and2wLt2C(1+μ2ε1),(18)
(19) iwRxiC(μi+μ1ε2i),for0i4andjwRtjCforj=1,2.(19)

ii. If αμ2ςε, then

(20) i+jvxitjC,for0i+2j4,(20)

wL and wR satisfy the derivative bounds of Lemma 2.3.

Proof.

Refer (Kumar et al., Citation2020; O’Riordan et al., Citation2006)

3. Formulation of numerical scheme

We use two steps in the procedure to generate the finite element model. At the beginning of the construction of the semi-discrete finite element model, there is no integration by part for the time variable. Using the Galerkin finite element method in combination with the uniform discretization of time Crank-Nicolson approach, the numerical scheme is formulated on a piecewise uniform Shishkin mesh type in the spatial direction.

3.1. Time discretization

Let us discretize the temporal variable interval, [τ,T] into m + M uniform meshes, where m and M are the number of meshes in the time-lag interval [τ,0] and the domain time component, [0,T] respectively.

The time step tJm=(Jm1)Δt, for J=1,..,m+M+1, where Δt is the uniform time mesh size, in which Δt=τ/m=T/M as we impose T= for some positive integer k. The discrete temporal domain is given by

DtM={tj=(j1)Δt,j=1,,M+1}.

The FE solutions are piece-wise smooth, they may not differentiable at the mesh points. So we need a function space of Lp space whose generalized derivatives also belongs to Lp, the so called Sobolev space. The Sobolev space, W21 is the set of functions from L2 whose first generalized derivative exist and belongs to L2. It is standard to use the Hilbert space H1=W21. H01 is the subspace of H1 in which the functions vanish at the boundary (Grossmann et al., Citation2007).

Define linear base functions {ψj(t)}1M with respect to variable t, by

(21) {ψj(t)}1M={ttj1Δt,tj1ttj,tj+1tΔt,tjttj+1,0,otherwise.(21)

Let V1(D¯tM)=Span{ψj(t)}1M and set a Sobolev space V=H01(D¯tM). clearly, at each x the piecewise linear approximation U(t)V1(D¯tM)V.

The solution u(x,t) is approximated as a linear combination of Uj(x) and ψj(t).

(22) u(x,t)U(x,t)=j=1MUj(x)ψj(t),(22)

where the function Uj(x) traces the function u(x,tj) at t=tj, which is going to be determined in a later step (Reddy, Citation2019).

The first-order time derivative of the approximation in Equation22 is independent of time. That is

(23) ∂tu(x,t)j=1MUj(x)Uj1(x)Δt.(23)

At a fixed time interval [tj1,tj], for some j=1,2,,M, Equation23 becomes

(24) ∂tu(x,t)Uj(x)Uj1(x)Δt.(24)

So, we can write problem (Equation1) - (Equation2) at each jth time level as,

(25) Uj(x)Uj1(x)Δtε2Uj(x)x2μaj(x)Uj(x)∂x+bj(x)Uj(x)=cj(x)Ujm(x)+fj(x).(25)

In our procedure, we used the Crank-Nicolson finite difference approximation of ∂tu(x,tj12), at the mean point of (x,tj) and (x,tj1).

From the Taylor’s series expansion of u(x,tj) and u(x,tj1) about (x,tj12),

Uj(x)=Uj12(x)+Δt2∂tUj12(x)+12(Δt2)22t2Uj12(x)+...

and

Uj1(x)=Uj12(x)Δt2∂tUj12(x)+12(Δt2)22t2Uj12(x)+...,

we can derive ,

(26) ∂tUj12(x)=Uj(x)Uj1(x)Δt+O((Δt)2)(26)

and

(27) Uj12(x)=Uj(x)+Uj1(x)2+O((Δt)2).(27)

The governing problem (1) at this mean point, (x,tj12) is

(28) (ε2ux2μa∂u∂x+bu+∂u∂t)(x,tj12)=c(x,tj12)u(x,tj12m)+f(x,tj12).(28)

Substituting Equation26 for time derivative and average values between (x,tj) and (x,tj1) for spatial derivatives in Equation28 gives

(29) (εd2dx2μaj12(x)ddx+bj12(x))(Uj(x)+Uj1(x)2)+Uj(x)Uj1(x)Δt=cj12(x)Ujm(x)+Uj1m(x)2+fj12(x).(29)

Equation29 is a second-order boundary differential equation that can be described iteratively by

(30) εd2dx2Uj(x)μaj12(x)ddxUj(x)+(2Δt+bj12(x))Uj(x)=εd2dx2Uj1(x)+μaj12(x)ddxUj1(x)+(2Δtbj12(x))Uj1(x)+cj12(x)(Ujm(x)+Uj1m(x))+2fj12(x),(30)

with the boundary conditions,

(31) {Uj(0)=0,Uj(1)=0GiventhatUjm(x)=γb(x,tjm),when0jm.(31)

(30) and (31) constitute the semi-discrete problem of problem (28)-(2). Once again, we define a differential operator,

(32) Lε,μMεd2dx2μaj12(x)ddx+(2Δt+bj12(x)).(32)

Considering the semi-discretization, at each time step j, the operator Lε,μM satisfies the maximum principle.

Lemma 3.1.

Semi-discrete maximum principle:

Suppose χ(x,tj)C2(0,1), such that χ(0,tj),χ(1,tj)0, and Lε,μM(χ(x,tj))0,∀x(0,1), then χ(x,tj)0,∀x[0,1].

Proof.

Ref (Worku et al., Citation2023)

Lemma 3.2.

Semi-disretization Uniform Stability

The solution u(x,tj) of (30) - (31) satisfies u(x,tj)1βg, where

g(x,tj)=εd2dx2Uj1(x)+μaj12(x)ddxUj1(x)+(2Δtbj12(x))Uj1(x)+cj12(x)(Ujm(x)+Uj1m(x))+2fj12(x).

Proof.

Define barrier functions

θ±(x,tj)=1βg±u(x,tj)

θ±(0,tj)=1βg±00, θ±(1,tj)=1βg±00 and
Lε,μM(θ±(x,tj))=±Lε,μMu(x,tj)+(2Δt+b).(1βg)=±g(x,tj)+bβg+2Δg0.

1βg±u(x,tj)0 by the semi-discrete maximum principle of Lemma  3.1.

Then

u(x,tj)1βg.

Let Uj(x) be the numerical solution of the semi-discrete problem (Equation30), whose exact solution is u(x,tj) at a fixed t=tj. Uj(x) is generated in an iterative sequence from the prior numerical solution, Uj1(x). Assume Uj(x) is generated from the exact prior solution u(x,tj1), then the following holds.

(33) Δt2{εd2dx2μaj12(x)ddx+bj12(x)}Uj(x)+Uj(x)=Δt2{εd2dx2+μaj12(x)ddxbj12(x)}u(x,tj1)+u(x,tj1)+Δtcj12(x)(Ujm(x)+Uj1m(x)2)+Δtfj12(x).(33)

Then, ej=|Uj(x)Uj(x)| is the absolute local error, the error caused by one step of iteration. The bound of this error is measured in the (j)th local truncation error Tej given by

Tej=Lε,μM(Uj(x)Uj(x))=Δt2{εd2dx2μaj12(x)ddx+bj12(x)}u(x,tj)+u(x,tj)Δt2{εd2dx2+μaj12(x)ddxbj12(x)}u(x,tj1)u(x,tj1)Δtc(x,tj12)(u(x,tj1m)+u(x,tjm)2)Δtf(x,tj12)
|Tej|Δt|(εd2dx2μa(x,tj12)ddx+b(x,tj12))×(u(x,tj)+u(x,tj1)2)+(u(x,tj)u(x,tj1)Δt)(c(x,tj12)u(x,tj12m)+f(x,tj12))|Δt|(εd2dx2μa(x,tj12)ddx+b(x,tj12))(u(x,tj12))+(u(x,tj)u(x,tj1)Δt)Lε,μu(x,tj12)|Δt|u(x,tj)u(x,tj1)Δt∂tu(x,tj12)|Δt|(Δt)2243t3u(x,t)|,for some tsuch that tj1ttjC(Δt)3

This argument with Lemma 3.1 implies the error estimat of local error,

(34) ejC(Δt)3.(34)

Lemma 3.3.

The global error estimate, E of the semi-discrete problem (Equation30) and (Equation31) is given by

(35) EC(Δt)2(35)

Proof.

From (Equation34) we have ejC(Δt)3.

ej is the contribution of each time step error to the global error, then the global error, E will be

E=j=1Mejj=1Mejj=1MC(Δt)3=CM(Δt)3=CT(Δt)2=C(Δt)2.

Then, EC(Δt)2

The boundary layer properties are determined according to the characteristic equation of Equation30 which is

(36) ε(λ(x))2μaλ(x)+(b+2Δt)=0,(36)

whose roots are

λ1(x)=μa2ε[1+1+4εμ2a2(b+2Δt)]λ2(x)=μa2ε[11+4εμ2a2(b+2Δt)].

let

(37) Λ1=maxx{λ1(x)}andΛ2=minx{λ2(x)}(37)

Lemma 3.4.

The ith derivative of the solution, u(x,tj) of (30) - (31) satisfies |didxiu(x,tj)|C[1+Λ1iexp(ρΛ1x)+Λ2iexp(ρΛ2(1x))], for 0iq up to a certain prescribed order q, and any ρ,0<ρ<1.

Proof.

Refer (M. Kadalbajoo & Yadaw, Citation2012; Rajan & Reddy, Citation2022)

3.2. Spatial discretization

The boundary layers’ widths depend on the values of perturbation parameters, while their position is at the left and right neighbourhoods of x = 0 and x = 1. Since we are implementing the fitted mesh method, the spatial discretization is piecewise uniform Shishkin mesh type. The spatial domain component, [0,1] is split into three subintervals: [0,σ1],[σ1,1σ2] and [1σ2,1], assuming the left transition point is σ1 and the right is σ2. The boundary layer subintervals [0,σ1] and [1σ2,1] will have N4 fine elements each and N2coarse elements will distribute along the outer layer region, [σ1,1σ2] uniformly, where a 4th multiple N is number of elements in spatial direction (Miller et al., Citation1998). The transition points σ1 and σ2 are determined by

(38) σ1={min{14,4εςαlnN},μ2ςεα,min{14,4εμαlnN},μ2ςεαand σ2={min{14,4εςαlnN},μ2ςεα,min{14,4μςlnN},μ2ςεα.(38)

The sizes of piecewise uniform meshes are provided by

(39) hi={4σ1N,i=1,2,,N4+1,2(1σ1σ2)N,i=N4+1,,3N4+1,4σ2N,i=3N4+1,,N+1.(39)

Accordingly the node points are given as

(40) xi={4Nσ1(i1),i=1,2,,N4+1,σ1+2N(1σ1σ2)(i1N4),i=N4+1,,3N4+1,1σ2+4Nσ2(i13N4),i=3N4+1,,N+1.(40)

So, the spatial discretization , DxN={xi=xi1+hi,x1=0and i=2,,N+1}. The following inequality needs to be considered for error analysis:

(41) 1<i<N,hi2N,(41)
(42) 1<i<N4,hi4σ1N1N,(42)
(43) 3N4<i<N,hi4σ2N1N,(43)
(44) N4<i<3N4,hi1N.(44)

Across the spatial direction, we consider the quadratic base functions. For each individual element there are three local nodes, which implies 2N+1 global nodes through the spatial domain. Let {ϕi(x)}12N be the set of base function and V2(D¯x2N) be the space of second degree polynomials those condense at the boundaries x = 0 and x = 1. V2(D¯x2N)=Span{ϕj(x)}12N and set a Sobolev space V=H01(D¯x2N). Clearly, at each t, the piecewise quadratic approximation Uj(x)V2(D¯x2M)V. The finite element approximation of u(x,tj) is given as linear combination of these base functions.

(45) u(x,tj)Uj(x)=i=12NUi,j.ϕi(x),(45)

where Ui,j is the functional value of u(xi,tj) which is going to be determined later. The required two variable finite element solution is obtained by substituting (Equation45) into the Rothe’s function (Equation22).

(46) u(x,t)U(x,t)=j=1Mi=12NUi,j.ϕi(x)ψj(t).(46)

Now, to determine the unknown coefficients Ui,j, write the weak or variation form of (Equation30) by multiplying a piecewise smooth weight function w(x) which vanishes at the boundary ΓlΓr and integrate over [0,1]. Since the Dirichlet boundary conditions are homogeneous, integration by part implies

(47) εdUjdx.dwdxμa¯dUjdx.w+(2Δt+b¯)Uj,w=εdUj1dx.dwdx+μa¯dUj1dx.w+(2Δtb¯)Uj1,w+c¯Ujm+Uj1m,w+2fj12(x),w.(47)

In the case of Galerkin finite element method, the weight function w(x) is chosen to be equal to the approximation function ϕ(x). So, the algebraic equation of Equation47 will be

(48) i=12N{εdϕidx,dϕldxμa¯dϕidx,ϕl+ (2Δt+b¯)ϕi,ϕl}Ui,j=i=12N{εdϕidx,dϕldx+μa¯dϕidx,ϕl+ (2Δtb¯)ϕi,ϕl}Ui,j1+c¯i=12N(Ui,j1m+Ui,jm)ϕi,ϕl+2fj(x),ϕl,(48)

for each j=1,2,,M+1, for all i,l=1,2,,2N and the bar functions a¯=ai12,j12a(xi+12hi,tj+12Δt) and b¯=bi12,j12b(xi+12hi,tj+12Δt).

48 can be expressed in a matrix notation of the form

(49) AUj=BUj1+C(Uj1m+Ujm)+\textit{f},(49)

where the matrices, A=(ai,l), B=(bi,l), C=(ci,l) and the vector \textit{f}=(fl), whose entries are given bellow.

ai,l=εdϕidx,dϕldxμa¯dϕidx,ϕl+(2Δt+b¯)ϕi,ϕl,bi,l=εdϕidx,dϕldx+μa¯dϕidx,ϕl+(2Δtb¯)ϕi,ϕl,ci,l=c¯ϕi,ϕland fl=2fj(x),ϕl.

3.2.1. Formulation of element equation

Consider an arbitrary space element e=[xi1,xi] and a quadratic approximation for this particular element, Uje(x)=Ui1,jϕ1e(x)+Ui12,jϕ2e(x)+Ui,jϕ3e(x). We need three local nodes to determine Uje(x) in terms of the Lagrange quadratic interpolation functions and the nodal values. Take the two endpoints (xi1=x1e,xi=x3e) and the midpoint (xi12=x2e) for convenience.

The parity and unity properties of Lagrange interpolation functions ϕ1e(x),ϕ2e(x),ϕ3e(x),

(50) ϕpe(xqe)={0,if pq,1,if p=q,p,q=1,2,3and p=13ϕpe(x)=1(50)

help us to derive the Lagrange quadratic interpolation polynomials as

(51) ϕ1e(x)=1D[xi12(xi)2xi(xi12)2+((xi12)2(xi)2)x+((xi)xi12)x2],(51)
(52) ϕ2e(x)=1D[xi(xi1)2xi1(xi)2+((xi)2(xi1)2)x+(xi1xi)x2],(52)
(53) ϕ3e(x)=1D[xi1(xi12)2xi12(xi1)2+((xi1)2(xi12)2)x+(xi12xi1)x2],(53)

where D=xi12(xi)2xi(xi12)2+xi(xi1)2xi1(xi)2+xi1(xi12)2xi12(xi1)2.

The inner product terms of the weak form with in this particular element are computed as follows.

(54) dϕpdx,dϕqdx=xi1xidϕpdx.dϕqdxdx=13hi[7818168187],(54)
(55) dϕpdx,ϕq=xi1xidϕpdx.ϕqdx=16[341404143],(55)
(56) ϕp,ϕq=xi1xiϕp.ϕqdx=hi30[4212162124],(56)
(57) fj(x),ϕq=xi1xifj(x).ϕqdx=[xi1xif(x,tj).ϕ1dxxi1xif(x,tj).ϕ2dxxi1xif(x,tj).ϕ3dx].(57)

The element matrices Ae and Be are given by

Ae=εdϕpdx,dϕqdxμai12,j12dϕpdx,ϕq+(2Δt+bi12,j12)ϕp,ϕq,
Be=εdϕpdx,dϕqdx+μai12,j12dϕpdx,ϕq+(2Δtbi12,j12)ϕp,ϕq.

The results through (Equation54) - (Equation57) imply

(58) Ae=[a1,1ea1,2ea1,3ea2,1ea2,2ea2,3ea3,1ea3,2ea3,3e]and Be=[b1,1eb1,2eb1,3eb2,1eb2,2eb2,3eb3,1eb3,2eb3,3e](58)

where the entries are

a1,1e=7ε3hi+μai12,j122+4hi15Δt+bi12,j122hi15,b1,1e=7ε3hiμai12,j122+4hi15Δtbi12,j122hi15a1,2e=8ε3hi+2μai12,j123+2hi15Δt+bi12,j12hi15,b1,2e=8ε3hi2μai12,j123+2hi15Δtbi12,j12hi15a1,3e=ε3hiμai12,j126hi15Δtbi12,j12hi30,b1,3e=ε3hi+μai12,j126hi15Δt+bi12,j12hi30a2,1e=8ε3hi2μai12,j123+2hi15Δt+bi12,j12hi15,b2,1e=8ε3hi+2μai12,j123+2hi15Δtbi12,j12hi15a2,2e=16ε3hi+0+16hi15Δt+bi12,j128hi15,b2,2e=16ε3hi+0+16hi15Δtbi12,j128hi15a2,3e=8ε3hi+2μai12,j123+2hi15Δt+bi12,j12hi15,b2,3e=8ε3hi2μai12,j123+2hi15Δtbi12,j12hi15a3,1e=ε3hi+μai12,j126hi15Δtbi12,j12hi30,b3,1e=ε3hi+μai12,j126hi15Δt+bi12,j12hi30,a3,2e=8ε3hi2μai12,j123+2hi15Δt+bi12,j12hi15,b3,2e=8ε3hi+2μai12,j123+2hi15Δtbi12,j12hi15a3,3e=7ε3hiμai12,j122+4hi15Δt+bi12,j122hi15,b3,3e=7ε3hi+μai12,j122+4hi15Δtbi12,j122hi15.

The coefficient matrix of delay term,

(59) Ce=hici12,j1230[4212162124].(59)

The element source vector,

(60) fe=hifi12,j126[141].(60)

Then, an element equation of the arbitrary space element e=[xi1,xi] recurrently given by

(61) AeUje=BeUj1e+Ce(Uj1me+Ujme)+fe.(61)

3.2.2. Assembling element equations

If the linear elements are connected head to tail, then the assembled equation will be a 2N1×2N1 system of equation of the form

(62) AUj=B.Uj1+C(Uj1m+Ujm)+f,(62)

for each jth time step with the discrete initial and boundary conditions,

(63) Ui,j=γb(xi,tj)∀ij=m,m+1,,0,U0,j=0∀j,U1,j=0∀j.(63)

The stiffness matrix A is a penta-diagonal given by

(64) A=[a1,11a1,21a1,310000a2,11a2,21a2,310000a3,11a3,21a3,31+a1,12a1,22a1,320000a2,12a2,22a2,320000a3,12a3,22a3,32+a1,13a1,23a1,320000a2,13a2,23a2,330000a3,12a3,22a3,32+a1,13a3,3N+1].(64)

The matrices B and C will be established in the same manner and the source vector function,

(65) \textit{f}=16[h1f12,j124h1f12,j12h1f12,j12+h2f32,j124h2f32,j12h2f32,j12+h3f52,j12hNf2N12,j12].(65)

Based on the assumption of the perturbation parameter given in the governing problem (0<ε,μ1), the stiffness matrix is non-singular. The algebraic system of Equation62 implies the unknown vector values Ui,j and the finite element approximate solution, U(x,t) is determined by

(66) U(x,t)=j=1M+1i=12N+1Ui,j.ϕi(x)ψj(t),(66)

(x,t)D¯, where ϕi(x) is space base function and ψj(t) is time base functions defined on (Equation51) and (Equation21).

4. Convergence analysis

The convergence of a finite element solution depends on the degree of approximate functions, the order of the derivative of u(x,t) in the weak form, and the size of the mesh elements (Reddy, Citation2019). We used piecewise linear polynomials in time and quadratic Lagrange interpolation functions in space direction to approximate u(x,t) throughout the domain. Hence, we are treating the h-convergence analysis, that is, the convergence by refining the size of the elements. Not increasing the degree of the approximate functions.

Errors introduced into finite element solutions are due to domain approximation, arithmetic, and approximation solutions. In our case, the domain is rectangular. Hence, the domain approximation error is not included (Surana & Reddy, Citation2016). The round-off error is reasonably small or zero in the desired decimal point accuracy. Then, the only inherent error introduced into the finite element solution is because of the approximation of the solution. The error estimate of the semi-discrete problem is discussed under Section 3 in maximum norm. Again, we apply the maximum norm to evaluate the error estimate in the spatial direction.

It is possible to decompose the numerical solution into U=V+WL+WR, just as the continuous solution did in Section 3, decomposed into regular and singular components. The error, Uu=(Vv)+(WLwL)+(WRwR), and then triangle inequality gives its bound with

UuVv+WLwL+WRwR.

Now, take an arbitrary spatial element D¯i=[xi1,xi] for a fixed time level j.

The finite element approximation at t=tj, u(x,tj) with in this interval is

Uj(x)=Ui1,jϕi1(x)+Ui,jϕi(x)|Uj(x)|maxDi(u(x,tj))(ϕi1(x)+ϕi(x)),since Ui1,j,Ui,jmaxDi(u(x,tj)),∀x[xi1,xi].Then |Uj(x)|maxDi(|u(x,tj)|),by the property ϕi1(x)+ϕi(x)=1.

Theorem 4.1

Given a function u(x)C2[0,1] and mesh points xo,x1,x2,,xN, the continuous piecewise quadratic function U(x) has an error estimate

(67) uUCh2u.(67)

Proof.

The error, e=u(x)U(x). At the mesh points, u(xi)=U(xi) and u(xi1)=U(xi1). Hence, e(xi)=e(xi1)=0. The Rolle’s theorem of calculus implies that there is zi(xi1,xi) such that e(zi)=0. So, for any x(xi1,xi), the Taylor expansion of e(x)=e(zi+xzi) is

e(x)=e(zi)+e(zi)(xzi)+e(zi)2(xzi)2+e(zi)3!(xzi)3+=e(zi)+e(zi)(xzi)+e(ξ)2(xzi)2,for some ξ,xi1ξxi.

At x=xi, e(xi)=e(zi)+12e(ξ)(xizi)2, which implies e(zi)=12e(ξ)(xizi)2.

If xi1+hi2zixi, then

|e(zi)|12(hi2)2|e(ξ)|12(hi2)2|u(ξ)U(ξ)|=12(hi2)2|u(ξ)C|=Chi2u.

uU=max1iN|e(zi)|Ch2u.

If xi1zixihi2, we arrive at the same result considering x=xi1.

In our case, Theorem 4.1 holds for Uj(x) and u(x,tj) at any fixed time tj. Using the second spatial derivative bounds of the continuous solution in Lemma 2.3, we can obtain the following error estimate.

(68) |Uj(x)u(x,tj)|{Chi2ε1,αμ2ςε,Chi2μ2ε2,αμ2ςε.(68)

Applying the component solutions of Uj(x) and u(x,tj),

|Uj(x)u(x,tj)||Vj(x)v(x,tj)|+|WLj(x)wL(x,tj)|+|WRj(x)wR(x,tj)||Vj(x)v(x,tj)|+|WLj(x)|+|wL(x,tj)|+|WRj(x)|+|wR(x,tj)|Chi2maxDi|v(x,tj)|+2maxDi|wL(x,tj)|+2maxDi|wR(x,tj)|.

The bounds on Lemma 2.4 and Lemma 2.5 implies

(69) |Uj(x)u(x,tj)|{C(hi2+exp(αςεxi1)+exp(αςε(1xi))),αμ2ςε,C(hi2(1+εμ1)+exp(αμεxi1)+exp(ςμ(1xi))),αμ2ςε.(69)

The error estimates in (68) and (69) depend on many factors. These error bounds are determined according to parameter values, whether αμ2ςε or αμ2ςε, the values of transition points σ1,σ20.25 or σ1,σ2=0.25, the position of the element, whether in the boundary regions or not and the propagation of the error in the delay term, when jm or j > m, the way that error propagation varies. Before we get into the analysis of each case, let us state the following theorem.

Theorem 4.2

Let Uj(x) be the finite element solution of the semi-discrete problem Equation30 - Equation31 on a fitted mesh DxN, to the exact solution u(x,tj), then

(70) Uj(x)u(x,tj)CN2(lnN)2.(70)

Proof.

Assume Uj(x)u(x,tj)Ujm(x)u(x,tjm)+k(N), for some mathematical expression k(N).

If jm, both Ujm(x)=u(x,tjm)=γb(x,tjm) and Ujm(x)u(x,tjm)=0. No error is encountered due to the delay term. Then Uj(x)u(x,tj)0+k(N)

if mj2m an additional error contributed due to the delay term Ujm(x)u(x,tjm)k(N), then Uj(x)u(x,tj)2k(N).

This can be proceed up to (k1)mjkm=T. The current error bound is a constant multiple of the prior one. that is

(71) Uj(x)u(x,tj)CUjm(x)u(x,tjm).(71)

Hence, it is sufficient to show the error estimate for jm or for the time interval [0,τ]. We focus the proof on the two major cases αμ2ςε and αμ2ςε,

Case I: αμ2ςε

If σ1=14, then there is uniform mesh length, hi=1N and 144εαςlnN, which implies 1εC(lnN)2. Substituting for hi and 1ε, in the Equation68, Uj(x)u(x,tj)Chi2ε1 gives

(72) Uj(x)u(x,tj)CN2(lnN)2.(72)

If σ1<14, then σ1=σ2=4εαςlnN. In the boundary regions , 1<i<N4 and 3N4<i<N, the mesh size hi=16εας.lnNN which implies hiε16ας.lnNN. then again Equation68 will be,

(73) Uj(x)u(x,tj)CN2(lnN)2.(73)

In the outer boundary region, N4<i<3N4 for any i, σ1<xi<σ2 and by Equation41, hi2N . We can have the following result from Equation69.

Uj(x)u(x,tj)C(hi2+exp(αςεxi1)+exp(αςε(1xi)))C((2N)2+exp(αςεσ1)+exp(αςε(σ2)))C((2N)2+exp(αςε4εαςlnN)+exp(αςε(4εαςlnN)))C(N2+N4+N4).

Thus

(74) Uj(x)u(x,tj)CN2.(74)

Case II: αμ2ςε

If σ1=14, then 14<4εαμlnN, which is με16αlnN. For any case of σ2=14 or σ2<14, the mesh size hi2N. These relations with the second case of Equation68, Uj(x)u(x,tj)Chi2μ2ε2, gives

(75) Uj(x)u(x,tj)CN2(lnN)2.(75)

If σ1<14, then σ1=4εαμlnN. The second transition point σ214.

In the left boundary layer, hi=16εαμlnNN. Inserting this value in Equation68, we get

(76) Uj(x)u(x,tj)CN2(lnN)2.(76)

In the outer boundary layer region, σ1<xi<σ2, by Equation43, hi2N for all i, n4<i<3N4. Applying the inequality εμ16ςlnN, (since 1μ16ςlnN) the second case of Equation69, becomes

Uj(x)u(x,tj)C((2N)2(1+εμ1)+exp(αμεσ1)+exp(ςμσ2))C(N2(1+εμ1)+exp(αμε4εαμlnN)+exp(ςμ4μςlnN))C(N2(1+lnN)+exp(4lnN)+exp(4lnN))C(N2+N2lnN+N4+N4).

Thus,

(77) Uj(x)u(x,tj)CN2lnN.(77)

In the right boundary layer region, σ1<σ2<xi<1 and hi2N for all i, 3N4<i<N4. Taking the same Equation69, we have

Uj(x)u(x,tj)C((2N)2(1+εμ1)+exp(αμεσ1)+exp(ςμσ2))C(N2(1+lnN)+exp(4lnN))C(N2+N2lnN+N4).

Then,

(78) Uj(x)u(x,tj)CN2lnN.(78)

The next theorem completes our analysis with the temporal global error bond of lemma 3.3.

Theorem 4.3

Let u(x,t) be the solution of problem (Equation1) - (Equation2) and U(x,t) be the finite element approximate solution obtained by (Equation46), then the following ε,μ uniform error estimate holds,

(79) uUC(N2(lnN)2+M2)(79)

where C is independent of ɛ and µ.

Proof.

The temporal and spatial error bounds in Lemma 3.3 and Theorem 4.2 implies the result.

5. Results and discussion

Two test problems are used for the numerical experiment. Extensive experiments are conducted on their numerical solutions. Some graphs are illustrated, and tables are presented for particular perturbation parameters and mesh numbers. The graphs and tables are used to show the maximum error estimates, convergence rates, and comparisons with previous study results.

A fine-grid solution is used to estimate errors when the exact solution to a problem is unknown. Thus, the double mesh principle is used to calculate the error estimate and rate of convergence of the proposed method. Let U(x,t) on a grid mesh N × M and V(x,t) on a doubled grid mesh 2N×2M be the FE solution for each perturbation parameter ɛ and µ. An element equation of a rectangular element [xi,xi+1]×[tj,tj+1] is given by

Ue(x,t)=p=jj+1q=2i12i+1Up,q.ϕp(x)ψq(t)=U2i1,j.ϕ1e(x)ψ1e(t)+U2i,j.ϕ2e(x)ψ1e(t)+U2i+1,j.ϕ3e(x)ψ1e(t)+U2i1,j+1.ϕ1e(x)ψ2e(t)+U2i,j+1.ϕ2e(x)ψ2e(t)+U2i+1,j+1.ϕ3e(x)ψ2e(t)=(U2i1,j.ψ1e(t)+U2i1,j+1.ψ2e(t))ϕ1e(x)+(U2i,j.ψ1e(t)+U2i,j+1.ψ2e(t))ϕ2e(x)+(U2i+1,j.ψ1e(t)+U2i+1,j+1.ψ2e(t))ϕ3e(x)

The hat functions, ψj and Lagrange quadratic interpolation functions, ϕi referred by (Equation21) and (51), in this specified element for j=1,2 and i=1,2,3 are determined by

(80) {ψ1e=1Δt(tj+1t)ψ2e=1Δt(ttj)and {ϕ1e=12xi2hi+34xihi2+14hi3(xihi+34hi2)x+12hix2ϕ2e=xi2hixihi2+(2xihi+hi2)xhix2ϕ3e=12xi2hi+14xihi2(xihi+14hi2)x+12hix2(80)
Ue(x,t)=(U2i1,j.ψ1e(t)+U2i1,j+1.ψ2e(t))×(12xi2hi+34xihi2+14hi3(xihi+34hi2)x+12hix2)+(U2i,j.ψ1e(t)+U2i,j+1.ψ2e(t))×(xi2hixihi2+(2xihi+hi2)xhix2)+(U2i+1,j.ψ1e(t)+U2i+1,j+1.ψ2e(t))×(12xi2hi+14xihi2(xihi+14hi2)x+12hix2)=U2i1,j.1Δt(tj+1t)×(12xi2hi+34xihi2+14hi3(xihi+34hi2)x+12hix2)+U2i,j.1Δt(tj+1t)×(xi2hixihi2+(2xihi+hi2)xhix2)+U2i+1,j.1Δt(tj+1t)×(12xi2hi+14xihi2(xihi+14hi2)x+12hix2)+U2i1,j+1.1Δt(ttj)×(12xi2hi+34xihi2+14hi3(xihi+34hi2)x+12hix2)+U2i,j+1.1Δt(ttj)×(xi2hixihi2+(2xihi+hi2)xhix2)+U2i+1,j+1.1Δt(ttj)×(12xi2hi+14xihi2(xihi+14hi2)x+12hix2).

Now, dividing each mesh in to two equal length (refer Figures ), similar numerical solutions, V11e(x,t),V12e(x,t),V21e(x,t) and V22e(x,t) are derived for the four quarter regions of the element. For each corresponding region, [xi,xi+12]×[tj,tj+12], [xi+12,xi+1]×[tj,tj+12], [xi,xi+12]×[tj+12,tj+1], and [xi+12,xi+1]×[tj12,tj+1], the numerical solution is indicated below.

Figure 1. Global numerical solution indices refers to local nodes of arbitrary finite element [xi,xi+1]×[tj,tj+1].

Figure 1. Global numerical solution indices refers to local nodes of arbitrary finite element [xi,xi+1]×[tj,tj+1].

Figure 2. Global numerical solution indices refers to local nodes of arbitrary finite element [xi,xi+1]×[tj,tj+1] after double split of the spatial and temporal finite elements.

Figure 2. Global numerical solution indices refers to local nodes of arbitrary finite element [xi,xi+1]×[tj,tj+1] after double split of the spatial and temporal finite elements.

If (x,t)[xi,xi+12]×[tj,tj+12], then

V11e(x,t)=V4i3,2j1.2Δt(tj+12t)(14xi2hi+316xihi2+132hi3(12xihi+316hi2)x+14hix2)+V4i2,2j1.2Δt(tj+12t)×(12xi2hi14xihi2+(xihi+14hi2)x12hix2)+V4i1,2j1.2Δt(tj+12t)×(14xi2hi+116xihi2(12xihi+116hi2)x+14hix2)+V4i3,2j.2Δt(ttj)(14xi2hi+316xihi2+132hi3(12xihi+316hi2)x+14hix2)+V4i2,2j.2Δt(ttj)×(12xi2hi14xihi2+(xihi+14hi2)x12hix2)+V4i1,2j.2Δt(ttj)×(14xi2hi+116xihi2(12xihi+116hi2)x+14hix2).

If (x,t)[xi+12,xi+1]×[tj,tj+12], then

V12e(x,t)=V4i1,2j1.2Δt(tj+12t)(14xi2hi+716xihi2+316hi3(12xihi+716hi2)x+14hix2)+V4i,2j1.2Δt(tj+12t)(12xi2hi34xihi214hi3+(xihi+54hi2)x12hix2)+V4i+1,2j1.2Δt(tj+12t)(14xi2hi+516xihi2+332hi3(12xihi+516hi2)x+14hix2)+V4i1,2j.2Δt(ttj)(14xi2hi+716xihi2+316hi3(12xihi+716hi2)x+14hix2)+V4i,2j.2Δt(ttj)(12xi2hi34xihi214hi3+(xihi+54hi2)x12hix2)+V4i+1,2j.2Δt(ttj)(14xi2hi+516xihi2+332hi3(12xihi+516hi2)x+14hix2).

If (x,t)[xi,xi+12]×[tj+12,tj+1], then

V21e(x,t)=V4i3,2j.2Δt(tj+1t)(14xi2hi+316xihi2+132hi3(12xihi+316hi2)x+14hix2)+V4i2,2j.2Δt(tj+1t)(12xi2hi14xihi2+(xihi+14hi2)x12hix2)+V4i1,2j.2Δt(tj+1t)(14xi2hi+116xihi2(12xihi+116hi2)x+14hix2)+V4i3,2j+1.2Δt(ttj+12)(14xi2hi+316xihi2+132hi3(12xihi+316hi2)x+14hix2)+V4i2,2j+1.2Δt(ttj+12)(12xi2hi14xihi2+(xihi+14hi2)x12hix2)+V4i1,2j+1.2Δt(ttj+12)(14xi2hi+116xihi2(12xihi+116hi2)x+14hix2).

If (x,t)[xi+12,xi+1]×[tj+12,tj+1], then

V22e(x,t)=V4i1,2j.2Δt(tj+1t)(14xi2hi+716xihi2+316hi3(12xihi+716hi2)x+14hix2)+V4i,2j.2Δt(tj+1t)(12xi2hi34xihi214hi3+(xihi+54hi2)x12hix2)+V4i+1,2j.2Δt(tj+1t)(14xi2hi+516xihi2+332hi3(12xihi+516hi2)x+14hix2)+V4i1,2j+1.2Δt(ttj+12)(14xi2hi+716xihi2+316hi3(12xihi+716hi2)x+14hix2)+V4i,2j+1.2Δt(ttj+12)(12xi2hi34xihi214hi3+(xihi+54hi2)x12hix2)+V4i+1,2j+1.2Δt(ttj+12)(14xi2hi+516xihi2+332hi3(12xihi+516hi2)x+14hix2).

Let an element numerical solution using double mesh be

(81) Ve(x,t)=V11e(x,t)+V12e(x,t)+V21e(x,t)+V22e(x,t),(81)

then, the error committed at any (x,t)[xi,xi+1]×[tj,tj+1] will be

(82) e(x,t)=Ue(x,t)Ve(x,t).(82)

The error e(x,t) is linear in t and quadratic in x in each quarter region. ∂te(x,t) depends on x only, which means it is constant at a fixed value of x. Hence, the maximum value of |e(x,t)| in the finite element attain at t=tj,tj+12or tj+1. Let ∂xe(x,t)=0 at x¯1(xi,xi+12) and x¯2(xi+12,xi+1). Therefore, the maximum absolute error in the local finite element exists at either of the 15 critical points (xi,tj), (x¯1,tj), (xi+12,tj), (x¯2,tj), (xi+1,tj), (xi,tj+12), (x¯1,tj+12), (xi+12,tj+12), (x¯2,tj+12), (xi+1,tj+12), (xi,tj+1), (x¯1,tj+1), (xi+12,tj+1), or (x¯2,tj+1),(xi+1,tj+1).

So, the element-wise maximum absolute error eε.μN,M is given by

eε.μN,M=max(|e(xi,tj)|,|e(x¯1,tj)|,|e(xi+12,tj)|,|e(x¯2,tj)|,|e(xi+1,tj)|,|e(xi,tj+12)|,|e(x¯1,tj+12)|,|e(xi+12,tj+12)|,|e(x¯2,tj+12)|,|e(xi+1,tj+12)|,|e(xi,tj+1)|,|e(x¯1,tj+1)|,|e(xi+12,tj+1)|,|e(x¯2,tj+1)|,|e(xi+1,tj+1)|).

Because of the continuity and balance properties of the finite element solution at junction edges and error at the initial and boundary of the domain is zero, we can consider only eight of the critical points to compute the global maximum absolute error during assembly. Then, the global maximum absolute error for each ɛ and µ (Eε,μN,M) of the numerical solution is

Eε,μN,M=sup(x,t)D¯|U(x,t)V(x,t)|=sup(x,t)D¯|j=1Mi=12NUi,j.ϕi(x)ψj(t)j=12Mi=14NVi,j.ϕi(x)ψj(t)|=max1iN1jM{|e(xi,tj+12)|,|e(x¯1,tj+12)|,|e(xi+12,tj+12)|,|e(x¯2,tj+12)|,|e(xi,tj+1)|,|e(x¯1,tj+1)|,|e(xi+12,tj+1)|,|e(x¯2,tj+1)|}.

The corresponding rate of convergence,Rε,μN,M is given by

(83) Rε,μN,M=log2(Eε,μN,M)log2(Eε,μ2N,2M).(83)

The maximum absolute error, EN,M and the corresponding rate of convergence, RN,M for any perturbation parameters ɛ and µ mutually near to zero is determined by

(84) EN,M=max0<ε,μ1(Eε,μN,M)and (84)
(85) RN,M=log2(EN,M)log2(E2N,2M)(85)

The following two test examples are adopted from Negero and Duressa (Citation2021) for numerical experiment.

Example 5.1.

(86) ε2ux2(x,t)μ(x+1)∂u∂x(x,t)+u(x,t)+∂u∂t=u(x,t1)16x2(1x)2,(86)

(x,t)(0,1)×(0,2], subjected to the initial and boundary conditions

(87) {u(x,t)=0,(x,t)[0,1]×[1,0]u(0,t)=0,∀t[0,2],u(1,t)=0,∀t[0,2].(87)

Example 5.2.

ε2ux2(x,t)μ(1+x(1x)+t2)∂u∂x(x,t)+(1+5xt)u(x,t)+∂u∂t=u(x,t1)x(1x)(ex1),(x,t)(0,1)×(0,2]

subjected to the initial and boundary conditions

(88) {u(x,t)=0,(x,t)[0,1]×[1,0]u(0,t)=0,∀t[0,2],u(1,t)=0,t[0,2].(88)

The governing equation’s assumptions and the necessary compatibility conditions in Equation4-(Equation7) are met. We are confident in the existence and uniqueness of the solutions for Example 5.1 and Example 5.2. However, their exact solutions are unknown. Thus, the double mesh concept is used to calculate the element-wise error estimate and rate of convergence of the proposed method. The numerical experiment is performed based on the convenience perturbation parameters and the number of finite elements so that 0<ε,μ1 and according to the performance of our personal computer. Figure is the finite element solution of Example 5.1 for a 32×32 rectangular elements grid and its double mesh grid. For this case, element wise absolute maximum error is illustrated in Figure . The 64×64 rectangular elements grid and its double mesh grid numerical solutions with their corresponding error graphs are shown in Figures . Similar investigation is done for Example 5.2 as shown in Figures . Through numerical experimentation, it has been found that the point-wise (as well as the maximum) absolute error reduces as the number of finite elements increases.

Figure 3. Graphs of the FE solution of example 5.1 for 32×32 mesh and double mesh grid with parameters ε=1010 and μ=1020..

Figure 3. Graphs of the FE solution of example 5.1 for 32×32 mesh and double mesh grid with parameters ε=10−10 and μ=10−20..

Figure 4. The graph of element-wise absolute maximum error of the FE solution in example 5.1 for 32×32 mesh when the parameters ε=1010 and μ=1020..

Figure 4. The graph of element-wise absolute maximum error of the FE solution in example 5.1 for 32×32 mesh when the parameters ε=10−10 and μ=10−20..

Figure 5. The graph of element-wise absolute maximum error of the FE solution in example 5.1 for 64×64 mesh when the parameters ε=1010 and μ=1020..

Figure 5. The graph of element-wise absolute maximum error of the FE solution in example 5.1 for 64×64 mesh when the parameters ε=10−10 and μ=10−20..

Figure 6. The graph of element-wise absolute maximum error of the FE solution in example 5.1 for 64×64 mesh when the parameters ε=1010 and μ=1020..

Figure 6. The graph of element-wise absolute maximum error of the FE solution in example 5.1 for 64×64 mesh when the parameters ε=10−10 and μ=10−20..

Figure 7. Graphs of the FE solution of example 5.2 for 32×32 mesh and double mesh grid with parameters ε=1010 and μ=1020..

Figure 7. Graphs of the FE solution of example 5.2 for 32×32 mesh and double mesh grid with parameters ε=10−10 and μ=10−20..

Figure 8. The graph of element-wise absolute maximum error of the FE solution in example 5.2 for 32×32 mesh when the parameters ε=1010 and μ=1020.

Figure 8. The graph of element-wise absolute maximum error of the FE solution in example 5.2 for 32×32 mesh when the parameters ε=10−10 and μ=10−20.

Figure 9. Graphs of the FE solution of example 5.2 for 64 × 64 mesh and double mesh grid with parameters ε = 10 − 10 and μ = 10 − 20.

Figure 9. Graphs of the FE solution of example 5.2 for 64 × 64 mesh and double mesh grid with parameters ε = 10 − 10 and μ = 10 − 20.

Figure 10. The graph of element-wise absolute maximum error of the FE solution in example 5.2 for 64 × 64 mesh when the parameters ε = 10 − 10 and μ = 10 − 20.

Figure 10. The graph of element-wise absolute maximum error of the FE solution in example 5.2 for 64 × 64 mesh when the parameters ε = 10 − 10 and μ = 10 − 20.

The error estimate and rate of convergence of the finite element solution of the first test problem in Example 5.1 are tabulated in . That is performed by fixing one of the perturbation parameters while reducing the other so that addressing the two cases αμ2ςε and αμ2ςε. shows the proposed method is uniformly convergent independent of the perturbation parameter µ, and shows it is again uniformly convergent independent of the perturbation parameter ɛ. A similar presentation is given in for the second problem of Example 5.2. The maximum absolute error decreases uniformly as the number of meshes increases, irrespective of perturbation parameters, with almost a second order of convergence. So, this experiment verified that the method is ε,μ uniform.

Table 1. Error estimate and convergence rate of example 5.1, for ε=1010

Table 2. Error estimate and convergence rate of example 5.1, for μ=1010

Table 3. Error estimate and convergence rate of example 5.2, for ε=1010

Table 4. Error estimate and convergence rate of example 5.2, for μ=1010

The logarithmic scaled graph of maximum absolute error of the finite element solutions of the two test problems for some particular parameters are given in Figure . The graphs are almost linear with slope of − 2 which strengthen the predicted convergence rate.

Figure 11. logarithmic scaled graphs of maximum error versus number of meshes:(a)Example 5.1, and (b) example 5.2.

Figure 11. logarithmic scaled graphs of maximum error versus number of meshes:(a)Example 5.1, and (b) example 5.2.

Assuming ε=104 and μ=109, Ayele et al. (Citation2023) implements the θ approach to solve Problem 5.1. For both θ = 1 and θ=12, the convergence rate and error are compared with the numerical solution provided in Kumar, et al. (2020). Our numerical results and the findings from earlier studies are included in Table . As a result, our method offers a smaller error and a better rate of convergence for the same perturbation parameters and domain discretization.

Table 5. Comparison of the error estimate (EN,M) and rate of convergence (RN,M) of example 5.1, for ε=104 and μ=109

6. Conclusion

A finite element method is developed to solve a large time delay, two-parameter singularly perturbed one-dimensional parabolic problem. In the decoupled technique, discretization is done in two phases. First, the time derivative is substituted by the Crank-Nicolson finite difference approximation after the temporal variable is uniformly discretized and approximated by a finite element piecewise linear continuous function. Next, a fitted mesh (layer-adapted) finite element method is applied to the semi-discretized problem in order to perform spatial discretization. Nodal approximations are obtained by deriving and assembling the space element equation. Ultimately, the entire rectangular domain’s finite element solution is provided as a polynomial of t and x, which is linear in t and quadratic in x. We theoretically proved that the method is uniformly convergent, independent of perturbation parameters. We also validate numerical solutions to the governing equation by solving two test problems. The maximum element-wise error decreases uniformly independent of perturbation parameters with nearly second-order convergence as the number of meshes doubles, which is consistent with the theoretical analysis. The logarithmic-scaled graphs demonstrate the same convergence rate. When compared to previous research’s numerical approaches, the current FEM provides a higher order of accuracy.

Disclosure statement

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

Additional information

Notes on contributors

Solomon Woldu Worku

Solomon Woldu Worku received his M.Sc. from Bahir Dar University, Ethiopia. Since 2015, he has been a mathematics lecturer at Dire Dawa University, Ethiopia. He is currently a Ph.D. candidate at Arba Mich University, Ethiopia. He has published one article on the topic of singularly perturbed parabolic equations, and his research interests are numerical analysis, singularly perturbed differential equations, and computational mathematics. Department of Mathematics, Arba Minch University, Arba Minch, Ethiopia.

Gemechis File Duressa

Gemechis File Duressa received his M.Sc. from Addis Ababa University, Ethiopia. Ph.D. from the National Institute of Technology in Warangal, India. He has been the dean of the College of Natural Science at Jimma University for six years. He has been a full professor of mathematics and director of the School of Graduate Studies at Jimma University since 2022. He has published over 120 articles in the fields of Education, numerical methods, numerical analysis, and, more specifically, singularly perturbed differential equations. Currently, he is the administration and development vice president of Jimma University. He also advises thirteen Ph.D. scholars towards completion. Department of Mathematics, College of Natural Sciences, Jimma University, Jimma, Ethiopia.

References

  • Ayele, M. A., Tiruneh, A. A., & Derese, G. A. (2023). Fitted cubic spline scheme for two-parameter singularly perturbed time-delay parabolic problems. Results in Applied Mathematics, 18, 100361. https://doi.org/10.1016/j.rinam.2023.100361
  • Bashier, E., & Patidar, K. (2011). A second-order fitted operator finite difference method for a singularly perturbed delay parabolic partial differential equation. Journal of Difference Equations and Applications, 17(5), 779–794. https://doi.org/10.1080/10236190903305450
  • Bhathawala, P., & Verma, A. (1975). A two-parameter singular perturbation solution of one dimension flow through unsaturated porous media. Applications of Mathematics, 43(5), 380–384.
  • Bullo, T., Duressa, G., & Degla, G. (2019). Higher order fitted operator finite difference method for two-parameter parabolic convection-diffusion problems. International Journal of Engineering and Applied Sciences, 11(4), 455–467. https://doi.org/10.24107/ijeas.644160
  • Das, A., & Natesan, S. (2015). Uniformly convergent hybrid numerical scheme for singularly perturbed delay parabolic convection–diffusion problems on Shishkin mesh. Applied Mathematics and Computation, 271, 168–186. https://doi.org/10.1016/j.amc.2015.08.137
  • Das, P., & Mehrmann, V. (2016). Numerical solution of singularly perturbed convection-diffusion-reaction problems with two small parameters. BIT Numerical Mathematics, 56(1), 51–76. https://doi.org/10.1007/s10543-015-0559-8
  • Feng, J. Q. (1990). A method of multiple-parameter perturbations with an application to drop oscillations in an electric field. Quarterly of Applied Mathematics, 48(3), 555–567. https://doi.org/10.1090/qam/1074971
  • Gao, X. W., Zhu, Y. M., & Pan, T. (2023). Finite line method for solving high-order partial differential equations in science and engineering. Partial Differential Equations in Applied Mathematics, 7, 100477. https://doi.org/10.1016/j.padiff.2022.100477
  • Govindarao, L., Sahu, S. R., & Mohapatra, J. (2019). Uniformly convergent numerical method for singularly perturbed time delay parabolic problem with two small parameters. Iranian Journal of Science & Technology, Transactions A: Science, 43(5), 2373–2383. https://doi.org/10.1007/s40995-019-00697-2
  • Grossmann, C., Roos, H. G., & Stynes, M. (2007). Numerical treatment of partial differential equations (Vol. 154). Springer.
  • Heywood, J. G., & Rannacher, R. (1990). Finite-element approximation of the nonstationary navier–Stokes problem. Part IV: Error analysis for second-order time discretization. SIAM Journal on Numerical Analysis, 27(2), 353–384. https://doi.org/10.1137/0727022
  • Jha, A., & Kadalbajoo, M. K. (2015). A robust layer adapted difference method for singularly perturbed two-parameter parabolic problems. International Journal of Computer Mathematics, 92(6), 1204–1221. https://doi.org/10.1080/00207160.2014.928701
  • Kadalbajoo, M., & Yadaw, A. S. (2012). Parameter-uniform finite element method for two-parameter singularly perturbed parabolic reaction-diffusion problems. International Journal of Computational Methods, 9(4), 1250047. https://doi.org/10.1142/S0219876212500478
  • Kadalbajoo, M. K., & Gupta, V. (2010). A brief survey on numerical methods for solving singularly perturbed problems. Applied Mathematics and Computation, 217(8), 3641–3716. https://doi.org/10.1016/j.amc.2010.09.059
  • Kumar, S., Kumar, M., et al. (2020). A robust numerical method for a two-parameter singularly perturbed time delay parabolic problem. Computational and Applied Mathematics, 39(3), 1–25. https://doi.org/10.1007/s40314-020-01236-1
  • Li, Z., Qiao, Z., & Tang, T. (2017). Numerical solution of differential equations: Introduction to finite difference and finite element methods. Cambridge University Press.
  • Mbroh, N. A., Noutchie, S. C. O., & Massoukou, R. Y. M. (2020). A robust method of lines solution for singularly perturbed delay parabolic problem. Alexandria Engineering Journal, 59(4), 2543–2554. https://doi.org/10.1016/j.aej.2020.03.042
  • Miller, J., O’Riordan, E., Shishkin, G., & Shishkina, L. (1998). Fitted mesh methods for problems with parabolic boundary layers. In Mathematical Proceedings of the Royal Irish Academy (pp. 173–190). https://www.jstor.org/stable/20459730
  • Mohye, M. A., Munyakazi, J. B., & Dinka, T. G. (2023). A nonstandard fitted operator finite difference method for two-parameter singularly perturbed time-delay parabolic problems. Frontiers in Applied Mathematics and Statistics, 9, 1222162. https://doi.org/10.3389/fams.2023.1222162
  • Munyakazi, J. B. (2015). A robust finite difference method for two-parameter parabolic convection-diffusion problems. Applied Mathematics and Information Sciences, 9(6), 2877.
  • Negero, N. T., & Duressa, G. F. (2021). A method of line with improved accuracy for singularly perturbed parabolic convection–diffusion problems with large temporal lag. Results in Applied Mathematics, 11, 100174. https://doi.org/10.1016/j.rinam.2021.100174
  • Negero, N. T., Duressa, G. F., Rathour, L., & Mishra, V. N. (2023). A novel fitted numerical scheme for singularly perturbed delay parabolic problems with two small parameters. Partial Differential Equations in Applied Mathematics, 8, 100546. https://doi.org/10.1016/j.padiff.2023.100546
  • O’Malley, R. (1967). Two-parameter singular perturbation problems for second-order equations. Journal of Mathematics and Mechanics, 16(10), 1143–1164. https://www.jstor.org/stable/45277141
  • O’Riordan, E., Pickett, M., & Shishkin, G. (2006). Parameter-uniform finite difference schemes for singularly perturbed parabolic diffusion-convection-reaction problems. Mathematics of Computation, 75(255), 1135–1154. https://doi.org/10.1090/S0025-5718-06-01846-1
  • Rajan, M., & Reddy, G. (2022). A generalized regularization scheme for solving singularly perturbed parabolic PDEs. Partial Differential Equations in Applied Mathematics, 5, 100270. https://doi.org/10.1016/j.padiff.2022.100270
  • Reddy, J. N. (2019). Introduction to the finite element method. McGraw-Hill Education.
  • Salama, A., & Al-Amery, D. (2017). A higher order uniformly convergent method for singularly perturbed delay parabolic partial differential equations. International Journal of Computer Mathematics, 94(12), 2520–2546. https://doi.org/10.1080/00207160.2017.1284317
  • Singh, S., Kumari, P., & Kumar, D. (2022). An effective numerical approach for two parameter time-delayed singularly perturbed problems. Computational and Applied Mathematics, 41(8), 337. https://doi.org/10.1007/s40314-022-02046-3
  • Surana, K. S., & Reddy, J. N. (2016). The finite element method for boundary value problems: Mathematics and computations. CRC press.
  • Woldaregay, M. M., Aniley, W. T., Duressa, G. F., & Macias-Diaz, J. E. (2021). Novel numerical scheme for singularly perturbed time delay convection-diffusion equation. Advances in Mathematical Physics, 2021, 1–13. https://doi.org/10.1155/2021/6641236
  • Worku, S. W., Duressa, G. F., et al. (2023). A numerical approach for diffusion-dominant two-parameter singularly perturbed delay parabolic differential equations. International Journal of Mathematics and Mathematical Sciences, 2023, 1–17. https://doi.org/10.1155/2023/6620669