- Research Note
- Open access
- Published:
A tension spline fitted numerical scheme for singularly perturbed reaction-diffusion problem with negative shift
BMC Research Notes volume 16, Article number: 112 (2023)
Abstract
Objective
The paper is focused on developing and analyzing a uniformly convergent numerical scheme for a singularly perturbed reaction-diffusion problem with a negative shift. The solution of such problem exhibits strong boundary layers at the two ends of the domain due to the influence of the perturbation parameter, and the term with negative shift causes interior layer. The rapidly changing behavior of the solution in the layers brings significant difficulties in solving the problem analytically. We have treated the problem by proposing a numerical scheme using the implicit Euler method in the temporal direction and a fitted tension spline method in the spatial direction with uniform meshes.
Result
Stability and uniform error estimates are investigated for the developed numerical scheme. The theoretical finding is demonstrated by numerical examples. It is obtained that the developed numerical scheme is uniformly convergent of order one in time and order two in space.
Introduction
In various areas of science and engineering, one may assume that a certain system is governed by a principal cause, which means that the current state is not dependent on the previous state and determined solely by the present one. However, under closer observation, a principal cause is usually an approximation to the real situation and more existent models involve some of the past states of the system. Such systems are governed by delay differential equations. Delay differential equations have recently gained popularity in a variety of fields of study, such as biology, engineering, robotics, and others with different goals and expectations [1].
A singularly perturbed delay reaction-diffusion problem is a differential equation in which the diffusive term is dominated by the reaction term due to the small positive parameter \(\varepsilon\) and involves one or more shifting arguments. Such problems arise frequently in the modeling of different physical phenomena. For instance, models in Bio-mathematics [2], problems in optimal control theory [3], neural dynamics and signal transmission [4] and models in the electro-optic bistable devices [5] are some applications modeled using singularly perturbed delay differential equations.
Due to the presence of \(\varepsilon\) as a coefficient of the highest order derivative term, the solution of a singularly perturbed delay differential equation varies abruptly involving two boundary layers. The term with large delay gives rise to interior layer. The abruptly changing behaviors of the solution in the layers make it difficult to solve the problem analytically.
Standard numerical methods are unfit to provide acceptable approximations to the solution of singularly perturbed problems due to the presence of layers. So, there is a need of developing uniformly convergent numerical methods to treat such type of problems.
Various research works are available in the literature to address the aforementioned limitations. For instance, Duressa [6] constructed a numerical method for singularly perturbed differential equation involving small delay by introducing a fitting parameter applying the finite difference approximation. Woldaregay and Duressa [7] developed a hybrid finite difference method on uniform meshes for singularly perturbed problem with delay. Chakravarthy et al. [8] treated a singular perturbation problem with delay by formulating a scheme using cubic spline in compression on a uniform mesh. Daba and Duressa [9] solved singularly perturbed problems by formulating a hybrid numerical scheme on a piece-wise uniform spatial meshes. Bansal and Sharma [10] solved singularly perturbed problems involving large delay by formulating a numerical method applying implicit Euler method in time variable and central difference method in space variable with piece-wise uniform meshes. Kumar and Kumari [11] developed numerical schemes for singularly perturbed parabolic reaction-diffusion problem with delay based on the Crank-Nicolson method for the time variable and the central difference approach for the spatial variable with a non-uniform meshes. Ejere et al. [12] proposed a fitted mesh numerical scheme for a singularly perturbed parabolic reaction-diffusion problem with large delay using the weighted average method in the time variable and central difference method in the spatial variable, and obtained that the method is uniformly convergent.
Motivated by the various papers mentioned above, we treated a time dependent singularly perturbed parabolic differential equation with delay in the spatial variable. We handled the influence of the perturbation parameter and the large negative shift by developing a numerical scheme based on the implicit Euler method in the time direction and a fitted tension spline method in the spatial direction on uniform meshes. The stability estimate and the uniform convergence of the proposed numerical scheme are investigated and proved. The validity of the theoretical findings is demonstrated by carrying out numerical experiments. Based on the theoretical and numerical results, we found that the proposed scheme is uniformly convergent.
The remainder of this paper is organized in the following order: In Sect. "Continuous problem", we present the statement of the problem. Section "Numerical Method" deals with the detail numerical description and methods. We present numerical results and discussions to illustrate the theoretical results in Sect. "Numerical experiments, results and discussions". We give the conclusion of this research work in Sect. "Conclusion".
Notation: Throughout this paper, we denote C as a generic constant independent of the perturbation parameter and the mesh numbers, which may take different values in different inequalities or equations. For a given function \(\upsilon\) on a domain \(\Omega\), the maximum norm is defined as \(\Vert \upsilon \Vert =\max \limits _{{(x,t)}\in {\bar{\Omega }}}|\upsilon (x,t)|\).
Continuous problem
We consider the following singularly perturbed delay differential equation on \(\Omega =\Omega _{x} \times \Omega _{t}=[0,2]\times [0,T]\).
where \(0< \varepsilon \ll 1\), \(\Omega _{L}=\{(x,t):\; x\in [-1,0]; \; t\in [0, T] \}\) and \(\Omega _{R}=\{(2,t): t\in [0, T]\}\) for finite time T. The functions l(x), m(x), g(x, t), \(u_{0}(x)\), \(\alpha (x,t)\) and \(\beta (t)\) are assumed to be sufficiently smooth, bounded and independent of \(\varepsilon\). Moreover, for arbitrary positive constant \(\mu\), we assumed that
Considering the interval boundary conditions, Eq. (1) can be equivalently written as
subject to
If we set \(\varepsilon =0\) in the continuous problem, then the reduced problem is given as
with the conditions
From the reduced form in Eq. (5), we observed that \(u_{0}(x,t)\) needs not necessarily satisfy the conditions
and hence, the solution u(x, t) involves two boundary layers at the ends of [0, 2] and interfacing layers at \(x=1\) [13]. Moreover, the initial and boundary data are assumed to satisfy Holder continuity and we impose the compatibility conditions as
By the above assumptions, it is possible to obtain a unique solution for the considered continuous problem. And by the approaches in [14, 15], we can obtain that
The solution to Eq. (1) approaches to \(u_{0}(x,t)\) for small values of \(\varepsilon\). As it is described in [16], we assumed that all the considered data values in Eq. (1) are identically zero, so that the following properties hold.
Lemma 2.1
The solution u(x, t) of the continuous problem (1) is bounded as \(\left| u(x,t)\right| \le C\), \((x,t)\in {\bar{\Omega }}\).
Proof
From Eq. (9), it follows that \(\left| u(x,t)\right| -\left| u_{0}(x)\right| \le Ct\), which implies that
Since \(u_{0}(x)\) is bounded, fixing t in (0, T], we obtain \(\left| u(x,t)\right| \le C\), \((x,t)\in {\bar{\Omega }}\)\(\square\).
Lemma 2.2
(Maximum principle). Let z(x, t) be a continuous function in \({\bar{\Omega }}\). If \(z(x,t)\ge 0\), \((x,t)\in \partial \Omega\) and \(L_{\varepsilon } z(x,t)\ge 0\), \((x,t) \in \Omega\), then \(z(x,t)\ge 0\), \((x,t) \in {\bar{\Omega }}\).
Proof
Let \(({\hat{x}}, {\hat{t}} )\in {\bar{\Omega }}\) and \(z({\hat{x}},{\hat{t}})=\min _{{\bar{\Omega }}}z(x,t)\). Assume that \(z({\hat{x}},{\hat{t}})< 0\). By the considered hypothesis, \(({\hat{x}},{\hat{t}})\notin \partial \Omega\) and by the extreme value theorem, we have \(z_{x}({\hat{x}},{\hat{t}})=0\), \(z_{xx}({\hat{x}},{\hat{t}})\ge 0\).
Case 1: For \(0<{\hat{x}}\le 1\), we have
Case 2: For \(1<{\hat{x}}\le 2\), we have
The two cases contradict the hypothesis, so that our assumption fails and \(z({\hat{x}},{\hat{t}})\ge 0\), which implies \(z(x,t)\ge 0\), \((x,t)\in {\bar{\Omega }}\)\(\square\).
Lemma 2.3
(Stability estimate). The solution of the continuous problem (1) is estimated as \(|u(x,t)| \le \mu ^{-1}\Vert g\Vert +\max \left\{ |\alpha (x, t)|, |\beta (2,t)| \right\}\).
Proof
Let’s define barrier functions as
Then, we have \(\pi ^{\pm }(0,t)\ge 0\) and \(\pi ^{\pm }(2,t)\ge 0\).
For \(x\in (0,1]\), we get
For \(x\in (1,2)\), we obtain
Therefore, by Lemma 2.2, the stability estimate holds true. \(\square\)
Lemma 2.4
Assuming that Lemmas 2.1 and 2.2 hold true. Then the derivatives of the solution u(x, t) with respect to t can be bounded as
Proof
For \(j=0\), it implies Lemma 2.1. Let \(j=1\). Then on \({\bar{\Omega }}\), we have \(u=0\) along the sides \(x=0\) and \(x=2\), which implies that \(u_{t}=0\). On the side \(t=0\), we have \(u=0\), and hence \(u_{xx}=0\). From Eq. (3), we have
For \(x\in (0, 1]\), \(u(x-1,0)=\alpha (x-1, 0)=0\) and for \(x\in (1, 2)\), we obtain that \(u(x-1,0)=u_0(x-1, 0)=0\). Combining these gives \(u(x-1,0)=0\). Then by Eq. (10), we obtain \(u_{t}(x, 0)= g(x,0)\). Since g is smooth function, it implies that \(|u_{t}|\le C\) for sufficiently large C on \(\partial \Omega\). Applying the differential operator \(L_{\varepsilon }\) on \(u_{t}(x,t)\), we obtain \(L_{\varepsilon }u_{t}(x,t)=g_{t}(x,t)\), which implies that \(|L_{\varepsilon }u_{t}(x,t)|=|g_{t}(x,t)|\le C \; \text {on} \; {\bar{\Omega }}\). Thus, application of Lemma 2.2 gives
By a similar procedure, for \(j=2\) we have \(u_{tt}=0\) on the sides \(x=0\) and \(x=2\), and \(u_{xx}=0\) on the side \(t=0\). Differentiating Eq. (3) with respect to t, we get
Since \(u_{t}(x, 0)= g(x,0)\), we have \(u_{xxt}(x, 0)= g_{xx}(x,0)\). And \(u(x-1, 0)=0\), implies \(u_{t}(x, 0)=0\). Using these results in Eq. (11) yields
Since g is smooth function, we have \(|u_{tt}| \le C\) along the x-axis, which implies that \(|u_{tt}| \le C\) on \(\partial \Omega\). Applying the differential operator on \(u_{tt}\), we get \(|L_{\varepsilon }u_{tt}(x, t)|\le C\) on \(\partial \Omega\). Thus, applying Lemma 2.2 gives
which completes the required proof. \(\square\)
Lemma 2.5
The derivatives of the solution u(x, t) with respect to x can be bounded as
where \(\delta _{1}(x)=\exp (-\sqrt{\frac{\mu }{\varepsilon }}x)+\exp (-\sqrt{\frac{\mu }{\varepsilon }}(1-x))\) and \(\delta _{2}(x)=\exp (-\sqrt{\frac{\mu }{\varepsilon }}(x-1))+\exp (-\sqrt{\frac{\mu }{\varepsilon }}(2-x))\) for \(k=0, 1, 2, 3.\)
Proof
Consider for \(x\in [0, 1].\) For \(k=0\), we obtain Lemma 2.1. For \(k=1\), fix \(t\in [0, T]\) and consider a neighborhood of the form \(I=(a, a+\sqrt{\varepsilon })\), \(\forall x \in I\). Then, applying the Mean Value Theorem for some \(y\in {\bar{I}}\), we get
Now, for any x in \({\bar{I}}\), we have
Using Eq. (1) into Eq. (14) yields
Using Eq. (13) into Eq. (15) gives \(|u_{x}(x,t)|\le C\varepsilon ^{\frac{-1}{2}}\). Since \(\delta _{1}(x)\) is bounded, we have
Similar procedure holds for \(x\in [1, 2]\). Using Eq. (1) and the bounds on u(x, t) and \(u_{x}(x,t)\), the bounds for \(k=2\) and \(k=3\) can be easily obtained. \(\square\)
Lemma 2.6
where \(\delta _{1}(x)=\exp (-\sqrt{\frac{\mu }{\varepsilon }}x)+\exp (-\sqrt{\frac{\mu }{\varepsilon }}(1-x))\) and \(\delta _{2}(x)=\exp (-\sqrt{\frac{\mu }{\varepsilon }}(x-1))+\exp (-\sqrt{\frac{\mu }{\varepsilon }}(2-x))\).
Proof
We use the approaches in [17, 18]. \(\square\)
Lemma 2.7
where \(\delta _{1}(x)=\exp (-\sqrt{\frac{\mu }{\varepsilon }}x)+\exp (-\sqrt{\frac{\mu }{\varepsilon }}(1-x))\) and \(\delta _{2}(x)=\exp (-\sqrt{\frac{\mu }{\varepsilon }}(x-1))+\exp (-\sqrt{\frac{\mu }{\varepsilon }}(2-x))\).
Proof
We refer the procedures in the proof of Lemma 10 of [19]. \(\square\)
Numerical method
Semi-discretization in the temporal direction
Let’s divide (0, T] into equally spaced intervals and form a uniform temporal mesh as \(\Omega _{t}^{M}=\{t_{j}=j\Delta t, \ j=0, 1,\ldots , M, \ T=M\Delta t\}\). Then, using implicit Euler method on time derivative, we obtain the semi-discrete scheme as
where
and
subject to \(u^{j+1}(x)=u_{0}(x),\; x \in {\bar{\Omega }}_{x}\), \(u^{j+1}(x)=\alpha (x,t_{j+1}), \; (x,t_{j+1}) \in \Omega _{L}\), \(u^{j+1}(2)=\beta (2, t_{j+1}), \; (2,t_{j+1})\in \Omega _{R}\), and for \(p(x)=1+\Delta t l(x)\) and \(q(x)=\Delta t m(x)\).
Lemma 3.1
Let \(\psi ^{j+1}(x)\) be a continuous function on \({\bar{\Omega }}_{x}\). If \(\psi ^{j+1}(0)\ge 0\), \(\psi ^{j+1}(2)\ge 0\) and \(L_{\varepsilon } \psi ^{j+1}(x)\ge 0\), \(x\in \Omega _{x}\), then \(\psi ^{j+1}(x)\ge 0\), \(x\in {\bar{\Omega }}_{x}\).
Proof
Let \(\nu \in [0,2]\) and \(\psi ^{j+1}(\nu )=\min _{{\bar{\Omega }}_{x}}\psi ^{j+1}(x)\) and assume that \(\psi ^{j+1}(\nu )< 0\). From the given conditions, we have \(\nu \notin \partial \Omega _{x}\) and \(\psi ^{j+1}_{x}(\nu )=0\), \(\psi ^{j+1}_{xx}(\nu )\ge 0\).
Case 1: For \(\nu \in (0,1]\), we have
Case 2: For \(\nu \in (1, 2)\), we have
By the two cases, the given condition is contradicted, which implies that our assumption is not holds and hence \(\psi ^{j+1}(x)\ge 0\), \(x\in {\bar{\Omega }}_{x}\). Thus, the maximum principle is satisfied by \(L_{\varepsilon , x}^{M}\), and we have
which is used in estimating the truncation error of the semi-discrete scheme. \(\square\)
Lemma 3.2
The solution \(u^{j+1}(x)\) of the semi-discrete problem (16) can be estimated as
Proof
Let us define barrier functions as
Then, we have \(\pi _{\pm }^{j+1}(0)\ge 0\) and \(\pi _{\pm }^{j+1}(2)\ge 0\).
For \(x\in (0,1]\), we have
For \(x\in (1,2)\), we have
Thus, we obtained that \(L_{\varepsilon }^{M}\pi _{\pm }^{j+1}(x)\ge 0\) for all \(x\in [0,2]\). Hence, by the semi-discrete maximum principle, the required estimation of \(u^{j+1}(x)\) is attained. \(\square\)
At the \((j+1){th}\) level, we can define the local truncation error \(e^{j+1}\) as the difference between the exact solution \(u(x,t_{j+1})\) and the approximate solution \(u^{j+1}(x)\) of Eq. (16) and the global error estimate \(E^{j+1}\) as the contribution of local truncation error up to the \((j+1){th}\) time level.
Lemma 3.3
(Local truncation error estimate). Suppose that \(\left| u^{(k)}(x,t)\right| \le C\), \((x,t)\in {\bar{\Omega }}\), \(k=0, 1, 2\). Then at the \((j+1){th}\) time level, local truncation error is given as \(\Vert e^{j+1}\Vert \le C(\Delta t)^{2}\).
Proof
We refer Lemma 6 of [20]. \(\square\)
Lemma 3.4
(Estimation of the global error). Suppose that Lemma 3.3 holds. Then the global truncation error is estimated as \(\Vert E^{j+1}\Vert \le C(\Delta t)\), j=0(1)M.
Proof
Considering the local truncation error in Lemma 3.3 up to the \((j+1){th}\) time level, we have
Thus, the semi-discrete scheme is convergent of order one in time. \(\square\)
Lemma 3.5
The derivatives of the solution \(u^{j+1}(x), \; j+1=1(1)M\) of (16) can be bounded as
Proof
See [21]. \(\square\)
Spatial discretization
Suppose the domain [0, 2] be subdivided into N equal intervals of step size h and form a uniform mesh as \(\Omega ^{N}_{x}=\{0=x_{0},x_{1},\ldots , x_{N/2}=1, x_{N/2+1},\ldots , x_{N}=2, \; x_{i}=ih, i=0(1)N,\; h=2/N\}\).
Description and derivation of the tension spline method
On a uniform mesh \(\Omega ^{N}_{x}\), a function \(S(x,\tau )\) of class \(C^{2}[0,2]\) that interpolates u(x) at \(x_{i}\) depends on the compression parameter \(\tau\) and reduced to a cubic spline on the interval [0, 2] for \(\tau\) approaching to zero is known as parametric cubic spline function [22]. In any interval \([x_{i},x_{i+1}]\subset [0,2]\), the spline function \(S(x,\tau )=S(x)\), which satisfies the linear second order differential equation
where \(S(x_{i}, t_{j+1})=u^{j+1}_{i}\) for \(\tau > 0\) is called cubic spline in compression. Solving the homogeneous part of Eq. (18) and setting \(\sqrt{\tau }=\frac{\lambda }{h}\) gives
where A and B are arbitrary constants. For the non-homogeneous part, let
Substituting in Eq. (18) and simplifying gives \(k=-1/\tau\), so that
where \(M_{i}=S_{xx}(x_{i}, t_{j+1})\) and \(M_{i+1}=S_{xx}(x_{i+1}, t_{j+1})\). From (19) and (20) we get
The values of the constants A and B can be determined by the interpolation conditions. That is, in \([x_{i},x_{i+1}]\) from Eq. (21), we obtain
and
From Eqs. (22) and (23), we can obtain that \(A=\frac{h^{2}}{2\lambda ^{2}\sinh (\lambda )}[M_{i+1}-e^{\lambda }M_{i}]\) and \(B=\frac{h^{2}}{2\lambda ^{2}\sinh (\lambda )}[M_{i}-e^{\lambda }M_{i+1}]\). Thus, Eq. (21) becomes
which is the cubic spline in compression on \([x_{i}, x_{i+1}]\), where \(M_{i}=S_{xx}(x_{i},t_{j+1})\). The derivative of Eq. (24) at \((x^{+}_{i},t_{j+1})\) is
Similarly for \(x\in [x_{i-1}, x_{i}]\), we obtain
From Eqs. (25) and (26) at the mesh point \(x_{i}\), we obtain
where \(\lambda _{1}=\frac{1}{\lambda ^{2}}\left( 1-\frac{\lambda }{\sinh (\lambda )}\right)\) and \(\lambda _{2}=\frac{1}{\lambda ^{2}}(\lambda \coth (\lambda )-1)\). The consistency condition in Eq. (27) is a guarantee for the continuity of the first derivative of the spline function at the interior points. From the time semi-discrete problem (16), we have
where \(p_{i}=1+\Delta tl_{i}\) and \(q_{i}=\Delta tm_{i}\). Inserting Eq. (28) into Eq. (27) and rearranging yields
Exponential fitting factor
To control the influence of \(\varepsilon\) in the region of the layers, we introduce an exponential fitting factor. By analogous procedures in [23], the analytical solution of Eq. (16) is written as
where the arbitrary constants \(\eta _{1}\) and \(\eta _{2}\) are determined using the conditions \(u^{j+1}(x_{i\pm 1})=u^{j+1}_{i\pm 1}\) and \(u^{j+1}(x_{i})=u^{j+1}_{i}\) as
Then, introducing a fitting factor \(\sigma\) on (0, 1], we obtain
On simplification of Eq. (33) for \(i=1, 2,\ldots , N/2\), we obtain the fitting factor
where \(p(0)=1+\Delta tl(0)\) and \(\rho =h/\sqrt{\varepsilon }\). Similarly for \(i=N/2+1, N/2+2,\ldots , N\), we obtain the fitting factor as
Thus, with the fitting factor \(\sigma _{1}\) and \(\sigma _{2}\) in Eq. (29), we obtain a fully-discrete numerical scheme as
where
From Eq. (36), we obtain a system of equation as
with \(u^{j+1}_{0}=u^{j+1}(0)\) and \(u^{j+1}_{N}=u^{j+1}(x_{N})\), where
The systems in Eq. (37) is solved easily using a suitable solver of system of equations.
Discrete stability and uniform convergence
Lemma 3.6
Let \(\varsigma \in \{0, 1, 2,\ldots , N\}\) and \(\psi ^{j+1}_{\varsigma }=\min _{{\bar{\Omega }}^{N, M}}\psi ^{j+1}_{i}\) and assume that \(\psi ^{j+1}_{\varsigma }< 0\). For a mesh function \(\psi ^{j+1}_{i}\) if \(\psi ^{j+1}_{0}\ge 0\), \(\psi ^{j+1}_{N}\ge 0\) and \(L^{N, M}_{\varepsilon } \psi ^{j+1}_{\varsigma }\ge 0\), \(\varsigma =1, 2,\ldots , N-1\), then \(\psi ^{j+1}_{i}\ge 0\), \(i=0, 1,\ldots , N\).
Proof
For \(\varsigma =0(1)N\) and \(\psi ^{j+1}_{\varsigma }=\min _{{\bar{\Omega }}^{N,M}}\psi ^{j+1}_{i}\), suppose that \(\psi ^{j+1}_{\varsigma }< 0\). From the given condition, it is clear that \(\varsigma \notin \{0, N\}\). So, we consider the following two cases.
Case 1: When \(\varsigma =1(1)N/2\), we have
Case 2: When \(\varsigma =N/2+1(1)N-1\), we have
From the two cases, we see that \(L^{N, M}_{\varepsilon }\psi ^{j+1}_{\varsigma } < 0\), which contradicts the given hypothesis. Thus, our assumption fails, and hence \(\psi ^{j+1}_{i}\ge 0\), \(i=0(1)N\). \(\square\)
Lemma 3.7
The solution \(u^{j+1}_{i}\) of the difference scheme in Eq. (36) is estimated as \(|u^{j+1}_{i}|\le (1+\mu \Delta t)^{-1}\Vert \vartheta \Vert + \max \left\{ |u^{j+1}_{0}|, |u^{j+1}_{N}| \right\} , \; \forall i=0, 1,\ldots , N\).
Proof
Let \(\pi _{i, \pm }^{j+1}\) be barrier functions defined by
Then, we have \(\pi _{0,\pm }^{j+1}\ge 0\) and \(\pi _{N, \pm }^{j+1}\ge 0\). Now, let \(\omega = (1+\mu \Delta t)^{-1}\Vert \vartheta \Vert + \max \left\{ |u^{j+1}_{0}|, |u^{j+1}_{N}| \right\}\). Then, when \(i=1,2,\ldots , N/2\), we have
And for \(i=N/2+1, N/2+2,\ldots , N-1\), we have
Therefore, we have \(L_{\varepsilon }^{M}\pi _{i, \pm }^{j+1}\ge 0\), \(i=0, 1, 2,\ldots , N\), and applying Lemma 3.6, the required stability estimate of \(u^{j+1}_{i}\) is implied. \(\square\)
Theorem 3.1
Let \(u^{j+1}(x_{i})\) and \(u^{j+1}_{i}\) be the solutions of the schemes (16) and (36), respectively. Then, the error estimate in the spatial discretization is given by
Proof
For \(i=0, 1,\ldots , N/2\), the truncation error is
Using Taylor’s series expansion for \(u^{j+1}_{i\pm 1}\), we obtain
For \(\lambda _{1}\) and \(\lambda _{2}\) satisfying \(2\lambda _{2}=1-2\lambda _{1}\), and using Taylor’s series expansion on \(p_{i\pm 1}\) and \(\sigma _{1}\), after certain manipulation Eq. (38) becomes
Now, invoking Lemma 3.6 yields
For \(i=\frac{N}{2}+1, \frac{N}{2}+2,\ldots , N\), we have
Using Taylor’s series expansion on \(u^{j+1}_{i\pm 1}\), \(p_{i\pm 1}\), \(q_{i\pm 1-\frac{N}{2}}\) and \(\sigma _{2}\) in Eq. (40) gives
Invoking Lemma 3.6 gives
Since \(h= \frac{2}{N}\), combining the inequalities (39) and (41) gives the required error estimate. Hence, the proposed scheme is uniformly convergent of order two in space. \(\square\)
Theorem 3.2
Let u(x) be the solution of Eq.(1) and \(u^{j+1}_{i}\) be the solution of Eq. (36). Then, the uniform error is estimated as
Proof
Combining the proofs of Lemma 3.4 and Theorem 3.1, we can obtain the required uniform error estimate. \(\square\)
Numerical experiments, results and discussions
To illustrate the implementation of the present numerical scheme, we solved model problems. Since the exact solutions of both problems are not known, we apply the double mesh principle [24] to determine the maximum nodal error as \(E^{N,M}_{\varepsilon }=\max \limits _{1\le i\le N}(u^{N,M}_{i}-u^{2N,2\,M}_{i})\), where \(u^{2N,2\,M}(x_{i},t_{j})\) is obtained by doubling the mesh numbers for a fixed transition parameter. The parameter-uniform maximum error is determined as \(E^{N,M}=\max \limits _{\varepsilon } E^{N,M}_{\varepsilon }\). The maximum convergence rate of the method is computed as \(R_{\varepsilon }^{N,M}=\frac{\log (E_{\varepsilon }^{N,M}/E_{\varepsilon }^{2N,2\,M})}{\log (2)}\) and its uniform convergence rate is determined by \(R^{N,M}=\max \limits _{\varepsilon }R_{\varepsilon }^{N,M}\).
Example 4.1
[10]. Consider \(-\frac{\partial u}{dt}+\varepsilon \frac{\partial ^{2}u}{\partial x^{2}}-5u(x,t)+2u(x-1,t)=-2\), subject to \(u(x,0)=\sin (\pi x)\), \(x\in [0,2]\), \(u(x,t)=0\), \((x,t)\in \{(x,t): x\in [-1, 0] \; \text {and}\; t\in [0,2]\}\) and \(u(2,t)=0\), \((2,t)\in \{(2,t): 0\le t\le 2\}\).
Example 4.2
[11]. Consider \(-\frac{\partial u}{dt}+\varepsilon \frac{\partial ^{2}u}{\partial x^{2}}-(x+6)u(x,t)+(x^{2}+1)u(x-1,t)=-3\), subject to \(u(x,0)=0\), \(x\in [0,2]\), \(u(x,t)=0\), \((x,t)\in \{(x,t): x\in [-1,0];\; \; t\in [0,2] \}\) and \(u(2,t)=0\), \((2,t)\in \{(2,t): t\in [0,2] \}\).
The numerical solutions and error analysis of both examples are computed applying the proposed numerical scheme by using the MATLAB R2019a packages. We computed the examples for \(\lambda _{1}=1/24\) and \(\lambda _{1}=11/24\). The maximum nodal error and convergence rate of both examples are computed and the results are as given in Tables 1 and 2, respectively. From these tables, we observe that by increasing the number of meshes, the maximum error decreases, while decreasing the value of \(\varepsilon\) yields an stabled maximum error. This confirms the uniform convergence of the proposed numerical scheme. Table 3 shows the accuracy of our scheme as compared to other works in the literature.
Graphical simulations of the solutions of the two examples are shown in Figs. 1, 2, 3, 4. From the line plots in Figs. 1 and 3, we observe the solution behaviors at different time levels and \(\varepsilon\). Also, to depict the physical behavior of the solutions surface plots are shown in Figs. 2 and 4 for the two examples, respectively. From these figures, we see that as the value of \(\varepsilon\) decreases, the width of the layers decreases. Figure 5 shows the log-log plots of the maximum error versus the number of meshes for both examples, which indicates that the developed numerical method is convergent independent of the perturbation parameter.
Conclusion
In this paper, we considered a time dependent singularly perturbed parabolic reaction-diffusion problem involving spatial delay. The influence of the perturbation parameter forms strong boundary layers in the solution and the large delay term gives rise to strong layer at \(x=1\). We treated such problem by developing a numerical scheme applying the implicit Euler method in the temporal variable and fitted spline tension method in the spatial variable. The stability estimate and the uniform error bound are investigated and proved. To validate the theoretical findings, we solved two numerical examples. Based on the theoretical and experimental results, we concluded that the proposed numerical scheme is uniformly convergent.
Availability of data and materials
There is no additional data used for this study.
References
Barbu L, Morosanu G. Singularly perturbed boundary-value problems, vol. 156. Berlin: Springer; 2007.
Bellen A, Guglielmi N, Maset S. Numerical methods for delay models in biomathematics. In: Complex systems in biomedicine. Milano: Springer; 2006. p. 147–85.
Naidu D. Singular perturbations and time scales in control theory and applications: an overview. Dyn Contin Discret Impuls Syst Ser B. 2002;9:233–78.
Patsatzis DG, Tingas EA, Goussis DA, Sarathy SM. Computational singular perturbation analysis of brain lactate metabolism. PLoS ONE. 2019;14(12): e0226094.
Neyer A, Voges E. Dynamics of electrooptic bistable devices with delayed feedback. IEEE J Quantum Electron. 1982;18(12):2009–15.
Duressa GF. Novel approach to solve singularly perturbed boundary value problems with negative shift parameter. Heliyon. 2021;7(7): e07497.
Woldaregay MM, Duressa GF. Uniformly convergent hybrid numerical method for singularly perturbed delay convection-diffusion problems. Int J Differ Equ. 2021. https://doi.org/10.1155/2021/6654495.
Pramod Chakravarthy P, Dinesh Kumar S, Nageshwar Rao R, Ghate DP. A fitted numerical scheme for second order singularly perturbed delay differential equations via cubic spline in compression. Adv Differ Equ. 2015;2015(1):1–14.
Takele Daba I, File Duressa G. A hybrid numerical scheme for singularly perturbed parabolic differential-difference equations arising in the modeling of neuronal variability. Comput Math Methods. 2021;3(5): e1178.
Bansal K, Sharma KK. Parameter-robust numerical scheme for time-dependent singularly perturbed reaction-diffusion problem with large delay. Numer Funct Anal Optim. 2018;39(2):127–54.
Kumar D, Kumari P. Parameter-uniform numerical treatment of singularly perturbed initial-boundary value problems with large delay. Appl Numer Math. 2020;153:412–29.
Ejere AH, Duressa GF, Woldaregay MM, Dinka TG. A uniformly convergent numerical scheme for solving singularly perturbed differential equations with large spatial delay. SN Appl Sci. 2022;4(12):324.
Roos HG, Stynes M, Tobiska L. Robust numerical methods for singularly perturbed differential equations: convection-diffusion-reaction and flow problems, vol. 24. Berlin: Springer; 2008.
Mbayi CK, Munyakazi JB, Patidar KC. A fitted numerical method for interior-layer parabolic convection-diffusion problems. Int J Comput Methods. 2022. https://doi.org/10.1142/S0219876222500281.
Kadalbajoo MK, Awasthi A. The midpoint upwind finite difference scheme for time-dependent singularly perturbed convection-diffusion equations on non-uniform mesh. Int J Comput Methods Eng Sci Mech. 2011;12(3):150–9.
Clavero C, Gracia JL. On the uniform convergence of a finite difference scheme for time dependent singularly perturbed reaction-diffusion problems. Appl Math Comput. 2010;216(5):1478–88.
Mbayi CK, Munyakazi JB, Patidar KC. Layer resolving fitted mesh method for parabolic convection-diffusion problems with a variable diffusion. J Appl Math Comput. 2022;68(2):1245–70.
Ng-Stynes MJ, O’Riordan E, Stynes M. Numerical methods for time-dependent convection-diffusion equations. J Comput Appl Math. 1988;21(3):289–310.
Kadalbajoo MK, Awasthi A. A parameter uniform difference scheme for singularly perturbed parabolic problem in one space dimension. Appl Math Comput. 2006;183(1):42–60.
Adivi Sri Venkata RK, Palli MMK. A numerical approach for solving singularly perturbed convection delay problems via exponentially fitted spline method. Calcolo. 2017;54(3):943–61.
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.
Pramod Chakravarthy P, Dinesh Kumar S, Nageshwar Rao R. Numerical solution of second order singularly perturbed delay differential equations via cubic spline in tension. Int J Appl Comput Math. 2017;3(3):1703–17.
Chakravarthy PP, Kumar SD, Rao RN. An exponentially fitted finite difference scheme for a class of singularly perturbed delay differential equations with large delays. Ain Shams Eng J. 2017;8(4):663–71.
Doolan EP, Miller JJ, Schilders WH. Uniform numerical methods for problems with initial and boundary layers. Dublin: Boole Press; 1980.
Acknowledgements
The authors thank the Editor for handling the submitted manuscript carefully, and the anonymous referees for their valuable comments and suggestions in modifying the original version of the manuscript.
Funding
There is no any fund support in this research work.
Author information
Authors and Affiliations
Contributions
GFD started and prepared the plan for this research work. AHE formulated the numerical scheme and investigated the numerical analysis of the study. MMW and TGD revised the procedures, analysis, and results of the study. All authors have equal contributions to the paper and agreed on the submitted version. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Ethics approval and consent to participate
Not applicable.
Consent for publication
Not Applicable.
Competing interests
There is no competing interest in this research work.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated in a credit line to the data.
About this article
Cite this article
Ejere, A.H., Dinka, T.G., Woldaregay, M.M. et al. A tension spline fitted numerical scheme for singularly perturbed reaction-diffusion problem with negative shift. BMC Res Notes 16, 112 (2023). https://doi.org/10.1186/s13104-023-06361-8
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13104-023-06361-8