Next Article in Journal
Sharp Front Approach Solutions to Some Doubly Degenerate Reaction-Diffusion Models
Previous Article in Journal
Universal Image Vaccine Against Steganography
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Robust-Fitted-Mesh-Based Finite Difference Approach for Solving a System of Singularly Perturbed Convection–Diffusion Delay Differential Equations with Two Parameters

by
Jenolin Arthur
1,
George E. Chatzarakis
2,*,
S. L. Panetsos
2 and
Joseph Paramasivam Mathiyazhagan
1
1
PG & Research Department of Mathematics, Bishop Heber College (Affiliated to Bharathidasan University), Trichy 620 017, Tamil Nadu, India
2
Department of Electrical and Electronic Engineering Educators, School of Pedagogical & Technological Education (ASPETE), 15122 Marousi, Athens, Greece
*
Author to whom correspondence should be addressed.
Symmetry 2025, 17(1), 68; https://doi.org/10.3390/sym17010068
Submission received: 5 December 2024 / Revised: 27 December 2024 / Accepted: 27 December 2024 / Published: 3 January 2025
(This article belongs to the Section Mathematics)

Abstract

:
This paper presents a robust fitted mesh finite difference method for solving a dynamical system of two parameter convection–reaction–diffusion delay differential equations defined on the interval [ 0 , 2 ] . The method incorporates a piecewise uniform Shishkin mesh to accurately resolve the solution behavior caused by small perturbation parameters and delay terms. The proposed numerical scheme is proven to be parameter-robust and achieves almost first-order convergence. Numerical illustrations are provided to showcase the method’s effectiveness, highlighting its capability to address boundary and interior layers with improved accuracy. The results, supported by symmetrical considerations in the figures, enhance the precision and serve as validation for the theoretical results.

1. Introduction

Singularly perturbed differential equations (SPDEs) emerge in numerous scientific and engineering fields, such as fluid dynamics, chemical reactor theory, population dynamics, particle fluid motion [1], and control theory [2]. A notable subset of these equations is the singularly perturbed delay differential equations (SPDDEs); these equations are characterized by the presence of two distinct small perturbation parameters, which introduce additional complexities due to the occurrence of boundary and interior layers. These layers arise because of the small perturbation parameters and delay terms, making the numerical approximation of SPDDEs particularly difficult. To tackle these challenges, numerous specialized numerical techniques, including fitted mesh methods [3] and fitted operator methods [4], are developed and well established. This approach offers robust and precise solutions to singularly perturbed differential equations (SPDEs). For instance, Cen [5] analyzed a class of first-order SPDDEs utilizing a hybrid difference scheme combined with a piecewise uniform Shishkin mesh, demonstrating that the approach achieves near second-order convergence. Gracia, O’Riordan, and Pickett [6] stated that a singularly perturbed ordinary differential equation is influenced by two small parameters that impact both the convection and diffusion terms. They proposed a second-order monotone numerical method to solve the problem. In [7], parabolic singularly perturbed parabolic differential equations involving two parameters on a rectangular domain were examined.
SPDDEs are typically defined a system of boundary value problems influenced by two small parameters, μ and ϵ i . The interaction between these parameters produces intricate layers, determined by the ratio μ 2 / ϵ i . This work has focused on developing parameter-robust methods for solving these equations, especially as both ϵ i and μ approach zero simultaneously. The most important papers among all are [6,8,9]. This paper focuses on the numerical solution of a boundary value problem for SPDDEs with two small perturbation parameters. The interaction between these parameters introduces complex, symmetry-influenced layer patterns in the solution, further compounded by the delay term. Our goal is to construct a parameter-robust numerical method that ensures the accurate solution of boundary and interior layers, regardless of the perturbation parameters. In doing so, we aim to establish the minimum principle and stability result of the solution and derive bounds for the solution’s derivatives to support the convergence analysis of the proposed fitted mesh finite difference method, which will achieve nearly first-order convergence, regardless of the two perturbation parameters, and offer a robust layer-solving solution. Several studies have addressed singular perturbation problems, focusing on their asymptotic properties, parameter-uniform methods, and delay differential equations to ensure robust and accurate solutions across varying parameters [10,11,12].
The novelty of this paper lies in its approach to solving a system of two-parameter singularly perturbed delay differential equations (SPDDEs) of the convection–diffusion type. Unlike previous works, such as [9], which focuses on single delay differential equations, and [8], which addresses a system of convection–reaction–diffusion equations without delay terms, this paper considers interacting variables influenced by both delay and two distinct small perturbation parameters. This dual influence introduces significant complexities, particularly in the formation of boundary and interior layers. To tackle these challenges, a more robust numerical scheme integrating advanced mesh techniques, such as the use of a piecewise uniform Shishkin mesh, is proposed. Furthermore, this method employs more robust numerical schemes and advanced mesh techniques, potentially achieving almost first-order convergence, independent of the two perturbation parameters.

2. Formulation of the Problem

E u ( ϰ ) + μ A ( ϰ ) u ( ϰ ) B ( ϰ ) u ( ϰ ) + D ( ϰ ) u ( ϰ 1 ) = f ( ϰ ) for all ϰ Ω = ( 0 , 2 ) ,
u = φ on [ 1 , 0 ] , u ( 2 ) = ι .
Here, u = u 1 u 2 , f = f 1 f 2 , E = ϵ 1 0 0 ϵ 2 , A ( ϰ ) = a 1 ( ϰ ) 0 0 a 2 ( ϰ ) ,   B ( ϰ ) = b 11 ( ϰ ) b 12 ( ϰ ) b 21 ( ϰ ) b 22 ( ϰ ) ,   D ( ϰ ) = d 1 ( ϰ ) 0 0 d 2 ( ϰ ) , where ϵ i , for i = 1 , 2 satisfy 0 < ϵ 1 < ϵ 2 1 and μ satisfy 0 < μ 1 are small parameters. The coefficient functions a i ( ϰ ) , b i j ( ϰ ) , d i ( ϰ ) , and f i ( ϰ ) are all sufficiently smooth over the domain Ω ¯ = [ 0 , 2 ] and a i ( ϰ ) α > 0 , b i i ( ϰ ) + b i j ( ϰ ) β > 0 , d i ( ϰ ) > 0 ,   b i i ( ϰ ) + b i j ( ϰ ) d i ( ϰ ) κ > 0 , for i , j = 1 , 2 and i j . The φ ( x ) is sufficiently smooth over the interval [ 1 , 0 ] . The value of γ is determined as γ = min x Ω ¯ j = 1 2 b i j ( ϰ ) d i ( ϰ ) a i ( ϰ ) for i = 1 , 2 and i j . When μ = 0 , the above problem is considered in [13] without delay. The problem demonstrates boundary layers that are influenced by both ϵ i and μ , in particular the layers are influenced by the ratio of μ 2 ϵ i . If μ 2 ϵ 1 γ α , the reduced problem can be expressed as
B ( ϰ ) u ( ϰ ) + D ( ϰ ) u ( ϰ 1 ) = f ( ϰ ) , ϰ ( 0 , 2 ] , u ( ϰ ) = φ ( ϰ ) on [ 1 , 0 ] .
This predicts a boundary layer of width O ( ϵ i ) near ϰ = 0 and an interior layer at ϰ = 1 (due to the unit delay component), assuming u ( 0 ) φ ( 0 ) . Also, a boundary layer of width O ( ϵ i ) is expected near ϰ = 2 and an interior layer at ϰ = 1 (again due to the unit delay component); if u ( 2 ) ι . If μ 2 ϵ 2 γ α , the reduced problem
μ A ( ϰ ) u ( ϰ ) B ( ϰ ) u ( ϰ ) + D ( ϰ ) u ( ϰ 1 ) = f ( ϰ ) , ϰ ( 0 , 2 ) ,
u ( ϰ ) = φ ( ϰ ) on [ 1 , 0 ] , u ( 2 ) = ι ,
is once again singularly perturbed with the parameter μ . A boundary layer of width O ( μ ) is anticipated near ϰ = 2 and an interior layer at ϰ = 1 (due to the unit delay component), unless the solution at ϰ = 2 differs from u ( 2 ) ; additionally, a boundary layer of width O ( ϵ i μ ) is anticipated near ϰ = 0 and an interior layer at ϰ = 1 (also due to the unit delay component), if u ( 0 ) φ ( 0 ) . Numerical experiments suggest that the interior right layer weakens considerably when ϵ i μ 2 . Consider the problem
L 1 z ( ϰ ) = E z ( ϰ ) + μ A ( ϰ ) z ( ϰ ) B ( ϰ ) z ( ϰ ) = g ( ϰ ) , ϰ Ω 1 ,
L 2 z ( ϰ ) E z ( ϰ ) + μ A ( ϰ ) z ( ϰ ) B ( ϰ ) z ( ϰ ) + D ( ϰ ) z ( ϰ 1 ) = f ( ϰ ) , ϰ Ω 2 ,
with boundary conditions
z ( 0 ) = φ ( 0 ) , z ( 1 ) = z ( 1 + ) , z ( 1 ) = z ( 1 + ) , z ( 2 ) = ι ,
where g ( ϰ ) = f ( ϰ ) D ( ϰ ) φ ( ϰ 1 ) , for ϰ Ω 1 , Ω 1 = ( 0 , 1 ) , Ω 2 = ( 1 , 2 ) .

3. Analytical Results

This section presents a minimum principle and a stability result, and it provides estimates for the derivatives of the solution to the problem defined by Equation (1).
Lemma 1.
Let ψ C 2 ( Ω ¯ ) be such that ψ ( 0 ) 0 , ψ ( 2 ) 0 , L 1 ψ 0 on ( 0 , 1 ) and L 2 ψ 0 on ( 1 , 2 ) , ψ ( 1 ) = 0 , ψ ( 1 ) 0 , then ψ 0 on [ 0 , 2 ] .
Proof. 
Assume that ϰ * and s * be such that ψ s * ( ϰ * ) = min ϰ Ω , s = 1 , 2 ψ s ( ϰ ) . Suppose ψ s * ( ϰ * ) < 0 . Then, ϰ * cannot be at the boundaries 0 or 2. At ϰ * , the first derivative of ψ s * , denoted as ψ s * ( ϰ * ) = 0 and the second derivative ψ s * ( ϰ * ) 0 . Claim (i): ϰ * ( 0 , 1 ) .
If ϰ * ( 0 , 1 ) , then
( L 1 ψ ) s * ( ϰ * ) = ϵ s * ψ s * ( ϰ * ) + μ a s * ( ϰ * ) ψ s * ( ϰ * ) j = 1 2 b s * j ( ϰ * ) ψ j ( ϰ * ) > 0 ,
which contradicts the assumption that L 1 ψ 0 on ( 0 , 1 ) . Thus, ϰ * ( 0 , 1 ) . Claim (ii): ϰ * [ 1 , 2 ) . If ϰ * [ 1 , 2 ) , then
( L 2 ψ ) s * ( ϰ * ) = ϵ s * ψ s * ( ϰ * ) + μ a s * ( ϰ * ) ψ s * ( ϰ * ) j = 1 2 [ b s * j ( ϰ * ) ] ψ j ( ϰ * )
d s * ( ϰ * ) ψ s * ( ϰ * 1 ) > 0 ,
which contradicts the assumption that L 2 ψ 0 on [ 1 , 2 ) . Hence, ϰ * [ 1 , 2 ) . When ϰ * = 1 , the differentiability of ψ s * at ϰ = 1 is investigated. If ψ s * ( 1 ) does not exist, then ψ s * ( 1 ) = ψ s * ( 1 + ) ψ s * ( 1 ) > 0 , which contradicts the condition ψ s * ( 1 ) 0 . If ψ s * is differentiable at ϰ = 1 , then μ a s * ( 1 ) ψ s * ( 1 ) j = 1 2 b s * j ( 1 ) ψ j ( 1 ) > 0 . Since all entries of A ( ϰ ) , B ( ϰ ) , and ψ j ( ϰ ) are continuous on [ 0 , 2 ] , there is an interval [ 1 h , 1 ) where μ a s * ( ϰ ) ψ s * ( ϰ ) j = 1 2 b s * j ( ϰ ) ψ j ( ϰ ) > 0 . If ψ s * ( p ) 0 for any p [ 1 h , 1 ) , then ( L 1 ψ ) s * ( p ) 0 , which leads to a contradiction. Therefore, it is assumed that ψ s * ( ϰ ) < 0 on the interval [ 1 h , 1 ) . This indicates that ψ s * ( ϰ ) is strictly decreasing over [ 1 h , 1 ) . Given that ψ s * ( 1 ) = 0 and ψ s * is continuous on ( 0 , 2 ) , it follows that ψ s * ( ϰ ) > 0 on [ 1 h , 1 ) . As a result, the continuous function ψ s * ( ϰ ) cannot attain a minimum at ϰ = 1 , which contradicts the assumption that ϰ * = 1 . Thus, ψ 0 on [ 0 , 2 ] . The proof of the lemma is complete. □
Lemma 2.
(Stability Result) Let ψ C 2 ( Ω ¯ ) . For ϰ Ω ¯ ,
| ψ i ( ϰ ) | max | ψ ( 0 ) | , | ψ ( 2 ) | , 1 κ L 1 ψ Ω ¯ 1 , 1 κ L 2 ψ Ω ¯ 2 .
Proof. 
Define
M = max | ψ ( 0 ) | , | ψ ( 2 ) | , 1 κ L 1 ψ Ω ¯ 1 , 1 κ L 2 ψ Ω ¯ 2 .
Consider the functions θ ± ( ϰ ) = M e ± ψ ( ϰ ) , where e = ( 1 , 1 ) T . Clearly, θ ± C 2 ( Ω ) ; at both 0 and 2, θ ± is non-negative, i.e., θ ± ( 0 ) 0 and θ ± ( 2 ) 0 . For ϰ ( 0 , 1 ) ,
L 1 θ ± ( ϰ ) = B ( ϰ ) M e ± L 1 ψ ( ϰ ) 0 ,
and for ϰ ( 1 , 2 ) ,
L 2 θ ± ( ϰ ) = B ( ϰ ) M e + D ( ϰ ) M e ± L 2 ψ ( ϰ ) 0 .
Also, θ ± ( 1 ) is equal to ± ψ ( 1 ) , both of which are zero, i.e., θ ± ( 1 ) = ± ψ ( 1 ) = 0 and θ ± ( 1 ) = ± ψ ( 1 ) = 0 , then θ ± ( ϰ ) 0 . By applying Lemma 1, it is obtained that | ψ i ( ϰ ) | M for ϰ Ω ¯ . The proof of the lemma is complete. □
Theorem 1.
Let u be the solution of (1); then, its derivatives satisfy the following bounds on Ω,
| u i ( k ) ( ϰ ) | C ( ϵ i ) k 1 + μ ϵ i k max { u , f } ,
u i ( 3 ) ( ϰ ) C ( ϵ i ) 3 1 + μ ϵ i 3 max u , f , f ,
| u i ( 4 ) ( ϰ ) | C ( ϵ i ) 4 1 + μ ϵ i 4 max u , f , f , f
where the constant C is independent of ϵ i and μ, i, k = 1, 2.
Proof. 
The proof follows the methodology outlined in Lemma 2.2 of [14]. For any ϰ ( 0 , 1 ) , a neighborhood N p = ( p , p + ϵ i ) can be constructed in such a way that ϰ N p and N p ( 0 , 1 ) . According to the mean value theorem, there is a y N p satisfying
u i ( y ) = u i ( p + ϵ i ) u i ( p ) ϵ i | u i ( y ) | 2 u i ϵ i .
Now,
u i ( ϰ ) = u i ( y ) + y ϰ u i ( η ) d η .
Thus,
| u i ( ϰ ) | C ϵ i 1 + μ ϵ i max { u , f } .
The bounds for u i are obtained from Equation (1) and the bounds from Equation (7) for k = 1 . Similarly, the bounds of u i ( 3 ) and u i ( 4 ) 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 α μ 2 γ ϵ 1 and α μ 2 γ ϵ 2 , u is expressed by
u = v + w L + w R ,
where
v ( ϰ ) = r ( ϰ ) , for ϰ [ 0 , 1 ) s ( ϰ ) , for ϰ [ 1 , 2 ] ,
w L ( ϰ ) = w L 1 ( ϰ ) = w 1 L 1 ( ϰ ) w 2 L 1 ( ϰ ) , for ϰ [ 0 , 1 ) w L 2 ( ϰ ) = w 1 L 2 ( ϰ ) w 2 L 2 ( ϰ ) , for ϰ [ 1 , 2 ] ,
w R ( ϰ ) = w R 1 ( ϰ ) = w 1 R 1 ( ϰ ) w 2 R 1 ( ϰ ) , for ϰ [ 0 , 1 ) w R 2 ( ϰ ) = w 1 R 2 ( ϰ ) w 2 R 2 ( ϰ ) , for ϰ [ 1 , 2 ] .
Case (i): α μ 2 γ ϵ 1
In this case,
L 1 r ( ϰ ) = g ( ϰ ) , for ϰ ( 0 , 1 ) , r ( 0 ) and r ( 1 ) are selected ,
L 2 s ( ϰ ) = f ( ϰ ) , for ϰ ( 1 , 2 ) , s ( 1 ) and s ( 2 ) are selected ,
s ( ϰ ) = r ( ϰ ) on [ 0 , 1 )
L 1 w L 1 = 0 , for ϰ ( 0 , 1 ) , w L 1 ( 0 ) = u ( 0 ) v ( 0 ) c 1 ( ϵ i , μ ) , w L 1 ( 1 ) = 0 ,
L 2 w L 2 = 0 , for ϰ ( 1 , 2 ) , w L 2 ( 1 ) = k 1 ( ϵ i , μ ) c 2 ( ϵ i , μ ) , w L 2 ( 2 ) = 0 ,
w L 2 ( ϰ ) = w L 1 ( ϰ ) , for ϰ [ 0 , 1 )
L 1 w R 1 = 0 , for ϰ ( 0 , 1 ) , w R 1 ( 0 ) = c 1 ( ϵ i , μ ) , w R 1 ( 1 ) = k 2 ( ϵ i , μ ) ,
L 2 w R 2 = 0 , for ϰ ( 1 , 2 ) , w R 2 ( 1 ) = c 2 ( ϵ i , μ ) , w R 2 ( 2 ) = u ( 2 ) v ( 2 ) ,
w R 2 ( ϰ ) = w R 1 ( ϰ ) , for ϰ [ 0 , 1 )
Case (ii): α μ 2 γ ϵ 2
In this case,
L 1 r ( ϰ ) = g ( ϰ ) , for ϰ ( 0 , 1 ) , r ( 0 ) and r ( 1 ) are selected ,
L 2 s ( ϰ ) = f ( ϰ ) , for ϰ ( 1 , 2 ) , s ( 1 ) and s ( 2 ) are selected ,
s ( ϰ ) = r ( ϰ ) on [ 0 , 1 )
L 1 w L 1 = 0 , for ϰ ( 0 , 1 ) , w L 1 ( 0 ) = u ( 0 ) v ( 0 ) c 1 ( ϵ i , μ ) , w L 1 ( 1 ) = 0 ,
L 2 w L 2 = 0 , for ϰ ( 1 , 2 ) , w L 2 ( 1 ) = k 1 ( ϵ i , μ ) c 2 ( ϵ i , μ ) , w 2 L ( 2 ) = 0 ,
w L 2 ( ϰ ) = w L 1 ( ϰ ) , for ϰ [ 0 , 1 )
L 1 w R 1 = 0 , for ϰ ( 0 , 1 ) , w R 1 ( 0 ) = c 1 ( ϵ i , μ ) , w R 1 ( 1 ) = k 2 ( ϵ i , μ ) ,
L 2 w R 2 = 0 , for ϰ ( 1 , 2 ) , w R 2 ( 1 ) = c 2 ( ϵ i , μ ) , w R 2 ( 2 ) = u ( 2 ) v ( 2 ) ,
w R 2 ( ϰ ) = w R 1 ( ϰ ) , for ϰ [ 0 , 1 )
To ensure the jump conditions at ϰ = 1 in Equations (13) and (22) are satisfied, the constants k 1 ( ϵ i , μ ) and k 2 ( ϵ i , μ ) must be selected appropriately. Additionally, the constants c 1 ( ϵ i , μ ) and c 2 ( ϵ i , μ ) should be determined independently for the cases α μ 2 γ ϵ 1 and α μ 2 γ ϵ 2 , ensuring they meet the bounds required for the singular component. Given that u ( 0 ) and u ( 1 ) are bounded by constants that do not depend on ϵ i and μ , even though c 1 , c 2 , k 1 , and k 2 are functions of ϵ i and μ , the magnitudes | c 1 | , | c 2 | , | k 1 | , and | k 2 | are constants independent of ϵ i and μ .

5. Bounds on the Regular Component and Its Derivatives

Case (i):  α μ 2 γ ϵ 1
Establishing the bounds of the regular components r and s , they are broken down as in [9]
r = y 0 + ϵ 2 y 1 + ( ϵ 2 ) 2 y 2 + ( ϵ 2 ) 3 y 3 , Ω ¯ 1 = [ 0 , 1 ]
s = z 0 + ϵ 2 z 1 + ( ϵ 2 ) 2 z 2 + ( ϵ 2 ) 3 z 3 , Ω ¯ 2 = [ 1 , 2 ]
where y i = ( y i 1 , y i 2 ) T , z i = ( z i 1 , z i 2 ) T , i = 0 , 1 , 2 , 3 , and their respective equations are on the intervals [ 0 , 1 ] and [ 1 , 2 ] , where y i ( ϰ ) and z i ( ϰ ) , i = 0 , 1 , 2 , 3 are defined by
B ( ϰ ) y 0 ( ϰ ) + D ( ϰ ) φ ( ϰ 1 ) = f ( ϰ ) , for ϰ [ 0 , 1 ] ,
B ( ϰ ) z 0 ( ϰ ) + D ( ϰ ) y 0 ( ϰ 1 ) = f ( ϰ ) , for ϰ [ 1 , 2 ] ,
B ( ϰ ) y 1 ( ϰ ) = g 1 , for ϰ [ 0 , 1 ] ,
B ( ϰ ) z 1 ( ϰ ) D ( ϰ ) y 1 ( ϰ 1 ) = q 1 , for ϰ [ 1 , 2 ] ,
B ( ϰ ) y 2 ( ϰ ) = g 2 , for ϰ [ 0 , 1 ] ,
B ( ϰ ) z 2 ( ϰ ) D ( ϰ ) y 2 ( ϰ 1 ) = q 2 , for ϰ [ 1 , 2 ] ,
L 1 y 3 ( ϰ ) = g 3 , for ϰ ( 0 , 1 ) ,
y 3 ( 0 ) = 0 , y 3 ( 1 ) = 0 ,
L 2 z 3 ( ϰ ) = q 3 , for ϰ ( 1 , 2 ) ,
z 3 ( 1 ) = 0 , z 3 ( 2 ) = 0 , z 3 ( ϰ ) = y 3 ( ϰ ) , on [ 0 , 1 ) .
where g i = ( g i 1 , g i 2 ) T , g i j = ϵ j ϵ 2 y i 1 j + μ ϵ 2 a j y i 1 j , and q i = ( q i 1 , q i 2 ) T , q i j = ϵ j ϵ 2 z i 1 j + μ ϵ 2 a j z i 1 j , i = 1 , 2 , 3 , j = 1 , 2 , Equations (33)–(37) give
y 0 ( k ) Ω ¯ 1 C , z 0 ( k ) Ω ¯ 2 C , for 0 k 7 ,
y 1 ( k ) Ω ¯ 1 C , z 1 ( k ) Ω ¯ 2 C , for 0 k 5 ,
y 2 ( k ) Ω ¯ 1 C , z 2 ( k ) Ω ¯ 2 C , for 0 k 3 .
Now, from (39)–(42) and using Lemma 2, y 3 C . Using the estimates y 32 ( k ) C ϵ 2 k / 2 ,   k = 1 , 2 . From the defining equation of y 31 in (39),
ϵ 1 y 31 + μ a 1 y 31 b 11 y 31 = ϵ 1 ϵ 2 y 21 μ ϵ 2 a 1 y 21 b 12 y 32 .
Decomposing y 31 as y 31 = p 0 + ϵ 1 p 1 + ( ϵ 1 ) 2 p 2 + ( ϵ 1 ) 3 p 3 where
b 11 p 0 = ϵ 1 ϵ 2 y 21 + μ ϵ 2 a 1 y 21 + b 12 y 32
b 11 p 1 = ϵ 1 p 0 + μ ϵ 1 a 1 p 0
b 11 p 2 = ϵ 1 p 1 + μ ϵ 1 a 1 p 1
ϵ 1 p 3 + μ a 1 p 3 b 11 p 3 = ϵ 1 p 2 μ ϵ 1 a 1 p 2
p 3 ( 0 ) = p 3 ( 1 ) = 0
using the above, p 0 , p 1 , p 2 , and p 3 are found and then, from (46), | y 31 ( k ) ( x ) | C , k = 0 , 1 , | y 31 ( x ) | C ϵ 2 1 , | y 31 ( ϰ ) | C ϵ 1 1 ϵ 2 2 . By differentiating the defining equation of y 32 once and using the bounds of y 0 , y 1 , y 2 , and y 31 , the following bound y 32 ( x ) C ϵ 2 2 is obtained. Now, by choosing
r ( 0 ) = y 0 ( 0 ) + ϵ 2 y 1 ( 0 ) + ( ϵ 2 ) 2 y 2 ( 0 ) + ( ϵ 2 ) 3 y 3 ( 0 )
r ( 1 ) = y 0 ( 1 ) + ϵ 2 y 1 ( 1 ) + ( ϵ 2 ) 2 y 2 ( 1 ) + ( ϵ 2 ) 3 y 3 ( 1 )
from the above, it is derived that
| r 1 ( k ) ( ϰ ) | C , w h e r e k = 0 , 1 , 2 , | r 1 ( ϰ ) | C ϵ 1 , | r 2 ( k ) ( ϰ ) | C , w h e r e k = 0 , 1 , 2 , 3 .
Similarly,
| s 1 ( k ) ( ϰ ) | C , w h e r e k = 0 , 1 , 2 , | s 1 ( ϰ ) | C ϵ 1 , | s 2 ( k ) ( ϰ ) | C , w h e r e k = 0 , 1 , 2 , 3 .
Case (ii):  α μ 2 γ ϵ 2
Establishing the bounds of the regular components r and s , they are broken down as
r = y 0 + ϵ 2 y 1 + ϵ 2 2 y 2 + ϵ 2 3 y 3 , Ω ¯ 1 = [ 0 , 1 ]
s = z 0 + ϵ 2 z 1 + ϵ 2 2 z 2 + ϵ 2 3 z 3 , Ω ¯ 2 = [ 1 , 2 ]
where y i = y i 1 y i 2 , z i = z i 1 z i 2 ,   i = 0 , 1 , 2 , 3 .
To estimate the smooth components r ( ϰ ) and s ( ϰ ) for α μ 2 γ ϵ 2 , the decomposition of r ( ϰ ) and s ( ϰ ) is analyzed on two levels. Furthermore, the maximum principle for a linear first-order operator in the context of a terminal value problem is established. Define the operators
L 3 μ A ( ϰ ) u ( ϰ ) B ( ϰ ) u ( ϰ ) ,
L 4 μ A ( ϰ ) u ( ϰ ) B ( ϰ ) u ( ϰ ) + D ( ϰ ) u ( ϰ 1 ) .
Consider the following decompositions:
r ( ϰ ; ϵ , μ ) = i = 0 3 ϵ 2 i y i ( ϰ ; μ ) , ϰ Ω ¯ 1 , s ( ϰ ; ϵ , μ ) = i = 0 3 ϵ 2 i z i ( ϰ ; μ ) , ϰ Ω ¯ 2 ,
where y i = y i 1 y i 2 , z i = z i 1 z i 2 ,   i = 0 , 1 , 2 , 3 are defined as follows:
L 3 y 0 ( ϰ ) = g ( ϰ ) , ϰ [ 0 , 1 ) , y 0 ( 1 ) is taken ,
L 4 z 0 ( ϰ ) = f ( ϰ ) , ϰ [ 1 , 2 ) , z 0 ( 2 ) is taken ,
z 0 ( ϰ ) = y 0 ( ϰ ) , ϰ [ 0 , 1 ) ,
L 3 y 1 ( ϰ ) = m 1 ( ϰ ) , ϰ [ 0 , 1 ) ,
L 4 z 1 ( ϰ ) = n 1 ( ϰ ) , ϰ [ 1 , 2 ) ,
z 1 ( ϰ ) = y 1 ( ϰ ) , ϰ [ 0 , 1 ) ,
L 3 y 2 ( ϰ ) = m 2 ( ϰ ) , ϰ [ 0 , 1 ) , y 2 ( 1 ) = 0 ,
L 4 z 2 ( ϰ ) = n 2 ( ϰ ) , ϰ [ 1 , 2 ) , z 2 ( 2 ) = 0 ,
z 2 ( ϰ ) = y 2 ( ϰ ) , ϰ [ 0 , 1 ) ,
L 1 y 3 ( ϰ ) = m 3 ( ϰ ) , ϰ ( 0 , 1 ) , y 3 ( 0 ) = 0 , y 3 ( 1 ) = 0 ,
L 2 z 3 ( ϰ ) = n 3 ( ϰ ) , ϰ ( 1 , 2 ) , z 3 ( 1 ) = 0 , z 3 ( 2 ) = 0 ,
z 3 ( ϰ ) = y 3 ( ϰ ) , ϰ [ 0 , 1 ) .
where m i = ( m i 1 , m i 2 ) T , m i j = ϵ j ϵ 2 y i 1 j , and n i = ( n i 1 , n i 2 ) T , n i j = ϵ j ϵ 2 z i 1 j . Here, g ( ϰ ) and f ( ϰ ) are given functions, and the functions y i ( ϰ ) and z i ( ϰ ) are chosen to satisfy the boundary and continuity conditions.
Lemma 3.
Let Ψ C 1 ( [ 0 , 2 ] ) with Ψ ( 1 ) 0 and Ψ ( 2 ) 0 . If L 3 Ψ 0 on [ 0 , 1 ) and L 4 Ψ 0 on [ 1 , 2 ) , then Ψ 0 on [ 0 , 2 ] .
Proof. 
Let ϰ * be a point, where Ψ ( ϰ * ) = min ϰ [ 0 , 1 ] Ψ ( ϰ ) . Assume for contradiction that Ψ ( ϰ * ) < 0 ; this implies that ϰ * 1 and Ψ ( ϰ * ) 0 . If ϰ * [ 0 , 1 ) . Then, this can analyzed as
L 3 Ψ ( ϰ * ) = μ a ( ϰ * ) Ψ ( ϰ * ) b ( ϰ * ) Ψ ( ϰ * ) > 0 ,
which contradicts the assumption that L 3 Ψ 0 on [ 0 , 1 ) . Furthermore, if ϰ * [ 1 , 2 )
L 4 Ψ ( ϰ * ) = μ a ( ϰ * ) Ψ ( ϰ * ) b ( ϰ * ) Ψ ( ϰ * ) + d ( ϰ * ) Ψ ( ϰ * 1 ) > 0 ,
which also leads to a contradiction. Thus, Ψ ( ϰ ) 0 on [ 0 , 2 ] .
The decomposition of y 0 ( ϰ ; μ ) and z 0 ( ϰ ; μ ) is given by
y 0 ( ϰ ; μ ) = q 0 ( ϰ ) + μ q 1 ( ϰ ) + μ 2 q 2 ( ϰ ) + μ 3 q 3 ( ϰ ) , for ϰ Ω 1 ,
z 0 ( ϰ ; μ ) = ρ 0 ( ϰ ) + μ ρ 1 ( ϰ ) + μ 2 ρ 2 ( ϰ ) + μ 3 ρ 3 ( ϰ ) , for ϰ Ω 2 ,
where
B ( ϰ ) q 0 ( ϰ ) = g ( ϰ ) , for ϰ [ 0 , 1 ] ,
B ( ϰ ) ρ 0 ( ϰ ) + D ( ϰ ) q 0 ( ϰ 1 ) = f ( ϰ ) , for ϰ [ 1 , 2 ] ,
B ( ϰ ) q 1 ( ϰ ) = A ( ϰ ) q 0 ( ϰ ) , for ϰ [ 0 , 1 ] ,
B ( ϰ ) ρ 1 ( ϰ ) D ( ϰ ) q 1 ( ϰ 1 ) = A ( ϰ ) ρ 0 ( ϰ ) , for ϰ [ 1 , 2 ] ,
B ( ϰ ) q 2 ( ϰ ) = A ( ϰ ) q 1 ( ϰ ) , for ϰ [ 0 , 1 ] ,
B ( ϰ ) ρ 2 ( ϰ ) D ( ϰ ) q 2 ( ϰ 1 ) = A ( ϰ ) ρ 1 ( ϰ ) , for ϰ [ 1 , 2 ] ,
L 3 q 3 ( ϰ ) = A ( ϰ ) q 2 ( ϰ ) , for ϰ [ 0 , 1 ) , q 3 ( 1 ) = 0 ,
L 4 ρ 3 ( ϰ ) = A ( ϰ ) ρ 2 ( ϰ ) , for ϰ [ 1 , 2 ) , ρ 3 ( 2 ) = 0 ,
ρ 3 ( ϰ ) = q 3 ( ϰ ) on [ 0 , 1 ) .
Since A ( ϰ ) , B ( ϰ ) , D ( ϰ ) , and f ( ϰ ) are sufficiently smooth, it follows that
| | q 0 , 0 ( k ) | | Ω 1 C , | | q 0 , 1 ( k ) | | Ω 1 C , | | q 0 , 2 ( k ) | | Ω 1 C , for 0 k 7 ,
| | ρ 0 , 0 ( k ) | | Ω 2 C , | | ρ 0 , 1 ( k ) | | Ω 2 C , | | ρ 0 , 2 ( k ) | | Ω 2 C , for 0 k 7 .
Using Lemma 3, it can be proved that | | q 3 ( 1 ) | | C , | | q 3 ( 2 ) | | C , | | ρ 3 ( 1 ) | | C , | | ρ 3 ( 2 ) | | C . Also, from (73),
| | q 31 | | C , | | q 32 | | C , | | ρ 31 | | C and | | ρ 32 | | C .
Hence, choosing
y 0 ( 1 ) = q 0 ( 1 ) + μ q 1 ( 1 ) + μ 2 q 2 ( 1 ) , z 0 ( 2 ) = ρ 0 ( 2 ) + μ ρ 1 ( 2 ) + μ 2 ρ 2 ( 2 ) ,
yields | | y 0 ( k ) | | C for 0 k 7 and | | ρ 0 ( k ) | | C for 0 k 3 . Similarly, finding y 1 , y 2 , and y 3 and using Lemma 3, | | y 1 ( k ) | | C ( 1 + μ ( k 1 ) ) , 0 k 3 and | | y 2 ( k ) | | C μ ( k + 1 ) , 0 k 3 . Utilizing the bounds from Theorem 1, the resulting estimates are as follows:
| | y 32 | | C μ 3 , | | y 32 | | C ϵ 2 1 μ 2 , | | y 32 | | C ϵ 2 2 μ 1 .
Also, from the equation of y 31 in (65),
ϵ 1 y 31 + μ a 1 y 31 b 11 y 31 = ϵ 1 ϵ 2 y 21 b 12 y 32 ,
and these bounds are obtained
| | y 31 | | C μ 3 , | | y 31 | | C μ 4 , | | y 31 | | C ϵ 2 1 μ 3 ,   and | | y 31 | | C ( ϵ 1 1 + ϵ 2 2 μ 3 ) .
Differentiating the equation of y 32 and using the bounds of y 31 and its derivatives,
| | y 32 | | C ϵ 2 3 + C ϵ 2 1 μ 4 + C ϵ 2 2 μ 2 .
similarly,
| | z 31 | | C μ 3 , | | z 31 | | C μ 4 , | | z 31 | | C ϵ 2 1 μ 3 , | | z 31 | | C ( ϵ 1 1 + ϵ 2 2 μ 3 )
and | | z 32 | | C ϵ 2 3 + C ϵ 2 1 μ 4 + C ϵ 2 2 μ 2 .
Hence,
r ( 0 ) = y 0 ( 0 ) + ϵ 2 y 1 ( 0 ) + ϵ 2 2 y 2 ( 0 ) + ϵ 3 2 y 3 ( 0 ) , r ( 1 ) = y 0 ( 1 ) + ϵ 2 y 1 ( 1 ) ,
s ( 0 ) = y 0 ( 1 ) + ϵ 2 y 1 ( 1 ) + ϵ 2 2 y 2 ( 1 ) + ϵ 3 2 y 3 ( 1 ) , s ( 2 ) = y 0 ( 2 ) + ϵ 2 y 1 ( 2 )
and by utilizing all the aforementioned bounds, the bounds of the regular component are obtained by
| | r ( k ) | | C for k = 0 , 1 , 2 , | | r 1 | | C ϵ 1 1 , | | r 2 | | C .
Similarly, it can be determined that
| | s ( k ) | | C for k = 0 , 1 , 2 , | | s 1 | | C ϵ 1 1 , | | s 2 | | C .
The proof of the lemma is complete. □

