Preprint
Article

This version is not peer-reviewed.

Numerical Method for Solving n Singularly Perturbed Mixed-Type Initial Value Problems with the Same Perturbation Parameter and Discontinuous Source Terms

Submitted:

19 June 2025

Posted:

20 June 2025

You are already at the latest version

Abstract
This work examines a system of n singularly perturbed robin-type initial value problems with discontinuous source terms. Each equation’s derivative component is multiplied by the same singular perturbation parameter (ε). A piecewise uniform Shishkin mesh is built and used, together with a classical finite difference scheme, to create a numerical technique for addressing the problem. It is demonstrated that the numerical approximations produced by this method are effectively first order convergent in the maximum norm at all places in the domain, uniformly with regard to the singular perturbation parameter. Numerical findings are offered to support the theory.
Keywords: 
;  ;  ;  ;  ;  

1. Introduction

Singularly perturbed initial–boundary value problems occur frequently across applied mathematics and engineering disciplines. For example, systems of first-order, singularly perturbed ordinary differential equations are fundamental in chemical reactor modeling. The small magnitude of the perturbation parameters induces a multi-scale behavior that typically precludes closed-form solutions. Consequently, the exact solution often features sharply varying layers—initial, boundary, or interior—confined to narrow regions. Over the past several decades, a variety of numerical schemes that achieve uniform convergence with respect to these small parameters have been developed and analyzed.
Examine a Robin-type, singularly perturbed initial-value system with discontinuous sources over Ω = ( 0 , 1 ] , assume the source term is discontinuous at a single point d within the domain Ω . Let Ω = ( 0 , d ) and Ω + = ( d , 1 ] . The jump of a function ω at the point d is defined by
[ ω ] ( d ) = ω ( d + ) ω ( d )
where ω ( d + ) and ω ( d ) denote the right and left limits of ω at d, respectively. The problem can be stated as finding the solution to the initial value problem u 1 , u 2 , , u n D = C 0 ( Ω ¯ ) C 1 ( Ω Ω + ) , such that
L u ( x ) = E u ( x ) + A ( x ) u ( x ) = f ( x ) , x Ω Ω +
along with the initial conditions provided
β u ( 0 ) = u ( 0 ) ε u ( 0 ) = ϕ
where, E = d i a g ( ε , ε , , ε ) , u ( x ) = ( u 1 ( x ) , u 2 ( x ) , , u n ( x ) ) T , A ( x ) = ( a i j ( x ) ) n × n and f ( x ) = ( f i ( x ) ) n × 1 .
From (1) and (2), the problem can equivalently be expressed in operator form as follows:
L u = f on Ω
with
β u ( 0 ) = ϕ
where the definitions of the operators L a n d β are given by
L = E D + A , β = I E D .
Here, the operator I is the identity, and D = d d x signifies the first derivative operator.
Assumption 1.
The functions a i j , f i C ( 2 ) ( Ω ¯ ) , i , j = 1 , , n satisfy the following positivity conditions
( i ) a i i ( x ) > j i j = 1 n | a i j ( x ) | for i = 1 ( 1 ) n ( i i ) a i j ( x ) 0 for i j and i = 1 ( 1 ) n x Ω ¯ .
Assumption 2.
The positive value α adheres to the inequality
0 < α < min i = 1 ( 1 ) n x Ω ¯ j = 1 n a i j ( x ) .
Assumption 3.
The parameter ε, representing the singular perturbation and distinct, is assumed to satisfy 0 < ε 1 .
The given problem is singularly perturbed in the sense that setting ε = 0 in system (1) yields the following reduced linear algebraic system.
A ( x ) v ( x ) = f ( x ) , x Ω Ω +
where A ( x ) = ( a i j ( x ) ) n × n , v ( x ) = ( v 1 ( x ) , , v n ( x ) ) T and f ( x ) = ( f 1 ( x ) , , f n ( x ) ) T .
The source terms f 1 ( x ) , f 2 ( x ) , , f n ( x ) are sufficiently smooth throughout Ω ¯ except at the point d. The component of the solution u 1 , u 2 , , u n of problem (1) and (2) display initial layers that overlap at x = 0 and interior layers that overlap just to the right of the discontinuity located at x = d .
For a detailed account of parameter-uniform numerical techniques used in the study of singular perturbation problems, see [3,4,6]. The seminal work of Shishkin [8] laid the groundwork for addressing singularly perturbed reaction-diffusion equations with discontinuous coefficients. In the context of scalar equations, Dunne and Riordan [2] investigated initial value problems exhibiting singular perturbations and discontinuous data. Numerical methods that maintain robustness with respect to the perturbation parameter for systems of such problems were discussed in [7]. In [12] a parameter-uniform numerical method was developed for systems where all singular perturbation parameters are equal, leading to solution components with initial layers of uniform width and thus simplifying the analysis. The case in which the singular perturbation parameter appears in only one of the equations was examined in [5]. The most general and challenging scenario, involving individual initial layers for each solution component that overlap and influence one another, has been studied in [1,9,13]. Notably, [9] introduced a uniformly convergent numerical method of first order accuracy (up to a logarithmic factor), while [1] proposed a hybrid finite difference scheme on a piecewise-uniform Shishkin mesh achieving nearly second-order accuracy uniformly with respect to both small parameters. In all these previous studies, the source term was assumed to be smooth. In contrast, the present work deals with discontinuous source terms, resulting in each solution component exhibiting both initial and interior layers.
Theorem 1.
Let A ( x ) satisfy (5) and (6). The problem (1) - (2) admits a solution u D .
Proof. 
Examine y and z as the specific solutions to the differential equations
ε y i ( x ) + j = 1 n a i j ( x ) y j ( x ) = f i ( x ) , i = 1 , 2 , , n , for all x Ω
and
ε z i ( x ) + j = 1 n a i j ( x ) z j ( x ) = f i ( x ) , i = 1 , 2 , , n , for all x Ω + .
Let us analyze the function
u i ( x ) = y i ( x ) + β ( u i ( 0 ) y i ( 0 ) ) ϕ i ( x ) , i = 1 , 2 , , n , x Ω z i ( x ) + B i ϕ i ( x ) , i = 1 , 2 , , n , x Ω +
where ϕ i is the solution of
ε ϕ i + j = 1 n a i j ( x ) ϕ j ( x ) = 0 β i ϕ i ( 0 ) = 1 , i = 1 , 2 , , n , for all x Ω .
Here B i , i = 1 ( 1 ) n is chosen so that u D . In Ω , 0 < ϕ 1 , The function ϕ cannot attain an internal maximum or minimum, and therefore, ϕ i < 0 , i = 1 ( 1 ) n in Ω . Choose the constants B i such that
y ( d ) = z ( d + ) , u ( d ) = u ( d + ) .
The existence of the constants B i requires that
[ u i ( 0 ) y i ( 0 ) ] ϕ i ( d ) ϕ i ( d + ) 0 for i = 1 ( 1 ) n .
Since ϕ i ( d + ) > 0 , the existence of B and consequently u is guaranteed. □
Remark: In this section, C stands for a general vector of positive constants, which remain unaffected by the perturbation parameters and the discretization parameter N.

2. Mathematical Analysis

The operator L adheres to the following maximum principle.
Lemma 1.
Let A ( x ) satisfy conditions (5) and (6). Suppose that a function u D satisfies β u ( 0 ) 0 , [ u ] ( d ) = 0 , [ ε u i ] ( d ) 0 , and L u ( x ) 0 for all x Ω Ω + . Then, u ( x ) 0 for all x Ω ¯ .
Proof. 
Assume that A ( x ) meets the requirements specified in (5) and (6). Let u D be a function such that
β u ( 0 ) 0 , [ u ] ( d ) = 0 , [ ε u i ] ( d ) 0 ,
and
L u ( x ) 0 for every x Ω Ω + .
Then it follows that
u ( x ) 0 for all x Ω ¯ .
Case (i):   p 1 Ω Ω +
β u ( 0 ) = u ( 0 ) ε u ( 0 ) < 0 , a contradiction
and
( L u ) 1 ( p 1 ) = ε u 1 ( p 1 ) + j = 1 n a 1 j ( p 1 ) u j ( p 1 ) = ε u 1 ( p 1 ) + j = 1 n a 1 j ( p 1 ) u j ( p 1 ) + j = 2 n a 1 j ( p 1 ) u 1 ( p 1 ) j = 2 n a 1 j ( p 1 ) u 1 ( p 1 ) < 0 , thus arriving at a contradiction .
Case (ii):   p 1 = d
Given that u C ( Ω ) and u 1 ( d ) < 0 , there exists a neighborhood N h = ( d h , d + h ) around d where u 1 ( x ) < 0 holds for every x N h . Select a point x 1 N h , distinct from d, such that u 1 ( x 1 ) > u 1 ( d ) . By the Mean Value Theorem, there exists some x 2 N h for which
u 1 ( x 2 ) = u 1 ( d ) u 1 ( x 1 ) d x 1 < 0 .
Since x 2 lies within N h , an argument analogous to that used in the first case implies that,
( L u ) 1 ( x 2 ) = ε u 1 ( x 2 ) + j = 1 n a 1 j ( x 2 ) u j ( x 2 ) < 0
thus arriving at a contradiction. □
As a straightforward implication of the previous lemma, the following stability result holds.
Lemma 2.
Let A ( x ) satisfies (5) and (6). Let u be the solution of (1) and (2). Then,
| | u ( x ) | | Ω ¯ max | | β u ( 0 ) | | , 1 α | | L u | | Ω Ω + .
Proof. 
Introduce the pair of functions
θ ± ( x ) = max β u ( 0 ) , 1 α L u Ω Ω + ± u ( x ) , x Ω ¯ θ ± ( x ) = M ± u ( x )
where M = max { | | β u ( 0 ) | | , 1 α | | L u | | Ω Ω + } . Then, it is true that β θ ± ( 0 ) 0 , [ θ ± ] ( d ) 0 , by a proper choice of C and L θ ± ( x ) 0 on Ω Ω + . It follows from Lemma 1 that θ ± ( x ) 0 on Ω ¯ . Hence,
| u ( x ) | max | | β u ( 0 ) | | , 1 α | | L u | | Ω Ω + .
Lemma 3.
Assume that A ( x ) fulfills the conditions specified in (5) and (6). Let u denote the solution of (1) and (2). Then, for each index i = 1 , 2 , , n and for all x Ω Ω + , there exists a constant C such that
| u i ( x ) | C ϕ + f Ω Ω + | u i ( x ) | C ε 1 ϕ + f Ω Ω + | u i ( x ) | C ε 2 ϕ + f Ω Ω + + f Ω Ω + .
Proof. 
The argument proceeds analogously to the proof of Lemma 2 in [11].

