ORIGINAL RESEARCH article

Front. Appl. Math. Stat., 31 August 2023

Sec. Numerical Analysis and Scientific Computation

Volume 9 - 2023 | https://doi.org/10.3389/fams.2023.1244490

Fitted computational method for singularly perturbed convection-diffusion equation with time delay

  • 1. Department of Applied Mathematics, Adama Science and Technology University, Adama, Ethiopia

  • 2. Department of Mathematics, Jimma University, Jimma, Ethiopia

Abstract

A uniformly convergent numerical scheme is proposed to solve a singularly perturbed convection-diffusion problem with a large time delay. The diffusion term of the problem is multiplied by a perturbation parameter, ε. For a small ε, the problem exhibits a boundary layer, which makes it challenging to solve it analytically or using standard numerical methods. As a result, the backward Euler scheme is applied in the temporal direction. Non-symmetric finite difference schemes are applied for approximating the first-order derivative terms, and a higher-order finite difference method is applied for approximating the second-order derivative term. Furthermore, an exponential fitting factor is computed and induced in the difference scheme to handle the effect of the small parameter. Using the discrete maximum principle, the stability of the scheme is examined and analyzed. The developed scheme is parameter-uniform with a linear order of convergence in both space and time. To examine the accuracy of the method, two model examples are considered. Further, the boundary layer behavior of the solutions is given graphically.

1. Introduction

Delay differential equations (DDEs) are differential equations in which the evolution of the system is influenced by its past history. DDEs are called retarded types if the delay argument does not appear in the highest-order derivative term; otherwise, they are neutral types. DDEs play an important role in a variety of fields, including robotics, biosciences [1], economics, epidemiology and mechanics [2], fluid dynamics, reaction-diffusion equations [3], and population dynamics [4].

A singularly perturbed delay differential equation (SPDDE) is a delay differential equation in which its higher-order derivative term is multiplied by a small perturbation parameter (0 < ε ≪ 1) and contains at least one delay parameter on the term different from the highest derivative. In contrast to the magnitude of the delay parameter with the perturbation parameter, the delay is classified as a large delay or a small delay. If the magnitude of the delay parameter of the SPDDE is smaller than the perturbation parameter, then the equation is said to be a singularly perturbed delay differential equation with a small delay, whereas when the magnitude of the delay parameter is higher than the perturbation parameter, it is said to be a singularly perturbed delay differential equation with a large delay [5]. A singularly perturbed problem, which arises as a time delay, occurs in many application areas of science and engineering, for instance, in the simulation of oil extraction from underground reservoirs, chemical processes, fluid flows, water quality problems in river networks, and mechanical systems [6].

The presence of ε as a multiple of the higher-order derivative term causes a boundary layer. The boundary layer is an asymptotically narrow region located in the neighborhood of the endpoints of the domain, where the solution has a steep gradient as ε tends to zero [6]. With the rapidly changing behavior of the solution in the boundary layer, one encounters computational difficulties in treating a singularly perturbed problem using analytically or classical numerical schemes. On the contrary, classical numerical schemes lead to spurious non-physical oscillations in the numerical solution, unless an unacceptably large number of mesh points are considered, which leads to a massive computational cost [7]. In response to this, different authors have to look for sounding numerical schemes which converge uniformly regardless of ε.

Recently, the authors in [8], proposed the implicit-Euler scheme in the time direction and the central difference scheme in the space direction. The authors in [7, 9], proposed the implicit-Euler scheme in the time direction and the hybrid scheme by a proper combination of the midpoint upwind in the outer region and the central difference scheme in the inner region in the spatial direction on the Shishkin mesh. Moreover, this method is addressed in [10], for the two-parameter problem. In [11], the authors proposed the implicit-Euler scheme in the time direction and the hybrid scheme on a generalized Shishkin mesh in the spatial direction. Gowrisankar and Natisan in [12] developed the backward Euler scheme in time direction and the upwind finite difference scheme in the spatial direction using a piecewise uniform mesh. The implicit Euler scheme in the time direction and the upwind scheme in the spatial direction are considered in [13]. In [14], the implicit trapezoidal scheme in the time direction and the hybrid scheme by proper combination of the midpoint upwind in the outer region and the central difference in the inner region in the spatial direction are used.