6. Layer Functions

The functions for the layers are denoted by B i l 1 ( ϰ ) and B i r 1 ( ϰ ) , i = 1 , 2 and are specified over the interval [ 0 , 1 ] ,
B 1 l 1 ( ϰ ) = e θ 1 ϰ , α μ 2 γ ϵ 1 e λ 1 ϰ , α μ 2 γ ϵ 2 , B 1 r 1 ( ϰ ) = e θ 1 ( 1 ϰ ) , α μ 2 γ ϵ 1 e κ ( 1 ϰ ) , α μ 2 γ ϵ 2 ,
B 2 l 1 ( ϰ ) = e θ 2 ϰ , α μ 2 γ ϵ 1 e λ 2 ϰ , α μ 2 γ ϵ 2 , B 2 r 1 ( ϰ ) = e θ 2 ( 1 ϰ ) , α μ 2 γ ϵ 1
The layer functions B i l 2 ( ϰ ) , B i r 2 ( ϰ ) , i = 1 , 2 are specified over [ 1 , 2 ] ,
B 1 l 2 ( ϰ ) = e θ 1 ( ϰ 1 ) , α μ 2 γ ϵ 1 e λ 1 ( ϰ 1 ) , α μ 2 γ ϵ 2 , B 1 r 2 ( ϰ ) = e θ 1 ( 2 ϰ ) , α μ 2 γ ϵ 1 e κ ( 2 ϰ ) , α μ 2 γ ϵ 2 ,
B 2 l 2 ( ϰ ) = e θ 2 ( ϰ 1 ) , α μ 2 γ ϵ 1 e λ 2 ( ϰ 1 ) , α μ 2 γ ϵ 2 , B 2 r 2 ( ϰ ) = e θ 2 ( 2 ϰ ) , α μ 2 γ ϵ 1
where θ i = γ α ϵ i ; λ i = α μ ϵ i ; κ = γ 2 μ , for i = 1 , 2 . Following the Lemma 5 presented in [13], the points ϰ s 0 , 1 2 , which satisfy the conditions for the case α μ 2 γ ϵ 1 , can be proved.
B 1 l i ( ϰ s ) ϵ 1 s = B 2 l i ( ϰ s ) ϵ 2 s , B 1 r i ( 1 ϰ s ) ϵ 1 s = B 2 r i ( 1 ϰ s ) ϵ 2 s ,
B 1 l i ( ϰ s 1 ) ϵ 1 s = B 2 l i ( ϰ s 1 ) ϵ 2 s , and B 1 r i ( 2 ϰ s ) ϵ 1 s = B 2 r i ( 2 ϰ s ) ϵ 2 s , 0 s 3 2 .
Similarly, for the case α μ 2 γ ϵ 2 , it can be shown that there are points ϰ k , k = 1 , 2 , 3 in 0 , 1 2 such that
B 1 l i ( ϰ k ) ϵ 1 k = B 2 l i ( ϰ k ) ϵ 2 k .

7. Bounds on the Singular Component and Its Derivatives

Theorem 2.
Let w L , w R satisfy problems (16), (19) and (25), (28) for the cases α μ 2 γ ϵ 1 and α μ 2 γ ϵ 2 , respectively. Consequently, the components of w L 1 and w R 1 satisfy the following bounds on ( 0 , 1 ) .
For the case α μ 2 γ ϵ 1 ,
| w 1 L 1 ( ϰ ) | C B 2 l 1 ( ϰ ) ; | w 2 L 1 ( ϰ ) | C B 2 l 1 ( ϰ ) ; | w 1 L 1 , ( k ) ( ϰ ) | C ϵ 1 k / 2 B 1 l 1 ( ϰ ) + ϵ 2 k / 2 B 2 l 1 ( ϰ ) , k = 1 , 2 , 3 ; | w 2 L 1 , ( k ) ( ϰ ) | C ϵ 2 k / 2 B 2 l 1 ( ϰ ) , k = 1 , 2 ; | w 2 L 1 , ( 3 ) ( ϰ ) | C ϵ 2 1 ϵ 1 1 / 2 B 1 l 1 ( ϰ ) + ϵ 2 1 / 2 B 2 l 1 ( ϰ ) .
For the case α μ 2 γ ϵ 2 ,
| w 1 L 1 ( ϰ ) | C B 2 l 1 ( ϰ ) ; | w 2 L 1 ( ϰ ) | C B 2 l 1 ( ϰ ) ; | w 1 L 1 , ( k ) ( ϰ ) | C μ k ϵ 1 k B 1 l 1 ( ϰ ) + ϵ 2 k B 2 l 1 ( ϰ ) , k = 1 , 2 , 3 ; | w 2 L 1 , ( k ) ( ϰ ) | C μ k ϵ 2 k B 2 l 1 ( ϰ ) , k = 1 , 2 ; | w 2 L 1 , ( 3 ) ( ϰ ) | C μ 3 ϵ 1 ϵ 2 2 B 1 l 1 ( ϰ ) + μ 3 ϵ 2 3 B 2 l 1 ( ϰ ) .
Moreover, the components satisfy the following bounds of w R 1 . For the case α μ 2 γ ϵ 1 ,
| w 1 R 1 ( ϰ ) | C B 2 r 1 ( ϰ ) ; | w 2 R 1 ( ϰ ) | C B 2 r 1 ( ϰ ) ; | w 1 R 1 , ( k ) ( ϰ ) | C ϵ 1 k / 2 B 1 r 1 ( ϰ ) + ϵ 2 k / 2 B 2 r 1 ( ϰ ) , k = 1 , 2 , 3 ; | w 2 R 1 , ( k ) ( ϰ ) | C ϵ 2 k / 2 B 2 r 1 ( ϰ ) , k = 1 , 2 ; | w 2 R 1 , ( 3 ) ( ϰ ) | C ϵ 2 1 ϵ 1 1 / 2 B 1 r 1 ( ϰ ) + ϵ 2 1 / 2 B 2 r 1 ( ϰ ) .
For the case α μ 2 γ ϵ 2 ,
| w 1 R 1 ( ϰ ) | C ; | w 2 R 1 ( ϰ ) | C ; | w 1 R 1 , ( k ) ( ϰ ) | C μ k , k = 1 , 2 ; | w 1 R 1 , ( 3 ) ( ϰ ) | C μ 3 + C ϵ 1 1 ; | w 2 R 1 , ( k ) ( ϰ ) | C μ k , k = 1 , 2 , 3 .
Components of w L 2 and w R 2 on ( 1 , 2 ) , for the case α μ 2 γ ϵ 1 ,
| w 1 L 2 ( ϰ ) | C B 2 l 2 ( ϰ ) ; | w 2 L 2 ( ϰ ) | C B 2 l 2 ( ϰ ) ; | w 1 L 2 , ( k ) ( ϰ ) | C ϵ 1 k / 2 B 1 l 2 ( ϰ ) + ϵ 2 k / 2 B 2 l 2 ( ϰ ) , k = 1 , 2 , 3 ; | w 2 L 2 , ( k ) ( ϰ ) | C ϵ 2 k / 2 B 2 l 2 ( ϰ ) , k = 1 , 2 ; | w 2 L 2 , ( 3 ) ( ϰ ) | C ϵ 2 1 ϵ 1 1 / 2 B 1 l 2 ( ϰ ) + ϵ 2 1 / 2 B 2 l 2 ( ϰ ) .
For the case α μ 2 γ ϵ 2 ,
| w 1 L 2 ( ϰ ) | C B 2 l 2 ( ϰ ) ; | w 2 L 2 ( ϰ ) | C B 2 l 2 ( ϰ ) ; | w 1 L 2 , ( k ) ( ϰ ) | C μ k ϵ 1 k B 1 l 2 ( ϰ ) + ϵ 2 k B 2 l 2 ( ϰ ) , k = 1 , 2 , 3 ; | w 2 L 2 , ( k ) ( ϰ ) | C μ k ϵ 2 k B 2 l 2 ( ϰ ) , k = 1 , 2 ; | w 2 L 2 , ( 3 ) ( ϰ ) | C μ 3 ϵ 1 ϵ 2 2 B 1 l 2 ( ϰ ) + μ 3 ϵ 2 3 B 2 l 2 ( ϰ ) .
Moreover, the components satisfy the following bounds of w R 2 . For the case α μ 2 γ ϵ 1 ,
| w 1 R 2 ( ϰ ) | C B 2 r 2 ( ϰ ) ; | w 2 R 2 ( ϰ ) | C B 2 r 2 ( ϰ ) ; | w 1 R 2 , ( k ) ( ϰ ) | C ϵ 1 k / 2 B 1 r 2 ( ϰ ) + ϵ 2 k / 2 B 2 r 2 ( ϰ ) , k = 1 , 2 , 3 ; | w 2 R 2 , ( k ) ( ϰ ) | C ϵ 2 k / 2 B 2 r 2 ( ϰ ) , k = 1 , 2 ; | w 2 R 2 , ( 3 ) ( ϰ ) | C ϵ 2 1 ϵ 1 1 / 2 B 1 r 2 ( ϰ ) + ϵ 2 1 / 2 B 2 r 2 ( ϰ ) .
For the case α μ 2 γ ϵ 2 ,
| w 1 R 2 ( ϰ ) | C ; | w 2 R 2 ( ϰ ) | C ; | w 1 R 2 , ( k ) ( ϰ ) | C μ k , k = 1 , 2 ; | w 1 R 2 , ( 3 ) ( ϰ ) | C μ 3 + C ϵ 1 1 ; | w 2 R 2 , ( k ) ( ϰ ) | C μ k , k = 1 , 2 , 3 .
Proof. 
The bounds on w R 1 and its derivatives are established for the case α μ 2 γ ϵ 2 . In this scenario, w R 1 is decomposed over the interval ( 0 , 1 ) .
w R 1 = q 0 R 1 + ϵ 2 q 1 R 1 + ϵ 2 2 q 2 R 1 + ϵ 2 3 q 3 R 1 ,
where q i R 1 = q i 1 R 1 q i 2 R 1 , i = 0 , 1 , 2 , 3 , and their equations are given as follows:
μ A ( ϰ ) q 0 R 1 , B ( ϰ ) q 0 R 1 = 0 ; q 01 R 1 ( 1 ) = u 1 ( 1 ) v 1 ( 1 ) ; q 02 R 1 ( 1 ) = u 2 ( 1 ) v 2 ( 1 ) ,
μ A ( ϰ ) q 1 R 1 , B ( ϰ ) q 1 R 1 = ϵ 1 ϵ 2 q 01 R 1 , , q 02 R 1 , T , q 11 R 1 ( 1 ) = q 12 R 1 ( 1 ) = 0 ,
μ A ( ϰ ) q 2 R 1 , B ( ϰ ) q 2 R 1 = ϵ 1 ϵ 2 q 11 R 1 , , q 12 R 1 , T , q 21 R 1 ( 1 ) = q 22 R 1 ( 1 ) = 0 ,
ϵ 1 q 3 R 1 , + μ A ( ϰ ) q 3 R 1 , B ( ϰ ) q 3 R 1 = ϵ 1 ϵ 2 q 21 R 1 , , q 22 R 1 , T ,
q 31 R 1 ( 0 ) = q 32 R 1 ( 0 ) = 0 ; q 31 R 1 ( 1 ) = q 32 R 1 ( 1 ) = 0 .
It can be easily derived from Equations (85)–(87) that,
| q 0 R 1 , ( k ) | C μ k , 0 k 5 , | q 1 R 1 , ( k ) | C μ ( k + 2 ) , 0 k 4 ,
| q 2 R 1 , ( k ) | C μ ( k + 4 ) , 0 k 3 .
Also, from the equation of q 32 R 1 in (88) using Theorem 1 and the fact that α μ 2 γ ϵ 2 , the following can be derived:
| q 32 R 1 | C μ 6 , | q 32 R 1 , | C ϵ 2 1 μ 5 , | q 32 R 1 , | C ϵ 2 2 μ 4 .
Consider the equation of q 31 R 1 in (88), which can be written as,
ϵ 1 q 31 R 1 , + μ a 1 q 31 R 1 , b 11 q 31 R 1 = ϵ 1 ϵ 2 q 21 R 1 , b 12 q 32 R 1 .
The decomposition of q 31 R 1 is as follows:
q 31 R 1 = 0 + ϵ 1 1 + ϵ 1 2 2 + ϵ 1 3 3 ,
where i , i = 0 , 1 , 2 , 3 are characterized by,
μ a 1 0 b 11 0 = ϵ 1 ϵ 2 q 21 R 1 , b 12 q 32 R 1 , 0 ( 1 ) = 0 ,
μ a 1 1 b 11 1 = 0 , 1 ( 1 ) = 0 ,
μ a 1 2 b 11 2 = 1 , 2 ( 1 ) = 0 ,
ϵ 1 3 + μ a 1 3 b 11 3 = 2 , 3 ( 0 ) = 3 ( 1 ) = 0 .
From the above equations,
| 0 ( k ) | C μ ( 6 + k ) , k = 0 , 1 , | 0 ( k ) | C μ ( 6 + k ) + C ϵ 2 ( k 1 ) μ ( 8 k ) , k = 2 , 3 ;
| 1 ( k ) | C μ ( 8 + k ) + C ϵ 2 1 μ ( 6 + k ) , | 2 ( k ) | C μ ( 10 + k ) + C ϵ 2 2 μ ( 6 + k ) , k = 0 , 1 ;
| 1 ( k ) | C μ ( 8 + k ) + C ϵ 2 k μ ( 8 k ) + C ϵ 1 ( 2 k ) ϵ 2 ( 2 k ) μ ( k 1 ) , k = 2 , 3 ;
| 2 ( k ) | C μ ( 10 + k ) + C ϵ 2 ( k + 1 ) μ ( 8 k ) + C ϵ 1 ( 1 k ) ϵ 2 1 μ ( k + 1 ) , k = 2 , 3 .
By applying Theorem 3 of [6], the following bounds are established by
| 3 | C μ 12 + C ϵ 2 3 μ 6 + C ϵ 1 1 ϵ 2 1 μ 3 ;
| 3 ( k ) | C ϵ 1 k ( μ ( 12 k ) + ϵ 2 3 μ ( 6 k ) + ϵ 1 1 ϵ 2 1 μ ( 3 k ) ) , k = 1 , 2 , 3 .
Using 0 , 1 , 2 , and 3 , the following bounds of q 31 R 1 are obtained by
| q 31 R 1 , ( k ) | C μ ( 6 + k ) + C ϵ 2 k μ ( 6 k ) , k = 0 , 1 , 2 ;
| q 31 R 1 , ( 3 ) | C μ 9 + C ϵ 2 2 μ 5 + C ϵ 2 3 μ 3 + C ϵ 1 1 ϵ 2 1 .
Now, using the bounds of q 01 R 1 , q 11 R 1 , q 21 R 1 , and q 31 R 1 and
| q 32 R 1 , ( 3 ) | C μ 7 ϵ 2 1 + C ϵ 2 2 μ 5 + C ϵ 2 3 μ 3 ,
using the above bounds, the following bounds of w R 1 and its derivatives are found for k = 0 , 1 , 2 , 3
| w 1 R 1 , ( k ) | C μ k , k = 0 , 1 , 2 ; | w 1 R 1 , ( 3 ) | C ϵ 1 1 + C μ 3 ; | w 2 R 1 , ( k ) | C μ k .
For the case α μ 2 γ ϵ 2 , we define the barrier functions ψ ± = ψ 1 ± ψ 2 ± , where ψ i ± = C B 2 l 1 ± w i L 1 for i = 1 , 2 . It is evident that ψ i ± ( 0 ) 0 and ψ i ± ( 1 ) 0 . Additionally, L 1 ψ ± ( x ) 0 for all x in the interval ( 0 , 1 ) . Therefore, it can demonstrate that | w 1 L 1 ( ϰ ) | C B 2 l 1 ( ϰ ) and | w 2 L 1 ( ϰ ) | C B 2 l 1 ( ϰ ) .
Considering the equation of w 2 L 1 from (25),
ϵ 2 w 2 L 1 , ( ϰ ) + μ a 2 ( ϰ ) w 2 L 1 , ( ϰ ) + b 21 ( ϰ ) w 1 L 1 ( ϰ ) b 22 ( ϰ ) w 2 L 1 ( ϰ ) = 0 .
This can also be written as,
w 2 L 1 , ( ϰ ) + μ ϵ 2 a 2 ( ϰ ) w 2 L 1 , ( ϰ ) = 1 ϵ 2 b 22 ( ϰ ) w 2 L 1 ( ϰ ) 1 ϵ 2 b 21 ( ϰ ) w 1 L 1 ( ϰ ) ) 1 ϵ 2 h 2 ( ϰ ) ,
where
h 2 ( ϰ ) = b 22 ( ϰ ) w 2 L 1 ( ϰ ) b 21 ( ϰ ) w 1 L 1 ( ϰ ) .
Now, taking A 2 ( 0 ) = a 0 ,
w 2 L 1 , ( ϰ ) = w 2 L 1 , ( 0 ) e μ ϵ 2 ( A 2 ( ϰ ) a 0 ) + ϵ 2 1 0 x h 2 ( s ) e μ ϵ 2 ( A 2 ( s ) A 2 ( ϰ ) ) d s ,
where A 2 ( ϰ ) is the indefinite integral of a 2 ( ϰ ) . Using the bounds on u , it is established that | w 2 L 1 , ( 0 ) | C ϵ 2 1 . Using the inequality e μ ϵ 2 ( A 2 ( s ) A 2 ( ϰ ) ) e μ ϵ 2 β ( ϰ s ) and applying integration by parts, it is derived from the above that
| w 2 L 1 , ( ϰ ) | C ϵ 2 1 B 2 l 1 ( ϰ ) .
Using a similar argument, it can be
| w 1 L 1 , ( ϰ ) | C ϵ 1 1 B 1 l 1 ( ϰ ) + C ϵ 2 1 B 2 l 1 ( ϰ ) .
Differentiating the equation and using a similar procedure as above, it can be shown that
| w 1 L 1 , ( ϰ ) | C ϵ 1 2 B 1 l 1 ( ϰ ) + C ϵ 2 2 B 2 l 1 ( ϰ ) .
Similarly,
| w 1 L 1 , ( ϰ ) | C ϵ 1 3 B 1 l 1 ( ϰ ) + C ϵ 2 3 B 2 l 1 ( ϰ ) .
The bounds on w 2 L 1 , ( ϰ ) can be obtained from the equation of w 2 L 1 in (25) and the bounds on w 2 L 1 ( x ) , w 2 L 1 , ( x ) , and w 1 L 1 ( x ) . The bound on w 1 L 1 , is obtained by differentiating the equation of w 1 L 1 in (25) twice and using a similar argument as above. Now, by differentiating the defining equation of w 2 L 1 in (25) once and using the bounds on w 2 L 1 , ( ϰ ) , w 1 L 1 , ( ϰ ) and w 2 L 1 , ( ϰ ) , the following can be derived below
| w 2 L 1 , ( ϰ ) | C ϵ 2 1 ϵ 1 1 B 1 l 1 ( ϰ ) + ϵ 2 2 B 2 l 2 ( ϰ ) .
It has been established that
| w 1 L 1 , ( ϰ ) | C ϵ 1 1 B 1 l 1 ( ϰ ) + ϵ 2 1 B 2 l 1 ( ϰ ) .
Consequently,
| L 1 w 1 L 1 ( ϰ ) | C μ ϵ 1 B 1 l 1 ( ϰ ) + μ ϵ 2 B 2 l 1 ( ϰ ) ,
where
L 1 w 1 L 1 , ( ϰ ) ϵ 1 ( w 1 L 1 , ) ( ϰ ) + μ a 1 ( ϰ ) ( w 1 L 1 , ) ( ϰ ) b 11 ( ϰ ) w 1 L 1 , ( ϰ ) = μ a 1 ( ϰ ) w 1 L 1 , ( ϰ ) b 12 ( ϰ ) w 2 L 1 , ( ϰ ) b 12 ( ϰ ) w 2 L 1 ( ϰ ) + b 11 ( ϰ ) w 1 L 1 ( ϰ ) .
By introducing the barrier function
ψ ± ( ϰ ) = C μ ϵ 1 B 1 l 1 ( ϰ ) + μ ϵ 2 B 2 l 1 ( ϰ ) ± w 1 L 1 , ( ϰ ) ,
it can be demonstrated that ψ ± 0 on [ 0 , 1 ] and L 1 ψ ± ( ϰ ) 0 on [ 0 , 1 ] , which implies
| w 1 L 1 , ( ϰ ) | C μ ϵ 1 B 1 l 1 ( ϰ ) + μ ϵ 2 B 2 l 1 ( ϰ ) ,
By introducing another barrier function
ϕ ± ( ϰ ) = C μ ϵ 1 2 B 1 l 1 ( ϰ ) + μ ϵ 2 2 B 2 l 1 ( ϰ ) ± w 1 L 1 , ( ϰ ) ,
it is derived that
| w 1 L 1 , ( ϰ ) | C μ ϵ 1 2 B 1 l 1 ( ϰ ) + ϵ 2 2 B 2 l 1 ( ϰ )
| w 2 L 1 , ( ϰ ) | C μ 2 ϵ 2 2 B 2 l 1 ( ϰ ) .
By differentiating the equations of w 1 L 1 and w 2 L 1 once and applying the bounds of w 1 L 1 , , w 1 L 1 , , w 2 L 1 , , and w 2 L 1 , , it is found that
| w 1 L 1 , ( ϰ ) | C μ 3 ϵ 1 3 B 1 l 1 ( ϰ ) + μ 3 ϵ 1 ϵ 2 2 B 2 l 1 ( ϰ ) ,
| w 2 L 1 , ( ϰ ) | C μ 3 ϵ 1 ϵ 2 2 B 1 l 1 ( ϰ ) + μ 3 ϵ 2 3 B 2 l 1 ( ϰ ) .
Similarly, analogous results can be derived for w L 2 on [ 1 , 2 ] .
Next, the bounds on w L 1 for the case α μ 2 γ ϵ 1 are derived. The bounds on w 1 L 1 ( ϰ ) and w 2 L 1 ( ϰ ) can be derived by defining the barrier functions
ψ i ± ( ϰ ) = C B 2 l 1 ( ϰ ) ± w i L 1 ( ϰ ) , i = 1 , 2 .
To bound w 1 L 1 , ( ϰ ) and w 2 L 1 , ( ϰ ) , the argument proceeds as follows, and from the equation of w 2 L 1 in Equation (16) and Theorem 1, it is obtained that | w 2 L 1 , ( ϰ ) | C ϵ 2 1 / 2 B 2 l 1 ( ϰ ) . From the equation of w 1 L 1 in (16) and Theorem 1, | w 1 L 1 , ( ϰ ) | C ϵ 1 1 / 2 B 2 l 1 ( ϰ ) . To improve the above bound on | w 1 L 1 ( ϰ ) | , proceed with the following and differentiate w 1 L 1 in (16) once, obtaining
| L 1 w 1 L 1 , ( ϰ ) | C ϵ 2 1 / 2 B 2 l 1 ( x ) ,
To establish the necessary bounds, define the barrier functions as follows:
ϕ i ± ( x ) = C ϵ 1 1 / 2 B 1 l 1 ( ϰ ) + ϵ 2 1 / 2 B 2 l 1 ( ϰ ) ± w i L 1 , ( ϰ ) , i = 1 , 2
and apply the minimum principle for the operator L 1 . The bound on w 2 L 1 , ( ϰ ) is obtained from the equation of w 2 L 1 in (16). To bound w 1 L 1 , ( ϰ ) and w 1 L 1 , ( ϰ ) , the defining equation of w 1 L 1 in (16) is differentiated twice and thrice, respectively, and an argument analogous to the one used to bound w 1 L 1 , ( ϰ ) leads to the required bounds. The bound on w 2 L 1 , ( ϰ ) is obtained by differentiating the defining equation of w 2 L 1 in (16) once and using the bounds of w 1 L 1 , ( ϰ ) , w 2 L 1 , ( ϰ ) , w 1 L 1 , ( ϰ ) , and w 2 L 1 , ( ϰ ) ; it can be seen that
| w 1 L 1 , ( ϰ ) | C ϵ 1 3 / 2 B 1 l 1 ( ϰ ) + ϵ 2 3 / 2 B 2 l 1 ( ϰ ) ,
| w 2 L 1 , ( ϰ ) | C ϵ 2 1 ϵ 1 1 / 2 B 1 l 1 ( ϰ ) + ϵ 2 1 / 2 B 2 l 1 ( ϰ ) .
Similarly, using an analogous way, it can be derived for w L 2 on [1,2].
For the case α μ 2 γ ϵ 1 , the bounds on w R 2 are obtained by the above analogous arguments to those applied in bounding w L . The proof of the theorem is complete. □

8. Sharper Bounds for w 1 L 1 , w 2 L 1 , w 1 L 2 , and w 2 L 2

