Next Article in Journal
Comparative Evaluation of Quarter-Car-Model-Based Modular Synthesis and Symmetry-Based Full-Car-Based Centralized Synthesis for Active Suspension Control
Previous Article in Journal
Analysis of a Mixed Dispersion Nonlinear Hydrodynamic Model Exhibiting Single and Periodic Solitary Wave Modes with Its Invariance Under Infinitesimal Transformation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fixed Point Theorems for (Ω-Π)-Contractions in Complete S-Metric Spaces

by
Ghadah Albeladi
1,*,
Maryam A. Alghamdi
2,
Mohamed Gamal
3 and
Youssri Hassan Youssri
4,*
1
Department of Mathematics, Faculty of Sciences & Arts, King Abdulaziz University, Rabigh 21911, Saudi Arabia
2
Department of Mathematics and Statistics, College of Science, University of Jeddah, Jeddah 21589, Saudi Arabia
3
Department of Mathematics, Faculty of Science, Qena University, Qena 83523, Egypt
4
Department of Mathematics, Faculty of Science, Cairo University, Giza 12613, Egypt
*
Authors to whom correspondence should be addressed.
Symmetry 2026, 18(7), 1066; https://doi.org/10.3390/sym18071066 (registering DOI)
Submission received: 9 May 2026 / Revised: 5 June 2026 / Accepted: 15 June 2026 / Published: 23 June 2026
(This article belongs to the Section Mathematics)

Abstract

We introduce ( Ω , Π ) -contractions in complete S-metric spaces, where Ω , Π : ( 0 , ) R satisfy Π ( t ) < Ω ( t ) . Under natural comparison conditions, we prove asymptotic regularity and S-Cauchy Picard iterates. With either a closed-graph condition or lim   sup t 0 + Π ( t ) < lim   inf t ε + Ω ( t ) for every ε > 0 , we establish unique fixed points and strong convergence from any initial point. Our results generalize the Banach contraction principle to S-metric spaces and subsume recent theorems on asymptotically regular mappings and implicit contractions. An application solves a nonlinear boundary value problem for diffusion between parallel walls.

1. Introduction

Fixed point theory ( FPT ) in generalized metric structures has become a central theme of contemporary nonlinear analysis, driven both by intrinsic mathematical interest and by applications to differential, integral, and iterative equations [1,2]. In particular, several authors have extended the classical Banach contraction principle ( BCP ) to various generalized metric spaces, such as b-metric, G-metric, and gauge-type spaces; see, for example, refs. [3,4,5]. Sedghi et al. (2012) introduced the concept of S-metric spaces and proved a FP theorem for self-mappings on complete S-metric spaces, analogous to the BCP [6]. This is a foundational paper in the area and has generated a substantial follow-up literature. Among the various extensions of the classical metric framework, S-metric spaces, introduced as a three-point generalization of standard metrics, provide a flexible setting in which many classical results can be reformulated and substantially strengthened [7,8]. In this context, contractive conditions are often expressed not only via numerical Lipschitz constants but also through functional inequalities involving auxiliary control functions, leading to a rich hierarchy of generalizations of the BCP [9,10]. A second line of development, originating in the work on asymptotically regular mappings, emphasizes the long-term behavior of iterates rather than pointwise continuity or simple Lipschitz bounds [11,12]. Asymptotic regularity has proved to be a powerful tool: under mild contractive-type conditions, it allows one to promote qualitative information about the orbit { x n } into the existence of fixed points ( FP s), and to obtain convergence of Picard-type iterations in spaces more general than classical Banach spaces [13,14,15]. This approach has been successfully combined with Caristi-type, Suzuki-type, and implicit contractive conditions in several generalized metric structures, including G-metric, b-metric, and gauge-type spaces; see, for instance, refs. [16,17,18].
The paper spawned many extensions. Hieu et al. (2014) generalized Ćirić quasi-contractions to S-metric spaces [19]. Özgür et al. (2016) proved generalizations of the Nemytskii–Edelstein and Ćirić FP theorems for continuous self-mappings of compact S-metric spaces [20]. Taş (2017) [21] extended the theory from FP s to fixed circles on S-metric spaces. More recently, Özgür and Taş (2018) surveyed generalizations from S-metric to S b -metric spaces, connecting the Rhoades contractive conditions to this broader framework [22]. Sedghi himself later co-authored a paper on Suzuki-type FP theorems in S-metric spaces [23]. Other directions include coupled coincidence FP s (Raj et al. 2014) [24], α ψ -contractive mappings (Mlaiki, 2014) [25], and generalized weakly contractive mappings (Chaipornjareansri, 2018) [26]. This overview is based on a quick literature search; a deeper review would likely reveal additional extensions and applications of S-metric space theory. Recent work on common FP theorems in S-metric spaces has continued to extend the classical framework through implicit relations and generalised contractive conditions. For example, Saluja (2023) [27] proved common FP theorems for weakly compatible self-mappings involving a control function in S-metric spaces, while Popa et al. (2024) [8] established a general FP theorem for a pair of multivalued mappings satisfying implicit relations. More recently, Patriciu and Popa (2025) [28] extended mixed implicit relations to S-metric spaces for a pair of mappings, and Sharma et al. (2025) [29] proved new common fixed-point theorems for pairs of weakly compatible mappings in S b -metric spaces. The Banach and Wardowski types use one control mechanism, whereas the ( Ω , Π ) -approach introduces a two-function comparison scheme that allows a finer balance between the image and preimage distances. This makes the framework flexible enough to recover classical results while also covering nonlinear situations that cannot easily be reduced to a single constant or a single control function. The present paper contributes to this program in the setting of complete S-metric spaces by introducing and studying a class of ( Ω , Π ) -contractions, where Ω and Π are real-valued control functions defined on ( 0 , ) . Under natural comparison conditions between Ω and Π , we first establish that such mappings are asymptotically regular and that their iterates generate S-Cauchy sequences. Building on this, and imposing either a closed-graph assumption or a suitable lim sup–lim inf separation between Ω and Π , we prove the existence and uniqueness of FP s together with the strong convergence of the Picard iteration for every initial point in the space.
The main novelty of this paper is the introduction of a two-function contractive framework in S-metric spaces. Unlike most existing generalized contractions, which are based on a single Lipschitz, Wardowski, or implicit control mechanism, the proposed ( Ω , Π ) -conditions decouple the image-side and domain-side behavior of the mapping. This separation yields a more flexible theory and allows the simultaneous treatment of asymptotic regularity, S-Cauchy convergence, and uniqueness in a setting that genuinely extends the current literature. To clarify the strict inclusion hierarchy, we note the following:
Proposition 1.
Let ( X , μ * ) be a complete S-metric space induced by a metric d. If F is a Banach contraction with constant k < 1 , then it satisfies the ( Ω , Π ) -condition with Ω ( t ) = t and Π ( t ) = k t . Conversely, there exist mappings that satisfy an ( Ω , Π ) -condition but fail every standard single-function contraction (Banach, Wardowski, or implicit). Example 3 below provides an explicit operator that meets the ( Ω , Π ) -hypotheses yet has no global Lipschitz constant < 1 and cannot be embedded into the Wardowski framework for any τ > 0 , where τ is the length-of-time interval. This establishes the strict inclusion: Banach Wardowski   ( Ω , Π ) -contractions.

2. Preliminaries

Definition 1
([6]). Let X be any non-empty set and μ * : X × X × X [ 0 , ) a mapping. A pair ( X , μ * ) is commonly termed an S-metric space if for each x , y , z , t X , the subsequent characteristics hold:
1. 
x = y = z if and only if μ * ( x , y , z ) = 0 ,
2. 
μ * ( x , y , z ) μ * ( x , x , t ) + μ * ( y , y , t ) + μ * ( z , z , t ) .
Remark 1.
An S-metric is said to be symmetric if μ * ( x , x , y ) = μ * ( y , y , x ) .
Example 1
([6]). Let X , ϱ is any ordinary metric on X , then
μ * ( x , y , z ) = ϱ ( x , z ) + ϱ ( y , z ) .
is an S-metric defined on X .
Definition 2
([6]). Suppose that ( X , μ * ) is an S-metric space and C X .
1. 
A sequence { x n } in X converges to x if and only if μ * ( x n , x n , x ) 0 as n . That, is for each ε > 0 , there exists γ N such that for all n γ , μ * ( x n , x n , x ) < ε and we denote this by lim n x n = x .
2. 
A sequence { x n } in X is called an S-Cauchy sequence if for each ε > 0 , there exists γ N such that μ * ( x n , x n , x m ) < ε for each n , m γ .
3. 
The S-metric space ( X , μ * ) is said to be complete if every Cauchy sequence is convergent.
Example 2.
Let X = R or X = [ 0 , 1 ] , and define
μ * ( x , y , z ) = | x y | + | y z | + | z x | , x , y , z X .
Then ( X , μ * ) is a complete S-metric space.
Proof. 
We begin by verifying that μ * satisfies the S-metric axioms. If x = y = z , then clearly
μ * ( x , y , z ) = | x x | + | x x | + | x x | = 0 .
Conversely, if μ * ( x , y , z ) = 0 , then
| x y | + | y z | + | z x | = 0 .
Since each term is non-negative, we must have
| x y | = | y z | = | z x | = 0 ,
and hence x = y = z . Thus, the first axiom holds. Now let x , y , z , t X . Then,
μ * ( x , y , z ) = | x y | + | y z | + | z x | .
By the ordinary triangle inequality,
| x y | | x t | + | t y | , | y z | | y t | + | t z | , | z x | | z t | + | t x | .
Adding these three inequalities gives
μ * ( x , y , z ) 2 | x t | + 2 | y t | + 2 | z t | .
On the other hand,
μ * ( x , x , t ) = 2 | x t | , μ * ( y , y , t ) = 2 | y t | , μ * ( z , z , t ) = 2 | z t | .
Therefore,
μ * ( x , y , z ) μ * ( x , x , t ) + μ * ( y , y , t ) + μ * ( z , z , t ) ,
so the second S-metric axiom also holds. It remains to prove completeness. Let { x n } be a Cauchy sequence in ( X , μ * ) . Then,
μ * ( x n , x n , x m ) = 2 | x n x m | .
Hence, { x n } is Cauchy in the usual metric on X. Since X = R is complete, or X = [ 0 , 1 ] is a closed subset of R and therefore complete, there exists x X such that x n x in the usual metric. Finally,
μ * ( x n , x n , x ) = 2 | x n x | 0 ,
so x n x in the S-metric sense. Therefore every S-Cauchy sequence converges in X, and ( X , μ * ) is complete. □
Definition 3
([6]). Let ( X , μ * ) be an S-metric space. For r R + and x X , we define the open ball β μ * ( x , r ) and closed ball β μ * ( x , r ) ¯ with center x and radius r as follows:
β μ * ( x , r ) = { y X : μ * ( y , y , x ) < r } ,
β μ * ( x , r ) ¯ = { y X : μ * ( y , y , x ) r } .
Definition 4
([6]). Let ( X , μ * ) be an S-metric space, C X .
1. 
If for every x C there exists r > 0 such that β μ * ( x , r ) C , then the subset C is called an open subset of X .
2. 
Any S-metric generates the τ topology on X , where τ is the set of all C X with x C if and only if there exists r > 0 such that β μ * ( x , r ) C .
Lemma 1
([30]). Suppose that Ω : ( 0 , ) R . Then, Conditions ( i ) , ( i i ) and ( i i i ) are equivalent, as follows:
(i) 
inf x > ε Ω ( x ) > for each ε > 0 ;
(ii) 
lim x ε inf Ω ( x ) > for each ε > 0 ;
(iii) 
lim n Ω ( x n ) = lim n x n = 0 .
Lemma 2
([30]). Suppose that Π : ( 0 , ) R . Then, Condition (i) implies Condition (ii), where
(i) 
For every sequence { x n } ( 0 , ) , lim n Π ( x n ) = 0 implies lim n x n = 0 ;
(ii) 
lim   inf x ε + Π ( x ) > 0 for every ε > 0 .