The implicit Euler scheme in the time direction and the central difference scheme in the space direction are used in [4]. The extended cubic B-spline is considered in [15]. A domain decomposition method is considered in [16, 17]. The authors in [18, 19] proposed hybrid scheme on both Shishkin and Bakhvalov meshes. Podila and Kumar [20] proposed a new stable finite difference scheme on a uniform mesh and also on an adaptive mesh. The backward Euler scheme in the time direction and exponentially fitted difference method is considered in [21]. The Crank-Nicolson method in the time direction and a novel fitted finite difference scheme in spatial direction are proposed in [22]. The Crank-Nicolson method in the time direction and an exponentially fitted spline in the spatial direction are discussed in [23]. The implicit Euler scheme in the time direction and the non-standard finite difference method in the space direction are considered in [24]. In [25], the authors proposed Crank-Nicolson method in the time direction and the operator compact implicit (OCI) method on the Shishkin mesh in the space direction. The backward Euler in the time direction and method of line following Micken's type discretization for the space derivatives are used in [26]. Sahoo and Gupta [27] used higher-order difference with an identity expansion (HODIE) on a piecewise uniform mesh. A similar technique was also used in [28] for a coupled system of singularly perturbed problems. The authors [29, 30] proposed the numerical schemes that work for both cases when the delay term is large or small.

The main aim of this work was to develop a ε-uniform numerical scheme for the class of singularly perturbed convection-diffusion problem with a large time delay. The method comprises the backward Euler scheme in the time direction and an exponentially fitted higher-order finite difference scheme in the spatial direction. Error bound and uniform convergence of the developed scheme is investigated and proved. The proposed scheme gives more accurate, stable, and uniformly convergent results.

In this study, C has been considered as a generic positive constant, which does not depend on Δs, Δt, and ε. The maximum norm is denoted by ‖.‖, which is defined by ‖γ‖ = maxs,t∈Ω|γ(s, t)|.

2. Continuous problem

Let Ω = Ωs × Ωt = (0, 1) × (0, 𝕋] for 𝕋 > 0, we consider SPDDE of the form where 𝔏εz(s, t) = −εzss(s, t) + β(s, t)zs(s, t) + α(s, t)z(s, t).

Here, ε ∈ (0, 1] and δ > 0 are the perturbation parameter and the delay parameter, respectively. We pretended that the functions β(s, t), α(s, t), κ(s, t), γ(s, t) on and ψb(s, t), ψl(t), ψr(t) on η = ηl ∪ ηr ∪ ηb are smooth enough and bounded which meet α(s, t) ≥ ϖ > 0, κ(s, t) ≥ φ > 0, β(s, t) ≥ μ > 0 on . These conditions assure that problem (1) has a boundary layer near s = 1 [7].

2.1. A priori bounds

Under the premises that the data are Hölder continuous and satisfy the following compatibility conditions at the corner points and the delay terms [31], we confirm the existence and uniqueness of the solution of (1) These assumptions and conditions are fulfilled. Then, the problem (1) admits a unique solution [31].

Setting ε = 0, the reduced problem of (1) is given as where z0(s, t) is the solution of the reduced problem.

Lemma 2.1. Let z(s, t) be the solution of (1). Then, we have where C does not depends on ε.

Proof: The proof is considered in [7].

The operator in (1) satisfies the next lemma.

Lemma 2.2. (Maximum principle). Let ν(s, t) ∈ C2(Ω) ∪ C0(η) satisfies ν(s, t) ≥ 0 (s, t) ∈ η. If 𝔏ν(s, t) ≥ 0, (s, t) ∈ Ω, then.

Proof: The proof is considered in [14].

Lemma 2.3. (Stability result). Let z(s, t) be the solution of (1). Then, we have where ϖ ≤ α(s, t).

Proof: The proof is considered in [22].

Lemma 2.4. The derivative of the solution z(s, t) of (1) with respect to s and t satisfywhere μ ≤ β(s, t).

Proof: The proof is considered in [7].

3. Numerical scheme

3.1. Temporal semi-discretization

The time domain [0, 𝕋] is discretized uniformly with step size Δt as and with M + 1 mesh points in [0, 𝕋] and j + 1 mesh points in [−δ, 0]. We have 𝕋 = for some positive integer r.

Applying the backward Euler scheme for time derivative, we get Simplifying (8), we have where and with the boundaries Now, (9) rewrite as where and and .

The local truncation error in the time direction is given as

Lemma 3.1. The local error emat tmsatisfies the bound

Lemma 3.2. The global error Emat tmsatisfies the boundProof: Using Lemma 3.1, the global error Em bound at mth time step is given as

Lemma 3.3. For every m = 0(1)M − 1, the solution Zm(s) of (9)-(10) satisfies the estimateProof: From (11), , where g = Q(s) − P(s, tm)Z(s).

Now, we integrate twice and we obtain where

Using inequality and the bound Hence, |Zp(s)| ≤ C. Here, . The boundary condition Z(1) = 0 yields C1 = 0. Now, the constants C1 and C2 must satisfy Since B(s) is bounded on (0, 1), B(1) − B(y) ≤ C(1 − y). Then, It follows that . Hence, . Finally, implies that The proof is done for i = 1. For i > 1 follows by induction and repeated differentiation. For the details, refer [32].

3.2. Spatial discretization

We discretize the spatial domain [0, 1] into N equal number of sub-intervals with the length of h as 0 = s0, s1, ..., sN = 1, and sn = nh, n = 0(1)N. Consider a smooth function Z(s) in the interval [0, 1]. From Taylor's series approximation, we get Following a similar relation of (15), it holds From (16), we have Substituting (17) into (16) and simplifying, we obtain where

From (11), we draw where Using (19), we have From the Taylor series approximations of and , we get Substituting (21) into (20), we have From (18), we draw Substituting (22) into (23) and rearranging, we obtain where

3.2.1. Computing the exponential fitting factor

We introduce the exponential fitting factor σ to handle the effect of ε in the layer. From the singular perturbation theory stated in [33], the zero order asymptotic solution of the problem of the form is given as From Taylor's series, approximation for β(s) and α(s) restricting to their first terms about s = 1 is given as where Z0(s) is the solution of reduced problem. Taking h → 0 and solving (28) at sn−1, sn, and sn+1, we get where . Multiplying (24) by h and the term containing ε by σ and evaluating the limit of the resulting equation as h → 0, we get From (29), we have Substituting (31) into (30) and simplifying yields Then, we get the fitting factor σ Therefore, the required scheme is taken as where In the explicit form, it becomes where

3.3. Stability and uniform convergence analysis

Lemma 3.4. (Discrete maximum principle). Assume thatand, then.

Proof: Assume that there is k ∈ {0, 1, 2, …, N}, such that . Assume that and from the assumption, it is shown that k ∉ {0, 1}. So, we have and . Then, we get for k = 1(1)N − 1. So, the assumption is wrong. Therefore, and ∀n = 0(1)N.

Lemma 3.5. (Uniform stability result). Letbe the solution of (33), then we havewhere P(sn, tm) ≥ ζ > 0.

Proof: Let and define the barrier functions by . On the boundaries, we get ψl(tm) ≥ 0 and . For sn, n = 1(1)N − 1, we obtain By Lemma 3.4, we get . Therefore, the needed bound is obtained.

From Taylor's series expansion, we get where

The next theorem provides the truncation error estimate for the developed scheme.

Theorem 3.6. Let the coefficients α(s, tm), β(s, tm), and κ(s, tm) of (9)-(10) be sufficiently smooth such that Zm(s) ∈ C4[0, 1]. Then, the solutionof (33) satisfies the next boundProof: The error estimate in the spatial direction is given as where and .

For the constants C1 and C2, we have for ρ ≤ 1. For ρ → ∞, since which gives |ρ coth(ρ) − 1| ≤ C1ρ.

Generally, ∀ρ > 0, we express as and we have From the bounds in (38), (40), and (42), we have By Lemma 3.3, we have Obviously, ε−3 ≥ ε−2, then we draw thus, it gives the wanted bound.

Lemma 3.7. For a fixed mesh and as ε → 0, it holdswhere sn = nh, 1 ≤ nN − 1.

Proof: The proof is in [22].

Theorem 3.8. Letbe the solution of (33), then we have the following uniform error boundProof: Substituting Lemma 3.7 into (39), we arrive at