To achieve sharper bounds on the derivatives of the singular components w 1 L 1 , w 2 L 1 , w 1 L 2 , and w 2 L 2 , decompose these components further for [0,1] and [1,2]. This refinement will help to demonstrate the nearly first-order convergence of the proposed method. Now, focusing on the case α μ 2 γ ϵ 2 . For w L 1 and w L 2 , decompose it as follows: w L 1 ( ϰ ) = w 1 L 1 ( ϰ ) + w 2 L 1 ( ϰ ) on [0,1] and w L 2 ( ϰ ) = w 1 L 2 ( ϰ ) + w 2 L 2 ( ϰ ) on [1,2]. Decompose of w 1 L 1 ( ϰ )
w 1 L 1 ( ϰ ) = w 11 L 1 ( ϰ ) + w 12 L 1 ( ϰ )
where
w 11 L 1 ( ϰ ) = k = 0 3 ( ( ϰ ϰ 2 ) k k ! ) w 1 L 1 , ( k ) ( ϰ 2 ) for ϰ [ 0 , ϰ 2 ) w 1 L 1 ( ϰ ) for ϰ [ ϰ 2 , 1 ]
w 12 L 1 ( ϰ ) = w 1 L 1 ( ϰ ) w 11 L 1 ( ϰ ) .
Decompose of w 2 L 1 ( ϰ )
w 2 L 1 ( ϰ ) = w 21 L 1 ( ϰ ) + w 22 L 1 ( ϰ )
where
w 21 L 1 ( ϰ ) = k = 0 3 ( ( ϰ ϰ 1 ) k k ! ) w 2 L 1 , ( k ) ( ϰ 1 ) for ϰ [ 0 , ϰ 1 ) w 2 L 1 ( ϰ ) for ϰ [ ϰ 1 , 1 ]
w 22 L 1 ( ϰ ) = w 2 L 1 ( ϰ ) w 21 L 1 ( ϰ ) .
Decompose of w 1 L 2 ( ϰ )
w 1 L 2 ( ϰ ) = w 11 L 2 ( ϰ ) + w 12 L 2 ( ϰ )
where
w 11 L 2 ( ϰ ) = k = 0 3 ( ( ϰ ϰ 2 ) k k ! ) w 1 L 2 , ( k ) ( ϰ 2 ) for ϰ [ 1 , ϰ 2 ) w 1 L 2 ( ϰ ) for ϰ [ x 2 , 2 ]
w 12 L 2 ( ϰ ) = w 1 L 2 ( ϰ ) w 11 L 2 ( ϰ ) .
Decompose of w 2 L 2 ( ϰ )
w 2 L 2 ( ϰ ) = w 21 L 2 ( ϰ ) + w 22 L 2 ( ϰ )
where
w 21 L 2 ( ϰ ) = k = 0 3 ( ( x x 1 ) k k ! ) w 2 L 2 , ( k ) ( ϰ 1 ) for ϰ [ 1 , ϰ 1 ) w 2 L 2 ( ϰ ) for ϰ [ ϰ 1 , 2 ]
w 22 L 2 ( ϰ ) = w 2 L 2 ( ϰ ) w 21 L 2 ( ϰ ) .
Lemma 4.
Given the decompositions of w 11 L 1 , w 12 L 1 , w 21 L 1 , and w 22 L 1 , the following bounds hold on [0,1]:
| w 11 L 1 , ( ϰ ) | C μ 3 ϵ 1 1 ϵ 2 2 B 2 l 1 ( ϰ ) , | w 12 L 1 , ( ϰ ) | C μ 2 ϵ 1 2 B 1 l 1 ( ϰ ) , | w 21 L 1 , ( ϰ ) | C μ 3 ϵ 2 3 B 2 l 1 ( ϰ ) , | w 22 L 1 , ( ϰ ) | C μ 2 ϵ 2 2 B 2 l 1 ( ϰ ) .
Similarly, the decompositions of w 11 L 2 , w 12 L 2 , w 21 L 2 and w 22 L 2 , the following bounds hold on [1,2]:
| w 11 L 2 , ( ϰ ) | C μ 3 ϵ 1 1 ϵ 2 2 B 2 l 2 ( ϰ ) , | w 12 L 2 , ( ϰ ) | C μ 2 ϵ 1 2 B 1 l 2 ( ϰ ) , | w 21 L 2 , ( ϰ ) | C μ 3 ϵ 2 3 B 2 l 2 ( ϰ ) , | w 22 L 2 , ( ϰ ) | C μ 2 ϵ 2 2 B 2 l 2 ( ϰ ) .
Proof. 
For w 11 L 1 , ( ϰ ) ,
On [ 0 , x 2 )
| w 11 L 1 , ( ϰ ) | = | w 1 L 1 , ( ϰ 2 ) | C μ 3 ( ϵ 1 3 B 1 l 1 ( ϰ 2 ) + ϵ 1 1 ϵ 2 2 B 2 l 1 ( ϰ 2 ) ) C μ 3 ϵ 1 1 ϵ 2 2 B 2 l 1 ( ϰ ) .
On [ ϰ 2 , 1 ]
| w 11 L 1 , ( ϰ ) | = | w 1 L 1 , ( ϰ ) | C μ 3 ϵ 1 1 ϵ 2 2 B 2 l 1 ( ϰ ) .
For w 21 L 1 , ( ϰ ) , On [ 0 , ϰ 1 )
| w 21 L 1 , ( ϰ ) | = | w 2 L 1 , ( ϰ 1 ) | C μ 3 ϵ 2 2 ( ϵ 1 1 B 1 l 1 ( ϰ 1 ) + ϵ 2 1 B 2 l 1 ( ϰ 1 ) ) C μ 3 ϵ 2 3 B 2 l 1 ( ϰ ) .
On [ ϰ 1 , 1 ]   | w 21 L 1 , ( ϰ ) | = | w 2 L 1 , ( ϰ ) | C μ 3 ϵ 2 3 B 2 l 1 ( ϰ ) .
For w 12 L 1 , ( ϰ ) and w 12 L 2 , ( ϰ ) , similar bounds are obtained. For [1,2], w 11 L 2 , ( ϰ ) is considered and on [ 1 , ϰ 2 )
| w 11 L 2 , ( ϰ ) | = | w 1 L 2 , ( ϰ 2 ) | C ( μ 3 ϵ 1 3 B 1 l 2 ( ϰ 2 ) + ϵ 1 1 ϵ 2 2 B 2 l 2 ( ϰ 2 ) ) C μ 3 ϵ 1 1 ϵ 2 2 B 2 l 2 ( ϰ ) .
On [ ϰ 2 , 2 ]
| w 11 L 2 , ( ϰ ) | = | w 1 L 2 , ( ϰ ) | C μ 3 ϵ 1 1 ϵ 2 2 B 2 l 1 ( ϰ ) .
For w 21 L 2 , ( ϰ ) , on [ 1 , ϰ 1 )
| w 21 L 2 , ( ϰ ) | = | w 2 L 2 , ( ϰ 1 ) | C μ 3 ϵ 2 2 ( ϵ 1 1 B 1 l 2 ( ϰ 1 ) + ϵ 2 1 B 2 l 2 ( ϰ 1 ) ) C μ 3 ϵ 2 3 B 2 l 2 ( ϰ ) .
On [ ϰ 1 , 2 ]
| w 21 L 2 , ( ϰ ) | = | w 2 L 2 , ( ϰ ) | C μ 3 ϵ 2 3 B 2 l 2 ( ϰ ) .
For w 12 L 2 , ( ϰ ) and w 12 L 2 , ( ϰ ) , similar bounds are obtained. Similarly, find the sharper bounds for the case α μ 2 γ ϵ 1 . In this scenario, the decomposition of w 1 L 1 and w 1 L 2 remains as before. The proof of the lemma is complete. □
Lemma 5.
Given the decompositions of w 11 L 1 , w 12 L 1 , w 21 L 1 , and w 22 L 1 , the following bounds hold on [0,1]:
| w 11 L 1 , ( ϰ ) | C ϵ 2 3 2 B 2 l 1 ( ϰ ) , | w 12 L 1 , ( ϰ ) | C ϵ 1 1 B 1 l 1 ( ϰ ) + ϵ 2 1 B 2 l 1 ( ϰ ) , | w 21 L 1 , ( ϰ ) | C ϵ 2 3 2 B 2 l 1 ( ϰ ) , | w 22 L 1 , ( ϰ ) | C ϵ 2 1 B 2 l 1 ( ϰ ) ,
and given the decompositions of w 11 L 2 , w 12 L 2 , w 21 L 2 , and w 22 L 2 , the following bounds hold for [1,2]:
| w 11 L 2 , ( ϰ ) | C ϵ 2 3 2 B 2 l 2 ( ϰ ) , | w 12 L 2 , ( ϰ ) | C ϵ 1 1 B 1 l 2 ( ϰ ) + ϵ 2 1 B 2 l 1 ( ϰ ) , | w 21 L 2 , ( ϰ ) | C ϵ 2 3 2 B 2 l 2 ( ϰ ) , | w 22 L 2 , ( ϰ ) | C ϵ 2 1 B 2 l 2 ( ϰ ) .
Proof. 
The proof follows the same logic as Lemma 4. □
Analogously, the decompositions can be made for w R 1 and w R 2 in both cases. Corresponding bounds for these components can be similarly demonstrated in a similar manner.

9. Numerical Method

This section presents the proposed numerical method for solving (1) and utilizing a Shishkin mesh for the discretization.
For the cases α μ 2 γ ϵ 1 and α μ 2 γ ϵ 2 , appropriate Shishkin meshes are developed over interval [ 0 , 2 ] .
Case (i): α μ 2 γ ϵ 1
In this case, the Shishkin mesh for Ω ¯ N over the interval [ 0 , 2 ] is determined by the transition parameters 1 and 2 . The interval [ 0 , 2 ] is partitioned into the subintervals [ 0 , 1 ] , [ 1 , 2 ] , [ 2 , 1 2 ] , [ 1 2 , 1 1 ] , [ 1 1 , 1 ] , [ 1 , 1 + 1 ] , [ 1 + 1 , 1 + 2 ] , [ 1 + 2 , 2 2 ] , [ 2 2 , 2 1 ] , and [ 2 1 , 2 ] , where 1 and 2 are defined as,
2 = min 1 4 , 2 ϵ 2 γ α ln N , 1 = min τ 2 2 , 2 ϵ 1 γ α ln N .
Each of the intervals [ 0 , 1 ] , [ 1 , 2 ] , [ 1 2 , 1 1 ] , [ 1 1 , 1 ] , [ 1 , 1 + 1 ] , [ 1 + 1 , 1 + 2 ] , [ 2 2 , 2 1 ] , and [ 2 1 , 2 ] are divided into N 16 subintervals, while the intervals [ 2 , 1 2 ] and [ 1 + 2 , 2 2 ] are divided into N 4 subintervals. When 2 = 1 4 and 1 = 1 8 , the mesh is uniform. Let H 1 , H 2 , and H 3 denote the step sizes on the intervals [ 0 , 1 ] , [ 1 , 2 ] , and [ 2 , 1 2 ] , respectively. Thus, H 1 = 16 1 N , H 2 = 16 ( 2 1 ) N , H 3 = 4 ( 1 2 2 ) N . The step sizes in the intervals [ 1 2 , 1 1 ] and [ 1 1 , 1 ] are H 2 and H 1 , respectively. Based on the selection for 1 and 2 , there are four possible meshes in this case.
Case (ii): α μ 2 γ ϵ 2
In this case, the Shishkin mesh for Ω ¯ N on [ 0 , 2 ] is defined by the transition parameters 1 , 2 , and σ 1 . The interval [ 0 , 2 ] is divided into the subintervals [ 0 , 1 ] , [ 1 , 2 ] , [ 2 , 1 σ 1 ] , [ 1 σ 1 , 1 ] , [ 1 , 1 + 1 ] , [ 1 + 1 , 1 + 2 ] , [ 1 + 2 , 2 σ 1 ] , and [ 2 σ 1 , 2 ] , where 1 , 2 , and σ 1 are defined as
2 = min 1 4 , ϵ 2 μ α ln N , 1 = min τ 2 2 , ϵ 1 μ α ln N , σ 1 = min 1 4 , μ γ ln N .
Each of the intervals [ 0 , 1 ] , [ 1 , 2 ] , [ 1 , 1 + 1 ] , and [ 1 + 1 , 1 + 2 ] is divided into N 16 subintervals, the intervals [ 1 σ 1 , 1 ] and [ 2 σ 1 , 2 ] are divided into N 8 subintervals, and the intervals [ 2 , 1 σ 1 ] and [ 1 + 2 , 2 σ 1 ] are divided into N 4 subintervals. Let the step length for each of the intervals be [ 0 , 1 ] , [ 1 , 2 ] , [ 2 , 1 σ 1 ] , and let [ 1 σ 1 , 1 ] be denoted by H 1 , H 2 , H 3 , and H 4 , respectively. Thus, H 1 = 16 1 N , H 2 = 16 ( 2 1 ) N , H 3 = 4 ( 1 σ 1 2 ) N , H 4 = 8 σ 1 N . Although there are eight possible meshes Ω ¯ N resulting from the various options for the transition parameters, τ 2 = 1 4 , σ 1 should take the value 1 4 . Otherwise, the case of inequality α μ 2 γ ϵ 2 would be true, leading to a contradiction. Therefore, there are only six possible meshes in this case.

10. The Discrete Problem

The discrete problem is defined as follows:
L N U ( ϰ j ) E δ 2 U ( ϰ j ) + μ A ( ϰ j ) D + U ( ϰ j ) B ( ϰ j ) U ( ϰ j ) + D ( ϰ j ) U ( ϰ j 1 ) = f ( ϰ j ) on Ω N , 0 j N 1 ,
with boundary conditions specified as follows:
U ( ϰ j 1 ) = φ ( ϰ j 1 ) , for 0 j N 2 , U ( ϰ N ) = u ( ϰ N ) .
Let
L 1 N U ( ϰ j ) = E δ 2 U ( ϰ j ) + μ A ( ϰ j ) D + U ( ϰ j ) B ( ϰ j ) U ( ϰ j ) = g ( ϰ j ) on Ω 1 N ,
L 2 N U ( ϰ j ) = E δ 2 U ( ϰ j ) + μ A ( ϰ j ) D + U ( ( ϰ j ) B ( ϰ j ) U ( ϰ j ) + D ( ϰ j ) U ( ϰ j 1 ) = f ( ϰ j ) on Ω 2 N .
The discrete derivatives are defined as
D + U ( ϰ j ) = U ( ϰ j + 1 ) U ( ϰ j ) h j + 1 , D U ( ϰ j ) = U ( ϰ j ) U ( ϰ j 1 ) h j ,
δ 2 U ( ϰ j ) = 1 h ¯ j ( D + U ( ϰ j ) D U ( ϰ j ) ) ,
with h j = ϰ j ϰ j 1 , h ¯ j = h j + h j + 1 2 , ϰ j Ω ¯ N .

11. Numerical Results

This section establishes a discrete minimum principle, a discrete stability result, and the first-order convergence of the proposed numerical method.
Lemma 6.
(Discrete Minimum Principle) Assume that the mesh function Ψ ( ϰ j ) satisfies Ψ ( ϰ 0 ) 0 and Ψ ( ϰ N ) 0 . Then, if L 1 N Ψ ( ϰ j ) 0 for 1 j N 2 1 , L 2 N Ψ ( ϰ j ) 0 for N 2 j N 1 , and D + Ψ ( ϰ N 2 ) D Ψ ( ϰ N 2 ) 0 , it implies that Ψ ( ϰ j ) 0 for all 0 j N .
Proof. 
Let i * and j * be such that Ψ i * ( ϰ j * ) = min i , j Ψ i ( ϰ j ) and suppose Ψ i * ( ϰ j * ) < 0 . Then, j * { 0 , N } , Ψ i * ( ϰ j * ) Ψ i * ( ϰ j * + 1 ) , and Ψ i * ( ϰ j * ) Ψ i * ( ϰ j * 1 ) .Therefore, δ 2 Ψ i * ( ϰ j * ) 0 . Conside the two cases, for 1 j * N 2 1 , if ϰ j * Ω 1 N , then
( L 1 N Ψ ) i * ( ϰ j * ) = ϵ i * δ 2 Ψ i * ( ϰ j * ) + μ a i * ( ϰ j * ) D + Ψ i * ( ϰ j * ) j = 1 2 b i * j ( ϰ j * ) Ψ j ( ϰ j * ) > 0
which is a contradiction, which gives ( L 1 N Ψ ) i * ( ϰ j * ) 0 . For N 2 j * N 1 ,if ϰ j * Ω 2 N , then
( L 2 N Ψ ) i * ( ϰ j * ) = ϵ i * δ 2 Ψ i * ( ϰ j * ) + μ a i * ( ϰ j * ) D + Ψ i * ( ϰ j * ) j = 1 2 b i * j ( ϰ j * ) Ψ j ( ϰ j * ) d i * ( x j * ) Ψ i * ( ϰ j * 1 ) > 0
which is a contradiction, which gives ( L 2 N Ψ ) i * ( ϰ j * ) 0 . The only remaining possibility is that ϰ j * = ϰ N 2 . Thus, by hypothesis, it follows that
D Ψ i * ( ϰ N 2 ) 0 and D + Ψ i * ( ϰ N 2 ) 0 .
This implies
D + Ψ i * ( ϰ N 2 ) D Ψ i * ( ϰ N 2 ) 0 ,
and since D Ψ i * ( ϰ N 2 ) 0 D + Ψ i * ( ϰ N 2 ) , it follows that
D + Ψ i * ( ϰ N 2 ) D Ψ i * ( ϰ N 2 ) .
Consequently, it follows that
Ψ i * ( ϰ N 2 1 ) = Ψ i * ( ϰ N 2 ) = Ψ i * ( ϰ N 2 + 1 ) < 0 .
Now, consider the operator acting on the solution at ϰ N / 2 1
( L 1 N Ψ ) i * ( ϰ N 2 1 ) = ϵ i * δ 2 Ψ i * ( ϰ N 2 1 ) + a i * ( ϰ N 2 1 ) Ψ i * ( ϰ N 2 1 ) j = 1 2 b i * j ( ϰ N 2 1 ) Ψ j ( ϰ N 2 1 ) = ϵ i * δ 2 Ψ i * ( ϰ N 2 1 ) j = 1 , j i * 2 b i * j ( ϰ N 2 1 ) Ψ i * ( ϰ N / 2 1 ) > 0 ,
leading to a contradiction, implying that Ψ ( ϰ j ) 0 for all 0 j N . □
Lemma 7.
(Discrete Stability Result) If Ψ ( ϰ j ) is any mesh function, then
| Ψ i ( ϰ j ) | max | Ψ ( ϰ 0 ) | , | Ψ ( ϰ N ) | , max 1 j N 2 1 | L 1 N Ψ ( ϰ j ) | , max N 2 j N 1 | L 2 N Ψ ( ϰ j ) | .

Error Estimate

Analogous to the continuous case, the discrete solution U can be decomposed into V and W as defined below.
L 1 N V 1 ( ϰ j ) = g ( ϰ j ) , for 0 < j < N 2 1 , V 1 ( ϰ 0 ) = r ( 0 ) , V 1 ϰ N 2 = r ( 1 ) ,
L 2 N V 2 ( ϰ j ) = f ( ϰ j ) , for N 2 < j < N 1 , V 2 ϰ N 2 = s ( 1 ) , V 2 ( ϰ N ) = s ( 2 ) ,
V 2 ( ϰ j 1 ) = V 1 ϰ j N 2 , for N 2 j < N ,
L 1 N W L 1 ( ϰ j ) = 0 , for 0 < j < N 2 1 , W L 1 ( ϰ 0 ) = w L 1 ( 0 ) , W L 1 ϰ N 2 = w L 1 ( 1 ) ,
L 2 N W L 2 ( ϰ j ) = 0 , for N 2 < j < N 1 , W L 2 ϰ N 2 = w L 2 ( 1 ) , W L 2 ( ϰ N ) = w L 2 ( 2 ) ,
W L 1 ( ϰ j 1 ) = W L 1 ϰ j N 2 , for N 2 j < N .
It is clear that
V ( ϰ j ) = V 1 ( ϰ j ) , for 0 j N 2 1 V 2 ( ϰ j ) , for N 2 j N ,
W L ( ϰ j ) = W L 1 ( ϰ j ) , for 0 j N 2 1 W L 2 ( ϰ j ) , for N 2 j N .
Lemma 8.
If v is the solution of (10), (13), (22) and V is the solution of (102) and (103), then
| ( V v ) ( ϰ j ) | C N 1 , for 0 j N .
Proof. 
v ( ϰ ) = r ( ϰ ) , for ϰ [ 0 , 1 ) s ( ϰ ) , for ϰ [ 1 , 2 ]
Hence,
| ( V v ) ( ϰ j ) | = | ( V 1 r ) ( ϰ j ) | , for 0 j N 2 1 | ( V 2 s ) ( ϰ j ) | , for N 2 j N .
L 1 N ( V r ) ( x j ) = g ( ϰ j ) L 1 N r ( ϰ j ) = ( L 1 L 1 N ) r ( ϰ j )
= E d 2 d ϰ 2 δ 2 r ( ϰ j ) + μ d d ϰ D + A ( ϰ j ) r ( x j )
= ϵ 1 d 2 d ϰ 2 δ 2 r 1 ( ϰ j ) + μ a 1 ( ϰ j ) d d ϰ D + r 1 ( x j ) ϵ 2 d 2 d ϰ 2 δ 2 r 2 ( ϰ j ) + μ a 2 ( ϰ j ) d d ϰ D + r 2 ( ϰ j )
Determining the local truncation error
ϵ i d 2 d ϰ 2 δ 2 r i ( ϰ j ) + μ a i ( ϰ j ) d d ϰ D + r i ( ( ϰ j ) C ( ϰ j + 1 ϰ j 1 ) ( ϵ i r i + μ r i ) ,
for i = 1 , 2 . It is established that ( ϰ j + 1 ϰ j 1 ) C N 1 . In this case α μ 2 γ ϵ 1 , from (53) and (54),
| L 1 N ( V 1 r ) ( ϰ j ) | C N 1 ϵ 1 r 1 + μ r 1 ϵ 2 r 2 + μ r 2
C N 1 ϵ 1 C ϵ 1 1 / 2 + μ C ϵ 2 C + μ C
C N 1 C ϵ 1 1 / 2 + μ C ϵ 2 C + μ C C N 1
| L 2 N ( V 1 s ) ( ϰ j ) | C N 1 ϵ 1 s 1 + μ s 1 ϵ 2 s 2 + μ s 2
C N 1 ϵ 1 C ϵ 1 1 / 2 + μ C ϵ 2 C + μ C C N 1 .
Using Lemma 7, consider the mesh function,
Ψ ± ( ϰ j ) = C N 1 ( e T ) ± ( V 1 r ) ( ϰ j ) , 0 j N 2 .
Provided that the value of C is sufficiently large, it follows that L 1 N Ψ ± ( ϰ j ) 0 , for   1 j N 2 1 , Ψ ± ( ϰ 0 ) 0 , and Ψ ± ( ϰ N 2 ) 0 .
| ( V 1 r ) ( ϰ j ) | C N 1 , for 0 j N 2 .
Similarly,
| ( V 1 s ) ( ϰ j ) | C N 1 , for N 2 j N .
For the case α μ 2 γ ϵ 2
| ( V 2 r ) ( ϰ j ) | C N 1 , for 0 j N 2 .
Similarly,
| ( V 2 s ) ( ϰ j ) | C N 1 , for N 2 j N .
It can be stated that for both cases,
| ( V v ) ( ϰ j ) | = | ( V 1 r ) ( ϰ j ) | C N 1 , for 0 j N 2 | ( V 2 r ) ( ϰ j ) | C N 1 , for 0 j N 2 | ( V 1 s ) ( ϰ j ) | C N 1 , for N 2 j N | ( V 2 s ) ( ϰ j ) | C N 1 , for N 2 j N .
Thus,
| ( V v ) ( ϰ j ) | C N 1 , for 0 j N .
The proof of the lemma is complete. □
The bounds on the error in the singular components w L 1 and w L 2 are estimated for the case α μ 2 γ ϵ 2 , utilizing the mesh functions defined on Ω ¯ N ,
B 1 ( l p , N ) ( ϰ j ) = i = 1 j 1 + α μ h i 2 ϵ 1 1 , B 2 ( l p , N ) ( ϰ j ) = i = 1 j 1 + α μ h i 2 ϵ 2 1 ,
with B 1 ( l p , N ) ( ϰ 0 ) = B 2 ( l p , N ) ( ϰ 0 ) = 1 for p = 1,2.
Lemma 9.
For the case α μ 2 γ ϵ 2 , the layer components W L 1 and W L 2 satisfy the following bounds on Ω ¯ N :
| W 1 L 1 ( ϰ j ) | C B 2 ( l 1 , N ) ( ϰ j ) , | W 1 L 2 ( ϰ j ) | C B 2 ( l 2 , N ) ( ϰ j )
| W 2 L 1 ( ϰ j ) | C B 2 ( l 1 , N ) ( ϰ j ) , | W 2 L 2 ( ϰ j ) | C B 2 ( l 2 , N ) ( ϰ j ) .
Proof. 
This result can be demonstrated by defining the mesh functions ψ i ± ( ϰ j ) = C B 2 ( l p , N ) ( ϰ j ) ± W i L 1 ( ϰ j ) ; ψ i ± ( ϰ j ) = C B 2 ( l p , N ) ( ϰ j ) ± W i L 2 ( ϰ j ) ; i = 1, 2; and p = 1, 2 and noticing that ψ i ± ( ϰ 0 ) 0 and ψ i ± ( ϰ N ) 0 . Furthermore, ( L 1 N ψ ± ) i ( ϰ j ) 0 , and ( L 2 N ψ ± ) i ( ϰ j ) 0 , j = 1 , 2 , , N 1 . Therefore, the discrete minimum principle provides the desired outcome. The proof of the lemma is complete. □
Lemma 10.
Let w L 1 and w L 2 satisfy (25), and let W L 1 and W L 2 satisfy (104) and (105). Then,
W L 1 w L 1 C N 1 ln N .
W L 2 w L 2 C N 1 ln N .
Proof. 
The local truncation error is given by
| L 1 N ( W L 1 w L 1 ) | C ( ϰ j + 1 ϰ j 1 ) ϵ 1 w 1 L 1 , D + μ w 1 L 1 , D ϵ 2 w 2 L 1 , D + μ w 2 L 1 , D
| L 2 N ( W L 2 w L 2 ) | C ( ϰ j + 1 ϰ j 1 ) ϵ 1 w 1 L 2 , D + μ w 1 L 2 , D ϵ 2 w 2 L 2 , D + μ w 2 L 2 , D
where D = [ ϰ j 1 , ϰ j + 1 ] . When 2 = 1 4 , 1 = 1 8 and σ 1 = 1 4 , the mesh Ω ¯ N is uniform; then, the value of h = N 1 . In this instance, μ ϵ 1 1 C ln N , μ ϵ 2 1 C ln N , and μ 1 C ln N .
| L 1 N ( W L 1 w L 1 ) | C N 1 μ 3 1 ϵ 1 2 B 1 l 1 ( ϰ j 1 ) + 1 ϵ 2 2 B 2 l 1 ( ϰ j 1 ) 1 ϵ 1 1 ϵ 2 B 1 l 1 ( ϰ j 1 ) + 1 ϵ 2 2 B 2 l 1 ( ϰ j 1 )
| L 2 N ( W L 2 w L 2 ) | C N 1 μ 3 1 ϵ 1 2 B 1 l 2 ( ϰ j 1 ) + 1 ϵ 2 2 B 2 l 2 ( x j 1 ) 1 ϵ 1 1 ϵ 2 B 1 l 2 ( ϰ j 1 ) + 1 ϵ 2 2 B 2 l 2 ( ϰ j 1 )
Develop the mesh functions ϕ that were specified in Ω ¯ N by
ϕ 1 ( ϰ j ) = C N 1 ν ( α ν ) ( exp 2 ν h μ ϵ 1 ϵ 1 1 μ Y j + exp 2 ν h μ ϵ 2 ϵ 2 1 μ Z j ) ,
ϕ 2 ( ϰ j ) = C N 1 ν ( α ν ) exp 2 ν h μ ϵ 2 ϵ 1 1 μ Z j ,
where ν is a constant and it satisfies 0 < ν < α ,
Y j = λ N j 1 λ N 1 , λ = 1 + ν μ h ϵ 1 , Z j = ζ N j 1 ζ N 1 , ζ = 1 + ν μ h ϵ 2 .
The mesh functions described above are inspired by those constructed in [15]. Now, that 0 Y j , Z j 1 , ( ϵ 1 δ 2 + μ ν D + ) Y j = 0 , ( ϵ 2 δ 2 + μ ν D + ) Z j = 0 , D + Y j ν μ ϵ 1 1 exp ν μ ϰ j + 1 ϵ 1 1 and D + Z j ν μ ϵ 2 1 exp ν μ ϰ j + 1 ϵ 2 1 . Then, define ψ ± ( ϰ j ) = ϕ ( ϰ j ) ± ( W L w L ) ( ϰ j ) . It is easy to observe that ψ ( ϰ j ) 0 , j = 0 , . . . . . , N and L 1 N ψ ( ϰ j ) 0 , L 2 N ψ ( ϰ j ) 0 , 1 j N 1 . Hence, by applying minimum principle,
| ( W L 1 w L 1 ) ( ϰ j ) | C N 1 ϵ 1 1 μ + ϵ 2 1 μ ϵ 2 1 μ C N 1 ln N .
Similarly,
| ( W L 2 w L 2 ) ( ϰ j ) | C N 1 ϵ 1 1 μ + ϵ 2 1 μ ϵ 2 1 μ C N 1 ln N .
Now, when 2 = ϵ 2 μ α ln N , for the mesh elements ϰ j , for N 8 j N 2
| ( W 1 L 1 w 1 L 1 ) ( ϰ j ) | | W 1 L 1 ( ϰ j ) | + | w 1 L 1 ( ϰ j ) | C B 2 ( l 1 , N ) ( ϰ j ) + C B 2 l 1 ( ϰ j ) C B 2 ( l 1 , N ) ( 2 ) + C B 2 l 1 ( 2 ) C N 1 .
Similarly,
| ( W 2 L 1 w 2 L 1 ) ( ϰ j ) | C N 1 .
For 5 N 8 j N
| ( W 1 L 2 w 1 L 2 ) ( ϰ j ) | | W 1 L 2 ( ϰ j ) | + | w 1 L 2 ( ϰ j ) | C B 2 ( l 2 , N ) ( ϰ j ) + C B 2 l 2 ( ϰ j ) C B 2 ( l 2 , N ) ( 2 ) + C B 2 l 2 ( 2 ) C N 1 .
Similarly,
| ( W 2 L 2 w 2 L 2 ) ( ϰ j ) | C N 1 .
When 2 = ϵ 2 μ α ln N , there are two distinct cases that are considered: ϵ 1 ϵ 2 2 and ϵ 1 < ϵ 2 2 . In the case ϵ 2 2 ϵ 1 ϵ 2 , for N 16 j N 8 , 2 2 ϵ 1 μ α ln N . Hence,
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C N 1 ln N ϵ 1 1 μ 2 B 1 l 1 ( ϰ j 1 ) + ϵ 2 1 μ 2 B 2 l 1 ( ϰ j 1 ) ϵ 2 1 μ 2 B 2 l 1 ( ϰ j 1 ) .
For 9 N 16 j 5 N 8
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C N 1 ln N ϵ 1 1 μ 2 B 1 l 2 ( ϰ j 1 ) + ϵ 2 1 μ 2 B 2 l 2 ( ϰ j 1 ) ϵ 2 1 μ 2 B 2 l 2 ( ϰ j 1 ) .
For this case, ϵ 2 > 2 ϵ 1 for N 16 j N 8 ; using the decomposition of w L 1 and w L 2 , the following results are derived based on (95)–(98). Let h ¯ = ϰ j + 1 ϰ j 1 ; then,
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | h ¯ ϵ 1 | | w 11 L 1 , | | + C μ | | w 11 L 1 , | | + ϵ 1 | | w 12 L 1 , | | + C μ | | w 12 L 1 , | | ϵ 2 h ¯ | | w 21 L 1 , | | + ϵ 1 | | w 22 L 1 , | | + C μ h ¯ | | w 2 L 1 , | |
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C N 1 ln N μ 2 ϵ 2 1 B 2 l 1 ( ϰ j 1 ) + C ϵ 1 1 μ 2 B 1 l 1 ( ϰ j 1 ) C N 1 ln N μ 2 ϵ 2 1 B 2 l 1 ( ϰ j 1 ) + C ϵ 2 1 μ 2 B 1 l 1 ( ϰ j 1 ) .
For 9 N 16 j 5 N 8
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | h ¯ ϵ 1 | | w 11 L 2 , | | + C μ | | w 11 L 2 , | | + ϵ 1 | | w 12 L 2 , | | + C μ | | w 12 L 2 , | | ϵ 2 h ¯ | | w 21 L 2 , | | + ϵ 1 | | w 22 L 2 , | | + C μ h ¯ | | w 2 L 2 , | |
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C N 1 ln N μ 2 ϵ 2 1 B 2 l 2 ( ϰ j 1 ) + C ϵ 1 1 μ 2 B 1 l 2 ( ϰ j 1 ) C N 1 ln N μ 2 ϵ 2 1 B 2 l 2 ( ϰ j 1 ) + C ϵ 2 1 μ 2 B 1 l 2 ( ϰ j 1 ) .
For 0 j N 16 , 1 ϵ 1 μ α ln N ,
| L 1 N ( W l 1 w l 1 ) ( ϰ j ) | C N 1 μ 2 ln N ϵ 1 1 B 1 l 1 ( ϰ j 1 ) + ϵ 2 1 B 2 l 1 ( ϰ j 1 ) ϵ 2 1 B 2 l 1 ( ϰ j 1 ) .
For N 2 j 9 N 16 ,
| L 2 N ( W L 2 w l 2 ) ( ϰ j ) | C N 1 μ 2 ln N ϵ 1 1 B 1 l 2 ( ϰ j 1 ) + ϵ 2 1 B 2 l 2 ( ϰ j 1 ) ϵ 2 1 B 2 l 2 ( ϰ j 1 ) .
Let us define the mesh functions Φ on the domain Ω ¯ N for the value of j such that 0 j N 16 , p = 1 and for N 2 j 9 N 16 , p = 2 as follows:
Φ 1 ( ϰ j ) = C N 1 ln N exp 2 α μ H 1 ϵ 1 B 1 ( l p , N ) ( ϰ j ) + exp 2 α μ H 1 ϵ 2 B 2 ( l p , N ) ( ϰ j ) ,
Φ 2 ( ϰ j ) = C N 1 ln N exp 2 α μ H 1 ϵ 2 B 2 ( l p , N ) ( ϰ j ) ,
and for N 16 j N 8 , p = 1 and 9 N 16 j 5 N 8 , p = 2 as
Φ 1 ( ϰ j ) = C N 1 ln N exp 2 α μ H 2 ϵ 2 B 2 ( l p , N ) ( ϰ j ) + C B 1 ( l p , N ) ( ϰ j ) ,
Φ 2 ( ϰ j ) = C N 1 ln N exp 2 α μ H 2 ϵ 2 B 2 ( l p , N ) ( ϰ j ) + C N 1 ( τ 2 ϰ j ) ϵ 2 1 + 1 .
By defining the barrier functions Ψ ± ( ϰ j ) = Φ ( ϰ j ) ± ( W L 1 w L 1 ) ( ϰ j ) for 0 j N 8 and utilizing the minimum principle, it can be established that Ψ ± ( ϰ j ) 0 for all 0 j N 8 . Similarly, by defining the barrier functions Ψ ± ( ϰ j ) = Φ ( x j ) ± ( W L 2 w L 2 ) ( ϰ j ) for N 2 j 5 N 8 and utilizing the minimum principle, it can be established that Ψ ± ( ϰ j ) 0 for all N 2 j 5 N 8 . Consequently, it follows that
| ( W L 1 w L 1 ) ( ϰ j ) | C N 1 ln N , for 0 j N 8 ,
| ( W L 2 w L 2 ) ( ϰ j ) | C N 1 ln N , for N 2 j 5 N 8 .
Now, consider the case 2 = 1 4 , σ 1 = 1 4 , and 1 = ϵ 1 μ α ln N . In this scenario, ϵ 2 1 μ C ln N . For x j [ 0 , 1 ) , it follows that ( ϰ j + 1 ϰ j 1 ) C ϵ 1 μ 1 N 1 ln N . Hence,
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C ( ϰ j + 1 ϰ j 1 ) ϵ 1 w 1 L 1 , D + μ w 1 L 1 , D ϵ 2 w 2 L 1 , D + μ w 2 L 1 , D
C N 1 ln N μ 2 ϵ 1 1 B 1 l 1 ( ϰ j 1 ) + ϵ 2 1 B 2 l 1 ( ϰ j 1 ) ϵ 2 1 B 2 l 1 ( ϰ j 1 )
For ϰ j [ 1 , 1 + 1 ) , it follows that ( ϰ j + 1 ϰ j 1 ) C ϵ 1 μ 1 N 1 ln N . Hence,
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C ( ϰ j + 1 ϰ j 1 ) ϵ 1 w 1 L 2 , D + μ w 1 L 2 , D ϵ 2 w 2 L 2 , D + μ w 2 L 2 , D
C N 1 ln N μ 2 ϵ 1 1 B 1 l 2 ( ϰ j 1 ) + ϵ 2 1 B 2 l 2 ( ϰ j 1 ) ϵ 2 1 B 2 l 2 ( ϰ j 1 ) .
For ϰ j [ 1 , 2 ] , by utilizing the decomposition in the previous case, the following is derived
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | h ¯ ϵ 1 | | w 11 L 1 , | | + C μ | | w 11 L 1 , | | + ϵ 1 | | w 12 L 1 , | | + C μ | | w 12 L 1 , | | ϵ 2 h ¯ | | w 21 L 1 , | | + ϵ 1 | | w 22 L 1 , | | + C μ h ¯ | | w 2 L 1 , | |
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C N 1 ln N μ 2 ϵ 2 1 B 2 l 1 ( ϰ j 1 ) + C ϵ 1 1 μ 2 B 1 l 1 ( ϰ j 1 ) C N 1 ln N μ 2 ϵ 2 1 B 2 l 1 ( ϰ j 1 ) + C ϵ 2 1 μ 2 B 1 l 1 ( ϰ j 1 ) .
For ϰ j [ 1 + 1 , 1 + 2 ] ,
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | h ¯ ϵ 1 | | w 11 L 2 , | | + C μ | | w 11 L 2 , | | + ϵ 1 | | w 12 L 2 , | | + C μ | | w 12 L 2 , | | ϵ 2 h ¯ | | w 21 L 2 , | | + ϵ 1 | | w 22 L 2 , | | + C μ h ¯ | | w 2 L 2 , | |
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C N 1 ln N μ 2 ϵ 2 1 B 2 l 2 ( ϰ j 1 ) + C ϵ 1 1 μ 2 B 1 l 2 ( ϰ j 1 ) C N 1 ln N μ 2 ϵ 2 1 B 2 l 2 ( ϰ j 1 ) + C ϵ 2 1 μ 2 B 1 l 2 ( ϰ j 1 ) .
Similarly, for ϰ j [ 2 , 1 ) , it follows that ( ϰ j + 1 ϰ j 1 ) C N 1 ln N . Hence,
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C ( ϰ j + 1 ϰ j 1 ) ϵ 1 w 1 L 1 , D + μ w 1 L 1 , D ϵ 2 w 2 L 1 , D + μ w 2 L 1 , D
C N 1 ln N μ 2 ϵ 2 1 B 2 l 1 ( ϰ j 1 ) + C ϵ 1 1 μ 2 B 1 l 1 ( ϰ j 1 ) C N 1 ln N μ 2 ϵ 2 1 B 2 l 1 ( ϰ j 1 ) + C ϵ 2 1 μ 2 B 2 l 1 ( ϰ j 1 ) .
For ϰ j [ 1 + 2 , 2 ) , it follows that ( ϰ j + 1 ϰ j 1 ) C N 1 ln N . Hence,
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C ( ϰ j + 1 ϰ j 1 ) ϵ 1 w 1 L 2 , D + μ w 1 L 2 , D ϵ 2 w 2 L 2 , D + μ w 2 L 2 , D
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C N 1 ln N μ 2 ϵ 2 1 B 2 l 2 ( ϰ j 1 ) + C ϵ 1 1 μ 2 B 1 l 2 ( ϰ j 1 ) C N 1 ln N μ 2 ϵ 2 1 B 2 l 2 ( ϰ j 1 ) + C ϵ 2 1 μ 2 B 2 l 2 ( ϰ j 1 ) .
Finally, by utilizing the minimum principle along with the specified barrier functions, the required bounds can be obtained. Let ψ ± ( ϰ j ) = ϕ ( ϰ j ) ± ( W L 1 w L 1 ) ( ϰ j ) , where ϕ = ( ϕ 1 , ϕ 2 ) T is defined for 0 j < N 16 , p = 1 and ψ ± ( ϰ j ) = ϕ ( ϰ j ) ± ( W L 2 w L 2 ) ( ϰ j ) for N 2 j 9 N 16 , p = 2 as follows:
ϕ 1 ( ϰ j ) = C N 1 ln N exp 2 α μ H 1 ϵ 1 B 1 ( l p , N ) ( ϰ j ) + exp 2 α μ H 1 ϵ 2 B 2 ( l p , N ) ( ϰ j ) ,
ϕ 2 ( ϰ j ) = C N 1 ln N exp 2 α μ H 1 ϵ 2 B 2 ( l p , N ) ( ϰ j ) ,
and for N 16 j N 8 , p = 1 and 9 N 16 j 5 N 8 , p = 2 as
ϕ 1 ( ϰ j ) = C N 1 ln N exp 2 α μ H 2 ϵ 2 B 2 ( l p , N ) ( ϰ j ) + C B 1 ( l p , N ) ( ϰ j ) ,
ϕ 2 ( ϰ j ) = C N 1 ln N exp 2 α μ H 2 ϵ 2 B 2 ( l p , N ) ( ϰ j ) + C N 1 ( 2 ϰ j ) ϵ 2 1 + 1 .
and for N 8 j N 2 , p = 1 and for 5 N 8 j N , p = 2 as
ϕ 1 ( ϰ j ) = C N 1 ln N exp 2 α μ H 3 ϵ 2 B 2 ( l p , N ) ( ϰ j ) + C B 1 ( l p , N ) ( ϰ j ) ,
ϕ 2 ( ϰ j ) = C N 1 ln N exp 2 α μ H 3 ϵ 2 B 2 ( l p , N ) ( ϰ j ) + C B 1 ( l p , N ) ( ϰ j ) .
Thus, for each of the cases, the barrier function is constructed, and, using maximum principle, it has been derived that
| ( W L 1 w L 1 ) ( ϰ j ) | C N 1 ln N ,
| ( W L 2 w L 2 ) ( ϰ j ) | C N 1 ln N .
Therefore,
| ( W L w L ) ( ϰ j ) | C N 1 ln N .
The proof of the lemma is complete. □
For the case α μ 2 γ ϵ 1 , the error in the component w L is bounded as follows:
Lemma 11.
Let w L 1 and w L 2 satisfy (16), and W L 1 and W L 2 satisfy (104) and (105). Then,
W L 1 w L 1 C N 1 ln N .
W L 2 w L 2 C N 1 ln N .
Proof. 
The local truncation error is given by
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C ( ϰ j + 1 ϰ j 1 ) ϵ 1 w 1 L 1 , D + μ w 1 L 1 , D ϵ 2 w 2 L 1 , D + μ w 2 L 1 , D
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C ( ϰ j + 1 ϰ j 1 ) ϵ 1 w 1 L 2 , D + μ w 1 L 2 , D ϵ 2 w 2 L 2 , D + μ w 2 L 2 , D .
For 1 = 1 8 and 2 = 1 4 , with a uniform mesh size h = N 1 , it follows that ϵ 1 1 / 2 C ln N and ϵ 2 1 / 2 C ln N ,
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C N 1 1 ϵ 1 B 1 l 1 ( ϰ j 1 ) + 1 ϵ 2 B 2 l 1 ( ϰ j 1 ) 1 ϵ 1 B 1 l 1 ( ϰ j 1 ) + 1 ϵ 2 B 2 l 1 ( ϰ j 1 ) C N 1 ln N
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C N 1 1 ϵ 1 B 1 l 2 ( ϰ j 1 ) + 1 ϵ 2 B 2 l 2 ( ϰ j 1 ) 1 ϵ 1 B 1 l 2 ( ϰ j 1 ) + 1 ϵ 2 B 2 l 2 ( ϰ j 1 ) C N 1 ln N .
Consider the intervals separately for the case when 1 = ϵ 1 γ α ln N and 2 = 1 4 , for x j ( 2 , 1 2 ) , ( 1 + 2 , 2 2 )
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C N 1 1 ϵ 2 B 2 l 1 ( ϰ j 1 ) N 1 1 ϵ 2 B 2 l 1 ( ϰ j 1 ) C N 1 ln N
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C N 1 1 ϵ 2 B 2 l 2 ( ϰ j 1 ) N 1 1 ϵ 2 B 2 l 2 ( ϰ j 1 ) C N 1 ln N .
For ϰ j ( 1 , 2 ) , ( 1 2 , 1 1 ) , using the decomposition of w L 1 and w L 2 , it follows that
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C N 1 1 ϵ 1 B 1 l 1 ( ϰ j 1 ) + 1 ϵ 2 B 2 l 1 ( ϰ j 1 ) 1 ϵ 1 B 1 l 1 ( ϰ j 1 ) + 1 ϵ 2 B 2 l 1 ( ϰ j 1 ) C N 1 ln N .
For ϰ j ( 1 + 1 , 1 + 2 ) , ( 2 2 , 2 1 )
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C N 1 1 ϵ 1 B 1 l 2 ( ϰ j 1 ) + 1 ϵ 2 B 2 l 2 ( ϰ j 1 ) 1 ϵ 1 B 1 l 2 ( ϰ j 1 ) + 1 ϵ 2 B 2 l 2 ( ϰ j 1 ) C N 1 ln N .
For ϰ j ( 0 , 1 ) , ( 1 1 , 1 ) , it follows that ( ϰ j + 1 ϰ j 1 ) C N 1 ϵ 1 ln N ; then,
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C N 1 ϵ 1 ln N 1 ϵ 1 + 1 ϵ 2 1 ϵ 1 + 1 ϵ 2 C N 1 ln N .
For ϰ j ( 1 , 1 + 1 ) , ( 2 1 , 2 )
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C N 1 ϵ 1 ln N 1 ϵ 1 + 1 ϵ 2 1 ϵ 1 + 1 ϵ 2 C N 1 ln N .
To estimate this bound, the following mesh functions are defined on Ω ¯ N
B 1 ( l p , N ) ( ϰ j ) = i = 1 j 1 + γ α ϵ 1 h i 1 ,
B 2 ( l p , N ) ( ϰ j ) = i = 1 j 1 + γ α ϵ 2 h i 1 ,
with B 1 ( l p , N ) ( ϰ 0 ) = B 2 ( l p , N ) ( ϰ 0 ) = 1 , for Ω 1 , p = 1 , for Ω 2 , p = 2 . When 2 = ϵ 2 γ α ln N and 1 = 2 2 , it follows that ϵ 2 2 ϵ 1 < ϵ 2 ; hence, 2 C ϵ 1 ln N . For ϰ j [ 2 , 1 2 ] , it follows that
| ( W 1 L 1 w 1 L 1 ) ( ϰ j ) | | W 1 L 1 ( ϰ j ) | + | w 1 L 1 ( ϰ j ) | C B 2 ( l 1 , N ) ( ϰ j ) + C B 2 l 1 ( ϰ j ) i = 1 j 1 + γ α ϵ 1 h i 1 + C B 2 l 1 ( 2 ) ( 1 + 16 N 1 ln N ) N 16 + C N 1 C N 1 .
Similarly,
| ( W 2 L 1 w 2 L 1 ) ( ϰ j ) | C N 1 .
For ϰ j [ 1 + 2 , 2 2 ] , it follows that
| ( W 1 L 2 w 1 L 2 ) ( ϰ j ) | | W 1 L 2 ( ϰ j ) | + | w 1 L 2 ( ϰ j ) | C B 2 ( l 2 , N ) ( ϰ j ) + C B 2 l 2 ( ϰ j ) i = 1 j 1 + γ α ϵ 1 h i 1 + C B 2 l 1 ( 2 ) ( 1 + 16 N 1 ln N ) N 16 + C N 1 C N 1 .
Similarly,
| ( W 2 L 2 w 2 L 2 ) ( ϰ j ) | C N 1 .
When ϰ j ( 1 , 2 ) or ( 1 2 , 1 1 ) , ϰ j + 1 ϰ j 1 C N 1 ϵ 1 ln N . Therefore,
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C N 1 ϵ 1 ln N 1 ϵ 1 + 1 ϵ 2 1 ϵ 1 + 1 ϵ 2 C N 1 ln N .
For ϰ j ( 1 + 1 , 1 + 2 ) , ( 2 2 , 2 1 )
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C N 1 ϵ 1 ln N 1 ϵ 1 + 1 ϵ 2 1 ϵ 1 + 1 ϵ 2 C N 1 ln N .
When ϰ j ( 0 , 1 ) or ( 1 1 , 1 ) , ( ϰ j + 1 ϰ j 1 ) C ϵ 1 N 1 ln N , and the required bounds are derived as
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C N 1 ln N | L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C N 1 ln N .
When 2 = ϵ 2 γ α ln N and 1 = ϵ 1 γ α ln N and when ϰ j [ 2 , 1 2 ] or [ 1 + 2 , 2 2 ] ,
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C N 1 ln N | L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C N 1 ln N .
For ϰ j ( 0 , 1 ] or ( 1 2 , 1 ) , analogous arguments to those applied in the corresponding intervals of earlier cases yield the required bounds, ( ϰ j + 1 ϰ j 1 ) C ϵ 1 N 1 ln N ,
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C N 1 ln N .
For ϰ j ( 1 , 1 + 1 ] or ( 2 1 , 2 ) ,
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C N 1 ln N .
When ϰ j ( 1 , 2 ) or ( 1 2 , 1 1 ) , ϰ j + 1 ϰ j 1 C N 1 2 C N 1 ϵ 2 ln N . Hence,
| L 1 N ( W L 1 w L 1 ) ( ϰ j ) | C N 1 ln N .
For ϰ j ( 1 + 1 , 1 + 2 ) or ( 2 2 , 2 1 ) ,
| L 2 N ( W L 2 w L 2 ) ( ϰ j ) | C N 1 ln N .
Therefore,
| ( W L w L ) ( ϰ j ) | C N 1 ln N .
The proof of the lemma is complete. □
For the case α μ 2 γ ϵ 2 , the error in the component w R 1 is bounded as follows:
Lemma 12.
When w R 1 ( ϰ ) is decomposed as in (84), the following bounds hold | w R 1 ( 0 ) | C e γ μ .
Proof. 
Decomposition of (84),
w R 1 ( 0 ) = w 0 R 1 ( 0 ) + ϵ 2 w 1 R 1 ( 0 ) + ϵ 2 2 w 2 R 1 ( 0 ) .
Let ψ i ± ( x ) = C e γ μ ( 1 x ) ± w 0 i R 1 ( x ) , for i = 1 , 2 , where C is chosen to be sufficiently large and it is evident that ψ i ± ( 0 ) 0 . Additionally, it is known that L 1 ψ 1 0 as defined in Lemma 3. By utilizing the minimum principle, it follows that ψ i ± ( x ) 0 , leading to the inequality
| w 0 i R 1 ( ϰ ) | C e γ μ ( 1 ϰ ) for i = 1 , 2 .
Using this result and Equation (85), the bound is derived as follows:
| w 0 i R 1 , ( ϰ ) | C μ e γ μ ( 1 ϰ ) , for i = 1 , 2 .
By differentiating Equation (85) and applying the previous bounds, it is obtained that
| w 0 i R 1 , ( ϰ ) | C μ 2 e γ μ ( 1 ϰ ) , for i = 1 , 2 .
Thus,
| w 0 i R 1 , ( k ) ( ϰ ) | C μ k e γ μ ( 1 ϰ ) , for i = 1 , 2 .
Next, considering w 1 R 1 ( ϰ ) and using the established bounds on w 0 i R 1 ( ϰ ) and their derivatives, it is concluded that
| w 1 i R 1 , ( k ) ( ϰ ) | C μ ( k + 2 ) e γ μ ( 1 ϰ ) , where k = 0 , 1 , 2 and i = 1 , 2 .
Similarly, it is found that
| w 2 i R 1 , ( k ) ( ϰ ) | C μ ( k + 4 ) e γ μ ( 1 ϰ ) , where k = 0 , 1 , 2 and i = 1 , 2 .
By combining all these results, the bound is obtained as follows: | w R 1 ( ϰ ) | C e γ μ ( 1 ϰ ) for [0,1]. Analogously, it is easy to find | w R 2 ( ϰ ) | C e γ μ ( 2 ϰ ) for [1,2]. The proof of the lemma is complete. □
Lemma 13.
The singular component w R 1 ( ϰ ) and w R 2 ( ϰ ) for the case α μ 2 γ ϵ 2 satisfies the following bounds:
| w R 1 ( ϰ ) | C e γ μ ( 1 ϰ ) ,
| w R 2 ( ϰ ) | C e γ μ ( 2 ϰ ) .
Proof. 
Utilizing the previous lemma, deriving the above bound is not hard. To establish the bounds on the error | ( W R 1 w R 1 ) ( ϰ j ) | , the mesh function is defined over Ω ¯ N
B ( r p , N ) ( ϰ j ) = i = j + 1 N 1 + γ h i 2 μ 1 , B ( r p , N ) ( ϰ N ) = 1 , where B ( r p , N ) , i = 1 , 2 .
Now, consider Ψ R 1 ( ϰ j ) = C B ( r 1 , N ) ( ϰ j ) ± W R 1 and Ψ R 2 ( ϰ j ) = C B ( r 2 , N ) ( ϰ j ) ± W R 2 . Also, since W R 1 ( 0 ) e γ μ , W R 1 ( 0 ) B ( r 1 , N ) ( ϰ 0 ) . Hence, Ψ R 1 ( 0 ) 0 . Also, for an appropriate choice of C, it follows that Ψ R 1 ( ϰ N ) 0 . Further, L 1 N Ψ R 1 ( ϰ j ) 0 and L 2 N Ψ R 2 ( ϰ j ) 0 . Hence, by the minimum principle, Ψ R 1 ( ϰ j ) 0 and Ψ R 2 ( ϰ j ) 0 , for 0 j N . Hence, similarly, it can be stated for | W R 2 ( ϰ j ) | ,
| W R 1 ( ϰ j ) | C B ( r 1 , N ) ( ϰ j ) and | W R 2 ( ϰ j ) | C B ( r 2 , N ) ( ϰ j ) on Ω ¯ N .
The proof of the lemma is complete. □
Lemma 14.
At each point ϰ j Ω ¯ N , | ( W R w R ) ( ϰ j ) | C N 1 ln N , for the case α μ 2 γ ϵ 2 .
Proof. 
The local truncation error is given by
| L 1 N ( W R 1 w R 1 ) | C ( ϰ j + 1 ϰ j 1 ) ϵ 1 w 1 R 1 , D + μ w 1 R 1 , D ϵ 2 w 2 R 1 , D + μ w 2 R 1 , D
| L 2 N ( W R 2 w R 2 ) | C ( ϰ j + 1 ϰ j 1 ) ϵ 1 w 1 R 2 , D + μ w 1 R 2 , D ϵ 2 w 2 R 2 , D + μ w 2 R 2 , D
where D = [ ϰ j 1 , ϰ j + 1 ] . Consider the case σ 1 = μ γ ln N , x j ( 0 , 1 σ 1 ] . Hence,
| ( W R 1 w R 1 ) ( ϰ j ) | | W R 1 ( ϰ j ) | + | w R 1 ( ϰ j ) | C B ( r 1 , N ) ( ϰ j ) + C B 2 r 1 ( ϰ j ) C B ( r 1 , N ) ( σ 1 ) + C B 2 r 1 ( σ 1 ) C N 1 ,
for ϰ j ( 1 , 2 σ 1 ]
| ( W R 2 w R 2 ) ( ϰ j ) | | W R 2 ( ϰ j ) | + | w R 2 ( ϰ j ) | C B ( r 2 , N ) ( ϰ j ) + C B 2 r 2 ( ϰ j ) C B ( r 2 , N ) ( σ 1 ) + C B 2 r 2 ( σ 1 ) C N 1 .
Examine the mesh region ( 1 σ 1 , 1 ] ; it is known that h ¯ = ϰ j + 1 ϰ j 1 , then, ϰ j + 1 ϰ j 1 C μ N 1 ln N
| L 1 N ( W R 1 w R 1 ) ( ϰ j ) | C μ N 1 ln N ϵ 1 ( C μ 3 + C ϵ 1 ) + μ ( C μ 2 ) ϵ 2 ( C μ 3 ) + μ ( C μ 2 ) .
C N 1 ln N .
For ( 2 σ 1 , 2 ]
| L 2 N ( W R 2 w R 2 ) ( ϰ j ) | C μ N 1 ln N ϵ 1 ( C μ 3 + C ϵ 1 ) + μ ( C μ 2 ) ϵ 2 ( C μ 3 ) + μ ( C μ 2 ) .
C N 1 ln N .
When σ 1 = 1 4 , μ 1 C ln N . Hence,
| ( W R 1 w R 1 ) ( ϰ j ) | C N 1 μ 1 C N 1 ln N ,
| ( W R 2 w R 2 ) ( ϰ j ) | C N 1 μ 1 C N 1 ln N .
Thus,
W R w R Ω ¯ N C N 1 ln N .
The proof of the lemma is complete. □
From the previous Lemmas 10–14, for α μ 2 γ ϵ 1 , analogously W R w R Ω ¯ N C N 1 ln N is obtained.
Theorem 3.
Let u be the solution of (1) and U be the solution of (99)–(101). Then, for each mesh point ϰ j Ω ¯ N ,
U u Ω ¯ N C N 1 ln N ,
for both of the cases α μ 2 γ ϵ 1 and α μ 2 γ ϵ 2 .
Proof. 
The proof follows Lemmas 8, 10, 11, and 14. □

12. Numerical Illustration

Example

The numerical approximated the solution to the following system on the interval ( 0 , 2 ) , applying the proposed method to both cases where α μ 2 γ ε 1 and α μ 2 γ ε 2
ϵ 1 u 1 ( ϰ ) + 0.5 μ u 1 ( ϰ ) 6 u 1 ( ϰ ) + 2 u 2 ( ϰ ) + 0.8 u 1 ( ϰ 1 ) = 1.0
ϵ 2 u 2 ( ϰ ) + 0.5 μ u 2 ( ϰ ) + 2 u 1 ( ϰ ) 6 u 2 ( ϰ ) + 0.8 u 2 ( ϰ 1 ) = 2.0
with boundary conditions specified as u 1 ( 0 ) = u 1 ( 2 ) = 1 and u 2 ( 0 ) = u 2 ( 2 ) = 1 .
To evaluate the order of convergence, maximum pointwise errors, and error constants, a modified two-mesh algorithm was utilized. The findings are summarized in Table 1 and Table 2. Notably, as η decreases, the error stabilizes for each N, while the maximum error D N reduces with increasing N. Furthermore, the order of convergence p N rises as N increases, confirming the theoretical results.
Figure 1 and Figure 2 illustrate the graphs of the solutions obtained and demonstrate how symmetry in the layers contributes to the accuracy and validation of the theoretical results. In Figure 1, where the ratio μ 2 ε 1 γ α , boundary layers for u 1 and u 2 are observed near ϰ = 0 , ϰ = 1 , and ϰ = 2 , which is consistent with expectations. In contrast, Figure 2 shows that when μ 2 ε 2 γ α , the initial layers for u 1 and u 2 are present near ϰ = 0 , while boundary layers appear for both u 1 and u 2 near ϰ = 2 and a delay appears near ϰ = 1 .

13. Conclusions

In this paper, a robust fitted mesh finite difference method is introduced for solving a system of two-parameter singularly perturbed delay differential equation of the convection–reaction–diffusion type. By employing a piecewise uniform Shishkin mesh, our robust fitted mesh method effectively addresses the complexities arising from two distinct small perturbation parameters, delay terms, and resolved boundary and interior layers in SPDDEs. The theoretical analysis confirms that the proposed scheme achieves almost first-order convergence in the maximum norm, independent of these two distinct perturbation parameters. Numerical illustrations validate the method’s effectiveness, showcasing its ability to resolve intricate boundary and interior layers. This work highlights the importance in numerical techniques for SPDDEs and lays the groundwork for further advancements. Future research could focus on extending this methodology to multidimensional and time-dependent problems, exploring adaptive mesh strategies and applying the approach to real-world applications in engineering and science.

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. and J.P.M.; project administration, J.P.M. and G.E.C.; funding acquisition, 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 is contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. 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]
  2. 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]
  3. Miller, J.J.H.; O’Riordan, E.; Shishkin, G.I. Fitted Numerical Methods for Singular Perturbation Problems: Error Estimates in the Maximum Norm for Linear Problems in One and Two Dimensions; World Scientific: Singapore, 2012. [Google Scholar]
  4. 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]
  5. 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]
  6. 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]
  7. O’Riordan, E.; Pickett, M.; Shishkin, G.I. Parameter-uniform finite difference schemes for singularly perturbed parabolic diffusion-convection-reaction problems. Math. Comput. 2006, 75, 1135–1154. [Google Scholar] [CrossRef]
  8. 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]
  9. 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]
  10. O’Malley, R.E. Two-parameter singular perturbation problems for second-order equations. J. Math. Mech. 1967, 16, 1143–1164. [Google Scholar]
  11. Nagarajan, S.; Narasimhan, R.; Miller, J.J.H.; Sigamani, V. A parameter uniform method for an initial value problem for a system of singularly perturbed delay differential equations. Adv. Appl. Math. 2014, 87, 127–138. [Google Scholar]
  12. Cesarano, C.; Pinelas, S.; Al-Showaikh, F.; Bazighifan, O. Asymptotic properties of solutions of fourth-order delay differential equations. Symmetry 2019, 11, 628. [Google Scholar] [CrossRef]
  13. 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]
  14. 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]
  15. 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: New York, NY, USA, 2000. [Google Scholar] [CrossRef]
Figure 1. Graphical representation of numerical solutions for the case α μ 2 γ ϵ 1 .
Figure 1. Graphical representation of numerical solutions for the case α μ 2 γ ϵ 1 .
Symmetry 17 00068 g001
Figure 2. Graphical representation of Numerical solutions for the case: α μ 2 γ ϵ 2 .
Figure 2. Graphical representation of Numerical solutions for the case: α μ 2 γ ϵ 2 .
Symmetry 17 00068 g002
Table 1. Values of D ε N , D N , p N , p * , and C p * N when ϵ 1 = η 64 , ϵ 2 = η 32 , μ = η 4 for α μ 2 γ ϵ 1 .
Table 1. Values of D ε N , D N , p N , p * , and C p * N when ϵ 1 = η 64 , ϵ 2 = η 32 , μ = η 4 for α μ 2 γ ϵ 1 .
η Number of Mesh Points N
64128256512
0.250 0.326 × 10 2 0.242 × 10 2 0.137 × 10 2 0.691 × 10 3
0.625 × 10 1 0.326 × 10 2 0.216 × 10 2 0.131 × 10 2 0.756 × 10 3
0.156 × 10 1 0.326 × 10 2 0.216 × 10 2 0.131 × 10 2 0.756 × 10 3
0.391 × 10 2 0.326 × 10 2 0.216 × 10 2 0.131 × 10 2 0.756 × 10 3
0.977 × 10 3 0.325 × 10 2 0.215 × 10 2 0.131 × 10 2 0.755 × 10 3
D N 0.326 × 10 2 0.242 × 10 2 0.137 × 10 2 0.756 × 10 3
p N 0.429 × 10 0 0.823 × 10 0 0.857 × 10 0
C p N 0.754 × 10 1 0.754 × 10 1 0.574 × 10 1 0.427 × 10 1
The order of convergence p * = 0.429 × 10 0
Computed error constant, C p * N = 0.754 × 10 1
Table 2. Values of D ε N , D N , p N , p * , and C p * N when ϵ 1 = η 64 , ϵ 2 = η 32 , μ = η 4 for α μ 2 γ ϵ 2 .
Table 2. Values of D ε N , D N , p N , p * , and C p * N when ϵ 1 = η 64 , ϵ 2 = η 32 , μ = η 4 for α μ 2 γ ϵ 2 .
η Number of Mesh Points N
64128256512
0.625 × 10 1 0.159 × 10 1 0.111 × 10 1 0.367 × 10 2 0.958 × 10 3
0.156 × 10 1 0.123 × 10 1 0.158 × 10 1 0.109 × 10 1 0.357 × 10 2
0.391 × 10 2 0.169 × 10 1 0.123 × 10 1 0.154 × 10 1 0.106 × 10 1
0.977 × 10 3 0.499 × 10 1 0.337 × 10 1 0.201 × 10 1 0.147 × 10 1
0.244 × 10 3 0.889 × 10 1 0.761 × 10 1 0.576 × 10 1 0.372 × 10 1
D N 0.889 × 10 1 0.761 × 10 1 0.575 × 10 1 0.371 × 10 1
p N 0.224 × 10 0 0.403 × 10 0 0.631 × 10 0
C p N 0.157 × 10 1 0.157 × 10 1 0.138 × 10 1 0.104 × 10 1
The order of convergence p * = 0.224 × 10 0
Computed error constant, C p * N = 0.157 × 10 1
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.

Share and Cite

MDPI and ACS Style

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. https://doi.org/10.3390/sym17010068

AMA Style

Arthur J, Chatzarakis GE, Panetsos SL, Mathiyazhagan JP. 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(1):68. https://doi.org/10.3390/sym17010068

Chicago/Turabian Style

Arthur, Jenolin, George E. Chatzarakis, S. L. Panetsos, and Joseph Paramasivam Mathiyazhagan. 2025. "A Robust-Fitted-Mesh-Based Finite Difference Approach for Solving a System of Singularly Perturbed Convection–Diffusion Delay Differential Equations with Two Parameters" Symmetry 17, no. 1: 68. https://doi.org/10.3390/sym17010068

APA Style

Arthur, J., Chatzarakis, G. E., Panetsos, S. L., & Mathiyazhagan, J. P. (2025). A Robust-Fitted-Mesh-Based Finite Difference Approach for Solving a System of Singularly Perturbed Convection–Diffusion Delay Differential Equations with Two Parameters. Symmetry, 17(1), 68. https://doi.org/10.3390/sym17010068

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop