Uniform Error Estimates for Singularly Perturbed Cauchy Problems via Green’s Functions and Spectral Decomposition ()
1. Introduction
Singularly perturbed differential equations arise in mathematical models in which processes evolving on widely separated time or spatial scales interact. Their defining feature is the presence of a small positive parameter multiplying the highest-order derivative. As this parameter approaches zero, the order of the differential equation is reduced, and the limiting problem can no longer accommodate all the conditions imposed on the original equation. This loss of order generally produces thin transition regions, known as boundary or initial layers, where the solution or its derivatives vary rapidly.
These problems occur in fluid mechanics, reaction kinetics, control theory, electrical circuits, transport phenomena, and other areas involving multiple timescales. From the analytical point of view, the principal difficulty is that convergence to the reduced solution is usually nonuniform near the layer. Although the solution itself may converge uniformly, its derivatives may retain an order-one discrepancy within a region whose thickness tends to zero with the perturbation parameter.
For linear ordinary differential equations, the qualitative convergence theory is well established [1]-[3]. Nevertheless, qualitative convergence alone does not determine the rate of approximation, the dependence of the estimates on the data, or the precise contribution of the rapidly decaying characteristic mode. These questions are essential for rigorous asymptotic analysis and for the construction of numerical methods whose accuracy remains uniform with respect to the perturbation parameter.
The purpose of this paper is to derive explicit and parameter-uniform error estimates for a second-order singularly perturbed Cauchy problem with constant coefficients. Our approach combines an exact Green’s function representation with a spectral decomposition of the characteristic roots into slow and fast modes. This makes it possible to identify the initial-layer contribution explicitly and to determine the compatibility condition under which that contribution disappears.
The main contributions of the paper are as follows:
(i) an explicit and rigorous
uniform estimate for the difference between the perturbed and reduced solutions;
(ii) a pointwise decomposition of the derivative error into an exponentially localized initial-layer term and an
remainder;
(iii) an exact compatibility condition ensuring uniform
convergence;
(iv) numerical experiments comparing exact errors with the explicit theoretical bounds;
(v) a closed-form example demonstrating the sharpness of the estimates.
The remainder of the paper is organized as follows. Section 2 introduces the singularly perturbed problem and its reduced counterpart. Section 3 establishes the functional setting and regularity of the reduced solution. Section 4 analyzes the characteristic roots and the separation of timescales, while Section 5 derives the error equation and its Green’s-function representation. Sections 6 and 7 establish the uniform solution and derivative estimates. Section 8 states precise prototypes for extensions, Section 9 presents numerical experiments, and Section 10 gives an explicit example confirming sharpness. Conclusions are collected in Section 11.
2. Problem Formulation
2.1. Problem Statement
Fix
and consider the family of linear, constant-coefficient, second-order Cauchy problems
(2.1)
(2.2)
under the standing hypotheses
(2.3)
Define once and for all the admissible parameter threshold
(2.4)
We take
. This single threshold guarantees real, distinct, negative characteristic roots, the quantitative root separation used in the Green’s-function estimates, and constants independent of
. As
, one formally discards the term
and is left with the reduced first-order problem
(2.5)
Problem (2.5) is of first order, so it can only absorb one of the two initial data in (0.2); the datum
is imposed, but in general
This mismatch generates an initial layer of width
near
, where the derivative of the perturbed solution differs substantially from that of the reduced solution. We address the following questions:
(Q1) Uniform solution error. At what rate does
converge to
on the full interval
?
(Q2) Derivative behavior. Can
be decomposed into an exponentially localized layer and a uniformly small remainder?
(Q3) Compatibility. Which condition on
removes the order-one fast component and restores convergence in
?
(Q4) Optimality. Are the resulting orders best possible?
2.2. State of the Art
The qualitative theory of (2.1)-(2.2) belongs to the classical literature on singular perturbations [4]. O’Malley’s analysis of singular initial-value problems gives uniform asymptotic expansions on finite intervals [5]; more recently, parameter-uniform discretizations and initial-layer correctors have been developed for stiff initial-value problems [6] [7]. Green’s-function estimates with explicit dependence on the perturbation parameter also play a central role in the analysis of layer problems [8]. Closely related is the analysis of incompatible initial and boundary data for singularly perturbed parabolic problems, where an interior or initial layer of order one similarly arises from a data mismatch and is treated by an explicit corrector function [9]. These peer-reviewed results provide the closest analytical and computational context for the present estimates.
In this paper, a problem is called regular if the solutions of the full Cauchy problems converge in
to the solution of the reduced problem as
; this is precisely the qualitative uniform-convergence property referred to in Question 1 above. For the scalar family considered here, the uniform-convergence criterion quoted below is used under the precise assumptions that the coefficients and initial data are independent of
,
,
,
, the reduced problem has a unique solution, and the root lost in the reduction is uniformly stable, namely
for some
. The standing assumptions (2.3), together with
from (2.4), imply all these conditions.
Batard [10] [11] studies the complementary characteristic equation and, using a continuous-convergence theorem attributed to Elsgoltz [12], obtains a qualitative criterion for uniform convergence. In the present positive-coefficient setting, this criterion is consistent with the stability of the characteristic roots:
under the terminology and hypotheses used in those references. The result establishes convergence but does not provide the parameter-uniform bounds derived below.
(L1) a non-asymptotic upper bound for the solution error;
(L2) a separate estimate for the derivative that identifies its fast component;
(L3) a
estimate under the compatibility condition
.
These observations define the scope of the contribution without suggesting that the broader theory of initial layers is new. The novelty claimed here is the particular set of parameter-uniform estimates, explicit constants, and the accompanying optimality calculation for problem (2.1)-(2.2).
2.3. Main Contributions
Using the Green’s function of
and the separation of the characteristic roots into fast and slow modes, we obtain:
(C1) (Theorem 6.1) the non-asymptotic bound
valid on the full interval, with
independent of
;
(C2) (Theorem 7.1) the derivative estimate
which separates the order-one fast contribution from an
remainder and yields uniform derivative convergence away from
;
(C3) (Corollary 7.4) the compatibility implication
(C4) (Example 10.1) a closed-form calculation showing that the
uniform solution error and the order-one derivative discrepancy at
are optimal in general.
(C5) A precise discussion of the additional kernel and spectral hypotheses required to extend the framework to variable coefficients, higher-order equations, and systems (Section 8).
All estimates follow from the exact representation. Every main result below states explicitly which quantities its constants may depend on; none of those constants depends on
.
3. Functional Setting and Reduced Problem
Let
denote the Banach space of
-times continuously differentiable functions with the sup-norm
. Constants are defined locally in each result and are independent of
.
Proposition 3.1 (Reduced Solution Regularity) Under
, the reduced problem (2.5) admits a unique solution
given explicitly by
(3.1)
Moreover,
for
.
Proof. Equation (2.5) is linear first-order with constant coefficient
. Multiplying by the integrating factor
,
and integrating from 0 to
, using
,
which is (3.1). Since
, differentiating (2.5) once gives
, so
, i.e.
; differentiating once more gives
, confirming the stated recurrence for
. □
Theorem 3.2 (Well-Posedness of the Full Problem) For every fixed
, the problem (2.1)-(2.2) possesses a unique solution
.
Proof. Writing
, equation (2.1) is equivalent to the linear first-order system
The matrix is constant and
, so the right-hand side is globally Lipschitz in
and continuous in
. Standard existence and uniqueness theory for linear systems therefore gives a unique solution on
, with
and hence
. □
4. Spectral Analysis and Timescale Separation
The characteristic polynomial of
is
with roots
(4.1)
Since
, the discriminant is positive. Thus both roots are real, negative (by Vieta:
and
), and distinct.
Proposition 4.1 (Rigorous Root Bounds and Asymptotic Expansion) Let
and
. Then, for every
,
(4.2)
Moreover, as
, the roots admit the uniformly valid asymptotic expansions
(4.3)
(4.4)
Proof. Step 1 (an exact closed form for
, and the bound (4.2)). Rationalize the numerator of
in (4.1) by multiplying and dividing by
:
which simplifies, after cancelling
, to the exact,
-uniform identity
(4.5)
For
the quantity
satisfies
, hence
which is exactly the bound on
in (4.2), with no asymptotic approximation involved.
Step 2 (bound on
). By Vieta’s formula
, so
using the lower bound
from Step 1 (so
). The admissible threshold (2.4) implies
For such
,
which is the second bound in (4.2).
Step 3 (asymptotic expansions (4.3)-(4.4)). Write
and use the binomial (Taylor) expansion
for
:
Substituting into
:
which is (4.3). For
,
which is (4.4). (Alternatively, (4.4) follows instantly from (4.3) and Vieta’s identity
, without a second Taylor expansion.) □
Remark 4.2 Only the exact bounds (4.2), not the asymptotic expansions (4.3)-(4.4), are needed to prove the error estimates of Sections 5-6; the expansions are retained because they give the leading-order constants in the worked example of Section 1.
5. Error Equation and Green’s Function
Define the error
. Subtracting (2.5) from (2.1) and using
,
Therefore the exact error equation is
(5.1)
where
, since
and
.
The Green’s function (impulse-response fundamental solution) of
, i.e. the solution of
with
,
, is obtained from the two exponential modes
:
(5.2)
Indeed
and
, as required.
Lemma 5.1 (Uniform Bounds for the Green’s Function and Its Derivative) For every
and
, estimates (5.3)-(5.5) hold with
These constants depend only on
and are independent of
,
, and the initial data.
(5.3)
(5.4)
(5.5)
Proof. Step 1 (lower bound for the denominator). By (4.1),
. Definition (2.4) gives
, hence
. Equivalently,
Thus both (4.2) and
hold throughout
; no additional parameter threshold is introduced.
Step 2 (bound (5.3)). Since
by Proposition 4.1 and
, both
and
lie in
, so
Hence, using
,
This proves (5.3) with the explicit constant
.
Step 3 (bound (5.4)). Differentiating (5.2),
Term (I). By (4.2),
and
, so
(
, by (4.2),
hence
.
Term (II). Write
. From Vieta,
, so
; since
,
for
, because
. By (0.8),
with
. Hence
.
Combining (I) and (II) with
and
gives
which is (5.4).
Step 4 (integral bounds (5.5)). Directly,
. For the second,
using
and bounding both terms by
.
This is (5.5) (with the constant
in place of the schematic
). □
By the variation-of-parameters formula for the linear operator
, the unique solution of (5.1) is
(5.6)
Remark 5.2 (Derivation of (5.6)) Write
. The homogeneous part
solves
with
,
; since
itself already satisfies
,
, the multiple
satisfies
and
, as required. The particular part
solves
with zero initial data; by Duhamel’s principle for the impulse response
,
because the forcing term of (5.1) is exactly
and
is, by definition, the response of
to a unit impulse. Summing
gives (5.6).
6. Uniform Convergence of the Solution
Theorem 6.1 (Optimal
Uniform Error Bound) Under (2.3), for every
,
(6.1)
with
as in Lemma 5.1. In particular
uniformly on
as
.
Proof. Fix
. From the exact representation (5.6) and the triangle inequality,
By (5.3),
for the first term. For the integral term, bound
(constant, taken out of the integral) and
pointwise for
, so
since
. Adding the two bounds,
Since the right-hand side does not depend on
, taking the supremum over
gives (6.1) with
. □
Remark 6.2 Theorem 6.1 strengthens the qualitative convergence statement discussed in Section 2.2 by providing a parameter-uniform
bound valid for every
.
7. Initial Layer Analysis for the Derivative
Differentiating (5.6) in
(the boundary term at
inside the integral is handled by Leibniz’s rule, and vanishes because
):
Theorem 7.1 (Derivative Estimate with an Initial-Layer Term) For all
and
, estimate (7.1) holds with
Thus
and
depend only on the fixed coefficients and
, and are independent of
,
, and the initial data.
(7.1)
Proof. We treat the two terms of
separately.
Step 1: the homogeneous (initial-condition) term
. From (5.2),
For the slow component,
and
. Therefore
and
. For the fast component, the exact formulae for the roots give
where we used
. Since
, the two components satisfy
(7.2)
for every
and
.
Step 2: the convolution (particular) term. Integrate by parts in
by setting
,
, so
and, since
, we take
:
At
:
, so this boundary contribution vanishes. At
: the term is
(mind the overall sign from evaluating the bracket at the lower limit with a minus sign in front). Hence
Using
from (5.3) for both the boundary term and inside the integral,
Multiplying by
,
(7.3)
Step 3: conclusion. Since
, combining (7.2) and (7.3) via the triangle inequality gives, with
and
,
which is (7.1). □
Remark 7.2 Estimate (7.1) separates the possible order-one contribution, whose amplitude is controlled by
, from a remainder of order
. Once the fast term has decayed, or when
, the derivative error is uniformly
.
Corollary 7.3 (Uniform Convergence Away from the Layer) For every fixed
,
uniformly on
as
; more precisely,
Proof. For
,
since
is decreasing; substituting this into (7.1) gives the displayed bound. As
,
(in fact faster than any power of
, since
for every
, by L’Hôpital or by the standard exponential-dominates-polynomial estimate) and the remainder term
linearly; hence the whole right-hand side tends to 0. □
The Compatibility Condition
Corollary 7.4 (Strong
-Convergence under Compatibility) If
(equivalently
), then
(7.4)
for a constant
depending only on
.
Proof. If
, the order-one term in (7.1) is absent, leaving
Also, setting
in (6.1) gives
. Adding the two bounds (and enlarging
if necessary to absorb both) gives (7.4). □
Remark 7.5 The compatibility condition removes the order-one fast contribution associated with the initial slope mismatch and upgrades uniform convergence of the solution to
convergence with the same order
.
8. Extensions to Variable Coefficients and Higher-Order Systems
8.1. Variable Coefficients
Consider the prototype
(8.1)
A direct extension of the present argument would assume
,
,
, and constants
such that
The reduced problem
,
, must possess a unique
solution. In addition, the first-order formulation must admit a slow-fast exponential dichotomy: its evolution operator has a one-dimensional fast component
satisfying
with
independent of
. Finally, the Green kernel
must satisfy analogues of (5.3)-(5.5), uniformly on the triangle
. The natural compatibility condition remains
. Under these assumptions the representation and estimates of Sections 5 - 7 can be repeated, with constants depending on
, and
, but not on
. Proving this dichotomy and the kernel bounds is a separate theorem and is not claimed here.
8.2. Higher-Order Equations
For the prototype
, assume
is bounded away from zero, the coefficients and
have sufficient bounded regularity to produce the derivatives of the reduced solution used by the residual, and the reduced
st-order problem is well posed. A usable spectral hypothesis is that the first-order companion system has exactly one fast spectral subspace with real parts bounded above by
, while its remaining spectrum stays in
and is separated from the fast spectrum by at least
. The initial datum associated with the lost derivative must match the corresponding derivative of the reduced solution if uniform convergence of that derivative is sought. Without this spectral separation, neither the number nor the scale of the layers is determined by the differential order alone.
8.3. Systems
Consider
, where
may lose rank in the limit. Assume
,
, all coefficients and their stated derivatives are bounded, and the reduced differential-algebraic problem is well posed. Let the matrix pencil
split uniformly into slow and fast spectral bundles with constant dimensions, uniformly bounded spectral projectors, a gap of size at least
, and fast evolution satisfying
. Compatibility requires the initial vector to have no leading-order component in the fast bundle relative to the reduced initial state. Together with a matrix Green-kernel bound uniform in
, these assumptions are the system counterpart of those used in Lemma 5.1; see [15]. Their verification for particular systems lies beyond the scope of this paper.
9. Numerical Experiments
We test the explicit constants using the problem of Example 10.1 on
. Thus
,
,
,
, and
. The exact solution is evaluated from (10.1); no numerical ODE solver or discretization error enters the comparison. The parameter values
all belong to
, since
. Supremum errors were calculated on a uniform grid of
points. For this example, Theorem 6.1 gives
(9.1)
whereas Theorem 7.1 gives the pointwise estimate
(9.2)
Table 1. Exact maximum-norm errors and explicit theoretical bounds on
.
|
|
|
bound
|
|
|
|
0.6752 |
|
1.0000 |
|
|
0.7744 |
|
1.0000 |
|
|
0.8511 |
|
1.0000 |
|
|
0.9059 |
|
1.0000 |
|
|
0.9426 |
|
1.0000 |
Table 1 shows that
tends toward a nonzero limit, numerically confirming the sharp
rate. The bound
holds for every tested value but is deliberately conservative because it is obtained from coefficient-only kernel estimates. The derivative error remains exactly one in the maximum norm because
for every
; this confirms that uniform derivative convergence fails when the compatibility condition is violated.
Figure 1. Exact errors and theoretical bounds for the test problem. Top left: exact solution error on
. Top right:
and the bound
on logarithmic axes. Bottom left: derivative error near the initial layer. Bottom right: derivative error and the pointwise bound (0.25), plotted against the stretched coordinate
.
Figure 1 confirms both scales predicted by the analysis. The solution error decreases proportionally to
, while the derivative discrepancy is concentrated in a region whose width is proportional to
. In the stretched coordinate
, the derivative profiles nearly collapse onto a common exponentially decaying curve. The explicit bounds remain above the exact errors, thereby validating their parameter-uniform character, while the nonzero initial derivative discrepancy confirms the sharpness of the layer amplitude.
10. Explicit Example and Sharpness
Example 10.1 (Fully Worked Example Validating Sharpness) Take
,
,
:
Reduced problem.
,
; by (0.6),
, so
and
. Hence
: the compatibility condition of Corollary 0.12 fails, and we expect a genuine
boundary layer in the derivative.
Exact roots. By (4.5) with
: setting
,
Exact closed form of
. Writing
and imposing
,
gives the linear system
whose determinant is
; solving by Cramer’s rule,
Thus, exactly (no approximation yet),
(10.1)
At
, the expression gives
, as required.
Expansion in
. Since
(Step 3 of Proposition 4.1 with
), we compute the two coefficients to
:
Also
(consistent with (4.3)), so
Substituting into (10.1) and keeping terms up to
:
so that
(10.2)
Since
with
(Proposition 4.1 with
), the last term satisfies
; combined with (10.2) this gives
which has the form
. To verify optimality, fix any
. Then (10.2) gives
Hence
is bounded below by a positive multiple of
for sufficiently small
. Together with Theorem 6.1, this proves
for this example.
Derivative. Differentiating (10.1) exactly,
For the first term, using
and
,
so, multiplying by
,
For the second term,
and, since
(by (4.4) with
), we get
, so
Adding the two contributions,
(10.3)
Since
, we have
. On the fixed interval
, this is bounded by
for any fixed
and all sufficiently small
. Hence (10.3) reads
which is the two-scale structure predicted by Theorem 7.1. Moreover,
for every
. Consequently, the derivative cannot converge uniformly on
when
, and the order-one layer amplitude in the theorem is optimal in general.
11. Conclusions
We derived parameter-uniform estimates for the singularly perturbed Cauchy problem by combining an exact Green’s-function representation with the separation of the slow and fast characteristic roots. The main conclusions are:
on the complete interval, with a constant independent of
;
the derivative error is bounded by an exponentially localized term proportional to
plus an
remainder;
if
, then
in
with order
;
the closed-form example proves that the uniform solution rate and the order-one derivative discrepancy at the initial point are optimal in general.
The discussion of variable coefficients, higher-order equations, and systems also clarifies which kernel estimates and spectral assumptions would be needed to extend the argument. These extensions require separate analysis and are not claimed by the present results.
Possible continuations include nonlinear perturbations and numerical schemes whose error bounds remain uniform as
.
Acknowledgments
The author thanks the institutions of affiliation for their support. Special thanks to Dr. Lorgio Félix Batard Martínez for his foundational work on singular perturbations, and to Aisseli Comet Marrero for her detailed error estimates, which provided the starting point for our rigorous analysis.
Author Contributions
All authors contributed to the mathematical analysis and the revision of the manuscript. All authors read and approved the final version.