A numerical approach for
singularly perturbed parabolic reaction-diffusion
problem on a modified graded mesh
Abstract.
This paper addresses the numerical approximations of solutions for one dimensional parabolic singularly perturbed problems of reaction-diffusion type. The solution of this class of problems exhibit boundary layers on both sides of the domain. The proposed numerical method involves combining the backward Euler method on a uniform mesh for temporal discretization and an upwind finite difference scheme for spatial discretization on a modified graded mesh. The numerical solutions presented here are calculated using a modified graded mesh and the error bounds are rigorously assessed within the discrete maximum norm. The primary focus of this study is to underscore the crucial importance of utilizing a modified graded mesh to enhance the order of convergence in numerical solutions. The method demonstrates uniform convergence, with first-order accuracy in time and nearly second-order accuracy in space concerning the perturbation parameter. Theoretical findings are supported by numerical results presented in the paper.
Key words and phrases:
Singular perturbation problem, Parabolic reaction-diffusion problems, Finite difference methods, Modified graded mesh, Boundary layers, Uniform convergence2005 Mathematics Subject Classification:
65M06, 65M12, 65M15.1. Introduction
Singular perturbation problem consists of small parameter associated with highest oredr derivative in the equation. Presence of the parameter will cause the distortion in the solution in the vicinity of the boundary. Such problems have boundary or interior layers in their solutions. The interior layer develops when there is a discontinuity in the provided data, and the boundary layer happens when a term containing the highest order derivative is multiplied by a singular perturbation parameter. Furthermore, the problem is stiff due to the simultaneous presence of a discontinuous coefficient and a delay parameter, and the solution shows multi-scale character as . Many physical and real world problems are followed by singularly perturbed parabolic problem. In [7], its applications to many field of interests have been described. One can refer the book [2] for the application of the problem in medicine while, [11, 13] are dealing with the applications of such problems in mechanics. There are many articles in the literature that are imerged as a result of convergence of numerical schemes applied to singularly perturbed problem of parabolic type, e.g., one can refer to the articles [7, 3, 4, 5].
Finite difference method (FDM) is a sort of numerical technique that approximates the derivatives in a differential equation by replacing them with finite differences, calculated over a discrete grid of points, to solve for the unknown function or solution. There are a lots of beauties of this methods including
-
Discretization: FDM discretizes the continuous domain into a grid of points, allowing for numerical approximation.
-
Approximation of derivatives: FDM approximates derivatives using finite differences, such as forward, backward, or central differences.
-
Local accuracy: FDM has high local accuracy, meaning it’s accurate in small neighbourhood around each grid point.
-
Global convergence: FDM can converge to the exact solution as the grid size decreases.
-
Easy to implement: FDM is relatively simple to understand and implement, especially for simple geometries.
-
Computational efficiency: FDM can be computationally efficient, especially for large-scale problems.
-
Flexibility: FDM can be applied to various types of differential equations, including non-linear and time-dependent equations.
However, certain limitations to the method are grid dependence, numerical diffusion and boundary treatment. Overall, the finite difference method is a powerful tool for solving differential equations, offering a good balance between accuracy, efficiency, and simplicity.
The manuscripts that are utilizing the methods to obtain accuracy of discrtized solution include [10, 15, 18, 6]. Different variants of FDMs have been utilized to get the accuracy and convergence of the problem with different conditions and restrictions. [8] is the study of convection–reaction problem in which space direction is discretized by Shishkin mesh while Crank-Nikolson is adapted to discrtize in time direction. As a result, second order convergence in time domain and higher order convergence in space domain are gained, respectively. except this [9] is the study of the discrtization of convection-reaction problem using Euler technique in time domain and a central difference method comprises with space domain. Almost second order convergence upto logarithmic term is shown as a convergence result.
Throughing these manuscripts, we have considered the singularly perturbed parabolic initial-boundary-value problem (IBVP):
(1) |
where,
(2) |
is a small parameter, and are sufficiently smooth functions with for . Here, = , where and and also The above considered singular perturbation parameter is and also considered function , , , and are sufficiently smooth, bounded and also satisfy the condition The reduced problem corresponding to is
(3) |
As ) is characterized by boundary layers, uniform meshes do not work properly [1], which results to the construction of non-uniform and layer adapted meshes. In recent days, layer adapted meshes are better in handling the problems possess boundary and interior layers. [3, 14, 17] are the study about the convergence of finite difference methods over Shishkin mesh and other layer adapted meshes for reaction-convection equations.
In the present study, we have adopted the modified graded mesh for spatial domain. simple upwinding are introduced for discretizing the problem and uniform grid is taken place as domain discretization in time domain. As a consequence, almost second order convergence upto logarithimic factor we have achieved in spactial direction as a convergence rate of numerical solution which is optimal. Finally, we have presented two test problems to validate our theretical conclusions.
The rest of the manuscripts are adored in the following manner: Section 2 is a brief study of the analytical behavior of the problem, including an introduction to the appropriate Hölder spaces. The discussion includes the maximum principle for the differential operator, highlighting its role in ensuring -uniform stability. We also present sufficient compatibility conditions on the initial and boundary data to ensure the existence, uniqueness, and appropriate regularity of the problem’s solutions. In Theorem 2, both classical and new sharper -uniform bounds in the maximum norm on the derivative of the solution are discussed. The latter are obtained by means of a new decomposition of the solution, which leads to a deceptively simple proof of the required results. We generated the modified graded mesh and their properties are contained in Section 3. The upwind finite difference scheme is constructed in Section 4. We have completed error analysis for the presented method in Section 5. In Section 6, the numerical results are reported, which validate the results predicted by the theory and in fact show that the numerical methods work equally well in practice for a much broader class of problems than the theory predicts. Section 7 ends with the conclusion.
Notation: is used as a generic constant throughout the paper and also, is independent of the perturbation parameter and the mesh point and we use discrete maximum norm to study convergence which is defined as,
2. Analytical behaviour of the continuous problem
To explore the consistency of solutions to the time-dependent problem under consideration, we introduce certain function spaces characterized by Hölder continuity in both spatial and temporal dimensions. Specifically, consider and be a convex domain in Again we suppose that and fulfilled the condition Then a function is said to be Hölder continuous in of degree if, for all
Notice the distinction in the metrics employed for the spatial and temporal variables. The collection of all Holder continuous functions constitutes a normed linear vector space denoted by , equipped with the norm
where
We introduce the subspace of for each integer . These are functions within that possess Hölder continuous derivatives. and also introduced
The norm on is taken to be
Observe once more the distinct handling of space and time derivatives. For and , we also define the following semi-norms:
From these definitions, it is clear that
Adopting the notational convention , when the domain is apparent or of no specific importance, is typically omitted.
Furthermore, the initial functions , are essential to meet compatibility conditions at corner points of the domain, namely at and . These points significantly represents the boundaries or changes in the boundary conditions, satisfying compatibility conditions at these points ensures a consistency where the boundary or initial conditions may change sharply. The required compatibility conditions at the corners are stated below,
Under the above compatibility condition, possess unique solution with possibility of layer at both the end points and .
Minimum Principle. Assume that and let also suppose that on then in implies that in
Proof.
Let us assume that for all , we have , and for all , . Now, we apply the differential operator on . To contradict we assume that there exists a point such that , and is a minimum of in . Since, we have assumed that minimum and also is differentiable, then by applying a second order differential operator , on shows that it has upward concavity, which contradicts our supposition that . Also, if attain its minimum on , then by assumption that for all and hence on , must also be non-negative. ∎
Ensuring the stability of and establishing an -uniform bound for the solution in the maximum norm naturally follows from this.
Theorem 1.
Consider any function within the domain of the differential operator in . Then
and any solution of has the -uniform upper bound
where
The subsequent classical theorem provides adequate conditions for guaranteeing the existence of a unique solution.
Theorem 2.
Suppose that the data and and that the compatibility conditions
are fulfilled. then has a unique solution and
sectionBounds on the solution and its derivatives
The proposed method’s error estimate, discussed below, is validated assuming that the solution of exhibits a higher level of regularity than guaranteed by Theorem 4. Achieving this heightened regularity necessitates the imposition of stronger compatibility conditions at the two corners of . The additional compatibility conditions are
(4) |
Note that these conditions necessitate additional smoothness of . The subsequent theorem establishes the existence of a smooth solution for the problem with homogeneous boundary conditions.
Theorem 3.
Assume that the data and and that the compatibility conditions
and
are fulfilled. Then has a unique solution and Furthermore, the derivatives of the solution satisfy, for all non-negative integers such that
where the constant is independent of
Proof.
The first part’s proof is provided in [12]. Bounds on the derivatives are acquired through the following process: by transforming the variable into the stretched variable , problem becomes problem
(5) |
where . The differential equation in is not dependent on Utilizing the estimate (10.5) from [12], it is deduced that for all non-negative integers such that , and all in ,
Hence, we used the Theorem 1 which bound on the . ∎
The limits on the derivatives of the solution, as provided in Theorem 3, were initially deduced from classical findings. Nevertheless, it has been discovered that they lack sufficiency for proving the -uniform error estimate. To address this, more robust boundaries on these derivatives are acquired through a methodology initially presented in [16]. A pivotal maneuver involves breaking down the solution,, into components of smoothness and singularity.
Suppose that the solution of equation and write in the form as
(6) |
where and are smooth and singular components of .
Now, again decomposed the smooth component in the form such that
where the define the component and in the form as
Therefore, it is evident that represents the solution to the reduced problem and moreover, satisfies
With defined in this manner, it follows that is determined and satisfies
Now, we can also easily to write of such that
where and are define by
It’s evident that and denote the boundary layers on and , respectively. The theorem following contains the necessary non-classical bounds on and , along with their derivatives.
Theorem 4.
Let’s consider problem . We assume that the data and , and that the compatibility conditions of the previous theorem are met. Under these conditions, the reduced solution exists and belongs to . Additionally, if the supplementary compatibility conditions are satisfied, then
(7) |
and
(8) |
are satisfied then and exists and . Also, for all positive integers such that
and for all ,
and
where is a constant independent of
Proof.
References for the existence and regularity results can be found in [12]. The proofs of the bounds on the functions and their derivatives are presented subsequently.
The reduced solution, denoted as , emerges as the solution to a first-order differential equation. Employing a classical argument, we arrive at an estimate denoted as
(9) |
Moreover, the function represents the solution to a problem that conforms to the conditions specified in Theorem 3. Consequently, it follows that
(10) |
Since
The necessary estimates for the smooth component and its derivatives can be obtained by employing equations and . Similarly, the necessary bounds on and , as well as their derivatives, are derived in a similar manner.
Therefore, to simplify the proof, we will focus solely on and its derivatives. To establish a bound on , we begin by defining
Then, if is chosen sufficiently large and
and
if the value of is chosen as in Theorem 1 to be It follows from the maximum principle that for all
as required. ∎
3. The modified graded mesh and mesh discretization
In this section, we have constructed a modified graded mesh for the interval to address the reaction-diffusion parabolic problem, incorporating the effects of the perturbation parameter associated with boundary layers on both sides of the domain-specifically, at (left) and (right). The modified graded mesh is generated using a piecewise-defined function within the given interval . The subintervals and represent the finer regions in the spatial direction, forming a uniform grid divided into segments. In contrast, the interval constitutes the coarser region of the graded mesh, characterized by a non-uniform grid obtained through the non-linear equation (12) and subdivided into segments. The nonlinear equation (12) itself is derived using the bisection method.

(11) |
These equations establish a piecewise function for , where is explicitly defined as is explicitly set to , and the rest of the values are determined based on the specified conditions. This sequence of values for varies according to the ranges of , utilizing a non-linear equation involving the parameter and satisfies the following non-linear equation such that
(12) |
This technique guarantees a precise arrangement of grid points across distinct subintervals within the range Within each subinterval and points are evenly distributed with a step length of . Here, denotes the total grid point count, and represents a small positive value indicating the width of boundary regions. The selection of within the central subinterval is established iteratively through a non-linear equation . The mesh length is denoted by for .
Remark 5.
The proposed modified graded mesh adheres to the following bounds for mesh size.
Lemma 6.
The mesh described in equation fulfills the subsequent estimates.
Proof.
Initially, we investigate the results for . No further establishment is required since the mesh is uniform in this segment.
Now, we have described the following for such that
Here, we have taken . ∎
Lemma 7.
The parameter for the modified graded mesh defined in Equation adheres to the following bound:
Proof.
In the mesh partition defined in Equation , let and denote the number of points where the mesh spacing remains constant. It is clear that and are bounded above by . Conversely, represents the count of points within the same partition where the mesh steps vary, indicating a non-uniform mesh size. Additionally, we consider , identified as the minimum point for which . Now, we aim to derive an upper limit for . Under the assumption that , we have
because . For any , we have
Recalling , we have
Finally, we get
where represents grid points in the -direction. ∎
3.1. Temporal Discretization
We present mesh with uniform step length in the time direction since layer phenomenon has no effect on the temporal variable . The following notation and definition apply to the uniform mesh in the time direction:
Here represents the grid points in the temporal direction.
4. Discretization method
Now, we proceed to discretize our domain systematically. We construct a non-uniform grid on , consisting of mesh points. This grid is formed by placing uniform mesh points within the layer part and mesh points outside the layer part. Additionally, we consider an equidistant grid on with a uniform step length of . The discretized domain is then defined as:
We now discretize our problem using the aforementioned discretized mesh. We utilize an upwind difference method for spatial derivatives and employ backward Euler for temporal derivatives.
(13) |
by arranging , we will get a tri-diagonal system
(14) |
where
we defined the following parameter of finite difference scheme forward, backward,and central and the mesh function such that
4.1. Numerical algorithm
The following algorithm provides the grid construction and the corresponding numerical solution:
Step 1. Given the number of mesh points in the temporal and the spatial direction, and , respectively, take uniform mesh points in the temporal direction, .
Step 2. For the finer part in the spatial direction we have the uniform mesh .
Step 3. For the coarser part the graded mesh parameter is obtained by solving the nonlinear equation (12) by the bisection method.
Step 4. Using the graded mesh parameter , obtain the graded mesh in the interval from (11).
Step 5. Set .
Step 6. For the value of , solve the tridiagonal system (14) to obtain the solution for the time level .
Step 7. goto Step 6.
Step 8. If then stop and mark as the required solution.
5. Error convergence
Lemma 9.
(Discrete maximum principle) Suppose that is the mesh function which satisfies on . If on , then on .
Proof.
Let us assume that for all , we have ,and for all . To contradict we assume that there exists a point such that , and is a minimum of in .
Since, we have assumed that minimum and also is differentiable, then by applying a second order differential operator on shows that it has upward concavity, which contradicts our supposition that . Also, if attain its minimum on , then by assumption that for all and hence on must also be non-negative. ∎
Lemma 10.
For any solution of , we have
(15) |
Proof.
By constructing the barrier function
(16) |
Now, we can obtained the result with apply the Lemma 9 on the result which is defined in . ∎
Theorem 11.
Assume that and be the solution of continuous problem and discretized problem , respectively. Furthermore, both the solutions meet the corners compatibility requirements. Then, the error estimate is given by
(17) |
Here, constant is free from , and .
Proof.
We consider the following SPPDEs,
(18) | |||
To obtain the numerical solution, we discretize equation (18) employing the upwind finite difference method for spatial derivatives and the backward-Euler scheme for the time derivative.
(19) |
where is the approximate solution obtained over the interval .
Presently, we partition the solution of equation (1) into its regular and singular constituents, denoted as . Additionally, we decompose as , where represents the solution to the reduced problem.
and
Further satisfies
and the singular components satisfies
We now decompose the numerical solution of equation (19) into , where denotes the singular component of the decomposition, and represents the regular component, which is the solution to the subsequent non-homogeneous problem
and the singular component must satisfy,
Thus, the error can be expressed as:
We will now derive the bounds for the smooth and the layer components. To establish the bound for the smooth component, we employ a classical argument. The smooth error component can be written as:
thus we obtain
When taking the absolute values on both sides and applying (17), the preceding inequality becomes,
also we used the Taylor series expansion such that
On using Remark 8, estimates of derivatives, bounds of mesh length and discrete maximum principle, we have
(20) |
Similar to the continuous variable , the discrete counterpart is utilized to estimate the singular component, we have
The singular component error can be expressed as,
then the classical estimates gives
The discrete maximum principle is satisfied by the operator and also, due to the uniform boundedness of the inverse operator, the above inequality reduces to,
(21) |
6. Numerical Experiments
This section contains two examples featuring boundary layers to demonstrate the discussed numerical method. Through tables and graphs, we present the efficiency of the numerical approach. All numerical computations are conducted with . The numerical outcomes validate our theoretical conclusions.
Example 12.
Consider the following parabolic IBVP:
(22) |
We select the initial data and the source function to match the exact solution . Moreover, we define the maximum point-wise error corresponding order of convergence for each as:
where and are exact and approximate solution respectively. We compute the maximum point-wise error and the order of convergence for Example 12 using a modified graded mesh and Shishkin mesh, which includes boundary layers at and on both the left and right sides of the domain. We apply the upwind finite difference scheme and summarize the results in Table 1 and Table 2. Our observation from the results in Table 1 and Table 2 is that the scheme exhibits second-order convergence. Additionally, in the log-log plot shown in Fig. 2, it is evident that the maximum point-wise error of the proposed numerical method exhibits a second-order convergence with the perturbation parameter in space.
Number of Intervals | ||||
128/ | 256/ | 512/ | 1024/ | |
In order to compare our results with the well established Shishkin mesh [19], we define the the Shishkin mesh for the problem considered as follows. The Shishkin mesh is a piecewise uniform mesh, depends on two transition points which are defined by means of the transition parameter.
(23) |
where is a constant to be fixed later. A uniform mesh is placed in , and such that , and Therefore the mesh points are given by for for and for
Number of Intervals | ||||
---|---|---|---|---|
128/ | 256/ | 512/ | 1024/ | |
Example 13.
Consider the following problem
with homogeneous initial and boundary conditions.
In Example 13, an exact solution is unavailable. Consequently, to assess the maximum point-wise error and determine the order of convergence for the computed solution, we employ the double mesh principle. This involves considering intervals in the spatial direction and intervals in the temporal direction. We obtain the numerical solution on the mesh , where . Notably, each th point of the mesh coincides with the th point of the mesh .
The maximum point-wise error for each is defined by,
and the order of convergence is given by
Similarly, we compute the maximum point-wise error and the order of convergence for Example 13 using a modified graded mesh and Shishkin mesh, which includes boundary layers at and on both the left and right sides of the domain. We apply the upwind finite difference scheme and summarize the results in Table 3 and Table 4. Our observation from the results in Table 3 and Table 4. is that the scheme exhibits second-order convergence with the perturbation parameter in space. Additionally, in the log-log plot shown in Fig. 2, it is evident that the maximum point-wise error of the proposed numerical method exhibits a second-order uniform convergence in the perturbation parameter in space.
Number of Intervals | ||||
---|---|---|---|---|
128/ | 256/ | 512/ | 1024/ | |
Number of Intervals | ||||
128/ | 256/ | 512/ | 1024/ | |
1.7878 | 1.9463 | 1.9862 | ||
1.9823 | 1.9957 | 1.9989 | ||
1.9865 | 1.9966 | 1.9991 | ||
1.9845 | 1.9962 | 1.9990 | ||
Results by proposed method on the modified graded mesh | ||||
Number of Intervals | ||||
128/ | 256/ | 512/ | 1024/ | |
Results by proposed method on the Shishkin mesh | ||||
Number of Intervals | ||||
128/ | 256/ | 512/ | 1024/ | |
Results by [19] | ||||
Number of Intervals | ||||
128/ | 256/ | 512/ | 1024/ | |


7. Discussion and Conclusions
In this article, for the first time, we propose a modified graded mesh for reaction-diffusion problems that provides second-order uniform convergence with respect to the perturbation parameter. We have presented effective numerical approaches in this work that are based on a modified graded mesh. We have presented upwind finite difference schemes on modified graded mesh and Shishkin mesh. In order to verify the theoretical estimation established, we conduct numerical experiments for two test problems for various values of , and step sizes and . In order to find maximum point-wise error and corresponding order of convergence, we double the number of mesh points in the time and spatial direction for the proposed schemes on the modified graded mesh and Shishkin mesh. Through this procedure we get the second-order convergence. These can be observed from the results presented in Table 1 and Table 2 for Example 12 and Table 3, Table 4 for Example 13. From the above tables it can be confirmed that overall second order uniform convergence. Corresponding log-log plot are provided for the Example 12 and Example 13. Fig. 2 shows the overall second order of convergence for various values of with the upwind finite difference scheme on modified graded mesh and Shishkin mesh. Table 5 display comparison of the proposed scheme with the previous works. It is observed the proposed scheme is better than those considered in [19]. The uniform convergence of the proposed methods is shown by the numerical results obtained for the test problems. The ability to build higher-order, more time-accurate numerical schemes using the current setting is a feasible extension that may be used to improve accuracy while reducing computing costs. Finally, numerical outcomes supports the theoretical findings.
Funding: The first author Mr. Kishun Kumar Sah conveys his profound gratitude to the Department of Science and Technology, Govt. of India for providing INSPIRE fellowship (IF 190722).
Data Availability: Enquiries about data availability should be directed to the authors.
Acknowledgements.
The authors would like to thank the referees and editor for their useful remarks, which contributed to improving the quality of this article.
References
-
[1]
A.R. Ansari, S.A. Bakr, G.I. Shishkin,
A parameter-robust finite difference method for singularly perturbed delay parabolic partial differential equations, J. Comput. Appl. Math., 205 (2007), no.1, pp. 552–566,
https://doi.org/10.1016/j.cam.2006.05.032
- [2] A. Asachenkov, G. Marchuk, R. Mohler, S. Zuev, Disease dynamics, Springer Science & Business Media, 1993.
-
[3]
C. Clavero, J.L. Gracia,
A high order hodie finite difference scheme for 1d parabolic singularly perturbed reaction–diffusion problems, Appl. Math. Comput., 218(2012) no.9, pp. 5067–5080,
https://doi.org/10.1016/j.amc.2011.10.072,
-
[4]
C. Clavero, J.l. Gracia,
An improved uniformly convergent scheme in space for 1d parabolic reaction–diffusion systems,
Appl. Math. Comput., 243 (2014), pp. 57–73.
https://doi.org/10.1016/j.amc.2014.05.081
-
[5]
C. Clavero, J.L. Gracia,
Uniformly convergent additive finite difference schemes for singularly perturbed parabolic reaction–diffusion systems,
Comput. Math. Appl., 67 (2014), no.3, pp. 655–670.
https://doi.org/10.1016/j.camwa.2013.12.009
-
[6]
C. Clavero, J.C. Jorge,
A linearly implicit splitting method for solving time dependent semilinear reaction-diffusion systems,
Boundary and Interior Layers, Computational and Asymptotic Methods BAIL 2018, pp. 129–141. Springer, 2020,
https://doi.org/10.1007/978-3-030-41800-7-8
-
[7]
I.T. Daba, G.F. Duressa,
Computational method for singularly perturbed parabolic differential equations with discontinuous coefficients and large delay, Heliyon, 8 (2022), no.9.
https://doi.org/10.1016/j.heliyon.2022.e10742
-
[8]
G.F. Duressa, F.W. Gelu, G.D. Kebede,
A robust higher-order fitted mesh numerical method for solving singularly perturbed parabolic reaction-diffusion problems, Results Appl. Math., 20:100405, 2023,
https://doi.org/10.1016/j.rinam.2023.100405
-
[9]
F.W. Gelu, G.F. Duressa,
Efficient hybridized numerical scheme for singularly perturbed parabolic reaction–diffusion equations with robin boundary conditions,
Part. Differ. Equ. Appl. Math., 10:100662, 2024,
https://doi.org/10.1016/j.padiff.2024.100662
-
[10]
J.L. Gracia, F.J. Lisbona, E. O’Riordan,
A coupled system of singularly perturbed parabolic reaction-diffusion equations,
Adv. Comput. Math.,
32 (2010), pp. 43–61.
https://doi.org/10.1007/s10444-008-9086-3
-
[11]
A. Kaushik, M.D. Sharma,
Numerical analysis of a mathematical model for propagation of an electrical pulse in a neuron,
Numer. Methods Partial Differ. Equ., 24 (2008), no.4, pp. 1055–1079.
https://doi.org/10.1002/num.20301
- [12] O.A. Ladyzhenskaia, V.A. Solonnikov, Nina N Ural’tseva, Linear and quasi-linear equations of parabolic type, volume 23, American Mathematical Soc., 1968.
- [13] J. Lasalle, International symposium on nonlinear differential equations and nonlinear mechanics, Elsevier, 2012.
-
[14]
T. Linß, Robust convergence of a compact fourth-order finite difference scheme for reaction–diffusion problems,
Numer. Math., 111 (2008), no.2, pp. 239–249,
https://doi.org/10.1007/s00211-008-0184-4
-
[15]
N. Madden, M. Stynes,
A uniformly convergent numerical method for a coupled system of two singularly perturbed linear reaction–diffusion problems, IMA J. Numer. Anal., 23 (2003), no.4, pp. 627–644,
https://doi.org/10.1093/imanum/23.4.627
-
[16]
G.I. Shishkin,
Approximation of the solutions of singularly perturbed boundary-value problems with a parabolic boundary layer, USSR Comput. Math. Math. Phys., 29 (1989), no.4, pp. 1–10.
https://doi.org/10.1016/0041-5553(89)90109-2
-
[17]
R. Vulanović, A higher-order scheme for quasilinear boundary value problems with two small parameters, Computing, 67 (2001), no.4,
https://doi.org/10.1007/s006070170002
-
[18]
G.M. Wondimu, M.M. Woldaregay, G.F. Duressa, Tekle G Dinka,
Exponentially fitted numerical method for solving singularly perturbed delay reaction-diffusion problem with nonlocal boundary condition, BMC Research Notes, 16:94, (2023), no.1. https://doi.org/10.1186/s13104-023-06347-6
-
[19]
C. Clavero, J.L. Gracia, Uniformly convergent finite difference schemes for singularly
perturbed 1d parabolic reaction–diffusion problems,
In BAIL 2010-Boundary and Interior Layers, Computational and Asymptotic Methods, Springer, (2011), pp. 75–83.
https://doi.org/10.1007/978-3-642-19665-2-9
- [20]