Abstract
This paper proposes a robust finite difference method on a fitted Shishkin mesh to solve a system of n singularly perturbed convection–reaction–diffusion differential equations with two small parameters. Defined on the interval , this system exhibits boundary layers due to the presence of small parameters, making accurate numerical approximations challenging. The method employs a piecewise uniform Shishkin mesh that adapts to layer regions and efficiently captures the solution’s behavior. The scheme is proven to be uniformly convergent with respect to the perturbation parameters, achieving nearly first-order accuracy. Comprehensive numerical experiments validate the theoretical results, illustrating the method’s robustness and efficiency in handling parameter-sensitive boundary layers.
Keywords:
singularly perturbed differential equations; numerical methods; convection–diffusion equations; Shishkin meshes; boundary layer; uniform convergence MSC:
65L11; 65L12; 65L20; 65L50; 65L70
1. Introduction
Singularly perturbed differential equations (SPDEs) are pivotal, with vastly different scales, arising in fields such as fluid dynamics, chemical kinetics, control systems and population dynamics [1,2]. Within this category, singularly perturbed differential equations (SPDEs) pose additional challenges due to the presence of small perturbation parameters, which induce boundary layers. The accurate numerical approximation of these layers is complex, especially because of the two parameters. Various approaches, including fitted mesh [3] and fitted operator methods [4], have been developed to tackle SPDEs. The mesh used in the proposed scheme is based on the Shishkin mesh, introduced in [3]. This type of mesh has been widely used in singularly perturbed problems to ensure parameter-uniform convergence. Cen [5] demonstrated a hybrid approach using Shishkin meshes to achieve near-second-order convergence, while Gracia et al. [6] introduced a monotone method for SPDEs with two parameters affecting both convection and diffusion. Some of the pioneering and recent works in this field are [7,8,9,10,11,12]. However, SPDEs governed by multiple small parameters, often denoted as and , introduce unique challenges. Specifically, the interactions between these parameters produce intricate boundary layers, often governed by the ratio , requiring parameter-robust methods for accurate representation. In this work, we propose a fitted mesh finite difference method designed to be parameter-robust for SPDEs, particularly as both and tend toward zero. The theoretical analysis establishes stability and bounds for the solution’s derivatives, demonstrating that the proposed method achieves nearly first-order accuracy uniformly with respect to both parameters. The main contribution of this paper is the development of a robust, parameter-insensitive numerical scheme for an n-system of SPDEs in a convection–diffusion–reaction framework. Our approach addresses a broader class of problems than previous studies that focused on either scalar singularly perturbed delay differential equations with two parameters [13], two systems of singularly perturbed equations without delay terms [14] and a system of two singularly perturbed differential equations with delay terms and two parameters [15]. A key novelty of this paper is its ability to handle the complex interaction between two distinct perturbation parameters affecting the convection and diffusion terms in an n-system of equations. This work advances the numerical analysis of SPDEs by providing a robust scheme that accurately resolves boundary layers, even under two parameter conditions and achieve parameter-uniform convergence, significantly enhancing the numerical analysis of SPDEs.
2. Formulation of the Problem
The following system of singularly perturbed two-parameter differential equations is under consideration
Here,
where , for , satisfying , and , satisfying , are small parameters. The functions , and act as coefficients, which are all sufficiently smooth over the domain , and The value of is determined as
When , the above problem is considered in [16]. The problem demonstrates boundary layers influenced by both and ; in particular, the layers are influenced by the ratio of . If , , the reduced problem can be expressed as
This predicts a boundary layer of width near , assuming . A similar boundary layer of width is expected near , if . If , , the reduced problem is
with boundary conditions This problem remains singularly perturbed with the parameter . A boundary layer of width is anticipated near . Additionally, a boundary layer of width is anticipated near , if . Numerical experiments suggest that the interior right layer weakens considerably when .
3. Analytical Results
This section presents a minimum principle, establishes a stability result and derives estimates for the derivatives of the solution associated with the problem defined by Equation (1).
Lemma 1.
Let be such that , and on ; then, on .
Proof.
Assume and are such that . Suppose . Then, cannot be at the boundaries 0 or 1. At , the first derivative of denoted as and the second derivative .
Claim: . If , then
which contradicts the assumption that on . Thus, . Therefore, on . The proof of the lemma is complete. □
Lemma 2. (Stability Result)
Let ; for ,
Proof.
Define
Consider the functions , where . Clearly, , and for all . Hence, by Lemma 1, it is proven that , which yields the required result. □
Theorem 1.
Let be the solution of Equation (1), and then its derivatives satisfy the following bounds on Ω,
where the constant C is independent of and μ, and
Proof.
The proof follows the methodology outlined in Lemma 2.2 of [11]. For any , a neighborhood such that and . According to the mean value theorem, there exists a satisfying
Now,
Thus,
The bounds for are obtained from Equation (1). Similarly, the bounds of and can be established for higher-order derivatives through analogous corresponding manipulations. The proof of the theorem is complete. □
4. Shishkin Decomposition of the Solution
For each of the cases and , is expressed by
where
Case (i):
In this case, for ,
Case (ii):
Inthis case, for ,
It should be ensured that the constants are selected appropriately. Additionally, the constants should be determined independently for the cases and , ensuring they meet the bounds required for the singular component. Given that and are bounded by constants that do not depend on and , even though c and k are functions of and , the magnitudes and are constants independent of and .
5. Bounds on the Regular Component and Its Derivatives
To establish the result, bounds for the smooth components and their derivatives on the interval should be estimated. Specifically, this is achieved by decomposing each component with respect to , and then applying to the first components, followed by for the first components, and so on. This step-by-step decomposition approach is as follows for both cases.
Case (i):
Establishing the bounds of the regular component , it is broken down as
Here, represents the solution
where is the solution of
represents the solution of
and is the solution of
Since is a matrix whose entries are bounded, for ,
Now, using Theorem 1 and (18) for the choice of ,
Then, from (19) and (20), it is found that
In order to facilitate the estimation of bounds for , the following representation is introduced, for , with . To proceed with the analysis, consider the system of first equations in (18),
The decomposition of proceeds similarly to the equation above,
Proceeding similarly to above, the problem associated with is similar to that in (18). By applying the estimates, the bound on the solution is obtained for , . Then, using Theorem 1 and , . Therefore, Employing a similar approach, singularly perturbed systems of l equations can be formulated, where ,
Applying a similar decomposition yields For each i, where and , the bound is
Case (ii):
Establishing the bounds of the regular component , it is broken down as
urthermore, the maximum principle for a linear operator of first order in the context of a terminal value problem has been demonstrated. Define the operators
By decomposing individually and proceeding similarly to case (i), for and , the bound is determined as follows
6. Layer Functions
The functions for the layers are denoted by and ; is specified over the interval
where ; ; and , for . Following Lemma 5 presented in [16], the points , which satisfy the conditions for the case , can be proved.
Similarly, for the case , it can be demonstrated that there exist points in such that
7. Bounds on the Singular Component and Its Derivatives
Theorem 2.
Proof.
For the case , the barrier functions can be defined, where for . It is evident that and . Additionally, for all x in the interval . Therefore, by hypothesis, it follows that . Considering the equation of from (13),
This can also be written as
where Now, taking ,
where is the indefinite integral of . Using the bounds on , it is established that . Using the inequality and using integration by parts, from the above it follows that Using a similar argument, we can obtain Differentiating the above equation and using a similar procedure as above, it can be shown that
It has been established that Consequently,
By introducing the barrier functions it can be demonstrated that on and which implies
By introducing other barrier functions the following result is obtained: Differentiating the equations of once and applying the bounds of and , it is observed that
Next, the bounds on for the case are derived. The bounds on can be derived by defining the barrier functions To bound , the argument continues as described from in (10) and utilizing Theorem 1, Improving the above bound on proceeds as follows, differentiating in (10) once, obtaining
To establish the necessary bounds, the barrier functions are defined as follows,
The bound on is obtained from the equation of in (10). To bound , the defining equation undergoes differentiation twice and thrice, respectively, using an argument analogous to that employed for bounding , which leads to the required bounds. The bound on is obtained by differentiating the equation of in (10) once, and then utilizing the bounds of and it can be seen that
The bounds on and its derivatives are established for the case . In this scenario, is decomposed over the interval .
This leads to
Since is a matrix with bounded entries, it follows, for , that
Now, using Theorem 1 and (31) for the choice of
Then, from (32) and (33), it follows that The decomposition for each component with respect to is given, and then is applied to the first components, followed by for the first components, and so on. For and , the bound is determined as Utilizing the previous derivations, is derived, similarly finding □
8. Sharper Bounds for
To achieve sharper bounds on the derivatives of the singular components , these components are further decomposed for [0, 1]. This refinement will help in demonstrating that the method’s convergence rate approaches nearly first-order accuracy. Now, the focus is on the case . In addition to that, the following ordering holds
For , it is decomposed as follows, on [0,1], where the components are defined, on the interval , by
for
and for
with and , on .
Lemma 3.
Given the decompositions of component for each ρ and i, and satisfy the following estimates on [0,1]:
Proof.
For the interval [0,1], differentiating (34) thrice yields
Then, for , using Theorem 2,
Since for , ,
For ,
As , , for ,
From (35) and (36), it is evident that for each , and
Differentiating (35) thrice on yields
For ,
From (35) and (36), it is evident that for each , , and ,
Differentiating (36) thrice on yields
For ,
From (36) and , it is evident that for and for ,
Since for , it holds that for any and ,
Hence, Similar arguments lead to
for and The proof of the theorem is complete. □
Analogously, the sharper bounds for the case can be found.
Lemma 4.
Given the decompositions of component for each ρ and i, and satisfy the following estimates on :
Proof.
The proof follows the same logic as Lemma 3. Analogously, the decompositions can be made for in both cases. Corresponding bounds for these components can be demonstrated in a similar manner. □
9. Numerical Method
This section explains the numerical method proposed for (1).
Shishkin Mesh
For the cases and , appropriate Shishkin meshes are developed over the interval .
Case (i):
A piecewise uniform Shishkin mesh is constructed over the interval ; the interval is divided into subintervals based on transition points as follows, The transition points for are defined as
for , ensuring finer mesh density near layer regions. The intervals are populated with points as follows, points on all inner regions, and for a uniform mesh with points is placed. If each takes the left choice in its definition, the mesh becomes a classical uniform mesh, with and a constant step size . The step sizes in the intervals are defined as , for and . At each transition point , the change in step size from to is given by , where , with when . When for all , the mesh simplifies to a uniform mesh, ensuring uniformly spaced transition points and a constant step size throughout the interval. Then, from (37), and also
Case (ii):
A piecewise uniform Shishkin mesh is constructed over the interval ; the interval is divided into subintervals based on transition points as follows, The transition points for are defined as
for , ensuring finer mesh density near layer regions. The intervals are populated with points as follows, points on all inner regions, for a mesh of is placed and for a mesh of is placed. If each takes the left choice in its definition, the mesh becomes a classical uniform mesh, with and a constant step size . The step sizes in the intervals are defined as , for , and for . At each transition point , the change in step size from to is given by , where , with when . When for all , the mesh simplifies to a uniform mesh, ensuring uniformly spaced transition points throughout the interval. Then, from (38), and also
10. The Discrete Problem
The discrete problem is defined as follows,
with boundary conditions specified as follows,
where for . The discrete derivatives are defined as follows:
with
11. Numerical Results
This section focuses on establishing the discrete minimum principle, demonstrating the discrete stability result of the proposed method and proving its first-order convergence.
Lemma 5. (Discrete Minimum Principle) Assume that the mesh function satisfies and . Then, if for , it implies that for all .
Proof.
Let and be such that and suppose . Then, , and . Therefore, For , if , then
which is a contradiction, gives , implying that for all . The proof of the theorem is complete. □
Lemma 6. (Discrete Stability Result) If is any mesh function, then
Error Estimate
Analogous to the continuous case, the discrete solution is split into two distinct components and .
Proof.
The error bounds for singular components are estimated for the case , utilizing the mesh functions for considered over ,
Lemma 8.
For the case , the layer components , satisfy the following bounds on ,
Proof.
This result can be demonstrated by defining the mesh functions and noticing that and . Furthermore, , . Therefore, the discrete minimum principle provides the desired outcome. The proof of the lemma is complete. □
Proof.
The local truncation error is given by
where . Since and the mesh is uniform, the value of . In this instance, and .
Let the barrier function be
on , where is a constant that satisfies ,
The mesh functions described above are inspired by those constructed in [17]. Now, , and , giving
and
Then, define . It is easy to observe that and . Hence, by applying the minimum principle,
The proof of the theorem is complete. □
Proof.
This is demonstrated for each mesh point by partitioning into small subintervals In each case, the local truncation error is estimated and a corresponding barrier function is constructed. Lastly, the desired estimate is derived by utilizing barrier functions.
Case (a):
Clearly, . Using standard local truncation error analysis applied in Taylor expansions, the estimates hold for and ,
For and , the mesh functions are considered as
Utilizing the minimum principle and barrier function , it has been derived that
Case (b): .
There are two possible cases: Case (b1): and Case (b2):. Case (b1): , since the mesh is uniform over the interval . In this case, it follows that , for . Then,
Now, for and , specify
Utilizing the minimum principle and barrier function , it has been derived that
Case (b2): . For this case, , and hence for , by applying the standard local truncation approach, which is based on Taylor expansions, ; then,
Now, using Lemma 3, it is not hard to derive that
and for ,
Define
and for ,
Case (c):.
There are three possibilities: Case (c1): , Case (c2): and for some q, , Case (c3): . Case (c1): . Since and the mesh remains uniform within the interval , it implies that for , , and hence
For ,
Utilizing the minimum principle and barrier function , it has been derived that
Case (c2): and for some q, . Since and the mesh is uniform in , it follows that , for . By applying the standard local truncation approach, which is based on Taylor expansions,
Now, using Lemma 3, for ,
and for ,
Now specify, for ,
and for ,
Case (c3): . Substituting m for q in the arguments of the previous case (c2) yields the following, and using , the estimates hold for . For ,
and for ,
For , define
and for ,
Case (d):
There are three possible scenarios, Case (d1): , Case (d2): and for some q, and Case (d3):. Case (d1): . The mesh is uniform over and the result is from Lemma 9. Case (d2): and for some q, . In this context, based on the definition of , it follows that , and utilizing analogous arguments to Case (c2) leads to the estimates for . For ,
and for ,
Now, specify, for ,
and for ,
Case (d3): . Let ; therefore, for ,
Thus, for each of the cases, the barrier function is constructed and, using the minimum principle, it has been derived that
The proof of the lemma is complete. □
To determine the estimate of the error bound, the mesh functions are defined on
with , for . For the case , the error in the component is bounded.
Proof. Assume that ; for , the local truncation error is given by
where . Since and the mesh is uniform, the value of . In this instance, ,
This is demonstrated for each mesh point by partitioning into small subintervals In each case, the local truncation error is estimated and a corresponding barrier function is considered. Lastly, the desired estimate is derived by utilizing barrier functions.
Case (a):
Clearly, . Using standard local truncation error analysis applied in Taylor expansions, the estimates hold for and ,
Case (b): .
There are two possible cases: Case (b1): and Case (b2): . Case (b1): . The mesh is uniform over the interval . In this case, it follows that , for . Then,
Case (b2): . For this case, , and therefore, for , by the local truncation utilized in Taylor expansions, ; then, using Lemma 4,
Case (c): .
There are three possibilities: Case (c1): , Case (c2): and for some q, and Case (c3): . Case (c1): , since and the mesh is uniform in . In this case, it follows that for , , and hence
Case (c2): and for some q, . Since , and the mesh is uniform in , it follows that , for . By utilizing the method of calculating the local truncation error and analyzing using Taylor expansions, as given in Lemma 4, the following can be obtained:
Case (c3): . Substituting m with q in the arguments of the previous case (c2) yields the following, and using , the following hold for ,
Case (d):
There are three possible scenarios, Case (d1): , Case (d2): and for some q, and Case (d3): . Case (d1): and the mesh is uniform over , and is established above. Case (d2): and for some q, . In this context, based on the definition of , it follows that and utilizing analogous arguments to Case (c2) leads to the estimates for . Case (d3): . Let . Therefore, on ,
The proof of the lemma is complete. □
To establish the bounds on the error , the mesh function is defined over ,
Lemma 12.
For the case , the layer components , satisfy the following bounds on ,
Proof.
This result can be demonstrated by defining the mesh functions . Also, since , . Hence, . Also, for an appropriate choice of C, it follows that . Further, . Hence, by the minimum principle, for . Hence, it can be said that The proof of the lemma is complete. □
Lemma 13.
At each point , , for the case .
Proof.
The local truncation error is given by
where . Consider the case ; then,
Consider the case . Hence,
Examine the mesh region . It is known that ; then,
The proof of the lemma is complete. □
Theorem 3.
Proof.
The proof follows Lemmas 7, 9,11 and 13. □
12. Numerical Illustration
Example
The solution to the following system on the interval is numerically approximated and the proposed method is applied to both cases and .
where
To evaluate the order of convergence, maximum pointwise errors and error constants, a modified two-mesh algorithm was utilized. The results are summarized in Table 1 and Table 2. As the parameter decreases, the error stabilizes for each N, the maximum pointwise error decreases with increasing N and the observed order of convergence improves, confirming the theoretical predictions. Figure 1 and Figure 2 display the solution profiles for the n- system over the interval . In Figure 1, corresponding to the condition boundary layers are observed for the components of () near and , consistent with theoretical expectations. On the other hand, Figure 2 illustrates the case where Here, layers are observed for near , while boundary layers emerge near . The log–log plots are used to visualize the relationship between the number of mesh points N and the maximum pointwise errors, providing a clear representation of the convergence behavior. Figure 3 displays the maximum pointwise errors for different values for the cases 1 and 2. These plots illustrate how the error decreases as N increases, reinforcing the theoretical predictions and highlighting the influence of and the accuracy of the numerical method.
Table 1.
Values of and when for .
Table 2.
Values of and when for .
Figure 1.
Graphical representation of numerical solutions for the case .
Figure 2.
Graphical representation of numerical solutions for the case .
Figure 3.
Graphical representation of maximum pointwise errors for different values for cases 1 and 2.
13. Conclusions
This paper presented a robust fitted mesh finite difference method for solving a system of two-parameter ‘n’ singularly perturbed differential equations of the convection–reaction–diffusion type. Using a piecewise uniform Shishkin mesh, our approach successfully captures the intricate behavior introduced by small perturbation parameters, which are typically challenging for conventional numerical methods. Our theoretical analysis establishes that the proposed scheme attains nearly first-order convergence in the maximum norm, uniformly with respect to both parameters. Numerical experiments confirm the method’s robustness and accuracy, demonstrating its capability to resolve boundary layers with precision across a system of equations. This work contributes to the numerical analysis of SPDEs by highlighting the importance of tailored methods for systems with small parameter effects. Future work can extend these results to enhance accuracy and efficiency in even more challenging scenarios of SPDEs.
Author Contributions
Conceptualization, J.P.M.; methodology, J.A. and J.P.M.; software, J.P.M. and J.A.; validation, J.P.M., G.E.C. and S.L.P.; formal analysis, J.A. and J.P.M.; investigation, J.A., J.P.M. and G.E.C.; resources, J.P.M. and J.A.; data curation, J.A. and J.P.M.; writing—original draft preparation, J.A. and J.P.M.; writing—review and editing, J.A., J.P.M., G.E.C. and S.L.P.; visualization, J.A.; supervision, G.E.C.; project administration, J.P.M., G.E.C. and S.L.P.; funding acquisition, S.L.P. and G.E.C. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
Data are contained within the article.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Bhatti, M.M.; Alamri, S.Z.; Ellahi, R.; Abdelsalam, S.I. Intra-uterine particle-fluid motion through a compliant asymmetric tapered channel with heat transfer. J. Therm. Anal. Calorim. 2021, 144, 2259–2267. [Google Scholar] [CrossRef]
- Glizer, V. Asymptotic analysis and solution of a finite-horizon H∞ control problem for singularly-perturbed linear systems with small state delay. J. Optim. Theory Appl. 2003, 117, 295–325. [Google Scholar] [CrossRef]
- Miller, J.J.H.; O’Riordan, E.; Shishkin, G.I. Fitted Numerical Methods for Singular Perturbation Problems; World Scientific: Singapore, 1996. [Google Scholar] [CrossRef]
- Doolan, E.P.; Miller, J.J.H.; Schilders, W.H.A. Uniform Numerical Methods for Problems with Initial and Boundary Layers; Boole Press: Dublin, Ireland, 1980. [Google Scholar]
- Cen, Z. Parameter-uniform finite difference scheme for a system of coupled singularly perturbed convection—diffusion equations. Int. J. Comput. Math. 2005, 82, 177–192. [Google Scholar] [CrossRef]
- Gracia, J.L.; O’Riordan, E.; Pickett, M.L. A parameter robust second order numerical method for a singularly perturbed two-parameter problem. Appl. Numer. Math. 2006, 56, 962–980. [Google Scholar] [CrossRef]
- Besova, M.; Kachalov, V. Axiomatic approach in the analytic theory of singular perturbations. Axioms 2020, 9, 9. [Google Scholar] [CrossRef]
- Liu, L.B.; Long, G.; Zhang, Y. Parameter uniform numerical method for a system of two coupled singularly perturbed parabolic convection-diffusion equations. Adv. Differ. Eq. 2018, 2018, 450. [Google Scholar] [CrossRef]
- Vishik, M.I.; Lyusternik, L.A. Regular degeneration and boundary layer for linear differential equations with small parameter. Russ. Math. Surv. 1957, 12, 3–122. [Google Scholar]
- O’Malley, R.E. Two-parameter singular perturbation problems for second-order equations. J. Math. Mech. 1967, 16, 1143–1164. [Google Scholar]
- O’Riordan, E.; Pickett, M.L.; Shishkin, G.I. Singularly perturbed problems modeling reaction-convection-diffusion processes. Comput. Methods Appl. Math. 2003, 3, 424–442. [Google Scholar] [CrossRef]
- Selvaraj, D.; Mathiyazhagan, J.P. A parameter uniform convergence for a system of two singularly perturbed initial value problems with different perturbation parameters and Robin initial conditions. Malaya J. Mat. 2021, 9, 498–505. [Google Scholar] [CrossRef] [PubMed]
- Kalaiselvan, S.S.; Miller, J.J.H.; Sigamani, V. A parameter uniform numerical method for a singularly perturbed two-parameter delay differential equation. Appl. Numer. Math. 2019, 145, 90–110. [Google Scholar] [CrossRef]
- Nagarajan, S. A parameter robust fitted mesh finite difference method for a system of two reaction-convection-diffusion equations. Appl. Numer. Math. 2022, 179, 87–104. [Google Scholar] [CrossRef]
- Arthur, J.; Chatzarakis, G.E.; Panetsos, S.L.; Mathiyazhagan, J.P. A robust-fitted-mesh-based finite difference approach for solving a system of singularly perturbed convection–diffusion delay differential equations with two parameters. Symmetry 2025, 17, 68. [Google Scholar] [CrossRef]
- Mathiyazhagan, P.; Sigamani, V.; Miller, J.J.H. Second order parameter-uniform convergence for a finite difference method for a singularly perturbed linear reaction-diffusion system. Math. Commun. 2010, 15, 587–612. [Google Scholar]
- Farrell, P.; Hegarty, A.; Miller, J.M.; O’Riordan, E.; Shishkin, G.I. Robust Computational Techniques for Boundary Layers, 1st ed.; Chapman and Hall/CRC: Boca Raton, FL, USA, 2000. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).