Hence, the result leads Using the sup over all ε ∈ (0, 1], we get From (46), when ε > h, the obtained method uniformly converges uniformly with order two in the space direction. When ε ≪ h, the method converges uniformly with order one in the space direction.

Theorem 3.9. Let z and Z are the solutions of (1) and (33), respectively, then we have the following uniform error boundProof: The proof is considered by combining of Lemma 3.1 and Theorem 3.8.

4. Numerical results

Considering two test examples we carry out some numerical inquiries to confirm the developed scheme is ε-uniform convergent. Since the exact solution of the examples are not known, we used a variant of double mesh principle is applied for the numerical inquiries. So, we calculate the maximum pointwise error by , the ε-uniform error by , the rate of convergence by and the ε-uniform rate of convergence by rN,M = log2(EN,M/E2N, 2M).

4.1. Example

Consider the problem [7]

(s, t) ∈ (0, 1) × (0, 2] with interval condition z(s, t) = 0, on (s, t) ∈ [0, 1] × [−1, 0] and the boundary conditions z(0, t) = 0 and z(1, t) = 0, t ∈ [0, 2].

4.2. Example

Consider the problem [13]

(s, t) ∈ (0, 1) × (0, 2] with interval condition z(s, t) = 0, on (s, t) ∈ [0, 1] × [−1, 0] and the boundary conditions z(0, t) = 0 and z(1, t) = 0, t ∈ [0, 2].

For distinguishable values of ε and N, the obtained results for the model Examples 4.1 and 4.2, respectively, , , and rN,M of the developed scheme are delineated in Tables 1, 2. From these tables, one can observe that the maximum absolute error decreases as the step sizes decrease for every value of ε, and as ε approaches to zero, the maximum absolute error after getting large becomes constant, which displays ε-uniform convergence of the proposed scheme regardless of ε. On the other hand, the calculated EN,M and the corresponding rN,M using the proposed scheme are given in the last two rows, which confirms that the theoretical finding of the developed scheme is order one in both space and time direction.

Table 1

ε↓Number of intervals N = M
163264128256
202.1285e-041.4601e-052.7352e-052.0267e-051.1789e-05
3.8657-0.90560.43250.7817-
2−29.8466e-048.9095e-051.1378e-048.8529e-055.2297e-05
3.4662-0.35280.36200.7594-
2−43.6424e-035.2203e-042.1648e-041.6404e-049.7451e-05
2.80271.26990.40020.7513-
2−61.2902e-023.8264e-037.1066e-043.0405e-041.5008e-04
1.75352.42881.22491.0186-
2−81.5384e-027.4554e-033.1045e-039.0706e-042.8724e-04
1.04511.26391.77511.6589-
2−101.5389e-027.6241e-033.7907e-031.8490e-037.7045e-04
1.01331.00811.03571.2630-
2−121.5389e-027.6241e-033.7923e-031.8943e-039.4730e-04
1.01331.00751.00140.9998-
2−141.5389e-027.6241e-033.7923e-031.8943e-039.4771e-04
1.01331.00751.00140.9992-
2−161.5389e-027.6241e-033.7923e-031.8943e-039.4771e-04
1.01331.00751.00140.9992-
2−181.5389e-027.6241e-033.7923e-031.8943e-039.4771e-04
1.01331.00751.00140.9992-
2−201.5389e-027.6241e-033.7923e-031.8943e-039.4771e-04
1.01331.00751.00140.9992-
EN,M1.5389e-027.6241e-033.7923e-031.8943e-039.4771e-04
rN,M1.01331.00751.00140.9992

, and rN,M for Example 4.1.

Table 2

ε↓Number of intervals N = M
163264128256
201.3602e-041.4927e-051.4266e-051.0773e-056.3185e-06
3.18780.06530.40520.7698-
2−23.8939e-046.6953e-056.2477e-053.9473e-052.1855e-05
2.54000.09980.66250.8529-
2−49.8460e-042.5366e-041.3556e-046.9903e-053.5485e-05
1.95660.90400.95550.9782-
2−63.5833e-031.2258e-034.0647e-041.4312e-045.5885e-05
1.54761.59251.50591.3567-
2−84.8773e-032.9551e-031.2250e-034.0706e-041.2709e-04
0.72291.27041.58951.6794-
2−104.8804e-033.0579e-031.6631e-038.3185e-043.3471e-04
0.67450.87870.99951.3134-
2−124.8804e-033.0579e-031.6641e-038.6096e-044.3655e-04
0.67450.87780.95070.9798-
2−144.8804e-033.0579e-031.6641e-038.6096e-044.3682e-04
0.67450.87780.95070.9789-
2−164.8804e-033.0579e-031.6641e-038.6096e-044.3682e-04
0.67450.87780.95070.9789-
2−184.8804e-033.0579e-031.6641e-038.6096e-044.3682e-04
0.67450.87780.95070.9789-
2−204.8804e-033.0579e-031.6641e-038.6096e-044.3682e-04
0.67450.87780.95070.9789-
EN,M4.8804e-033.0579e-031.6641e-038.6096e-044.3682e-04
rN,M0.67450.87780.95070.9789

, and rN,M for Example 4.2.

In Figures 1, 2, the numerical solutions of the method for Examples 4.1 and 4.2 for different values of ε are given, respectively, for N = 80 and M = 40. Figure 3 displays the effect ε on the solutions profile of the developed scheme for Examples 4.1 and 4.2. From the figures, we see that a strong boundary layer is created on the right side of the spatial domain as ε close to zero. Furthermore, in Figure 4, the maximum point wise errors of the scheme is shown by the log-log scale plot. From these figures, one can observe that maximum absolute error decreases as the step sizes decrease for every values of ε, which confirm ε-uniform convergence of the proposed scheme.

Figure 1

Figure 2

Figure 3

Figure 4

In Table 3, the comparison with results of the developed method with the existing recently published studies of [23, 29] are given for Example 4.1. In Table 4, the comparison with results of the developed method with the existing number of recently published studies of [15, 24, 29, 30] are given for Example 4.2. As one follows, the developed scheme holds more accurate.

Table 3

Number of intervals N = M
Schemes ↓163264128256
Present method
EN,M1.5389e-027.6241e-033.7923e-031.8943e-039.4771e-04
rN,M1.01331.00751.00140.9992
Method in [23]
EN,M7.2307e-033.8523e-031.9892e-031.0107e-03
rN,M0.908421.00621.01550.98837
Method in [29]
EN,M3.41e-021.84e-029.38e-034.67e-032.31e-03
rN,M0.89010.97201.00621.01551.0063

EN,M and rN,M for Example 4.1.

Table 4

Number of intervals N = M
Schemes ↓163264128256
Present method
EN,M4.8804e-033.0579e-031.6641e-038.6096e-044.3682e-04
rN,M0.67450.87780.95070.9789
Method in [30]
EN,M6.40e-033.43e-031.75e-038.85e-044.44e-04
rN,M0.899860.970850.983610.99512
Method in [15]
EN,M1.86e-21.00e-25.48e-32.86e-31.46e-3
rN,M0.890.870.940.971.11
Method in [29]
EN,M3.06e-021.72e-029.00e-034.58e-032.30e-03
rN,M0.83110.93440.97460.99371.0000
Method in [24]
EN,M4.9006e-022.8622e-021.5141e-027.7173e-033.8858e-03
rN,M0.7758360.9186080.9723380.9898980.995894

EN,M and rN,M for Example 4.2.

5. Conclusion

We have developed a numerical method for solving singularly perturbed parabolic convection-diffusion equation with a large time delay. The solution of the problem exhibits a boundary layer on the right side of the domain. The solution has a steep gradient in the layer region due to the presence of ε. In the rapidly changing behavior of the solution in the layer region, one encounters computational difficulties to find the solution using analytically or using classical numerical methods. To handle this effect, we developed method comprises of the backward Euler scheme in the time direction and an exponentially fitted higher order finite difference scheme in the spatial direction. Using comparison principle, the stability of the discrete scheme is analyzed. The stability and uniformly convergent of the method are discussed theoretically. Numerical results are delineated by applying maximum point wise error, ε-uniform error and ε-uniform rate of convergence in tables which are in acceptable agreement with the theoretical analysis. The developed method contributes more accurate, stable, and ε-uniform with a linear order of convergence in the spatial and in the time direction. The proposed scheme can be extended for singularly perturbed turning point problems.

Statements

Data availability statement

The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding author.

Author contributions

ST and MW carried out the scheme development, algorithms writing, MATLAB code writing, the numerical simulations, and write final version of the manuscript. GD and TD planned the problem, design, wrote draft of the manuscript, and revised the manuscript. All authors read, commented, and approved the submitted version of the manuscript.

Acknowledgments

The authors would like to thank the referees for their constructive comments that improved the quality of this article.

Conflict of interest

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Publisher’s note

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.

References

  • 1.

    BakerCTBocharovGARihanFA. A Report on the Use of Delay Differential Equations in Numerical Modelling in the Biosciences. Citeseer (1999).

  • 2.

    GopalsamyK. Stability and Oscillations in Delay Differential Equations of Population Dynamics. vol. 74. Springer Science and Business Media (1992).

  • 3.

    BestehornMGrigorievaEV. Formation and propagation of localized states in extended systems. Ann Phys. (2004) 516:42331. 10.1002/andp.200451607-806

  • 4.

    GovindaraoLMohapatraJDasA. A fourth-order numerical scheme for singularly perturbed delay parabolic problem arising in population dynamics. J Appl Math Comput. (2020) 63:17195. 10.1007/s12190-019-01313-7

  • 5.

    TianH. Numerical Treatment of Singularly Perturbed Delay Differential Equations. Manchester, UK: The University of Manchester (2000).

  • 6.

    AnsariARBakrSAShishkinGI. A parameter-robust finite difference method for singularly perturbed delay parabolic partial differential equations. J Comput and Appl Math. (2007) 205:55266. 10.1016/j.cam.2006.05.032

  • 7.

    DasANatesanS. Uniformly convergent hybrid numerical scheme for singularly perturbed delay parabolic convection–diffusion problems on Shishkin mesh. Appl Math Comput. (2015) 271:16886. 10.1016/j.amc.2015.08.137

  • 8.

    GowrisankarSNatesanS. A robust numerical scheme for singularly perturbed delay parabolic initial-boundary-value problems on equidistributed grids. Electron Trans Numer Anal. (2014) 41:37695. 10.1016/j.cpc.2014.04.004

  • 9.

    GuptaVKumarMKumarS. Higher order numerical approximation for time dependent singularly perturbed differential-difference convection-diffusion equations. Num Methods Partial Differ Equ. (2018) 34:35780. 10.1002/num.22203

  • 10.

    SumitKumarSKuldeepKumarM. A robust numerical method for a two-parameter singularly perturbed time delay parabolic problem. Comput Appl Math. (2020) 39:125. 10.1007/s40314-020-01236-1

  • 11.

    KumarSKumarM. High order parameter-uniform discretization for singularly perturbed parabolic partial differential equations with time delay. Comput Math Appl. (2014) 68:135567. 10.1016/j.camwa.2014.09.004

  • 12.

    GowrisankarSNatesanS. ε-Uniformly convergent numerical scheme for singularly perturbed delay parabolic partial differential equations. Int J Comput Math. (2017) 94:90221. 10.1080/00207160.2016.1154948

  • 13.

    DasANatesanS. Second-order uniformly convergent numerical method for singularly perturbed delay parabolic partial differential equations. Int J Comput Math. (2018) 95:490510. 10.1080/00207160.2017.1290439

  • 14.

    GovindaraoLMohapatraJ. A second order numerical method for singularly perturbed delay parabolic partial differential equation. Eng Comput. (2018) 36:42044. 10.1108/EC-08-2018-0337

  • 15.

    KumarDKumariP. A parameter-uniform scheme for singularly perturbed partial differential equations with a time lag. Num Methods Partial Differ Equ. (2020) 36:86886. 10.1002/num.22455

  • 16.

    SinghJKumarSKumarM. A domain decomposition method for solving singularly perturbed parabolic reaction-diffusion problems with time delay. Num Methods Partial Differ Equ. (2018) 34:184966. 10.1002/num.22256

  • 17.

    RaoSCSKumarS. 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:334254. 10.1016/j.cam.2011.01.047

  • 18.

    KumarSKumarM. A second order uniformly convergent numerical scheme for parameterized singularly perturbed delay differential problems. Num Algor. (2017) 76:34960. 10.1007/s11075-016-0258-9

  • 19.

    KumarSKumarM. Analysis of some numerical methods on layer adapted meshes for singularly perturbed quasilinear systems. Num Algor. (2016) 71:13950. 10.1007/s11075-015-9989-2

  • 20.

    PodilaPCKumarK. A new stable finite difference scheme and its convergence for time-delayed singularly perturbed parabolic PDEs. Comput Appl Math. (2020) 39:116.

  • 21.

    TesfayeSKWoldaregayMMDinkaTGDuressaGF. Fitted computational method for solving singularly perturbed small time lag problem. BMC Res Notes. (2022) 15:318. 10.1186/s13104-022-06202-0

  • 22.

    WoldaregayMMAnileyWTDuressaGF. Novel numerical scheme for singularly perturbed time delay convection-diffusion equation. Adv Math Phys. (2021) 2021:6641236. 10.1155/2021/6641236

  • 23.

    NegeroNTDuressaGF. An efficient numerical approach for singularly perturbed parabolic convection-diffusion problems with large time-lag. J Math Model. (2022) 10:17390. 10.22124/jmm.2021.19608.1682

  • 24.

    BabuGBansalK. A high order robust numerical scheme for singularly perturbed delay parabolic convection diffusion problems. J Appl Math Comput. (2021) 68:36389. 10.1007/s12190-021-01512-1

  • 25.

    SalamaAAAl-AmeryDG. A higher order uniformly convergent method for singularly perturbed delay parabolic partial differential equations. Int J Comput Math. (2017) 94:252046. 10.1080/00207160.2017.1284317

  • 26.

    NegeroNTDuressaGF. A method of line with improved accuracy for singularly perturbed parabolic convection–diffusion problems with large temporal lag. Results Appl Math. (2021) 11:100174. 10.1016/j.rinam.2021.100174

  • 27.

    SahooSKGuptaV. Parameter robust higher-order finite difference method for convection-diffusion problem with time delay. Num Methods Partial Differ Equ. (in press). 10.1002/num.23039

  • 28.

    RaoSCSKumarS. Second order global uniformly convergent numerical method for a coupled system of singularly perturbed initial value problems. Appl Math Comput. (2012) 219:374053. 10.1016/j.amc.2012.09.075

  • 29.

    KumarDKumariP. A parameter-uniform numerical scheme for the parabolic singularly perturbed initial boundary value problems with large time delay. J Appl Math Comput. (2019) 59:179206. 10.1007/s12190-018-1174-z

  • 30.

    NegeroNTDuressaGF. Uniform convergent solution of singularly perturbed parabolic differential equations with general temporal-lag. Iran J Sci Technol Trans A Sci. (2022) 46:50724. 10.1007/s40995-021-01258-2

  • 31.

    ProtterMWeinbergerH. Maximum Principles in Differential Equations. Englewood Cliffs, NJ: Prentice-Hall Inc. (1967).

  • 32.

    KelloggRBTsanA. Analysis of some difference approximations for a singular perturbation problem without turning points. Math Comp. (1978) 32:102539.

  • 33.

    O'MalleyRE. Singular Perturbation Methods for Ordinary Differential Equations. vol. 89. New York, NY: Springer (1991).

Summary

Keywords

singularly perturbed, delay differential equation, exponentially fitted finite difference, non-symmetric finite difference, uniform convergence

Citation

Tesfaye SK, Duressa GF, Woldaregay MM and Dinka TG (2023) Fitted computational method for singularly perturbed convection-diffusion equation with time delay. Front. Appl. Math. Stat. 9:1244490. doi: 10.3389/fams.2023.1244490

Received

22 June 2023

Accepted

07 August 2023

Published

31 August 2023

Volume

9 - 2023

Edited by

Vikas Gupta, LNM Institute of Information Technology, India

Reviewed by

Sunil Kumar, Indian Institute of Technology (BHU), India; Sanjay Ku Sahoo, LNM Institute of Information Technology, India

Updates

Copyright

*Correspondence: Sisay Ketema Tesfaye

†ORCID: Sisay Ketema Tesfaye orcid.org/0009-0005-0602-3013

Gemechis File Duressa orcid.org/0000-0003-1889-4690

Mesfin Mekuria Woldaregay orcid.org/0000-0002-6555-7534

Disclaimer

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.

Outline

Figures

Cite article

Copy to clipboard


Export citation file


Share article

Article metrics