3. Estimates for the Derivative Components

To obtain more precise derivative estimates, we split the solution into a regular part v and a singular part w , such that
u = v + w .
The regular component v is defined to satisfy the following boundary value problem:
L v ( x ) = f ( x ) , x Ω Ω + β v ( 0 ) = β u 0 ( 0 ) .
Correspondingly, the singular component w is defined as the solution to the problem described below:
L w ( x ) = 0 , x Ω Ω + β w ( 0 ) = β ( u v ) ( 0 ) , [ w ] ( d ) = [ v ] ( d ) .
Theorem 2.  Suppose A ( x ) meets the conditions specified in (5) and (6). Then, for every x Ω Ω + and for k = 0 , 1 , 2 , the components v i , i = 1 , , n , of the regular component v along with their derivatives satisfy the following estimates:
| | v ( k ) | | Ω Ω + C for k = 0 , 1 | [ v ] ( d ) | C , | [ v ] ( d ) | C | | v i | | Ω Ω + C ε 1 for i = 1 ( 1 ) n .
Proof. The findings can be established by utilizing the techniques described in [9].
| | v ( k ) | | Ω Ω + C for k = 0 , 1
Also for i = 1 , 2 , , n ,
| | v i | | Ω Ω + C ε 1
and
| [ v i ] ( d ) | = v i ( d + ) v i ( d ) | v i ( d + ) | + | v i ( d ) | C .
Similarly, | [ v ] ( d ) | C , and hence the proof is completed. □
We now aim to find bounds on the layer components of u . Consider the layer functions:
B l ( x ) = e α x / ε , B r ( x ) = e α ( x d ) / ε , i = 1 ( 1 ) n B ( x ) = B l ( x ) + B r ( x ) .
Theorem 3.  Provided that A ( x ) adheres to the criteria outlined in (5) and (6), the singular part w of the solution has components w i ( i = 1 , , n ) whose values and derivatives satisfy the following bounds for all x Ω Ω + .
| w i ( x ) | C B l ( x ) , x Ω C B r ( x ) , x Ω + | w i ( x ) | C ε 1 B l ( x ) , x Ω C ε 1 B r ( x ) , x Ω + | w i ( x ) | C ε 2 B l ( x ) , x Ω C ε 2 B r ( x ) , x Ω + .
Proof. Since u = v + w , and by Lemma 2 we have | w ( 0 ) | C and | w ( d + ) | C , we proceed by introducing the barrier function
ξ ± = C B l ( x ) ± w i ( x )
where C is chosen sufficiently large so that ξ | w | at x = 0 and x = d + .
( L ξ ± ) i ( x ) = ε [ C B l ( x ) ± w i ( x ) ] + C B l ( x ) j = 1 n a i j ( x ) + j = 1 n w j ( x ) = C j = 1 n a 1 j α , j = 1 n a 2 j α , , j = 1 n a n j α B l ( x ) ± w i ( x ) 0 = | L w | Ω
It is straightforward to verify that β ξ ( 0 ) 0 . Applying the maximum principle (1), we obtain the desired bounds on w . To bound the first-order derivative of w i , consider the equation
ε w i + j = 1 n a i j w j = 0
along with the established bounds on w . This implies that
| w i ( x ) | C ε 1 B l ( x ) , x Ω C ε 1 B r ( x ) , x Ω + .
To obtain a sharper bound, consider the system of n 1 equations
E ˜ w ˜ + A ˜ w ˜ = h ,
To derive a more accurate bound, we analyze the reduced system consisting of n 1 equations:
E ˜ w ˜ + A ˜ w ˜ = h ,
where E ˜ and A ˜ are the matrices obtained by eliminating the last row and column of E and A, respectively. The vector h has components defined by h i = a i n w n for 1 i n 1 . By utilizing previously derived bounds and decomposing w ˜ into its regular and singular components, w ˜ = q + r , we can establish the required result.
To estimate the second derivatives, we differentiate the equation
ε w i + j = 1 n a i j w j = 0
once more. Applying earlier bounds on w i then yields the desired estimates for the singular component w and its derivatives. □
A finer decomposition of the singular component w is required to facilitate the convergence analysis. The next Lemma provides the necessary estimates of decomposed layer functions.
Theorem 4.  For each 1 i n , the singular component w can be broken down as follows:
w i ( x ) = q = 1 n w i , q ( x )
where
| w i , q ( x ) | C ε 1 B l ( x ) , x Ω C ε 1 B r ( x ) , x Ω + | w i , q ( x ) | C ε 2 B l ( x ) , x Ω C ε 2 B r ( x ) , x Ω +
Proof. Define a function w i , 1 as follows
w i , 1 ( x ) = w i ( x ) q = 2 n w i , q ( x )
and for 1 < q n , we have
w i , q = k = 0 2 [ ( x x q 1 , q ) k ] k ! w i ( k ) ( x q 1 , q ) , x [ 0 , x q 1 , q ) , w i ( x ) r = q + 1 n w i , r ( x ) , x [ x q 1 , q , d ) , k = 0 2 [ ( x d x q 1 , q ) k ] k ! w i ( k ) ( d + x q 1 , q ) , x ( d , d + x q 1 , q ) , w i ( x ) r = q + 1 n w i , r ( x ) , x [ d + x q 1 , q , 1 ] .
We now determine the estimates for the second derivative.
For x [ x n 1 , n , d ] [ d + x n 1 , n , 1 ] .
| ε w i , n ( x ) | = | ε w i ( x ) | C ε 2 B l ( x )
For x [ 0 , x n 1 , n ) ( d , d + x n 1 , n ) .
| ε w i , n ( x ) | = | ε w i ( x n 1 , n ) | C ε 1 B l ( x n 1 , n ) C ε 1 B l ( x )
Now for each 2 q n 1 , from this, it can be inferred that
On the interval x [ x q 1 , q , d ) [ d + x q 1 , q , 1 ] ,
w i , q ( x ) = 0 .
On the interval x [ 0 , x q 1 , q ) ( d , d + x q 1 , q ] .
| ε w i , q ( x ) | = | ε w i ( x q 1 , q ) | C ε 2 B l ( x q 1 , q ) C ε 2 B l ( x ) .
On the interval x [ x 1 , 2 , d ) [ d + x 1 , 2 , 1 ] ,
w i , 1 ( x ) = 0 .
On the interval x [ 0 , x 1 , 2 ) ( d , d + x 1 , 2 ] .
| ε w i , 1 ( x ) | = | ε w i ( x ) q = 2 n ε w i , q ( x ) | C ε 2 B l ( x ) .
The relation corresponding to the bounds of the first derivatives is given by:
| w i , q ( x ) | = x x q , q + 1 w i , q ( t ) d t C ε 1 x x q , q + 1 B l ( t ) d t C ε 1 B l ( x ) .