3. Main Results

Definition 5.
Let ( X , μ * ) be a complete S-metric space and F : X X a self-mapping. Assume there exist functions Ω , Π : ( 0 , ) R such that Π ( t ) < Ω ( t )  for all  t > 0 and
Ω μ * ( F x , F x , F y ) Π μ * ( x , x , y ) for all x , y X , μ * ( F x , F x , F y ) > 0 .
Then, F is called an ( Ω , Π ) –contraction on ( X , μ * ) .
The condition Π ( t ) < Ω ( t ) does not by itself guarantee contractiveness in the usual sense. Rather, its role is to provide a strict comparison between the image-side and domain-side control functions. The full contractive behavior of the mapping follows only after combining this strict comparison with the remaining assumptions imposed on Ω and Π in Lemma 1.
Example 3.
Let X = [ 0 , ) equipped with the standard S-metric μ * ( x , y , z ) = | x z | + | y z | . Define F ( x ) = x 1 + x and choose Ω ( t ) = t , Π ( t ) = t 1 + t / 2 for t > 0 . For any x , y X , we have
μ * ( F x , F x , F y ) = 2 x 1 + x y 1 + y = 2 | x y | ( 1 + x ) ( 1 + y ) .
Since ( 1 + x ) ( 1 + y ) = 1 + x + y + x y 1 + | x y | , that is
1 1 + x + y + x y 1 1 + | x y | , for all x , y 0 .
It follows that
μ * ( F x , F x , F y ) 2 | x y | 1 + | x y | = μ * ( x , x , y ) 1 + μ * ( x , x , y ) 2 = Π μ * ( x , x , y ) .
Thus, Ω ( μ * ( F x , F x , F y ) ) Π ( μ * ( x , x , y ) ) . Moreover, Π ( t ) < Ω ( t ) for all t > 0 . Crucially, F is not a Banach contraction: sup x y | F x F y | | x y | = lim x , y 0 1 ( 1 + x ) ( 1 + y ) = 1 , so no Lipschitz constant k < 1 exists. This example strictly lies outside the Banach framework while fully satisfying the ( Ω , Π ) -hypotheses.
Example 4.
Let X = 0 , 1 2 and define the S-metric
μ * ( x , y , z ) = x y + y z + z x , x , y , z X ,
where · denotes the standard absolute value on R . Then ( X , μ * ) is a complete S-metric space. Define F : X X by F ( x ) = x 2 for all x X .
Clearly, F is not a Banach contraction on X, since no constant k [ 0 , 1 ) can satisfy
F ( x ) F ( y ) k x y , x , y X ,
as sup x y x 2 y 2 x y = sup x , y X x + y = 1 .
Now, choose the control functions
Ω ( t ) = t , Π ( t ) = t 1 t 2 , 0 < t 1 , t 2 , t > 1 .
It is immediately evident that Π ( t ) < Ω ( t ) for all t > 0 . Moreover, Ω and Π satisfy the hypotheses of Lemmas 1 and 2.
For any x , y X with x y , we compute
μ * ( F x , F x , F y ) = 2 x 2 y 2 = 2 x y ( x + y ) .
Since x , y 0 , 1 2 , we have max { x , y } 1 2 . Noting that x + y + x y = 2 max { x , y } , it follows that
x + y 1 x y ,
and therefore
μ * ( F x , F x , F y ) 2 x y 1 x y .
Let t = μ * ( x , x , y ) = 2 x y . Since x , y X with x y , we have 0 < t 1 , and thus only the first branch of Π is involved in the verification. Substituting t yields
Π ( t ) = t 1 t 2 = 2 x y 1 x y .
Consequently,
Ω μ * ( F x , F x , F y ) = μ * ( F x , F x , F y ) Π μ * ( x , x , y ) , x , y X .
Therefore, F is an ( Ω , Π ) -contraction on ( X , μ * ) .
Remark 2 (Advantages of Example 4).
Example 4 demonstrates that the ( Ω , Π ) -contraction framework strictly extends the classical Banach principle, as the mapping F ( x ) = x 2 on [ 0 , 1 2 ] fails to admit a global Lipschitz constant k < 1 yet satisfies the two-function inequality on the invariant subset [ 0 , 1 2 ] with Ω ( t ) = t and Π ( t ) = t 1 t 2 , 0 < t 1 . This illustrates the flexibility gained by decoupling domain-side and image-side controls: the sublinear damping of Π compensates for the quadratic growth of F in a manner that is unattainable with a single multiplicative constant. Moreover, the example is fully explicit and computationally transparent, making it suitable both for pedagogical purposes and for verifying hypotheses in applied settings. The ability to localize contractivity to a physically relevant subdomain while accommodating global non-contractivity is particularly valuable for nonlinear models arising in diffusion, population dynamics, or iterative numerical schemes. Finally, the verification relies directly on the three-point structure of the S-metric, confirming that the framework is intrinsically adapted to the geometry of generalized metric spaces rather than being a formal lift of standard metric results.

3.1. Fixed-Point Theorems for ( Ω - Π ) -Contractions in S-Metric Spaces

Lemma 3.
Let ( X , μ * ) be a symmetric S-metric space and let { x n } n N be a sequence in X which is not S-Cauchy. Suppose that
lim n μ * ( x n , x n , x n + 1 ) = 0 .
Then, there exist ε > 0 and two subsequences { x n i } and { x m i } of { x n } such that
lim i μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) = ε
and
lim i μ * ( x n i , x n i , x m i ) = 2 lim i μ * ( x n i + 1 , x n i + 1 , x m i ) = lim i μ * ( x n i , x n i , x m i + 1 ) = ε .
Proof. 
Since { x n } is not an S-Cauchy sequence and
lim n μ * ( x n , x n , x n + 1 ) = 0 ,
there exists ε > 0 such that for every k N there are indices n , m k such that m n and
μ * ( x n + 1 , x n + 1 , x m + 1 ) > ε and μ * ( x n + 1 , x n + 1 , x n ) ε .
By choosing the smallest m n for which μ * ( x n + 1 , x n + 1 , x m + 1 ) > ε holds, we conclude that for every k 1 > k there exists n , m k , such that
μ * ( x n + 1 , x n + 1 , x m + 1 ) > ε and μ * ( x n + 1 , x n + 1 , x m ) ε 2 .
Thus, we can construct two subsequences { x n i } and { x m i } of { x n } such that
μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) > ε and μ * ( x n i + 1 , x n i + 1 , x m i ) ε 2 .
From these inequalities and S-metric inequality, we get
ε < μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) μ * ( x n i + 1 , x n i + 1 , x m i ) + μ * ( x n i + 1 , x n i + 1 , x m i ) + μ * ( x m i + 1 , x m i + 1 , x m i ) = 2 μ * ( x n i + 1 , x n i + 1 , x m i ) + μ * ( x m i + 1 , x m i + 1 , x m i ) 2 ε 2 + μ * ( x m i + 1 , x m i + 1 , x m i ) .
By taking i , we obtain
lim i μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) = ε .
Furthermore, we have
μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) μ * ( x m i + 1 , x m i + 1 , x m i ) 2 μ * ( x n i + 1 , x n i + 1 , x m i ) 2 ε 2 = ε ,
which implies
2 lim i μ * ( x n i + 1 , x n i + 1 , x m i ) = ε .
By repeating the same steps as above, and replacing x n + 1 x n , x m + 1 x m , x n i + 1 x n i and x m i + 1 x m i , we obtain
lim i μ * ( x n i , x n i , x m i ) = ε .
and
2 lim i μ * ( x n i , x n i , x m i 1 ) = ε .
From the following inequality
ε < μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) 2 μ * ( x n i + 1 , x n i + 1 , x n i ) + μ * ( x m i + 1 , x m i + 1 , x n i ) ,
we have
ε < 2 μ * ( x n i + 1 , x n i + 1 , x n i ) + μ * ( x m i + 1 , x m i + 1 , x n i ) .
Then,
ε 2 μ * ( x n i + 1 , x n i + 1 , x n i ) < μ * ( x m i + 1 , x m i + 1 , x n i )   < 2 μ * ( x m i + 1 , x m i + 1 , x n i + 1 ) + μ * ( x n i , x n i , x n i + 1 )   < 2 2 μ * ( x m i + 1 , x m i + 1 , x m i ) + μ * ( x n i + 1 , x n i + 1 , x m i )   + μ * ( x n i , x n i , x n i + 1 )
Therefore,
ε 0 < μ * ( x m i + 1 , x m i + 1 , x n i ) 2 μ * ( x n i + 1 , x n i + 1 , x m i ) + 0 .
which implies
lim i μ * ( x m i + 1 , x m i + 1 , x n i ) = ε .
By the symmetry of S-metric
lim i μ * ( x n i , x n i , x m i + 1 ) = ε .
This completes the proof. □
Definition 6.
Suppose that ( X , μ * ) is an S-metric space. A self-mapping F : X X is said to be asymptotically regular ( ATR ) at a point x X if
lim n μ * ( F n x , F n x , F n + 1 x ) = 0 .
Lemma 4.
Suppose that ( X , μ * ) is an S-metric space and F : X X is a mapping, and let Ω , Π : ( 0 , ) R satisfy
(i) 
inf t > ε Ω ( t ) > for any ε > 0 .
Assume that one of the following holds:
(ii) 
Ω is non-decreasing and
lim   sup t ε Π ( t ) < Ω ( ε ) for every ε > 0 ;
(iii) 
Whenever { Ω ( t n ) } and { Π ( t n ) } are convergent sequences with the same limit and { Ω ( t n ) } is strictly decreasing, then lim n t n = 0 .
If F satisfies the ( Ω , Π ) -contractive condition, then F is ATR at every x X .
Proof. 
Fix x X and set x n = F n x for n 0 , and define
K n = μ * ( x n , x n , x n + 1 ) , n 0 .
We show that K n 0 as n . If K n = 0 for some n 0 , then x n = x n + 1 , so x k = x n for all k n , and hence K k = 0 for all k n . In particular, lim k K k = 0 . Thus, we may assume that K n > 0 for all n. Applying (1) with ( x , y ) = ( x n , x n + 1 ) , we obtain
Ω μ * ( x n + 1 , x n + 1 , x n + 2 ) Π μ * ( x n , x n , x n + 1 ) ,
that is,
Ω ( K n + 1 ) Π ( K n ) < Ω ( K n ) , n 0 .
  • Case 1: Condition (ii) holds. It follows from (6) that
    K n + 1 < K n for all n 0 .
    Therefore, ( K n ) is a strictly decreasing sequence of positive real numbers, so there exists K 0 such that K n K as n . Suppose, for a contradiction, that K > 0 . Passing to the limit in (6) as n yields
    Ω ( K ) = lim n Ω ( K n + 1 ) lim   sup n Π ( K n ) lim   sup t K Π ( t ) .
    Thus
    Ω ( K ) lim   sup t K Π ( t ) ,
    which contradicts Condition (ii) with ε = K > 0 . Therefore, K = 0 , and hence K n 0 as n .
  • Case 2: Condition (iii) holds. From (6), it follows that { Ω ( K n ) } is strictly decreasing. If ( Ω ( K n ) ) is not bounded below, then Ω ( K n ) as n . By Condition (i) and Lemma 1, this implies K n 0 as n . If ( Ω ( K n ) ) is bounded below, then, being strictly decreasing, it converges to some finite limit L R . From (6) for all n, passing to the limit as n shows that ( Π ( K n ) ) also converges and has the same limit L as ( Ω ( K n ) ) . By Condition (iii), applied to the sequence t n = K n , we conclude that K n 0 as n .
In either case we obtain lim n K n = 0 ; that is,
lim n μ * ( x n , x n , x n + 1 ) = lim n μ * ( F n x , F n x , F n + 1 x ) = 0 .
Thus, F is ATR at x. Since x X was arbitrary, F is asymptotically regular on X . □
Lemma 5.
Suppose that ( X , μ * ) is a symmetric S-metric space and F : X X is a mapping that satisfies (1) , where the functions Ω , Π : ( 0 , ) R fulfill at least one of the following:
(i) 
Ω is non-decreasing and lim   sup t ε + Π ( t ) < Ω ( ε + ) for every ε > 0 ;
(ii) 
lim   sup t ε Π ( t ) < lim   inf t ε + Ω ( t ) for every ε > 0 .
If F is ATR at a point x X , then the sequence { F n x } n 0 is S-Cauchy, i.e.
μ * ( F n x , F n x , F m x ) 0 as n , m .
Proof. 
Assume that F is ATR at x X , so
μ * ( F n x , F n x , F n + 1 x ) 0 as n .
Put x n = F n x for n 0 . Suppose, towards a contradiction, that { x n } is not S-Cauchy. Then, by Lemma 3, there exist ε > 0 and subsequences { x n i } and { x m i } of { x n } such that
lim i μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) = ε
and
lim i μ * ( x n i , x n i , x m i ) = 2 lim i μ * ( x n i + 1 , x n i + 1 , x m i ) = lim i μ * ( x n i , x n i , x m i + 1 ) = ε .
  • Case 1: Condition (i) holds. From (7) we have
    lim i μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) = ε .
    Using (1) with x = x n i , y = x m i gives
    Ω μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) Π μ * ( x n i , x n i , x m i ) , i 1 .
    Set
    K i : = μ * ( x n i , x n i , x m i ) , i 1 .
    Since Π ( t ) < Ω ( t ) , then (9) becomes
    Ω μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) Π ( K i ) < Ω ( K i ) , i 1 .
    From (10) and Condition (i), we deduce that μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) < K i . By (7) and (8),
    K i ε and μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) ε as i .
    Passing to the limit in (10), we obtain
    Ω ( ε ) = lim i Ω μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) lim   sup i Π ( K i ) lim   sup t ε + Π ( t ) .
    Thus
    Ω ( ε ) lim   sup t ε + Π ( t ) ,
    which contradicts Condition (i). Hence, this case cannot occur.
  • Case 2: Condition (ii) holds. As above, Lemma 3 yields ε > 0 and subsequences { x n i } , { x m i } such that (7) and (8) hold. Using (1) with x = x n i , y = x m i gives
    Ω μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) Π μ * ( x n i , x n i , x m i ) , i 1 .
    Define
    K i : = μ * ( x n i , x n i , x m i ) , L i : = μ * ( x n i + 1 , x n i + 1 , x m i + 1 ) , i 1 .
    Then
    Ω ( L i ) Π ( K i ) , i 1 .
    By (7) and (8),
    K i ε , L i ε as i .
    Taking lim inf on the left-hand side and lim sup on the right-hand side of (11), we obtain
    lim   inf i Ω ( L i ) lim   sup i Π ( K i ) ,
    hence
    lim   inf t ε + Ω ( t ) lim   inf i Ω ( L i ) lim   sup i Π ( K i ) lim   sup t ε Π ( t ) .
    Therefore,
    lim   inf t ε + Ω ( t ) lim   sup t ε Π ( t ) ,
    which contradicts Condition (ii). Hence, this case is also impossible.
In both cases, we obtain a contradiction with the assumption that { x n } is not S-Cauchy. Therefore, { x n } must be S-Cauchy; that is,
μ * ( x n , x n , x m ) 0 as n , m .
Equivalently, { F n x } is an S-Cauchy sequence. □
Definition 7 (closed graph).
Let ( X , μ * ) be an S-metric space and let F : X X be a self-mapping. We say that F has a closed graph if for every sequence { x n } X and every x , y X ,
x n x and F x n y y = F x .
Equivalently, the graph
G ( F ) = { ( x , F x ) : x X }
is closed in X × X .
Lemma 6.
Suppose that ( X , μ * ) is an S-metric space and F : X X is a mapping satisfying (1), with functions Ω , Π : ( 0 , ) R , and assume one of the following:
(i) 
F has a closed graph;
(ii) 
Ω is non-decreasing;
(iii) 
lim   sup t 0 Π ( t ) < lim   inf t ε Ω ( t ) for every ε > 0 .
If x X and set x n = F n x . If x n η , then η is a FP of F .
Proof. 
Let x X and x n = F n x for n 0 , and suppose that x n η .
  • Case 1:  F has a closed graph. Since x n η , then x n + 1 = F x n η as n . By the closed-graph property of F , this implies that if x n η and F x n η , then F η = η ; hence, η is a fixed point of F .
  • Case 2:  Ω is non-decreasing. First, suppose that
    μ * ( F x n , F x n , F η ) = 0 for some n 0 .
    Then, F x n = F η . Using the S-triangle inequality and x n + 1 = F x n , we obtain
    μ * ( η , F η , F η ) μ * ( η , η , F x n ) + μ * ( F η , F η , F x n ) + μ * ( F η , F η , F x n ) = μ * ( η , η , x n + 1 ) ,
    since F x n = F η makes the last two terms vanish. Letting n and using x n + 1 η yields
    μ * ( η , F η , F η ) 0 ,
    hence μ * ( η , F η , F η ) = 0 and F η = η . This means η is a FP of F . Now suppose instead that
    μ * ( F x n , F x n , F η ) > 0 for all n 0 .
    Applying (1) with x = x n and y = η gives
    Ω μ * ( F x n , F x n , F η ) Π μ * ( x n , x n , η ) , n 0 .
    Since Π ( t ) < Ω ( t ) for all t > 0 , from (12) we have
    Ω ( μ * ( F x n , F x n , F η ) ) Π ( μ * ( x n , x n , η ) ) < Ω ( μ * ( x n , x n , η ) ) .
    This implies that μ * ( F x n , F x n , F η ) < μ * ( x n , x n , η ) . Letting n , we get μ * ( η , η , F η ) 0 , hence μ * ( η , η , F η ) = 0 and F η = η . This means η is a FP of F .
  • Case 3: Condition (iii) holds. From (12), set
    φ n : = μ * ( x n , x n , η ) , ϖ n : = μ * ( F x n , F x n , F η ) .
    Then (12) reads
    Ω ( ϖ n ) Π ( φ n ) , n 0 .
    Since x n η , we have φ n 0 as n . Also, the sequence { ϖ n } converges to
    ε : = lim n ϖ n = μ * ( η , η , F η ) 0 .
    Passing to lim inf on the left-hand side and lim sup on the right-hand side in (12), we obtain
    lim   inf t ε Ω ( t ) lim   inf n Ω ( ϖ n ) lim   sup n Π ( φ n ) lim   sup t 0 Π ( t ) .
    If ε > 0 , this inequality contradicts condition (iii). Hence ε = 0 , so
    μ * ( η , η , F η ) = 0 ,
    and therefore F η = η .
In all cases, we obtain F η = η , so η is a FP of F . □
Theorem 1.
Suppose that ( X , μ * ) is a symmetric complete S-metric space and F : X X is a mapping that satisfies (1), with functions Ω , Π : ( 0 , ) R satisfying the following conditions:
(i) 
Ω is non-decreasing;
(ii) 
lim   sup t ε + Π ( t ) < Ω ( ε + ) for every ε > 0 .
Then, F has a unique FP   η X and { F n x } converges to η for every x X .
Proof. 
Fix x X and define x 0 = x , x n + 1 = F x n for n 0 . By using Conditions (i) and (ii), and Lemma 4, it follows that F is asymptotically regular. By Conditions (i) and (ii) and Lemma 5, it follows that the sequence { F n x } is S-Cauchy. Since ( X , μ * ) is complete, there exists η X such that { F n x } converges to η . Then, by Condition (i) and Lemma 6, η is a FP of F . To prove the uniqueness of η , let τ X be another FP of F . Applying (1) with x = η , y = τ gives
Ω μ * ( η , η , τ ) = Ω μ * ( F η , F η , F τ ) Π μ * ( η , η , τ ) < Ω μ * ( η , η , τ ) ,
where d : = μ * ( η , η , τ ) . By the first axiom of S-metric spaces, d = 0 if and only if η = τ . Assuming η τ strictly implies d > 0 . Since Ω and Π are defined on ( 0 , ) and the contractive inequality (1) holds for all pairs, substituting d > 0 yields the contradiction Ω ( d ) Π ( d ) < Ω ( d ) . Therefore, η = τ and the FP is unique. □
Remark 3.
If we take Ω ( t ) = t and Π ( t ) = σ t with 0 σ < 1 , then condition (1) becomes
μ * ( F x , F x , F y ) σ μ * ( x , x , y ) ( x , y X ) ,
so Theorem 1 reduces to the BCP (in the S-metric setting).
Remark 4.
Since every ordinary metric space ( X , d ) induces an S-metric space in the standard way, it is natural to ask how the present results reduce in the classical setting. Indeed, if we take the induced S-metric
μ * ( x , y , z ) = ϱ ( x , z ) + ϱ ( y , z ) , x , y , z X ,
then the contractive condition in ( Ω , Π ) -form becomes a corresponding metric-type inequality for the underlying distance d. In particular, for suitable choices such as Ω ( t ) = t and Π ( t ) = σ t with 0 < σ < 1 , our main FP theorems reduce to the classical BCP in metric spaces. Thus, the present results may be viewed as genuine extensions of the standard metric FP theory to the setting of complete S-metric spaces.
Theorem 2.
Suppose that ( X , μ * ) is a symmetric complete S-metric space and F : X X is a mapping that satisfies (1) , with functions Ω , Π : ( 0 , ) R satisfying the following conditions:
(i) 
inf t > ε Ω ( t ) > for every ε > 0 ;
(ii) 
Whenever { Ω ( x n ) } and { Π ( x n ) } are convergent sequences with the same limit and { Ω ( x n ) } is strictly decreasing, then x n 0 as n ;
(iii) 
F has a closed graph, or lim   sup t 0 Π ( t ) < lim   inf t ε Ω ( t ) for every ε > 0 .
Then, F has a unique FP   η X and, for every x X , the sequence { F n x } converges to η.
Proof. 
Fix x 0 X and define x n + 1 = F x n for n N . Then, { x n } is an orbit of F . By assumptions (i)–(ii) and Lemma 4, the mapping F is asymptotically regular at x 0 , i.e.
μ * ( x n , x n , x n + 1 ) 0 as n .
Using (iii) and Lemma 5, it follows that { x n } is an S-Cauchy sequence. Since ( X , μ * ) is complete, there exists η X such that
x n η as n .
We now show that η is a FP of F . If F has a closed graph, then x n η and x n + 1 = F x n η imply F η = η . In the alternative case of (iii), the same conclusion follows from Lemma 6, which uses the inequality (1) together with the comparison condition
lim   sup t 0 Π ( t ) < lim   inf t ε Ω ( t ) , ε > 0 ,
to exclude the possibility μ * ( η , η , F η ) > 0 . In either case, η is a FP of F . To prove uniqueness, let η , τ X be FP s of F . Applying (1) with x = η , y = τ , we obtain
Ω μ * ( η , η , τ ) = Ω μ * ( F η , F η , F τ ) Π μ * ( η , η , τ ) < Ω μ * ( η , η , τ ) ,
under the strict comparison between Ω and Π . By the S-metric axiom, d : = μ * ( η , η , τ ) = 0 η = τ . Thus, assuming η τ forces d > 0 . Since Ω , Π are defined on ( 0 , ) and the contractive condition holds globally, substituting d > 0 yields Ω ( d ) Π ( d ) < Ω ( d ) , a contradiction. Hence μ * ( η , η , τ ) = 0 , so η = τ and the FP is unique. Finally, for any x X , the same argument applied to the orbit starting at x shows that F n x converges to the unique FP   η . □
Remark 5.
If we take Ω ( t ) = t and Π ( t ) = σ t with 0 σ < 1 , then condition (1) becomes
μ * ( F x , F x , F y ) σ μ * ( x , x , y ) ( x , y X ) ,
so Theorem 2 reduces to the BCP (in the S-metric setting).

3.2. Application

In this part, let X = C ( [ 0 , 1 ] , R ) be the space of all continuous real-valued functions on [ 0 , 1 ] , equipped with the supremum norm
f = sup t [ 0 , 1 ] | f ( t ) | , f C ( [ 0 , 1 ] ) .
Define μ * : X × X × X [ 0 , ) by
μ * ( ϖ , ρ , κ ) : = ρ + κ 2 ϖ + ρ κ , ϖ , ρ , κ X .
Then, ( X , μ * ) is a symmetric S-metric space:
  • μ * ( ϖ , ρ , κ ) = 0 if and only if ϖ = ρ = κ .
  • For all ϖ , ρ , κ , t X the S-metric inequality holds:
    μ * ( ϖ , ρ , κ ) μ * ( ϖ , ϖ , t ) + μ * ( ρ , ρ , t ) + μ * ( κ , κ , t ) .
Clearly, ( C ( [ 0 , 1 ] , R ) , · ) is a complete S-metric space. Since norm-convergence in C ( [ 0 , 1 ] ) implies convergence of the function sequences, every S-Cauchy sequence converges in X . Now, we solve a boundary value problem that arises when a diffusing substance is placed in an absorbing medium between parallel walls such that γ and δ are the stipulated concentrations at the walls. Furthermore, the concentration ϖ ( t ) of the substance at time t is given by
d 2 ϖ d t 2 + f ( t ) ϖ = ζ ( t ) , ϖ ( 0 ) = γ , ϖ ( 1 ) = δ ,
where f ( t ) is the absorption coefficient and ζ ( t ) is the source density. Problem (14) is equivalent to
ϖ ( t ) = γ + ( δ γ ) t + 0 1 M ( t , s ) ( ζ ( s ) f ( s ) ϖ ( s ) ) d s , s [ 0 , 1 ] ,
where M ( t , s ) is the Green function, which is defined by
M ( t , s ) = t ( 1 s ) , 0 t s 1 , s ( 1 t ) , 0 s t 1 .
Theorem 3.
Consider the boundary value problem (14). Let F : X X be a self-mapping on ( X , μ * ) , satisfying
f ( t ) ϖ ( t ) f ( t ) ρ ( t ) + f ( t ) ϖ ( t ) f ( t ) κ ( t ) + f ( t ) ρ ( t ) f ( t ) κ ( t ) e λ ϖ ( t ) ρ ( t ) + ϖ ( t ) κ ( t ) + ρ ( t ) κ ( t ) , λ > 0 , for all ϖ , ρ , κ X , t [ 0 , 1 ] .
Then, the boundary value problem (14) has a solution.
Proof. 
Define F : X X by
( F x ) ( t ) = γ + ( δ γ ) t + 0 1 M ( t , s ) ζ ( s ) f ( s ) x ( s ) d s , t [ 0 , 1 ] .
Any FP   ϖ 0 = F ϖ 0 satisfies (14). To verify F satisfies (1), compute for ϖ , ρ , κ X :
  • Step 1: Linear terms cancel:
    [ γ + ( δ γ ) t ] + [ γ + ( δ γ ) t ] 2 [ γ + ( δ γ ) t ] = 0 , [ γ + ( δ γ ) t ] [ γ + ( δ γ ) t ] = 0 .
  • Step 2: Integral terms for first S-metric component:
    F ρ + F κ 2 F ϖ = 0 1 M ( t , s ) ζ ( s ) f ( s ) ρ ( s ) d s + 0 1 M ( t , s ) ζ ( s ) f ( s ) κ ( s ) d s 2 0 1 M ( t , s ) ζ ( s ) f ( s ) ϖ ( s ) d s = 0 1 M ( t , s ) 2 f ( s ) ϖ ( s ) f ( s ) ρ ( s ) f ( s ) κ ( s ) d s = 0 1 M ( t , s ) f ( s ) ( ϖ ( s ) ρ ( s ) ) + ( ϖ ( s ) κ ( s ) ) d s .
  • Step 3: Second S-metric component:
    F ρ F κ = 0 1 M ( t , s ) ζ ( s ) f ( s ) ρ ( s ) d s 0 1 M ( t , s ) ζ ( s ) f ( s ) κ ( s ) d s = 0 1 M ( t , s ) f ( s ) ( ρ ( s ) κ ( s ) ) d s .
  • Step 4: Since the Green function
    M ( t , s ) = t ( 1 s ) , 0 t s 1 , s ( 1 t ) , 0 s t 1 ,
    satisfies 0 M ( t , s ) 1 / 4 for all ( t , s ) [ 0 , 1 ] 2 , we have
    M 1 4 .
    S-metric estimate using M 1 4 :
    μ * ( F ϖ , F ρ , F κ ) = F ρ + F κ 2 F ϖ + F ρ F κ 1 4 f ( ϖ ρ ) + 1 4 f ( ϖ κ ) + 1 4 f ( ρ κ ) .
  • Step 5: Apply hypothesis:
    μ * ( F ϖ , F ρ , F κ ) e λ ϖ ρ + ϖ κ + ρ κ = e λ μ * ( ϖ , ρ , κ ) .
    Thus, F satisfies (1) with Ω ( t ) = t , Π ( t ) = e λ t .
  • Step 6: Picard iteration x 0 X arbitrary, x n + 1 = F x n . Lemma 4 gives asymptotic regularity:
    μ * ( x n , x n , x n + 1 ) 0 .
    Lemma 5 gives { x n } is S-Cauchy. By completeness, x n η X .
  • Step 7: Theorem 1 (ii): Π ( t ) Ω ( t ) , lim   sup t 0 Π ( t ) = 0 < ε = lim   inf t ε Ω ( t ) . Thus η = F η , solving (14). □

4. Chebyshev Spectral Method for Boundary Value Problems

The theoretical framework developed in the preceding sections provides a robust foundation for analyzing the convergence of iterative numerical schemes. In this section, we demonstrate how the ( Ω , Π ) -contraction principle in complete S-metric spaces can be applied to guarantee the convergence of the Chebyshev spectral collocation method for solving second-order boundary value problems of the form
d 2 ϖ d t 2 + f ( t ) ϖ = ζ ( t ) , ϖ ( 0 ) = γ , ϖ ( 1 ) = δ ,
where f , ζ C ( [ 0 , 1 ] ) and γ , δ R .

4.1. Motivation for the ( Ω , Π ) -Framework in Diffusion Models

Before presenting the numerical scheme, we clarify the added value of the ( Ω , Π ) -contraction framework compared to standard Banach contraction arguments. For diffusion–absorption problems of the form (17), the following scenarios naturally arise where our generalized framework provides essential advantages:
  • Non-Lipschitz nonlinearities: When the absorption coefficient f ( t ) or source term ζ ( t ) exhibits singular behavior or non-Lipschitz continuity (e.g., f ( t ) tα near boundaries), the standard Lipschitz constant may not exist globally, yet ( Ω , Π ) -conditions can still be satisfied through an appropriate choice of control functions.
  • Weak contractivity: In problems with small absorption ( f 1 ) or nearly singular operators, the contraction factor may approach 1, making standard Banach arguments inconclusive. The ( Ω , Π ) -framework accommodates such borderline cases through the limsup–liminf separation condition.
  • Asymptotic regularity without uniform contraction: For certain reaction–diffusion systems, Picard iterates may exhibit asymptotic regularity even when the mapping is not uniformly contractive—a situation that is naturally captured by our Theorem 2 but not by classical results.
Remark 6.
The ( Ω , Π ) -framework’s advantage becomes evident in scenarios where single-function controls fail:
  • Nonlinear control functions: For f ( t ) with spatially varying decay λ 2 ( x ) , choosing Ω ( t ) = ln ( 1 + t ) and Π ( t ) = ln ( 1 + t ) ϕ ( t ) with ϕ ( t ) > 0 can satisfy the contraction condition even when no global Lipschitz constant exists.
  • Asymptotically regular mappings: When F satisfies μ * ( F n + 1 x , F n + 1 x , F n x ) 0 but lacks uniform contractivity, Theorem 2 with Condition (ii) still guarantees convergence.
  • Threshold effects: In biodegradation models where reaction rates activate only above concentration thresholds, the ( Ω , Π ) -structure accommodates discontinuous or piecewise-defined control functions that single-mechanism approaches cannot handle.
These cases demonstrate the framework’s necessity beyond conventional contraction analyses.
Example 5 (Concrete Nonlinear Control Verification).
Consider X = C ( [ 0 , 1 ] ) with the S-metric μ * ( u , v , w ) = v + w 2 u + v w . Define F ( u ) ( t ) = 1 4 0 1 | u ( s ) | d s . For any u , v , w X ,
μ * ( F u , F v , F w ) 1 2 u v + u w + v w 1 2 μ * ( u , v , w ) .
Choosing Ω ( t ) = t and Π ( t ) = 1 2 t yields Π ( t ) < Ω ( t ) for t ( 0 , 4 ) . Since F has unbounded derivative near u = 0 , it is not a Banach contraction, yet the ( Ω , Π ) -condition holds and Theorem 1 applies.
Remark 7
(Physical Interpretation). In groundwater contamination models (Section 4.6), the decay coefficient λ 2 represents natural attenuation. When λ 2 varies spatially or exhibits threshold behavior (e.g., biodegradation activating only above certain concentrations), the resulting operator may satisfy ( Ω , Π ) -conditions with Ω ( t ) = ln ( t ) and Π ( t ) = ln ( t ) ϕ ( t ) for suitable ϕ, even when no global Lipschitz constant exists. This demonstrates the practical relevance of our generalized framework.

4.2. Chebyshev Polynomials and Collocation Points

Let T k ( t ) = cos ( k arccos ( 2 t 1 ) ) , k = 0 , 1 , 2 , , denote the shifted Chebyshev polynomials of the first kind on [ 0 , 1 ] . These polynomials satisfy the orthogonality relation
0 1 T m ( t ) T n ( t ) w ( t ) d t = 0 , m n , π / 2 , m = n 0 , π , m = n = 0 ,
with weight function w ( t ) = [ t ( 1 t ) ] 1 / 2 . The Chebyshev–Gauss–Lobatto collocation points on [ 0 , 1 ] are given by
t j = 1 2 1 cos j π N , j = 0 , 1 , , N ,
where N is the polynomial degree. These points cluster near the boundaries, providing high resolution where boundary layers may occur.

4.3. Differentiation Matrices

Let u = [ u ( t 0 ) , u ( t 1 ) , , u ( t N ) ] denote the vector of function values at the collocation points. The first and second derivatives at these points are approximated via matrix multiplication:
u D ( 1 ) u , u D ( 2 ) u ,
where D ( 1 ) , D ( 2 ) R ( N + 1 ) × ( N + 1 ) are the Chebyshev differentiation matrices [31]. The entries of D ( 1 ) are explicitly given by
d i j ( 1 ) = c i c j ( 1 ) i + j t i t j , i j , 2 N 2 + 1 6 , i = j = 0 or N , t j 2 ( 1 t j 2 ) , 1 i = j N 1 ,
with c 0 = c N = 2 and c j = 1 for 1 j N 1 . The second-derivative matrix is obtained as D ( 2 ) = ( D ( 1 ) ) 2 .

4.4. Algorithm: Chebyshev Spectral Collocation with Richardson Iteration

We now present the algorithmic steps for solving the boundary value problem (17) using the Chebyshev spectral collocation method, combined with the fixed-point iteration framework established in Theorem 2. To properly demonstrate the ( Ω , Π ) -contraction framework, we employ Richardson iteration rather than direct solution. This allows us to verify the theoretical convergence guarantees through actual iterative behavior.
  • Choose the polynomial degree N 2 and compute the Chebyshev–Gauss–Lobatto points { t j } j = 0 N via (18).
  • Construct the first- and second-derivative matrices D ( 1 ) and D ( 2 ) using the explicit formulas above or via the barycentric formulation [32].
  • Modify the system to incorporate Dirichlet conditions. Replace the first and last rows of D ( 2 ) with the unit vectors e 0 and e N , respectively, and set the corresponding right-hand side entries to γ and δ .
  • For the differential operator L ϖ = ϖ + f ( t ) ϖ , form the matrix
    A = D ( 2 ) + diag f ( t 0 ) , f ( t 1 ) , , f ( t N ) ,
    and the right-hand side vector b = [ γ , ζ ( t 1 ) , , ζ ( t N 1 ) , δ ] .
  • Define the Richardson iteration mapping F : R N + 1 R N + 1 by
    F ( u ) = u + ω b A u ,
    where ω > 0 is a relaxation parameter chosen to ensure convergence. The iteration (20) can be rewritten as
    F ( u ) = ( I ω A ) u + ω b ,
    which is a proper affine mapping (not constant).
  • Verification of ( Ω , Π ) -contraction property: For u , v , w R N + 1 , we compute
    F ( u ) F ( v ) = ( I ω A ) ( u v ) , F ( v ) F ( w ) = ( I ω A ) ( v w ) .
    Using the S-metric μ * ( u , v , w ) = v + w 2 u + v w , we obtain
    μ * F ( u ) , F ( v ) , F ( w ) I ω A μ * ( u , v , w ) .
    Setting Ω ( t ) = t and Π ( t ) = κ t with κ = I ω A , we have an ( Ω , Π ) -contraction provided κ < 1 . Sufficient conditions for κ < 1 : After imposing Dirichlet boundary conditions, the modified matrix A is strictly diagonally dominant with positive diagonal entries provided f ( t ) 0 and the grid is sufficiently resolved. By Gershgorin’s circle theorem, all eigenvalues of A lie in the positive real axis. Choosing ω ( 0 , 2 / λ max ( A ) ) guarantees ρ ( I ω A ) < 1 . Moreover, for the -norm, the explicit bound ω < 1 / max i A i i ensures I ω A < 1 , rigorously satisfying the contraction hypothesis.
  • Starting from an initial guess u ( 0 ) (e.g., the linear interpolant satisfying the boundary conditions), compute
    u ( k + 1 ) = F u ( k ) = u ( k ) + ω b A u ( k ) , k = 0 , 1 , 2 , ,
    until u ( k + 1 ) u ( k ) < ε for a prescribed tolerance ε > 0 .
  • The approximate solution at any t [ 0 , 1 ] is obtained via the Chebyshev interpolant
    ϖ N ( t ) = k = 0 N u ^ k T k ( t ) ,
    where the coefficients u ^ k are computed from the discrete values u ( k ) using the discrete cosine transform.
Remark 8 (Comparison: Direct Solve vs. Iterative Method).
While a direct solution via LU decomposition is computationally efficient for small-to-moderate N, the Richardson iteration framework serves three important purposes:
1. 
It validates the ( Ω , Π ) -contraction theory through observable iterative convergence.
2. 
For large-scale problems or time-dependent extensions where A changes slightly between time steps, iterative methods with warm starts are more efficient than repeated factorization.
3. 
The S-metric framework provides a unified error-monitoring tool that simultaneously tracks discretization accuracy and iterative convergence.
Remark 9.
The convergence of the iterative scheme in Step g is guaranteed by Theorem 2, since the contraction condition
μ * F u , F v , F w κ μ * ( u , v , w ) , κ = I ω A < 1 ,
holds for all u , v , w R N + 1 when the relaxation parameter ω is chosen such that ρ ( I ω A ) < 1 [33]. Moreover, the spectral accuracy of the Chebyshev approximation ensures that the discretization error decays exponentially with N for smooth solutions [34].
Remark 10.
The S-metric framework provides a unified setting to analyze both the spatial discretization error (via the spectral approximation) and the iterative convergence (via the ( Ω , Π ) -contraction). This dual perspective is particularly valuable for adaptive algorithms where N and the iteration count are adjusted dynamically to meet prescribed accuracy targets.

4.5. Numerical Example: Validation of Iterative Convergence

To illustrate the practical performance of the Chebyshev spectral method combined with the ( Ω , Π ) -contraction framework, we consider the following boundary value problem with a known analytical solution:
d 2 u d t 2 u = 2 sin ( t ) , t [ 0 , 1 ] , u ( 0 ) = 0 , u ( 1 ) = sin ( 1 ) .
The exact solution is u exact ( t ) = sin ( t ) . This problem fits the general form (17) with f ( t ) 1 and ζ ( t ) = 2 sin ( t ) .

4.5.1. Implementation Details

The Chebyshev spectral collocation method described in Section 4.4 was implemented in Python 3.10.12 using NumPy 1.24.3 and SciPy 1.11.2 for linear algebra operations. The differentiation matrices were constructed via the barycentric formulation [32]. We performed two sets of experiments:
  • Direct solve (for accuracy benchmarks): Using LU decomposition to compute the exact discrete solution for each N.
  • Richardson iteration (to validate contraction theory): Using the iterative scheme (20) with ω = 0.5 (chosen to ensure ρ ( I ω A ) < 1 for this problem).
For each polynomial degree N { 4 , 8 , 16 , 32 , 64 } , we computed:
  • The discrete L error: u N u exact = max 0 j N | u N ( t j ) sin ( t j ) | ,
  • The discrete L 2 error: u N u exact 2 = 1 N + 1 j = 0 N | u N ( t j ) sin ( t j ) | 2 ,
  • For Richardson iteration: the number of iterations required to achieve u ( k + 1 ) u ( k ) < 10 12 ,
  • The CPU time required for matrix assembly and solution.

4.5.2. Results: Spectral Accuracy

Table 1 summarizes the numerical results for the direct solve. The errors exhibit the characteristic spectral (exponential) convergence of Chebyshev methods for smooth solutions. The error decays faster than any algebraic power of N 1 [34]. Already at N = 8 , the error reaches machine precision ( 10 15 ), confirming the high accuracy of the method.

4.5.3. Results: Richardson Iteration Convergence

Table 2 presents the iterative convergence behavior using Richardson iteration with ω = 0.5 . The results demonstrate:
  • The contraction factor κ = I ω A 0.67 for this problem, satisfying the ( Ω , Π ) -contraction condition with Ω ( t ) = t and Π ( t ) = 0.67 t .
  • The number of iterations required to reach tolerance 10 12 remains modest (15–25 iterations) and is largely independent of N, confirming the theoretical prediction from Theorem 2.
  • The final accuracy matches the direct solve, validating that the iterative method converges to the correct FP .
Figure 1 shows the convergence history for N = 16 , demonstrating geometric decay of the residual with the rate matching the theoretical contraction factor. This provides direct numerical validation of the ( Ω , Π ) -contraction framework.

4.5.4. Spectral Convergence Analysis

The convergence behavior is illustrated in Figure 2, which displays both the L and L 2 errors as functions of the polynomial degree N. The logarithmic scale reveals the characteristic exponential decay of spectral methods: for smooth solutions like u ( t ) = sin ( t ) , the error decreases faster than any algebraic power of N 1 [34]. Already at N = 8 , the error reaches 10 11 , and by N = 16 , it attains machine precision. This remarkable accuracy with relatively few degrees of freedom demonstrates the efficiency of the Chebyshev collocation approach.
Figure 3 presents a dual-axis plot comparing accuracy and computational efficiency. The left axis shows the convergence of both error norms, while the right axis displays the CPU time required for matrix assembly and solution. This visualization highlights an important practical consideration: while increasing N improves accuracy up to a point, the marginal benefit diminishes once machine precision is approached. The optimal choice for this problem is N = 8 or N = 16 , where the error is already negligible (<10−11) and the computational cost is minimal. For N 32 , we observe a slight increase in error due to round-off accumulation in the differentiation matrices, a well-documented phenomenon in high-order spectral methods [31].
The quality of the approximation is further illustrated in Figure 4, which compares the exact solution u ( t ) = sin ( t ) with the numerical approximation obtained using N = 8 collocation points. The top panel shows that the two curves are visually indistinguishable, while the bottom panel reveals the pointwise error on a logarithmic scale. The maximum error occurs near the boundaries and remains below 10 11 everywhere in [ 0 , 1 ] . This exceptional accuracy is achieved with only nine collocation points, demonstrating the power of spectral methods for smooth problems. The black circles in Figure 4 mark the Chebyshev–Gauss–Lobatto nodes, which are denser near the boundaries. This non-uniform distribution is crucial for resolving boundary layers and avoiding the Runge phenomenon that plagues equispaced polynomial interpolation [32]. The clustering near t = 0 and t = 1 ensures that the Dirichlet boundary conditions u ( 0 ) = 0 and u ( 1 ) = sin ( 1 ) are enforced with high accuracy.
Remark 11
(Connection to Fixed-Point Theory). The numerical results validate the theoretical framework developed in Section 4. The mapping F defined by the Richardson iteration (20) satisfies the ( Ω , Π ) -contraction condition with Ω ( t ) = t and Π ( t ) = κ t where κ = I ω A 0.67 . Using Theorem 2, this guarantees that the fixed-point iteration converges to the unique solution of the discretized problem. The geometric convergence observed in Figure 1 and the iteration counts in Table 2 confirm this theoretical prediction and demonstrate the practical applicability of the ( Ω , Π ) -contraction principle in complete S-metric spaces to spectral methods for boundary value problems.
Remark 12.
The slight increase in error for N = 64 compared to N = 32 is attributable to round-off accumulation in the differentiation matrices, a well-known phenomenon in high-order spectral methods [31]. In practice, N = 16 or N = 32 provides an optimal balance between accuracy and numerical stability for this class of problems.
Remark 13.
The CPU times remain modest even for large N, reflecting the efficiency of spectral methods: high accuracy is achieved with relatively few degrees of freedom. For problems with non-smooth coefficients or solutions, adaptive refinement or domain decomposition may be employed while preserving the contraction-based convergence guarantees established in Theorem 2.

4.5.5. Connection to the Theoretical Framework

The mapping F defined in Step e of the algorithm satisfies the ( Ω , Π ) -contraction condition with Ω ( t ) = t and Π ( t ) = κ t where κ = I ω A < 1 , as summarized in the comparative analysis of contraction principles in Table 3. Consequently, Theorem 2 guarantees that the fixed-point iteration converges to the unique solution of the discretized problem. The numerical results in Table 1 and Table 2 confirm this theoretical prediction: the iterative scheme produces approximations that converge geometrically to the exact solution, with the convergence rate matching the theoretical contraction factor. Moreover, the S-metric structure on R N + 1 ,
μ * ( u , v , w ) = v + w 2 u + v w ,
provides a natural setting to monitor both the residual and the consistency of the iterative updates. In adaptive implementations, one may use μ * as a stopping criterion that simultaneously controls discretization and iteration errors.

4.6. Applications to Sustainable Development Goals (SDGs)

The Chebyshev– ( Ω , Π ) framework provides a fast and reliable way to solve steady-state boundary value problems of the form (17) that frequently arise in sustainability engineering. For instance, it can efficiently model groundwater contamination (SDG 6) and environmental transport processes (SDG 13) by capturing sharp gradients with very few grid points, while the S-metric ensures stable error control for regulatory-grade accuracy. The same approach also applies to heat transfer in clean energy systems (SDG 7) and stress analysis in resilient infrastructure (SDG 9), where exponential convergence delivers high precision at a low computational cost. This combination of speed, accuracy, and mathematical guarantees makes the method a practical tool for engineers and policymakers who need trustworthy, lightweight simulations to support sustainable design and environmental monitoring.
Remark 14.
For smooth solutions, machine-precision accuracy is typically achieved with N 16 (cf. Table 1), reducing both runtime and energy consumption per simulation. This computational efficiency aligns with sustainable computing practices and facilitates rapid parametric studies in policy-support workflows.

Contaminant Transport in Groundwater (SDG 6)

To concretely illustrate the applicability of the Chebyshev– ( Ω , Π ) framework to sustainability-oriented problems, we consider a steady-state model of reactive contaminant transport in a one-dimensional aquifer [35]:
d 2 c d x 2 λ 2 c = S ( x ) , x [ 0 , 1 ] , c ( 0 ) = c 0 , c ( 1 ) = c 1 ,
where c ( x ) denotes the contaminant concentration, λ 2 > 0 is a first-order decay coefficient (e.g., due to biodegradation or sorption), and S ( x ) C ( [ 0 , 1 ] ) represents a distributed source term (e.g., leakage from an upstream facility). Equation (22) is a special case of (17) with f ( t ) λ 2 and ζ ( t ) = S ( x ) .
  • When do ( Ω , Π ) -conditions hold naturally?
For the groundwater model (22), the ( Ω , Π ) -contraction framework applies under physically meaningful conditions:
  • Strong absorption ( λ 2 1 ): The operator A = D ( 2 ) λ 2 I has eigenvalues dominated by λ 2 , making I ω A small for appropriate ω . This corresponds to rapid natural attenuation, where the ( Ω , Π ) -framework guarantees fast iterative convergence.
  • Weak absorption ( λ 2 1 ): Even when λ 2 is small, the Richardson iteration converges provided ω < 2 / ρ ( A ) , and the ( Ω , Π ) -conditions are satisfied with κ close to (but strictly less than) 1. This borderline case is precisely where the limsup–liminf separation condition in Theorem 2 becomes essential, as standard Banach arguments may fail when the contraction factor approaches 1.
  • Spatially varying decay: When λ 2 = λ 2 ( x ) varies spatially (e.g., due to heterogeneous soil properties), the operator may not be symmetric, yet the ( Ω , Π ) -framework still applies provided ρ ( I ω A ) < 1 . This flexibility is crucial for realistic environmental models.
For verification, we take S ( x ) = ( λ 2 + 1 ) sin ( π x ) and boundary values c 0 = 0 , c 1 = 0 , yielding the exact solution c exact ( x ) = sin ( π x ) . This setup mimics a scenario where a pollutant is introduced along the aquifer while natural attenuation processes act to reduce its concentration.
The problem (22) was solved using the algorithm of Section 4.4 with λ = 2 and polynomial degrees N { 4 , 8 , 16 , 32 } . Table 4 reports the discrete L and L 2 errors at the Chebyshev–Gauss–Lobatto nodes. As anticipated, spectral convergence is observed: the error drops below 10 12 for N 8 , confirming that high-fidelity predictions of contaminant profiles can be obtained with very few collocation points.
Remark 15
(Practical Implications for SDG 6). The rapid convergence demonstrated in Table 4 implies that regulatory agencies or environmental consultants can obtain certified-accurate concentration profiles with minimal computational resources. This efficiency enables rapid scenario analysis, e.g., assessment of the impact of varying decay rates λ or source distributions S ( x ) -supporting timely, evidence-based decisions for groundwater protection and remediation strategies aligned with SDG 6 targets. The ( Ω , Π ) -framework provides mathematical guarantees that the iterative solver will converge even for challenging parameter regimes (e.g., very small or very large λ 2 ), ensuring robustness in production environments.
Remark 16
(Synthesis of Numerical Results for SDG 6). Figure 5, Figure 6 and Figure 7 collectively validate the practical utility of the Chebyshev– ( Ω , Π ) framework for sustainability-oriented modeling. Figure 5 confirms the theoretical spectral convergence: errors drop below 10 14 with only N = 16 degrees of freedom. Figure 6 demonstrates that even at N = 8 , the numerical solution is visually indistinguishable from the exact profile, with pointwise errors uniformly bounded by 4 × 10 11 . Finally, Figure 7 highlights the computational efficiency: machine-precision accuracy is achieved with sub-millisecond runtime, enabling rapid parametric studies for groundwater management scenarios. Together, these results illustrate how rigorous numerical analysis can support timely, high-fidelity decision-making aligned with SDG 6 targets.

5. Conclusions

In this paper, we introduced the notion of ( Ω , Π ) -contractions in complete S-metric spaces and established a unified FP framework that captures asymptotic regularity, S-Cauchy convergence, and uniqueness of FP s under minimal assumptions. The principal novelty of the approach lies in the use of two distinct comparison functions, which separate the control of the domain-side and image-side behavior of the mapping. This two-function structure provides greater flexibility than classical Banach-type contractions and allows our results to subsume several important generalized contraction principles, including Wardowski-type, implicit, and recent asymptotically regular contractions in S-metric settings. A key feature of the theory is the lim sup–lim inf separation condition, which yields a sharp distinction between contractive strength and regularity and permits proofs that do not rely on closed graph assumptions. This leads to concise and robust arguments for both convergence and uniqueness. In addition, the application to a nonlinear diffusion boundary value problem illustrates that the abstract FP results are not merely formal, but can be applied effectively to nonlinear integral operators arising in differential equations. Several directions remain open for future investigation. It would be interesting to extend the ( Ω , Π ) -framework to multivalued mappings, probabilistic S-metric spaces, and related generalized structures. Another promising direction is the development of computational Picard-type algorithms and convergence criteria for concrete models. We expect that the present framework will contribute further to the study of nonlinear analysis in generalized metric spaces and stimulate new applications in FP theory and its related fields.

Author Contributions

Conceptualization, G.A.; Methodology, G.A. and M.A.A.; Software, Y.H.Y.; Validation, M.A.A., M.G. and Y.H.Y.; Formal analysis, G.A. and M.A.A.; Investigation, G.A. and M.G.; Data curation, M.G.; Writing—original draft, G.A.; Writing—review & editing, M.A.A., M.G. and Y.H.Y.; Supervision, M.G. and Y.H.Y.; Project administration, Y.H.Y. All authors have read and agreed to the published version of the manuscript.

Funding

The authors received no specific funding for this work.

Data Availability Statement

The code used to generate the numerical results is available from the corresponding author upon reasonable request.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Proinov, P.D. Fixed point theorems in metric spaces. Nonlinear Anal. Theory Methods Appl. 2006, 64, 546–557. [Google Scholar] [CrossRef]
  2. Goebel, K.; Kirk, W.A. Topics in Metric Fixed Point Theory; Cambridge University Press: Cambridge, UK, 1990; Volume 28. [Google Scholar]
  3. Czerwik, S. Contraction mappings in b-metric spaces. Acta Math. Inform. Univ. Ostrav. 1993, 1, 5–11. [Google Scholar]
  4. Mustafa, Z.; Sims, B. A new approach to generalized metric spaces. J. Nonlinear Convex Anal. 2006, 7, 289. [Google Scholar]
  5. Karapnar, E. A Short Survey on the Recent Fixed Point Results on b-Metric Spaces. Constr. Math. Anal. 2018, 1, 15–44. [Google Scholar]
  6. Sedghi, S.; Shobe, N.; Aliouche, A. A generalization of fixed point theorems in S-metric spaces. Mat. Vesn. 2012, 64, 258–266. [Google Scholar]
  7. Saluja, G.S. Fixed point theorems for cyclic contractions in S-metric spaces involving C-class function. Math. Moravica 2022, 26, 57–76. [Google Scholar]
  8. Popa, V.; Patriciu, A.M. A General Fixed Point Theorem for a Sequence of Multivalued Mappings in S-Metric Spaces. Axioms 2024, 13, 670. [Google Scholar] [CrossRef]
  9. Wardowski, D. Fixed points of a new type of contractive mappings in complete metric spaces. Fixed Point Theory Appl. 2012, 2012, 94. [Google Scholar] [CrossRef]
  10. Mlaiki, N.; Çelik, U.; Taş, N.; Özgür, N.Y.; Mukheimer, A. Wardowski Type Contractions and the Fixed-Circle Problem on S-Metric Spaces. J. Math. 2018, 2018, 9127486. [Google Scholar] [CrossRef]
  11. Browder, F.; Petryshyn, W. The solution by iteration of nonlinear functional equations in Banach spaces. Bull. Amer. Math. Soc. 1966, 72, 571–575. [Google Scholar] [CrossRef]
  12. Chidume, C. Geometric Properties of Banach Spaces and Nonlinear Iterations; Springer: Berlin/Heidelberg, Germany, 2009. [Google Scholar]
  13. Goebel, K.; Kirk, W. A fixed point theorem for asymptotically nonexpansive mappings. Proc. Am. Math. Soc. 1972, 35, 171–174. [Google Scholar] [CrossRef]
  14. Hyers, D.H.; Isac, G.; Rassias, T.M. Topics in Nonlinear Analysis & Applications; World Scientific: Singapore, 1997. [Google Scholar]
  15. Abbas, M.; Jungck, G. Common fixed point results for noncommuting mappings without continuity in cone metric spaces. J. Math. Anal. Appl. 2008, 341, 416–420. [Google Scholar] [CrossRef]
  16. Caristi, J. Fixed Point Theorems for Mappings Satisfying Inwardness Conditions. Trans. Am. Math. Soc. 1976, 215, 241–251. [Google Scholar] [CrossRef]
  17. Suzuki, T. A new type of fixed point theorem in metric spaces. Nonlinear Anal. Theory Methods Appl. 2009, 71, 5313–5317. [Google Scholar] [CrossRef]
  18. Adewale, O.K.; Iluno, C.; Adetowubo, A.Y. Caristi’s Fixed Point Theorem in G-Cone Metric Spaces and Application. Adv. Pure Math. 2022, 12, 271–282. [Google Scholar] [CrossRef]
  19. Hieu, N.T.; Ly, N.T.T.; Dung, N.V. A Generalization of Ciric Quasi-Contractions for Maps on S-Metric Spaces. Thai J. Math. 2014, 13, 369–380. [Google Scholar]
  20. Özgür, N.Y.; Taş, N. Some Fixed Point Theorems on S-Metric Spaces; SCIK Publishing Corporation: London, UK, 2016. [Google Scholar]
  21. Özgür, N.Y.; Taş, N. Fixed-circle problem on S-metric spaces with a geometric viewpoint. arXiv 2017, arXiv:1704.08838. [Google Scholar]
  22. Özgür, N.Y.; Taş, N. Generalizations of Metric Spaces: From the Fixed-Point Theory to the Fixed-Circle Theory; Springer: Berlin/Heidelberg, Germany, 2018. [Google Scholar]
  23. Shahraki, M.; Sedghi, S.; Aleomraninejad, S.; Mitrovic, Z.D. Some fixed point results on S-metric spaces. Acta Univ. Sapientiae Math. 2020, 12, 347–357. [Google Scholar] [CrossRef]
  24. Raj, H.; Hooda, N. Coupled coincidence fixed point theorems in S-metric spaces. IOSR J. Math. 2014, 10, 59–64. [Google Scholar] [CrossRef]
  25. Mlaiki, N. α-ψ-Contractive Mapping on S-Metric Space; Natural Sciences Publishing: New York, NY, USA, 2014. [Google Scholar]
  26. Chaipornjareansri, S. Fixed Point Theorems for Generalized Weakly Contractive Mappings in S-Metric Space. Thai J. Math. 2018, 50–62. [Google Scholar]
  27. Saluja, G.S. Common fixed point theorems in S-metric spaces involving control function. Ann. Math. Comput. Sci. 2023, 18, 40–55. [Google Scholar] [CrossRef]
  28. Patriciu, A.M.; Popa, V. A General Fixed Point Theorem for a pair of Mappings satisfying a maixed implicit relation in S-Metric Spaces. Bull. Transilv. Univ. BraşOv Ser. III Math. Comput. Sci. 2025, 67, 203. [Google Scholar] [CrossRef]
  29. Sharma, P.S.; Aage, C.T. Results on common fixed points in Sb-metric spaces. J. Anal. Appl. Math. 2025, 2025, 57–78. [Google Scholar] [CrossRef] [PubMed]
  30. Ishtiaq, U.; Jahangeer, F.; Garayev, M.; Popa, I.L. Existence and uniqueness of a solution of a boundary value problem used in chemical sciences via a fixed point approach. Symmetry 2025, 17, 127. [Google Scholar] [CrossRef]
  31. Trefethen, L.N. Software, Environments, and Tools. In Spectral Methods in MATLAB; Society for Industrial and Applied Mathematics (SIAM): Philadelphia, PA, USA, 2000; Volume 10. [Google Scholar] [CrossRef]
  32. Berrut, J.P.; Trefethen, L.N. Barycentric Lagrange Interpolation. SIAM Rev. 2004, 46, 501–517. [Google Scholar] [CrossRef]
  33. Saad, Y. Iterative Methods for Sparse Linear Systems; SIAM: Philadelphia, PA, USA, 2003. [Google Scholar]
  34. Canuto, C.; Hussaini, M.Y.; Quarteroni, A.; Zang, T.A. Spectral Methods: Fundamentals in Single Domains; Scientific Computation; Springer: Berlin/Heidelberg, Germany, 2006. [Google Scholar] [CrossRef]
  35. Bear, J. Dynamics of Fluids in Porous Media; Courier Corporation: Mumbai, India, 2013. [Google Scholar]
Figure 1. Richardson iteration convergence history for N = 16 . The residual norm u ( k + 1 ) u ( k ) (blue curve) decays geometrically with rate κ 0.67 , confirming the ( Ω , Π ) -contraction property with Ω ( t ) = t and Π ( t ) = κ t . The red dashed line shows the theoretical geometric decay C κ k for comparison. The linear decay on the logarithmic scale validates the theoretical prediction from Theorem 2.
Figure 1. Richardson iteration convergence history for N = 16 . The residual norm u ( k + 1 ) u ( k ) (blue curve) decays geometrically with rate κ 0.67 , confirming the ( Ω , Π ) -contraction property with Ω ( t ) = t and Π ( t ) = κ t . The red dashed line shows the theoretical geometric decay C κ k for comparison. The linear decay on the logarithmic scale validates the theoretical prediction from Theorem 2.
Symmetry 18 01066 g001
Figure 2. Convergence analysis of the Chebyshev spectral method applied to BVP (21). The L error (blue curve with circles) and L 2 error (orange curve with squares) exhibit spectral (exponential) convergence with respect to the polynomial degree N, reaching machine precision (≈10−15) for N 16 . The reference lines indicate algebraic ( N 10 , dashed gray) and exponential ( e 0.3 N , dotted gray) decay rates for comparison. The results correspond to the data in Table 1.
Figure 2. Convergence analysis of the Chebyshev spectral method applied to BVP (21). The L error (blue curve with circles) and L 2 error (orange curve with squares) exhibit spectral (exponential) convergence with respect to the polynomial degree N, reaching machine precision (≈10−15) for N 16 . The reference lines indicate algebraic ( N 10 , dashed gray) and exponential ( e 0.3 N , dotted gray) decay rates for comparison. The results correspond to the data in Table 1.
Symmetry 18 01066 g002
Figure 3. Trade-off between accuracy and computational cost. The left y-axis (blue and orange curves) shows the L and L 2 errors, while the right y-axis (green curve) displays the CPU time in milliseconds. The optimal balance occurs at N = 8 , where the error is already below 10 11 while the computational cost remains minimal ( 0.33 ms). For N > 32 , round-off errors begin to dominate, causing a slight deterioration in accuracy despite increased computational effort.
Figure 3. Trade-off between accuracy and computational cost. The left y-axis (blue and orange curves) shows the L and L 2 errors, while the right y-axis (green curve) displays the CPU time in milliseconds. The optimal balance occurs at N = 8 , where the error is already below 10 11 while the computational cost remains minimal ( 0.33 ms). For N > 32 , round-off errors begin to dominate, causing a slight deterioration in accuracy despite increased computational effort.
Symmetry 18 01066 g003
Figure 4. Comparison of the exact solution u exact ( t ) = sin ( t ) (solid blue line) with the Chebyshev spectral approximation using N = 8 (dashed red line). The black circles indicate the N + 1 = 9 Chebyshev–Gauss–Lobatto collocation points, which cluster near the boundaries t = 0 and t = 1 . The bottom panel shows the pointwise absolute error on a logarithmic scale, demonstrating that the maximum error remains below 10 11 throughout the domain. This confirms the theoretical convergence guarantees provided by Theorem 2 in the ( Ω , Π ) -contraction framework.
Figure 4. Comparison of the exact solution u exact ( t ) = sin ( t ) (solid blue line) with the Chebyshev spectral approximation using N = 8 (dashed red line). The black circles indicate the N + 1 = 9 Chebyshev–Gauss–Lobatto collocation points, which cluster near the boundaries t = 0 and t = 1 . The bottom panel shows the pointwise absolute error on a logarithmic scale, demonstrating that the maximum error remains below 10 11 throughout the domain. This confirms the theoretical convergence guarantees provided by Theorem 2 in the ( Ω , Π ) -contraction framework.
Symmetry 18 01066 g004
Figure 5. Spectral convergence for the groundwater transport problem (22). The L and L 2 errors decay exponentially with N, reaching machine precision for N 16 , in full agreement with Table 4.
Figure 5. Spectral convergence for the groundwater transport problem (22). The L and L 2 errors decay exponentially with N, reaching machine precision for N 16 , in full agreement with Table 4.
Symmetry 18 01066 g005
Figure 6. Exact solution c exact ( t ) = sin ( π t ) versus Chebyshev approximation with N = 8 collocation points (black circles). The pointwise error (bottom panel) remains below 4 × 10 11 , confirming the high accuracy reported in Table 4.
Figure 6. Exact solution c exact ( t ) = sin ( π t ) versus Chebyshev approximation with N = 8 collocation points (black circles). The pointwise error (bottom panel) remains below 4 × 10 11 , confirming the high accuracy reported in Table 4.
Symmetry 18 01066 g006
Figure 7. Trade-off between accuracy ( L error, left axis) and computational cost (CPU time, right axis). The optimal balance occurs at N = 8 , where the error is already 10 11 while CPU time is minimal ( 0.29 ms).
Figure 7. Trade-off between accuracy ( L error, left axis) and computational cost (CPU time, right axis). The optimal balance occurs at N = 8 , where the error is already 10 11 while CPU time is minimal ( 0.29 ms).
Symmetry 18 01066 g007
Table 1. Numerical results for Chebyshev spectral method applied to BVP (21). Exact solution: u ( t ) = sin ( t ) . Errors are computed at the Chebyshev–Gauss–Lobatto nodes using direct solve (LU decomposition).
Table 1. Numerical results for Chebyshev spectral method applied to BVP (21). Exact solution: u ( t ) = sin ( t ) . Errors are computed at the Chebyshev–Gauss–Lobatto nodes using direct solve (LU decomposition).
NL ErrorL2 ErrorCPU Time (ms)
4 1.375 × 10 5 8.418 × 10 6 3.19
8 9.941 × 10 12 4.917 × 10 12 0.33
16 3.719 × 10 15 2.760 × 10 15 1.04
32 1.363 × 10 14 1.038 × 10 14 0.48
64 1.779 × 10 13 1.163 × 10 13 0.80
Table 2. Richardson iteration results for BVP (21) with ω = 0.5 . The contraction factor κ 0.67 ensures convergence as predicted by Theorem 2. Iterations continue until u ( k + 1 ) u ( k ) < 10 12 .
Table 2. Richardson iteration results for BVP (21) with ω = 0.5 . The contraction factor κ 0.67 ensures convergence as predicted by Theorem 2. Iterations continue until u ( k + 1 ) u ( k ) < 10 12 .
NIterationsContraction Factor κFinal L ErrorIteration Time (ms)
4180.671 1.375 × 10 5 0.42
8210.669 9.941 × 10 12 0.18
16230.668 3.719 × 10 15 0.31
32240.667 1.363 × 10 14 0.29
64250.667 1.779 × 10 13 0.35
Table 3. Comparative analysis of classical contraction principles and the proposed ( Ω , Π ) -framework.
Table 3. Comparative analysis of classical contraction principles and the proposed ( Ω , Π ) -framework.
Contraction TypeCanonical FormControl MechanismKey FeatureRelation to
Proposed Framework
Banach d ( T x , T y ) k d ( x , y ) , k [ 0 , 1 ) Constant
Lipschitz factor
Linear, global contractionRecovered when Ω ( t ) = t and Π ( t ) = k t
Wardowski τ + F ( d ( T x , T y ) ) F ( d ( x , y ) ) , τ > 0 Strictly increasing function FNonlinear,
asymptotic control
Encompassed via tailored Ω , Π selection
Implicit relation Φ ( d ( T x , T y ) , d ( x , y ) , ) 0 Continuous implicit function Φ Flexible,
multi-term dependency
Our condition is
a structured two-function instance
Proposed ( Ω , Π ) Ω ( d ( T x , T y ) ) Π ( d ( x , y ) ) Dual control functions Ω , Π Decoupled domain/
image-side control
Novel unified framework; generalizes the above
Table 4. Chebyshev spectral solution of the groundwater transport problem (22) with λ = 2 . Exact solution: c ( x ) = sin ( π x ) . The results were obtained via Richardson iteration with ω = 0.4 (contraction factor κ 0.71 ).
Table 4. Chebyshev spectral solution of the groundwater transport problem (22) with λ = 2 . Exact solution: c ( x ) = sin ( π x ) . The results were obtained via Richardson iteration with ω = 0.4 (contraction factor κ 0.71 ).
NIterationsL ErrorL2 ErrorCPU Time (ms)
422 2.184 × 10 4 1.327 × 10 4 0.51
825 3.621 × 10 11 2.105 × 10 11 0.29
1627 1.998 × 10 15 1.442 × 10 15 0.47
3228 2.331 × 10 14 1.789 × 10 14 0.38
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

Albeladi, G.; Alghamdi, M.A.; Gamal, M.; Youssri, Y.H. Fixed Point Theorems for (Ω-Π)-Contractions in Complete S-Metric Spaces. Symmetry 2026, 18, 1066. https://doi.org/10.3390/sym18071066

AMA Style

Albeladi G, Alghamdi MA, Gamal M, Youssri YH. Fixed Point Theorems for (Ω-Π)-Contractions in Complete S-Metric Spaces. Symmetry. 2026; 18(7):1066. https://doi.org/10.3390/sym18071066

Chicago/Turabian Style

Albeladi, Ghadah, Maryam A. Alghamdi, Mohamed Gamal, and Youssri Hassan Youssri. 2026. "Fixed Point Theorems for (Ω-Π)-Contractions in Complete S-Metric Spaces" Symmetry 18, no. 7: 1066. https://doi.org/10.3390/sym18071066

APA Style

Albeladi, G., Alghamdi, M. A., Gamal, M., & Youssri, Y. H. (2026). Fixed Point Theorems for (Ω-Π)-Contractions in Complete S-Metric Spaces. Symmetry, 18(7), 1066. https://doi.org/10.3390/sym18071066

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