4. The Shishkin-Type Mesh

Consider a piecewise-uniform Shishkin mesh Ω ¯ N = { x j } j = 1 N consisting of N mesh intervals, constructed in the following manner. The domain [ 0 , 1 ] is partitioned into four subintervals:
[ 0 , σ ) ( σ , d ] ( d , d + τ ] ( d + τ , 1 ] .
A uniform mesh with N 4 points is then generated on each of these subintervals. The interior mesh points are denoted by { x j } .
Ω N = x j : 1 j N 2 1 x j : N 2 + 1 j N 1 .
Clearly, the midpoint of the mesh satisfies x N 2 = d , and the mesh is given by Ω ¯ N = { x j } j = 0 N . Note that the mesh reduces to a uniform mesh when τ = d 2 and σ = 1 d 2 . To adapt the mesh for the singularly perturbed problem (1), the parameters τ and σ are selected as functions depending on N and ε .
σ = min d 2 , ε α ln N τ = min 1 d 2 , ε α ln N .

5. Formulation of the Discrete Problem

Problems (1) and (2), which are of mixed initial value type, are numerically solved using a fitted mesh framework based on the piecewise-uniform grid Ω ¯ N and standard finite differences. The resulting scheme for i = 1 , 2 , , n takes the form:
( L N U ) i ( x j ) = E D U ( x j ) + A ( x j ) U ( x j ) = f ( x j ) , j N 2
with
β N U ( 0 ) = U ( 0 ) E D + U ( 0 ) = ϕ
and at x N 2 = d , the numerical scheme is formulated as
L N U ( x N 2 ) = E D U ( x N 2 ) + A ( x N 2 ) U ( x N 2 ) = f ( x N 2 1 ) .
The system described by (13) and (14) can be cast into operator form as well.
L N U = f on Ω N with
β N U ( 0 ) = ϕ
where L N = E D + A with
β N = I E D +
The operators D + and D represent forward and backward difference operators, respectively.
D U ( x j ) = U ( x j ) U ( x j 1 ) x j x j 1 , D + U ( x j ) = U ( x j + 1 ) U ( x j ) x j + 1 x j , j = 1 , 2 , , N .
The subsequent discrete results exhibit behavior similar to that observed in the continuous setting.
Lemma 4.  Let A ( x ) satisfy conditions (5) and (6). Suppose a mesh function Z ( x j ) satisfies
β N Z ( x 0 ) 0 and L N Z ( x j ) 0 , for all x j Ω N
and also
( D + D ) Z ( x N 2 ) 0 .
Then, it follows that
Z ( x j ) 0 for all x j Ω ¯ N .
Proof. Let x q be the point at which Z 1 ( x q ) attains its minimum over Ω ¯ N . If Z 1 ( x q ) 0 , the result is immediate. Without loss of generality, assume that Z 1 ( x q ) < 0 . In this case, it is evident that, x q 0 . Indeed, if x q = 0
β N Z ( 0 ) = Z ( 0 ) E D + Z ( 0 ) < 0 , this contradicts the established condition . .
Therefore, x q 0 . If q N / 2 , it is apparent that
D Z 1 ( x q ) 0 D + Z 1 ( x q )
and hence if x q Ω N , q N / 2 , then
( L N Z ) 1 ( x q ) = ε D Z 1 ( x q ) + a 11 ( x q ) Z 1 ( x q ) + + a 1 n ( x q ) Z n ( x q ) < 0
which is a contradiction. It can therefore be inferred that x q = x N 2 . Then
D Z 1 ( x N 2 ) 0 D + Z 1 ( x N 2 ) D Z 1 ( x N 2 ) .
From the above it is observed that
Z 1 ( x N 2 1 ) = Z 1 ( x N 2 ) = Z 1 ( x N 2 + 1 ) < 0
then, ( L N Z ) 1 ( x N 2 1 ) < 0 , this contradicts our assumption, completing the proof. □
Lemma 5.  Let the matrix function A ( x ) satisfy the assumptions in (5) and (6). Then the vector U , which denotes the numerical solution of (1) and (2), satisfies
| | U | | Ω ¯ N max | | β N U ( 0 ) | | , 1 α | | f | | Ω N Ω + N .
Proof. We now introduce two mesh functions defined as follows
Θ ± ( x j ) = max | | β N Ψ ( 0 ) | | , 1 α | | f | | Ω N Ω + N ± U .
By leveraging the properties of A ( x ) , it can be readily shown that
β N Θ ± ( 0 ) 0 and L N Θ ± 0 on Ω N .
Applying the discrete maximum principle (Lemma 4), it follows that
Θ ± 0 throughout Ω ¯ N .
Consequently,
| | U | | max | | β N Ψ ( 0 ) | | , 1 α | | f | | Ω N Ω + N
thereby establishing the result. □

6. Analysis of the Local Truncation Error

From Lemma 5, we observe that to estimate the error | | U u | | , it is sufficient to bound the quantity L N ( U u ) . Note that, for x j Ω N ,
L N ( U ( x j ) u ( x j ) ) = L N U ( x j ) L N u ( x j ) = E ( D D ) u ( x j )
and
( ( L L N ) u ) i ( x j ) = ε ( D D ) v i ( x j ) + ε ( D D ) w i ( x j )
This represents the local truncation error associated with the first derivative. By subsequently employing the triangle inequality,
| ( L N ( U u ) ) i ( x j ) | | ε ( D D ) v i ( x j ) | + | ε ( D D ) w i ( x j ) | .
The discrete solution U is similarly decomposed into components V and W , eas in the continuous case.
( L N V ) ( x j ) = f ( x j ) on Ω N , β N V ( 0 ) = β v ( 0 )
and
( L N W ) ( x j ) = 0 on Ω N , β N W ( 0 ) = β w ( 0 )
where u is the solution of (11) and w is the solution of (12).
Furthermore, for every i = 1 , 2 , , n ,
| ( β N ( V v ) ) i ( 0 ) | = | ε ( D D + ) v i ( 0 ) | | ( β N ( W w ) ) i ( 0 ) | = | ε ( D D + ) w i ( 0 ) |
| ( L N ( V v ) ) i ( x j ) | = | ε ( D D ) v i ( x j ) |
| ( L N ( W w ) ) i ( x j ) | = | ε ( D D ) w i ( x j ) | .
The error at each mesh point x j Ω ¯ N is given by U ( x j ) u ( x j ) . Correspondingly, the local truncation error L N ( U ( x j ) u ( x j ) ) can be decomposed as follows:
L N ( U u ) ( x j ) = L N ( V v ) ( x j ) + L N ( W w ) ( x j ) .
Taylor series applied to both components—singular and regular—provides
| ε d d x D v k ( x j ) | C ε ( x j x j 1 ) 2 | v k | 2 C N
and
| ε d d x D w k ( x j ) | C ε ( x j x j 1 ) 2 | w k | 2 C ε max [ x j , x j 1 ] | w k |
where k = 1 , 2 , , n , j N 2 .
The next section is dedicated to establishing error estimates for both the smooth and singular components.

7. Estimation of Numerical Errors

The validation of the error estimation theorem occurs in two stages: beginning with the evaluation of the smooth component error and then analyzing the singular component error.
Theorem 5.  Suppose A ( x ) meets the criteria outlined in (5) and (6). Let v denote the smooth component of the solution to the continuous problems (1) and (2), and let V signify the smooth component of the solution to the discrete system defined by (13) and (14). Then, the following estimate holds:
( L N ( V v ) ) i ( x j ) C N .
Proof. The expression implies that (19),
| ( β N ( V v ) i ( 0 ) | C ( x 1 x 0 ) max s [ x 0 , x 1 ] | v i ( s ) | C N
It is straightforward to show that
ε ( D D ) v i ( x j ) C h j max s I j | ε v i ( s ) | C h j C N
thus satisfying the requirement. □
Lemma 6.  Assume that A ( x ) fulfills the conditions stated in (5) and (6). Let w denote the singular part of the solution to problems (1) and (2), and let W represent the singular part of the solution to the discrete system given by (13) and (14). Then, the following bound holds:
( L N ( W w ) ) i ( x j ) C N ln N .
Proof. To show this Theorem, the accuracy estimates for singular components must be assessed at different sub intervals in the following manner:
Case (i): The solution strategy hinges on whether σ the transition parameter, is d 2 or ε α ln N .
Sub-case (i): When σ = d 2 , the mesh is uniform and meets the condition ε α ln N d 2 .
The expression implies that (20),
| β N ( W w ) ( 0 ) | C ε ( x 1 x 0 ) max s [ x 0 , x 1 ] | w ( s ) | C N ln N .
The solution approach outlined above thus produces
L N ( W w ) ( x j ) C ε ( x j x j 1 ) | w | 2 .
Since x j x j 1 2 N 1 , the estimate for | w | 2 obtained which gives
L N ( W w ) ( x j ) ε 2 ( x j x j 1 ) | w | 2 ε N 1 C ε 2 e α x ε C ε N .
Therefore,
L N ( W w ) ( x j ) C N ln N , sin ce ε 1 2 d ln N α .
Sub-case (ii): For σ = ε α ln N , the mesh is piecewise uniform, featuring a mesh size of 4 σ N on the interval [ 0 , σ ] and 4 ( d σ ) N on the interval [ σ , d ] .
Case (ii): The solution strategy varies depending on whether the transition parameter τ equals 1 d 2 or ε α ln N .
Sub-case (i): When τ = 1 d 2 , the mesh is uniform and satisfies the inequality ε α ln N 1 d 2 .
Accordingly, by following the same arguments used in the initial case, the proof is concluded.
Sub-case (ii): For τ = ε α ln N , the mesh becomes piecewise uniform with mesh widths 4 τ N on the segment [ d , d + τ ] and 4 ( 1 ( d + σ ) ) N on [ d + τ , 1 ] .
From this, we deduce that
| L N ( U u ) i ( x j ) | C N ln N , j N 2 .
Focusing now on x N 2 = d ,
| ( L N ( U u ) ) i ( d ) | C ε h + max [ x N 2 , x N 2 + 1 ] | y i ( η ) | + C ε h max [ x N 2 1 , x N 2 ] | y i ( θ ) | where x N 2 < η < x N 2 + 1 , x N 2 1 < θ < x N 2 C σ N 1 B ( η ) ε + C N B ( θ ) ε C σ N 1 ε + C N B ( θ ) ε C N ln N .
By applying the discrete maximum principle and conducting error bound derivation for both the regular and singular components, we arrive at the following key result, which is presented in this section.
Theorem 6.  Let u be the solution of the continuous problem (1) and (2), and U the solution of the discrete problem (13) and (14). Then, for sufficiently large N,
| | ( L N ( U u ) ) | | C N ln N
where C is a constant that does not depend on ε or N.
Proof. This proof mirrors the argument used in Theorem 2 of [10]. □

8. Numerical Experiment

This section illustrates the numerical method described above with a practical example.
Example 1.  We focus on the singularly perturbed mixed-type initial value problems characterized by discontinuous source terms, as given below.
ε u 1 ( x ) + ( 2 + x ) u 1 ( x ) u 2 ( x ) u 3 ( x ) = f 1 ( x ) , x Ω Ω + ε u 2 ( x ) u 1 ( x ) + 4 u 2 ( x ) u 3 ( x ) = f 2 ( x ) , x Ω Ω + ε u 3 ( x ) u 1 ( x ) u 2 ( x ) + ( 4 + e x ) u 3 ( x ) = f 3 ( x ) , x Ω Ω +
with
β u 1 ( 0 ) = 1 , β u 2 ( 0 ) = 1 , β u 3 ( 0 ) = 1 ,
where
f 1 ( x ) = 1 for 0 x 0.4 1 for 0.4 x 1 , f 2 ( x ) = 3 for 0 x 0.4 0.5 for 0.4 x 1 , f 3 ( x ) = 2 for 0 x 0.4 1 for 0.4 x 1 ,
As the exact solution for the test example is not known, the error in U is estimated by comparing it with the numerical solution U ˜ obtained on a finer mesh x ˜ j , which incorporates both the original mesh points and their midpoints. Calculations are carried out for different values of N and the perturbation parameter ε .
D ε N = | | U U ˜ ( x i ) | | Ω ¯
Figure 1 displays the numerical solution for Example 1 obtained through the fitted mesh method described by (13) and (14). The corresponding error constants and observed orders of convergence are summarized in Table 1.

9. Conclusions

In this paper, numerical methods are developed to solve linear systems of initial value problems characterized by identical singular perturbation parameters, discontinuous source terms, and Robin initial conditions. The proposed approach yields approximations that are uniformly convergent in the maximum norm across the perturbation parameter, with accuracy approaching first order. Numerical results, including convergence plots, confirm the first-order behavior of the schemes. Additionally, discrete derivatives of the solutions are computed and presented. The development of Shishkin meshes and corresponding numerical methods has proven to be both effective and intellectually engaging.

Author Contributions

Conceptualization, S.D.; methodology, S. D.; software, S.D.; validation, S.D., G.E.C., S.S and G.R.; formal analysis, S.D.; investigation, S.D., S.S.,G.R. and G.E.C.; resources, S.D.; data curation, S.D. and S.S.; writing—original draft preparation, S.D., S.S. and G.R.; writing—review and editing, S.D., S.S.,G.R. and G.E.C.; visualization, S.D.; supervision, G.E.C. and S.D.; project administration, S.D.; 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. Cen, Z.; Xu, A.; Le, A. A second-order hybrid finite difference scheme for a system of singularly perturbed initial value problems. J. Comput. Appl. Math. 2010, 234, 3445–3457. [CrossRef]
  2. Dunne, R.K.; Riordan, E.O’. Interior layers arising in linear singularly perturbed differential equations with discontinuous coefficients. In: Proceedings of the Fourth International Conference on Finite Difference Methods: Theory and Applications. Lozenetz, Bulgaria 2006, 29–38.
  3. Doolan, E.P.; Miller, J.J.H.; Schilders, W. H. A. Uniform Numerical Methods for Problems with Initial and Boundary Layers, Boole Press, 1980.
  4. Farrell, F.A.; Hegarty, A.;Miller, J.J.H.; O’Riordan, E.; Shishkin, G. I. Robust computational techniques for boundary layers. In R.J. Knops, K.W. Morton (Eds.), Applied Mathematics & Mathematical Computation, Chapman & Hall/CRC Press, 2000.
  5. Maragatha Meenakshi, P.; Valarmathi, S.; Miller, J. J. H. Solving a partially singularly perturbed initial value problem on Shishkin meshes. Applied Mathematics and Computation 2010, 215, 3170–3180. [CrossRef]
  6. 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 publishing Co.Pvt.Ltd., Singapore 1996.
  7. Roos, H.G.; Stynes, M.; Tobiska, L. Robust numerical methods for singularly perturbed differential equations. Springer Series in Computational Mathematics, 2nd edn. Springer, Berlin 2008.
  8. Shishkin, G.I. Grid Approximations of Singularly Perturbed Elliptic and Parabolic Equations, Ural Branch of Russian Academy of Sciences 1992.
  9. Valarmathi, S.; Miller, J.J.H. A parameter-uniform finite difference method for singularly perturbed linear dynamical systems. Int. J. Numer. Anal. Model. 2010, 7, 535–548.
  10. Dinesh, S. Linear System of Singularly Perturbed Initial Value Problems with Robin Initial Conditions, Australian Journal of Mathematical Analysis and Applications 2023, 20(1), 1–16.
  11. Dinesh Selvaraj; Joseph Paramasivam Mathiyazhagan. A parameter uniform numerical method for a singularly perturbed initial value problem with Robin initial condition, Malaya Journal of Matematik 2020, 8(2), 414–420.
  12. Hemavathi, S.; Bhuvaneswari, T.; Valarmathi, S.; Miller, J.J.H. A parameter uniform numerical method for a system of singularly perturbed ordinary differential equations. Appl.Math. Comput. 2007, 191, 1–11. [CrossRef]
  13. Rao, S.C.S.; Kumar, S. Second order global uniformly convergent numerical method for a coupled system of singularly perturbed initial value problems. Appl.Math. Comput. 219, 3740–3753.
Figure 1. The figure portrays the numerical solution associated with problem (1), calculated using N = 1152 . The solution components u 1 ( x ) , u 2 ( x ) , and u 3 ( x ) display initial layers as well as a discontinuity located at x = 0.4 .
Figure 1. The figure portrays the numerical solution associated with problem (1), calculated using N = 1152 . The solution components u 1 ( x ) , u 2 ( x ) , and u 3 ( x ) display initial layers as well as a discontinuity located at x = 0.4 .
Preprints 164346 g001
Table 1. Maximum absolute errors at points D ε N , D N , p N , p * and C p * N computed for the example.
Table 1. Maximum absolute errors at points D ε N , D N , p N , p * and C p * N computed for the example.
η Number of discretization points N
72 144 288 576
0.100E+01 0.798E-02 0.436E-02 0.228E-02 0.117E-02
0.250E+00 0.171E-01 0.112E-01 0.655E-02 0.357E-02
0.625E-01 0.162E-01 0.129E-01 0.916E-02 0.597E-02
0.156E-01 0.160E-01 0.127E-01 0.903E-02 0.588E-02
0.391E-02 0.160E-01 0.126E-01 0.900E-02 0.586E-02
D N 0.171E-01 0.129E-01 0.916E-02 0.597E-02
p N 0.409E+00 0.489E+00 0.618E+00
C p N 0.398E+00 0.398E+00 0.377E+00 0.326E+00
The order of ε -uniform convergence p * = 0.4094180 E + 00
Computed ε -uniform error constant, C p * N = 0.3980644 E + 00
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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated