Skip to Content
MathematicsMathematics
  • Article
  • Open Access

2 November 2025

Applications of Fixed-Point Results to Image Processing

Department of Mathematics and Statistics, Faculty of Science, University of Jeddah, P. O. Box 80327, Jeddah 21589, Saudi Arabia

Abstract

The primary objective of this study is to establish common fixed-point theorems for single-valued and multivalued mappings in the setting of complex-valued suprametric spaces. A new contraction is introduced for single-valued mappings, while a generalized Hausdorff distance aids in proving results for multivalued mappings. Additionally, fixed-point theorems are extended to complex-valued metric spaces. An example illustrates the findings, and an application to Fredholm integral equations demonstrates their role in image processing.

1. Introduction

Fixed-point (FP) theory is a vast and diverse field with three principal branches: metric, topological, and discrete FP theory. Among these, metric FP theory serves as a foundational pillar, concentrating on proving the existence and uniqueness of FPs for self-mappings defined on metric spaces (MSs). This theory is intrinsically tied to the notions of distance and convergence, which are the defining characteristics of MSs. The concept of an MS, developed by Maurice Fréchet [1] in 1906, establishes a solid foundation for quantifying distances between elements within a set. An MS is formally defined as a set equipped with a distance function, or metric, that satisfies specific axioms such as non-negativity, symmetry, and triangle inequality. Over time, this foundational idea has undergone significant development and generalization, leading to the creation of more complex mathematical structures that extend beyond classical MSs. One of the notable generalizations is the partial metric space (PMS), introduced by Matthews [2], which allows the self-distance of a point to be non-zero. This relaxation of the traditional MS axioms is particularly in areas that deal with computation, semantics, and formal methods. Similarly, Bakhtin [3] introduced b-metric spaces (b-MSs), where the triangle inequality is modified by incorporating a constant factor on the right-hand side. Further generalizations include rectangular metric spaces (RMSs), developed by Branciari [4], where the classical triangle inequality is replaced by a rectangular condition. This modification has found applications in the analysis of nonlinear problems and optimization models. Cone metric spaces (CMSs), introduced by Huang [5], represent a significant generalization of traditional MSs by replacing the real-valued distance function with a metric that takes values within a cone in a Banach space. This innovative approach provides a flexible framework for analyzing FP theorems and solving integral equations in more abstract and generalized mathematical settings. Among the more recent advancements is the concept of supra metric spaces (SMSs), introduced by Berzig [6]. SMSs are characterized by a relaxed version of the triangle inequality, allowing for a broader range of applications. The framework of SMSs has also been applied to nonlinear integral and matrix equations, demonstrating its versatility in addressing complex mathematical challenges. Later on, Berzig [7,8,9] extended the concept of SMS by generalizing the triangle inequality axiom, introducing two new MSs: generalized SMSs and b-SMSs. Additionally, recent studies by Antón-Sancho [10,11,12] further expand the FP theory in more complex and geometric contexts, including the FPs of principal E 6 -bundles over compact algebraic curves, involutions of G-Higgs bundle moduli spaces over compact Riemann surfaces, and the study of Spin(8, C )-Higgs bundles in relation to the Hitchin integrable system.
On the other hand, the concept of complex-valued metric spaces (C-VMSs) was introduced by Azam et al. [13], emerging as a special case of CMSs and an extension of an MS. C-VMSs extended the classical MSs by considering distance functions that take values in the set of complex numbers C . Rouzkard et al. [14] built upon the work of Azam et al. [13] by incorporating a rational expression into the contractive condition, significantly enhancing the scope of FP theory in C-VMSs. Afterwards, Hussain et al. [15] gave an innovative contractive condition in the background of C-VMSs and presented some common fixed-point (CFP) results. Subsequently, Ahmad et al. [16,17] further strengthened the concept of C-VMSs by developing CFP theorems for multivalued mappings, specifically under generalized contraction conditions. More recently, Panda et al. [18] unified the concepts of supra metric spaces (SMSs) and CVMSs, introducing the novel concept of complex-valued suprametric spaces (C-VSMSs). Within this new framework, they established several CFP theorems for rational contractions and demonstrated their applicability in solving complex nonlinear integral equations using contractive mappings. For readers interested in a detailed exploration of these advancements, further insights can be found in references [19,20,21,22].
FP theory has emerged as a powerful mathematical tool with significant applications in various scientific and engineering disciplines. One of its notable applications is in image processing, particularly in image restoration and enhancement. The use of FP methods in this domain has gained substantial attention due to their robustness, efficiency, and ability to handle complex optimization problems. Several studies have demonstrated the effectiveness of FP methods in image restoration. Hanjing et al. [23] introduced a fast image restoration algorithm that integrates this theory with optimization techniques, showcasing improved computational efficiency. Similarly, Kim et al. [24] employed an FP approach to solve a total variation L 2 ( T V L 2 ) regularization problem, which plays a crucial role in reducing noise while preserving important image features. FP methodologies have also been successfully implemented in hardware-based image processing. Cabello et al. [25] designed an FP 2D Gaussian filter for image processing using field-programmable gate arrays (FPGAs), highlighting the applicability of FP arithmetic in real-time signal processing tasks. Furthermore, Mishra et al. [26] explored contraction mapping principles in digital image processing, demonstrating their relevance in improving image reconstruction techniques. In particular, image denoising has become a central problem in medical imaging, where noisy CT, MRI, X-ray, and ultrasound scans can lead to misdiagnosis. Recent survey work of Kaur et al. [27] provides a comprehensive overview of state-of-the-art denoising techniques, including filtering methods, CNN-based approaches, GAN-based strategies, and Transformer-based frameworks. While such methods rely on machine learning and optimization strategies, FP theory provides a rigorous mathematical foundation for iterative schemes that underpin many of these algorithms.
On the other hand, FP theorems are a cornerstone of functional analysis, offering a robust framework for establishing the existence and uniqueness of solutions to a wide range of mathematical equations, including integral equations. Their significance is particularly evident in tackling intricate problems such as Fredholm integral equations, where FP theorems provide a structured approach to proving solvability and guaranteeing uniqueness under specific conditions. Fredholm integral equations are fundamental in numerous applied domains, including image processing (image deblurring and image denoising), where they serve as a crucial tool for modeling and solving various inverse problems. For further information, readers are encouraged to consult references [28,29,30].
In this study, we investigate the concept of C-VSMSs and establish CFP theorems for single-valued mappings under generalized contractions. Additionally, the study introduces the concept of generalized Hausdorff distance function to obtain FP theorems for multivalued mappings in the context of C-VSMSs. These theoretical advancements apply directly to C-VMSs and SMSs, leading to the derivation of some FP theorems as natural consequences of our leading results. To highlight the relevance and originality of our results, an example is provided to illustrate the main findings. We further examine the practical application of these results by applying them to the solution of Fredholm integral equations, which are significant in image denoising.

2. Preliminaries

In this section, we present the fundamental definitions, notations, and essential results that form the basis for our main findings. Since our main results are established in C-VSMSs, we first introduce the notions of MSs, SMSs, and C-VMSs to provide a structured foundation. Additionally, we review key properties related to contractions, completeness, and convergence, ensuring a self-contained framework for our FP results. These preliminaries will be instrumental in formulating and proving the main theorems in subsequent sections.
The concept of MS was introduced by Fréchet [1] in 1906, defined as follows:
Definition 1 
([1]). Let N Ø and d : N × N R + be a function that fulfills the following axioms:
(i) 
0 d ( l , ς ) and d ( l , ς ) = 0  ⇔  l = ς ;
(ii) 
d ( l , ς ) = d ( ς , l ) ;
(iii) 
d ( l , ς ) d ( l , ν ) + d ( ν , ς ) ;
for all l , ς , ν N ; then ( N , d ) is called an MS.
Berzig [6] introduced the concept of SMS in this way.
Definition 2 
([6]). Let N Ø and be a non-negative real constant. Consider a function d : N × N R + that satisfies the following properties:
(i) 
0 d ( l , ς ) and d ( l , ς ) = 0  ⇔  l = ς ;
(ii) 
d ( l , ς ) = d ( ς , l ) ;
(iii) 
d ( l , ς ) d ( l , ν ) + d ( ν , ς ) + d ( l , ν ) d ( ν , ς ) ;
for all l , ς , ν N ; then ( N , d ) is called an SMS.
Example 1. 
Let N = 0 , 1 , 2 . Define the function d : N × N R + as follows:
d ( 0 , 1 ) = d ( 1 , 0 ) = 0.5
d ( 0 , 2 ) = d ( 2 , 0 ) = 1
d ( 1 , 2 ) = d ( 2 , 1 ) = 2 ,
and
d ( 0 , 0 ) = d ( 1 , 1 ) = d ( 2 , 2 ) = 0 .
Let us choose = 1 . Then N , d is an SMS but not an MS because the triangle of MS is not satisfied; that is,
2 = d ( 1 , 2 ) > d ( 1 , 0 ) + d ( 0 , 2 ) = 0.5 + 1 .
The concept of a partial order on the set C is introduced as follows:
z 1 z 2 R e z 1 R e z 2 , I m z 1 I m z 2 .
for all z 1 , z 2 C . It follows that
z 1 z 2
if one of these conditions is met:
( a ) R e z 1 = R e z 2 , I m z 1 < I m z 2 , ( b ) R e z 1 < R e z 2 , I m z 1 = I m z 2 , ( c ) R e z 1 < R e z 2 , I m z 1 < I m z 2 , ( d ) R e z 1 = R e z 2 , I m z 1 = I m z 2 .
Azam et al. [13] defined the concept of CVMS as follows:
Definition 3 
([13]). Let N Ø and d : N × N C be a function that satisfies the subsequent axioms:
(i) 
0 d ( l , ς ) and d ( l , ς ) = 0  ⇔  l = ς ;
(ii) 
d ( l , ς ) = d ( ς , l ) ;
(iii) 
d ( l , ς ) d ( l , ν ) + d ( ν , ς ) ;
for all l , ς , ν N ; then ( N , d ) is said to be a CVMS.
Example 2 
([13]). Let N = [ 0 , 1 ] and l , ς N . Define d : N × N C by
d ( l , ς ) = 0 , if l = ς , i 2 , if l ς .
Then ( N , d ) is a CVMS.
Very recently, Panda et al. [18] defined the notion of C-VSMS in this manner.
Definition 4 
([18]). Let N Ø ,   0 and d : N × N C be a mapping satisfying
(i) 
0 d ( l , ς ) and d ( l , ς ) = 0  ⇔  l = ς ;
(ii) 
d ( l , ς ) = d ( ς , l ) ;
(iii) 
d ( l , ς ) d ( l , ν ) + d ( ν , ς ) + d ( l , ν ) d ( ν , ς ) ;
for all l , ς , ν N ; then ( N , d ) is considered as C-VSMS.
Example 3. 
Let N = { 0 , 1 , 2 } and d : N × N C is defined as
d ( l , ς ) = 0 , if l = ς , 1 + i , if l ς ,
for all l , ς N . Then ( N ,d) is a C-VSMS with = 1 .
Remark 1. 
By settingto zero in Definition 4, the idea of C-VSMS is simplified to C-VMS.
Lemma 1 
([18]). Let ( N , d ) be a C-VSMS and let l n N . Then l n converges to l if and only if d ( l n , l ) 0 as n .
Lemma 2 
([18]). Let ( N , d ) be a C-VSMS and let l n N . Then l n is a Cauchy sequence if and only if d ( l n , l n + m ) 0 as n , where m N .

3. Main Results

In this section, we establish CFP theorems for self mappings in the setting of C-VSMSs. Building on the preliminaries introduced earlier, we state and prove new FP results under generalized contractive conditions. These theorems generalize and extend existing results in C-VMSs and SMSs. The findings contribute to the broader study of FP theory in generalized metric structures and provide a theoretical foundation for potential applications in nonlinear analysis and integral equations.
Theorem 1. 
Let ( N , d ) be a complete C-VSMS and consider mappings R , J : N N . Suppose that there is a constant ϖ [ 0 , 1 ) such that
d ( R l , J ς ) ϖ M ( l , ς ) ,
where
M ( l , ς ) = d ( l , ς ) , d ( l , R l ) , d ( ς , J ς ) , d ( l , R l ) d ( ς , J ς ) 1 + d ( l , ς ) ,
holds for all l , ς N . Then R and J possess a unique CFP.
Proof. 
Let l 0 N be given. Define the sequence { l n } inductively by
l 2 n + 1 = R l 2 n and l 2 n + 2 = Jl 2 n + 1
for all n N , where R , J : N N are the self mappings. By (1) and (2), we have
d ( l 2 n + 1 , l 2 n + 2 ) = d ( R l 2 n , Jl 2 n + 1 ) ϖ M ( l 2 n , l 2 n + 1 ) ,
where
M ( l 2 n , l 2 n + 1 ) = d ( l 2 n , l 2 n + 1 ) , d ( l 2 n , R l 2 n ) , d ( l 2 n + 1 , Jl 2 n + 1 ) , d ( l 2 n , R l 2 n ) d ( l 2 n + 1 , Jl 2 n + 1 ) 1 + d ( l 2 n , l 2 n + 1 ) .
If M ( l 2 n , l 2 n + 1 ) = d ( l 2 n , l 2 n + 1 ) , then from (3), we have
d ( l 2 n + 1 , l 2 n + 2 ) ϖ d ( l 2 n , l 2 n + 1 ) ,
for all n N , which implies that
d ( l 2 n + 1 , l 2 n + 2 ) ϖ d ( l 2 n , l 2 n + 1 ) ,
for all n N . If M ( l 2 n , l 2 n + 1 ) = d ( l 2 n , R l 2 n ) , then from (3), we have
d ( l 2 n + 1 , l 2 n + 2 ) ϖ d ( l 2 n , R l 2 n ) = ϖ d ( l 2 n , l 2 n + 1 ) ,
signifying that
d ( l 2 n + 1 , l 2 n + 2 ) ϖ d ( l 2 n , l 2 n + 1 ) ,
for all n N . If M ( l 2 n , l 2 n + 1 ) = d ( l 2 n + 1 , Jl 2 n + 1 ) , then from (3), we have
d ( l 2 n + 1 , l 2 n + 2 ) ϖ d ( l 2 n + 1 , Jl 2 n + 1 ) = ϖ d ( l 2 n + 1 , l 2 n + 2 )
which yields that
d ( l 2 n + 1 , l 2 n + 2 ) ϖ d ( l 2 n + 1 , l 2 n + 2 ) < d ( l 2 n + 1 , l 2 n + 2 ) ,
and because ϖ < 1 , we get a contradiction. Hence M ( l 2 n , l 2 n + 1 ) d ( l 2 n + 1 , Jl 2 n + 1 ) . Now if
M ( l 2 n , l 2 n + 1 ) = d ( l 2 n , R l 2 n ) d ( l 2 n + 1 , Jl 2 n + 1 ) 1 + d ( l 2 n , l 2 n + 1 ) ,
then from (3), we have
d ( l 2 n + 1 , l 2 n + 2 ) ϖ d ( l 2 n , R l 2 n ) d ( l 2 n + 1 , Jl 2 n + 1 ) 1 + d ( l 2 n , l 2 n + 1 ) = ϖ d ( l 2 n , l 2 n + 1 ) d ( l 2 n + 1 , l 2 n + 2 ) 1 + d ( l 2 n , l 2 n + 1 ) ,
which implies that
d ( l 2 n + 1 , l 2 n + 2 ) ϖ d ( l 2 n , l 2 n + 1 ) d ( l 2 n + 1 , l 2 n + 2 ) 1 + d ( l 2 n , l 2 n + 1 ) ϖ d ( l 2 n + 1 , l 2 n + 2 ) ,
because d ( l 2 n , l 2 n + 1 ) < 1 + d ( l 2 n , l 2 n + 1 ) and d ( l 2 n , l 2 n + 1 ) 1 + d ( l 2 n , l 2 n + 1 ) < 1 . But since ϖ < 1 , so we have
d ( l 2 n + 1 , l 2 n + 2 ) ϖ d ( l 2 n + 1 , l 2 n + 2 ) < d ( l 2 n + 1 , l 2 n + 2 ) ,
a contradiction. Hence M ( l 2 n , l 2 n + 1 ) d ( l 2 n , R l 2 n ) d ( l 2 n + 1 , Jl 2 n + 1 ) 1 + d ( l 2 n , l 2 n + 1 ) . Thus from all the cases, we have
d ( l 2 n + 1 , l 2 n + 2 ) ϖ d ( l 2 n , l 2 n + 1 ) ,
for all n N . Similarly, from (1) and (2), we have
d ( l 2 n + 2 , l 2 n + 3 ) = d ( Jl 2 n + 1 , R l 2 n + 2 ) = d ( R l 2 n + 2 , Jl 2 n + 1 ) ϖ M ( l 2 n + 2 , l 2 n + 1 ) ,
where
M ( l 2 n + 2 , l 2 n + 1 ) = d ( l 2 n + 2 , l 2 n + 1 ) , d ( l 2 n + 2 , R l 2 n + 2 ) , d ( l 2 n + 1 , Jl 2 n + 1 ) , d ( l 2 n + 2 , R l 2 n + 2 ) d ( l 2 n + 1 , Jl 2 n + 1 ) 1 + d ( l 2 n + 2 , l 2 n + 1 ) .
If M ( l 2 n + 2 , l 2 n + 1 ) = d ( l 2 n + 2 , l 2 n + 1 ) , then from (5), we have
d ( l 2 n + 2 , l 2 n + 3 ) ϖ d ( l 2 n + 2 , l 2 n + 3 ) = ϖ d ( l 2 n + 1 , l 2 n + 2 ) ,
for all n N , which yields that
d ( l 2 n + 2 , l 2 n + 3 ) ϖ d ( l 2 n + 1 , l 2 n + 2 ) .
for all n N . If M ( l 2 n + 2 , l 2 n + 1 ) = d ( l 2 n + 2 , R l 2 n + 2 ) , then from (5), we have
d ( l 2 n + 2 , l 2 n + 3 ) ϖ d ( l 2 n + 2 , R l 2 n + 2 ) = ϖ d ( l 2 n + 2 , l 2 n + 3 ) ,
for all n N . It further implies that
d ( l 2 n + 2 , l 2 n + 3 ) ϖ d ( l 2 n + 2 , l 2 n + 3 ) < d ( l 2 n + 2 , l 2 n + 3 ) ,
and because ϖ < 1 , we get a contradiction. Hence M ( l 2 n + 2 , l 2 n + 1 ) d ( l 2 n + 2 , R l 2 n + 2 ) , for all n N . If M ( l 2 n + 2 , l 2 n + 1 ) = d ( l 2 n + 1 , Jl 2 n + 1 ) , then from (5), we have
d ( l 2 n + 2 , l 2 n + 3 ) ϖ d ( l 2 n + 1 , Jl 2 n + 1 ) = ϖ d ( l 2 n + 1 , l 2 n + 2 ) ,
for all n N . This yields that
d ( l 2 n + 2 , l 2 n + 3 ) ϖ d ( l 2 n + 1 , l 2 n + 2 ) ,
for all n N . If M ( l 2 n + 2 , l 2 n + 1 ) = d ( l 2 n + 2 , R l 2 n + 2 ) d ( l 2 n + 1 , Jl 2 n + 1 ) 1 + d ( l 2 n + 2 , l 2 n + 1 ) , then from (5), we have
d ( l 2 n + 2 , l 2 n + 3 ) ϖ d ( l 2 n + 2 , R l 2 n + 2 ) d ( l 2 n + 1 , Jl 2 n + 1 ) 1 + d ( l 2 n + 2 , l 2 n + 1 ) = ϖ d ( l 2 n + 2 , l 2 n + 3 ) d ( l 2 n + 1 , l 2 n + 2 ) 1 + d ( l 2 n + 2 , l 2 n + 1 ) ,
which implies that
d ( l 2 n + 2 , l 2 n + 3 ) ϖ d ( l 2 n + 2 , l 2 n + 3 ) d ( l 2 n + 1 , l 2 n + 2 ) 1 + d ( l 2 n + 2 , l 2 n + 1 ) ϖ d ( l 2 n + 2 , l 2 n + 3 ) ,
because d ( l 2 n + 1 , l 2 n + 2 ) < 1 + d ( l 2 n + 2 , l 2 n + 1 ) and d ( l 2 n + 1 , l 2 n + 2 ) 1 + d ( l 2 n + 2 , l 2 n + 1 ) < 1 . But since ϖ < 1 , so we have
d ( l 2 n + 2 , l 2 n + 3 ) ϖ d ( l 2 n + 2 , l 2 n + 3 ) < d ( l 2 n + 2 , l 2 n + 3 ) ,
a contradiction. Hence M ( l 2 n + 2 , l 2 n + 1 ) d ( l 2 n + 2 , R l 2 n + 2 ) d ( l 2 n + 1 , Jl 2 n + 1 ) 1 + d ( l 2 n + 2 , l 2 n + 1 ) . Thus in all cases, we have
d ( l 2 n + 2 , l 2 n + 3 ) ϖ d ( l 2 n + 1 , l 2 n + 2 )
for all n N . Hence from (4) and (6), we have
d ( l n , l n + 1 ) ϖ d ( l n 1 , l n )
for all n N . Hence
d ( l n , l n + 1 ) ϖ d ( l n 1 , l n ) ϖ 2 d ( l n 2 , l n 1 ) ϖ n d ( l 0 , l 1 ) ,
for all n N . If m > n , then we find
d l n , l m d l n , l n + 1 + d l n + 1 , l m + d l n , l n + 1 d l n + 1 , l m = d l n , l n + 1 + 1 + d l n , l n + 1 d l n + 1 , l m .
Now, we can apply the triangle inequality again to the second term d l n + 1 , l m , so we have
d l n + 1 , l m d l n + 1 , l n + 2 + d l n + 2 , l m + d l n + 1 , l n + 2 d l n + 2 , l m = d l n + 1 , l n + 2 + 1 + d l n + 1 , l n + 2 d l n + 2 , l m .
Now, we can apply the triangle inequality again to the second term d l n + 2 , l m , so we have
d l n + 2 , l m d l n + 2 , l n + 3 + d l n + 3 , l m + d l n + 2 , l n + 3 d l n + 3 , l m = d l n + 2 , l n + 3 + 1 + d l n + 2 , l n + 3 d l n + 3 , l m ,
and so on
d l m 2 , l m d l m 2 , l m 1 + d l m 1 , l m + d l m 2 , l m 1 d l m 1 , l m = d l m 2 , l m 1 + 1 + d l m 2 , l m 1 d l m 1 , l m .
Recursively substituting each inequality into the preceding one (8) and simplifying, we have
d l n , l m k = n m 1 d l n , l n + 1 i = n k 1 1 + d l i , l i + 1 .
By the inequality (7), we have
d l n , l m d l 0 , l 1 k = n m 1 μ n i = n k 1 1 + μ i d l 0 , l 1 .
Now observe that 1 + μ i d l 0 , l 1 1 , for all i . Therefore,
i = n k 1 1 + μ i d l 0 , l 1 1 .
Now with the product term bounded below by 1, we can simplify the summation
d l 0 , l 1 k = n m 1 μ n i = n k 1 1 + μ i d l 0 , l 1 d l 0 , l 1 k = n m 1 μ n .
since k = n m 1 μ n is a finite geometric series with the first term μ n and the common ratio μ . The sum of a finite geometric series is given by
k = n m 1 μ n = μ n 1 μ m n 1 μ .
As m ,   μ m n 0 . Therefore, the sum converges to μ n 1 μ , that is,
lim m μ n 1 μ m n 1 μ = μ n 1 μ .
Since μ < 1 , the expression μ n 1 μ approaches 0 as n . Letting n in (8) and employing the established facts, we arrive at
lim n d l n , l m = 0 .
which implies that l n is Cauchy. As N is complete, so there exists l * N such that l n l * as n . Thus,
lim n l n = l * .
Now, we show that l * is an FP of R . From (1) and (2), we have
d ( l * , R l * ) d l * , l 2 n + 2 + d l 2 n + 2 , R l * + d l * , l 2 n + 2 d l 2 n + 2 , R l * = d l * , l 2 n + 2 + d Jl 2 n + 1 , R l * + d l * , l 2 n + 2 d Jl 2 n + 1 , R l * = d l * , l 2 n + 2 + d R l * , Jl 2 n + 1 + d l * , l 2 n + 2 d R l * , Jl 2 n + 1 d l * , l 2 n + 2 + ϖ M l * , l 2 n + 1 + ϖ d l * , l 2 n + 2 M l * , l 2 n + 1 ,
which implies
d ( l * , R l * ) d l * , l 2 n + 2 + ϖ M l * , l 2 n + 1 + ϖ d l * , l 2 n + 2 M l * , l 2 n + 1 ,
where
M l * , l 2 n + 1 = d l * , l 2 n + 1 , d ( l * , R l * ) , d ( l 2 n + 1 , Jl 2 n + 1 ) , d ( l * , R l * ) d ( l 2 n + 1 , Jl 2 n + 1 ) 1 + d l * , l 2 n + 1 = d l * , l 2 n + 1 , d ( l * , R l * ) , d ( l 2 n + 1 , l 2 n + 2 ) , d ( l * , R l * ) d ( l 2 n + 1 , l 2 n + 2 ) 1 + d l * , l 2 n + 1 .
Taking n + in the inequality stated above, we arrive at the following result
lim n d l * , l 2 n + 1 = 0 ,
and
lim n ϖ d l * , l 2 n + 2 M l * , l 2 n + 1 = 0 ,
because lim n d l * , l 2 n + 2 = 0 . Therefore, the remaining task is to find lim n ϖ M l * , l 2 n + 1 . We discuss the following four cases. If M l * , l 2 n + 1 = d l * , l 2 n + 1 , then from (13), we have
d ( l * , R l * ) lim n ϖ d l * , l 2 n + 1 = 0 ,
implying l * = R l * . If M l * , l 2 n + 1 = d ( l * , R l * ) , then from (13), we have
d ( l * , R l * ) ϖ d ( l * , R l * )
which is a contradiction because ϖ < 1 . Hence M l * , l 2 n + 1 d ( l * , R l * ) . Now if M l * , l 2 n + 1 = d ( l 2 n + 1 , l 2 n + 2 ) , then from (13), we have
d ( l * , R l * ) lim n ϖ d ( l 2 n + 1 , l 2 n + 2 ) = 0 ,
which yields that l * = R l * . Now if M l * , l 2 n + 1 = d ( l * , R l * ) d ( l 2 n + 1 , l 2 n + 2 ) 1 + d l * , l 2 n + 1 , then from (13), we have
d ( l * , R l * ) ϖ lim n d ( l * , R l * ) d ( l 2 n + 1 , l 2 n + 2 ) 1 + d l * , l 2 n + 1 = 0 ,
which implies that l * = R l * . Thus l * is an FP of J . Similarly, from (1) and (2), we have
d ( l * , Jl * ) d l * , l 2 n + 1 + d l 2 n + 1 , Jl * + d l * , l 2 n + 1 d l 2 n + 1 , Jl * = d l * , l 2 n + 1 + d R l 2 n , Jl * + d l * , l 2 n + 1 d R l 2 n , Jl * d l * , l 2 n + 2 + ϖ M l 2 n , l * + ϖ d l * , l 2 n + 1 M l 2 n , l * ,
which further yields that
d ( l * , Jl * ) d l * , l 2 n + 2 + ϖ M l 2 n , l * + ϖ d l * , l 2 n + 1 M l 2 n , l * ,
where
M l 2 n , l * = d l 2 n , l * , d ( l 2 n , R l 2 n ) , d ( l * , Jl * ) , d ( l 2 n , R l 2 n ) d ( l * , Jl * ) 1 + d l 2 n , l * = d l 2 n , l * , d ( l 2 n , l 2 n + 1 ) , d ( l * , Jl * ) , d ( l 2 n , l 2 n + 1 ) d ( l * , Jl * ) 1 + d l 2 n , l * .
Taking n + in the previous inequality, we obtain the following
lim n d l * , l 2 n + 2 = 0
and
lim n ϖ d l * , l 2 n + 1 M R l 2 n , Jl * = 0 ,
because lim n d l * , l 2 n + 1 = 0 . Therefore, the remaining task is to find lim n ϖ M R l 2 n , Jl * . We discuss the following four cases. If M l 2 n , l * = d l 2 n , l * , then from (14), we have
d ( l * , Jl * ) ϖ lim n d l 2 n , l * = 0 ,
implying l * = Jl * . If M l 2 n , l * = d ( l 2 n , l 2 n + 1 ) , then from (14), we have
d ( l * , Jl * ) ϖ lim n d ( l 2 n , l 2 n + 1 ) = 0 ,
which yields that l * = Jl * . If M l 2 n , l * = d ( l * , Jl * ) , then from (14), we have
d ( l * , Jl * ) ϖ d ( l * , Jl * ) ,
a contradiction because ϖ < 1 . Hence M l 2 n , l * d ( l * , Jl * ) . If M l 2 n , l * = d ( l 2 n , l 2 n + 1 ) d ( l * , Jl * ) 1 + d l 2 n , l * , then from (14), we have
d ( l * , Jl * ) ϖ lim n d ( l 2 n , l 2 n + 1 ) d ( l * , Jl * ) 1 + d l 2 n , l * = 0 ,
implying that l * = Jl * . Thus l * is an FP of J . Hence l * is a CFP of J and R . To prove the uniqueness of l * , suppose, for contradiction, that another CFP l of J and R exists, i.e., l = Jl = R l with l * l . Then, from (1) and (2), we have
d ( l * , l ) = d ( R l * , Jl ) ϖ M l * , l ,
where
M l * , l = d ( l * , l ) , d ( l * , R l * ) , d ( l , Jl ) , d ( l * , R l * ) d ( l , Jl ) 1 + d ( l * , l ) = d ( l * , l ) , d ( l * , l * ) , d ( l , l ) , d ( l * , l * ) d ( l , l ) 1 + d ( l * , l ) .
Then we have only M l * , l = d ( l * , l ) , which implies by (15) that
d ( l * , l ) ϖ d ( l * , l ) ,
which is a contradiction because ϖ < 1 . Hence l * = l . Hence CFP is unique. □
Corollary 1. 
Let ( N , d ) be a complete C-VSMS and J : N N . Suppose that there is a constant ϖ [ 0 , 1 ) such that
d ( Jl , J ς ) ϖ M ( l , ς ) ,
where
M ( l , ς ) = d ( l , ς ) , d ( l , Jl ) , d ( ς , J ς ) , d ( l , Jl ) d ( ς , J ς ) 1 + d ( l , ς ) ,
for all l , ς N . Then J has a unique FP.
Proof. 
Take R = J in Theorem 1. □

4. Fixed-Point Results for Multivalued Mappings

In this section, we investigate the existence of fixed points for multivalued mappings in the setting of C-VSMSs. For this purpose, we define a generalized Hausdorff distance function in C-VSMSs with the help of a function s : C C defined by
s z 1 = { z 2 C : z 1 z 2 } ,
for z 1 C . Here, ⪯ is a partial order defined on C in the context of C-VSMSs. To ensure that s z 1 is nonempty, we assume that the partial order ⪯ on C is reflexive. Under this condition, for any z 1 C , there exists at least one element z 2 C such that z 1 z 2 , guaranteeing that s z 1 is nonempty. For the remainder of this section, let ( N , d ) denote a C-VSMS. We represent the collection of all nonempty subsets of N by 2 N , the set of all closed subsets of N by C ( N ) and the set of all closed and bounded subsets of N by C B ( N ) . A subset A N is said to be closed if, for every sequence { l n } A that converges to some l n l , the limit point l also belongs to A . The subset A N is bounded if there exists an element κ C such that
d ( l , ς ) κ
for all ρ , A . We define
s l , B = ς B s d l , ς = ς B { z C : d l , ς z } ,
for l N and B 2 N . For A , B C B N , we define the generalized Hausdorff distance in the following
s A , B = l A s l , B ς B s ς , A .
Lemma 3. 
Let N , d be a C-VSMS.
(i) 
Let z 1 , z 2 C . If z 1 z 2 , then s z 2 s z 1 .
(ii) 
Let l N and A 2 N . If 0 s l , A , then l A .
(iii) 
Let z C and let A , B C B N and l A . If z s A , B , then z s l , B .
(iv) 
Let z C and σ 0 , then σ s z s σ z .
Proof. 
(i): Assume that z 1 z 2 , for z 1 , z 2 C and let z 3 s z 2 be an arbitrary element. Then by the definition of s , we have
z 3 s z 2 z 2 z 3 .
Now since z 1 z 2 and z 2 z 3 , by the transitivity of , we have z 1 z 3 . Hence z 3 s z 1 . Thus s z 2 s z 1 .
(ii). Assume that 0 s l , A , for l N and A 2 N . By definition,
s l , A = a A s d l , a .
So, 0 s l , A means that there exists some ς A such that 0 s d l , ς . Then by the definition of s , we have
d l , ς 0 ,
which implies l = ς for some ς A . It follows that l A .
(iii) If we assume that z s A , B , then by the definition of s A , B , we have
z s A , B z l A s l , B ς B s ς , A .
Since z l A s l , B , it follows that z s l , B , for every l A .
(iv) It is obvious. □
Remark 2. 
Let N , d be a C-VSMS. Then
s { l } , { ς } = s d l , ς ,
l , ς N .
Remark 3. 
Let N , d be a C-VSMS. If C = R , then N , d reduces to an MS. Moreover, for any A , B C B ( N ) , the Hausdorff distance induced by d is given by
H ( A , B ) = inf s ( A , B ) .
The concept of α -admissible mappings was defined by Samet et al. [31] in 2012.
Definition 5 
([31]). Let J : N N and α : N × N [ 0 , + ) . Then, J is termed an α-admissible mapping when
l , ς N , α ( l , ς ) 1 α ( Jl , J ς ) 1 .
Abbas et al. [32] gave the concept of α-closed mappings in this way.
Definition 6 
([32]). Let N Ø , α : N × N [ 0 , + ) and J : N 2 N . Consequently, J is deemed α-closed if
l , ς N , α ( l , ς ) 1 α ( u , v ) 1 for any u Jl and v J ς .
Definition 7 
([32]). Let N Ø , α : N × N [ 0 , + ) and R , J : N 2 N . Then the pair R , J is said to be α-closed if
l , ς N , α ( l , ς ) 1 α ( u , v ) 1 ,
for any u R l and v J ς .
Theorem 2. 
Let ( N , d ) be a complete C-VSMS and R , J : N C B ( N ) . The following conditions are assumed to be true:
(i) There exists α : N × N [ 0 , + ) such that
ϖ d ( l , ς ) α ( l , ς ) s ( R l , J ς ) ,
for all l , ς N ;
(ii) R , J and J , R are α-closed;
(iii) there exist l 0 N , l 1 R l 0 such that α ( l 0 , l 1 ) 1 ;
(iv) if { l n } is a sequence in N such that α ( l n , l n + 1 ) 1 for all n and l n l * as n , then α ( l 2 n , l * ) 1 and α ( l 2 n + 1 , l * ) 1 for all n N .
Then there exists a point l * N such that l * R l * Jl * .
Proof. 
If we let l 0 be an arbitrary point in N , then R l 0 Ø and R l 0 C ( N ) . So there exists l 1 N such that l 1 R l 0 . By (16), we have
ϖ d ( l 0 , l 1 ) α ( l 0 , l 1 ) s ( R l 0 , Jl 1 ) .
By the definition of the generalized Hausdorff distance function “s”, we have
ϖ d ( l 0 , l 1 ) α ( l 0 , l 1 ) l R l 0 s l , Jl 1 ς Jl 1 s ς , R l 0 ,
which implies
ϖ d ( l 0 , l 1 ) α ( l 0 , l 1 ) s l , Jl 1 ,
for all l R l 0 . Since l 1 R l 0 , we have
ϖ d ( l 0 , l 1 ) α ( l 0 , l 1 ) s l 1 , Jl 1 .
This implies that
ϖ d ( l 0 , l 1 ) α ( l 0 , l 1 ) s l 1 , Jl 1 = α ( l 0 , l 1 ) s l Jl 1 d ( l 1 , l ) .
Since Jl 1 Ø , so there exists l 2 N such that l 2 Jl 1 , we have
ϖ d ( l 0 , l 1 ) α ( l 0 , l 1 ) s d l 1 , l 2 .
By Lemma 3 (iv), we have
ϖ d ( l 0 , l 1 ) α ( l 0 , l 1 ) s d l 1 , l 2 = s α ( l 0 , l 1 ) d l 1 , l 2 .
Therefore,
α ( l 0 , l 1 ) d l 1 , l 2 ϖ d ( l 0 , l 1 ) .
Since α ( l 0 , l 1 ) 1 , we have
d l 1 , l 2 α ( l 0 , l 1 ) d l 1 , l 2 ϖ d ( l 0 , l 1 ) ,
which implies
d l 1 , l 2 ϖ d ( l 0 , l 1 ) .
Now, if l 1 = l 2 , then l 1 is the required FP. And we have nothing to prove. So we suppose that l 1 l 2 . As α ( l 0 , l 1 ) 1 and the pairs R , J and J , R are α -closed, then α ( l 1 , l 2 ) 1 . Now from (16), we have
ϖ d ( l 1 , l 2 ) α ( l 1 , l 2 ) s ( Jl 1 , R l 2 ) .
This yields that
ϖ d ( l 1 , l 2 ) α ( l 1 , l 2 ) l Jl 1 s l , R l 2 ς R l 2 s ς , Jl 1 .
By the definition of the generalized Hausdorff distance function “s”, we have
ϖ d ( l 1 , l 2 ) α ( l 1 , l 2 ) s l , R l 2 ,
for all l Jl 1 . Since l 2 Jl 1 , we have
ϖ d ( l 1 , l 2 ) α ( l 1 , l 2 ) s l 2 , R l 2 .
This implies that
ϖ d ( l 1 , l 2 ) α ( l 1 , l 2 ) s l 2 , R l 2 = α ( l 1 , l 2 ) s l R l 2 d ( l 2 , l ) .
Since R l 2 Ø , there exists l 3 N such that l 3 R l 2 , and we have
ϖ d ( l 1 , l 2 ) α ( l 1 , l 2 ) s d l 2 , l 3 .
By Lemma 3 (iv), we have
ϖ d ( l 1 , l 2 ) α ( l 1 , l 2 ) s d l 2 , l 3 = s α ( l 1 , l 2 ) d l 2 , l 3 .
Therefore,
α ( l 1 , l 2 ) d l 2 , l 3 ϖ d ( l 1 , l 2 ) .
Since α ( l 1 , l 2 ) 1 , we have
d l 2 , l 3 α ( l 1 , l 2 ) d l 2 , l 3 ϖ d ( l 1 , l 2 ) ,
which yields
d l 2 , l 3 ϖ d ( l 1 , l 2 ) .
Now, if l 2 = l 3 , then l 2 is the required FP. And we have nothing to prove. So we suppose that l 2 l 3 . As α ( l 1 , l 2 ) 1 and the pairs R , J and J , R are α -closed, α ( l 2 , l 3 ) 1 . Now from (16), we have
ϖ d ( l 2 , l 3 ) α ( l 2 , l 3 ) s ( R l 2 , Jl 3 ) .
This implies that
ϖ d ( l 2 , l 3 ) α ( l 2 , l 3 ) l R l 2 s l , Jl 3 ς Jl 3 s ς , R l 2 ,
which yields
ϖ d ( l 2 , l 3 ) α ( l 2 , l 3 ) s l , Jl 3 ,
for all l R l 2 . Since l 3 R l 2 , we have
ϖ d ( l 2 , l 3 ) α ( l 2 , l 3 ) s l 3 , Jl 3 .
This implies that
ϖ d ( l 2 , l 3 ) α ( l 2 , l 3 ) s l 3 , Jl 3 = α ( l 2 , l 3 ) s l Jl 3 d ( l 3 , l ) .
Since Jl 3 Ø , so there exists l 4 N such that l 4 Jl 3 , we have
ϖ d ( l 2 , l 3 ) α ( l 2 , l 3 ) s d l 3 , l 4 .
By Lemma 3 (iv), we have
ϖ d ( l 2 , l 3 ) α ( l 2 , l 3 ) s d l 3 , l 4 = s α ( l 2 , l 3 ) d l 3 , l 4 .
Therefore,
α ( l 2 , l 3 ) d l 3 , l 4 ϖ d ( l 2 , l 3 ) .
Since α ( l 2 , l 3 ) 1 , we have
d l 3 , l 4 α ( l 2 , l 3 ) d l 3 , l 4 ϖ d ( l 2 , l 3 ) ,
which implies that
d l 3 , l 4 ϖ d ( l 2 , l 3 ) .
Iterating this procedure yields a sequence { l n } in N such that
l 2 n + 1 R l 2 n and l 2 n + 2 Jl 2 n + 1
and α ( l n , l n + 1 ) 1 and
d ( l n , l n + 1 ) ϖ d ( l n 1 , l n ) ϖ n d ( l 0 , l 1 ) ,
which leads to
d ( l n , l n + 1 ) ϖ d ( l n 1 , l n ) ,
for all n. Hence
d ( l n , l n + 1 ) ϖ d ( l n 1 , l n ) ϖ n d ( l 0 , l 1 ) ,
for all n N . Now, for any natural number m greater than n, we have
d l n , l m d l n , l n + 1 + d l n + 1 , l m + d l n , l n + 1 d l n + 1 , l m = d l n , l n + 1 + 1 + d l n , l n + 1 d l n + 1 , l m .
Now, we can apply the triangle inequality again to the second term d l n + 1 , l m ; we have
d l n + 1 , l m d l n + 1 , l n + 2 + d l n + 2 , l m + d l n + 1 , l n + 2 d l n + 2 , l m = d l n + 1 , l n + 2 + 1 + d l n + 1 , l n + 2 d l n + 2 , l m .
Now, we can apply the triangle inequality again to the second term d l n + 2 , l m ; we have
d l n + 2 , l m d l n + 2 , l n + 3 + d l n + 3 , l m + d l n + 2 , l n + 3 d l n + 3 , l m = d l n + 2 , l n + 3 + 1 + d l n + 2 , l n + 3 d l n + 3 , l m ,
and so on
d l m 2 , l m d l m 2 , l m 1 + d l m 1 , l m + d l m 2 , l m 1 d l m 1 , l m = d l m 2 , l m 1 + 1 + d l m 2 , l m 1 d l m 1 , l m .
Recursively substituting each inequality into the preceding one (26) and simplifying, we have
d l n , l m k = n m 1 d l n , l n + 1 i = n k 1 1 + d l i , l i + 1 .
By the inequality (25), we have
d l n , l m d l 0 , l 1 k = n m 1 μ n i = n k 1 1 + μ i d l 0 , l 1 .
Now observe that 1 + μ i d l 0 , l 1 1 , for all i . Therefore,
i = n k 1 1 + μ i d l 0 , l 1 1 .
Now with the product term bounded below by 1, we can simplify the summation
d l 0 , l 1 k = n m 1 μ n i = n k 1 1 + μ i d l 0 , l 1 d l 0 , l 1 k = n m 1 μ n .
since k = n m 1 μ n is a finite geometric series with the first term μ n and the common ratio μ . The sum of a finite geometric series is given by
k = n m 1 μ n = μ n 1 μ m n 1 μ .
As m ,   μ m n 0 . Therefore, the sum converges to μ n 1 μ , that is,
lim m μ n 1 μ m n 1 μ = μ n 1 μ .
Since μ < 1 , the expression μ n 1 μ approaches 0 as n . Letting n in inequality (27) and employing the established facts, we arrive at
lim n d l n , l m = 0 .
which implies that l n is Cauchy. As N is complete, so there exists l * N such that l n l * as n . Thus,
lim n l n = l * .
As we have a sequence { l n } in N such that α ( l n , l n + 1 ) 1 for all n and l n l * as n + then by assumption, we have α ( l 2 n , l * ) 1 for all n. From (16), we have
ϖ d ( l 2 n , l * ) α ( l 2 n , l * ) s ( R l 2 n , Jl * ) ,
for all n N . By the definition of the generalized Hausdorff distance function “s”, we have
ϖ d ( l 2 n , l * ) α ( l 2 n , l * ) l R l 2 n s l , Jl * ς Jl * s ς , R l 2 n ,
which implies that
ϖ d ( l 2 n , l * ) α ( l 2 n , l * ) s l , Jl * ,
for all l R l 2 n . Since l 2 n + 1 R l 2 n , we have
ϖ d ( l 2 n , l * ) α ( l 2 n , l * ) s l 2 n + 1 , Jl * .
This implies that
ϖ d ( l 2 n , l * ) α ( l 2 n , l * ) s l 2 n + 1 , Jl * = α ( l 2 n , l * ) s l Jl * d ( l 2 n + 1 , l ) .
Since Jl * Ø , so there exists v n N such that v n Jl * , we have
ϖ d ( l 2 n , l * ) α ( l 2 n , l * ) s d ( l 2 n + 1 , v n ) .
By Lemma 3 (iv), we have
ϖ d ( l 2 n , l * ) α ( l 2 n , l * ) s d ( l 2 n + 1 , v n ) = s α ( l 2 n , l * ) d ( l 2 n + 1 , v n ) .
Therefore,
α ( l 2 n , l * ) d ( l 2 n + 1 , v n ) ϖ d ( l 2 n , l * ) .
Since α ( l 2 n , l * ) 1 , we have
0 d ( l 2 n + 1 , v n ) α ( l 2 n , l * ) d ( l 2 n + 1 , u n ) ϖ d ( l 2 n , l * ) ,
which implies that
d ( l 2 n + 1 , v n ) ϖ d ( l 2 n , l * ) ,
for all n N . Now from triangular property and (31), we have
d ( l * , v n ) d ( l * , l 2 n + 1 ) + d ( l 2 n + 1 , v n ) + d ( l * , l 2 n + 1 ) d ( l 2 n + 1 , v n ) d ( l * , l 2 n + 1 ) + d ( l 2 n + 1 , v n ) + ϖ d ( l * , l 2 n + 1 ) d ( l 2 n , l * ) ,
for all n N . It yields that
d ( l * , v n ) d ( l * , l 2 n + 1 ) + d ( l 2 n + 1 , v n ) + ϖ d ( l * , l 2 n + 1 ) d ( l 2 n , l * ) ,
Taking the limit as n in (32) and considering that lim n l n = l * , we have
lim n d ( l * , v n ) = 0 ,
that is, lim n v n = l * . Since Jl * is closed, l * Jl * . This implies that l * is an FP of J . As we have a sequence { l n } in N such that α ( l n , l n + 1 ) 1 for all n and l n l * as n + then by assumption, we have α ( l 2 n + 1 , l * ) 1 for all n. Similarly by (16), we have
ϖ d ( l 2 n + 1 , l * ) α ( l 2 n + 1 , l * ) s ( Jl 2 n + 1 , R l * ) ,
for all n N . This implies that
ϖ d ( l 2 n + 1 , l * ) α ( l 2 n + 1 , l * ) l Jl 2 n + 1 s l , R l * ς R l * s ς , Jl 2 n + 1 ,
which yields that
ϖ d ( l 2 n + 1 , l * ) α ( l 2 n + 1 , l * ) s l , R l * ,
for all l Jl 2 n + 1 . Since l 2 n + 2 Jl 2 n + 1 , we have
ϖ d ( l 2 n + 1 , l * ) α ( l 2 n + 1 , l * ) s l 2 n + 2 , R l * .
This implies that
ϖ d ( l 2 n + 1 , l * ) α ( l 2 n + 1 , l * ) s l 2 n + 2 , R l * = α ( l 2 n + 1 , l * ) s l R l * d ( l 2 n + 2 , l ) .
Since R l * Ø , so there exists u n N such that u n R l * , we have
ϖ d ( l 2 n + 1 , l * ) α ( l 2 n + 1 , l * ) s d ( l 2 n + 2 , u n ) .
By Lemma 3 (iv), we have
ϖ d ( l 2 n + 1 , l * ) α ( l 2 n + 1 , l * ) s d ( l 2 n + 2 , u n ) = s α ( l 2 n + 1 , l * ) d ( l 2 n + 2 , u n ) .
Therefore,
α ( l 2 n + 1 , l * ) d ( l 2 n + 2 , u n ) ϖ d ( l 2 n + 1 , l * ) .
Since α ( l 2 n + 1 , l * ) 1 , we have
0 d ( l 2 n + 2 , u n ) α ( l 2 n + 1 , l * ) d ( l 2 n + 2 , u n ) ϖ d ( l 2 n + 1 , l * ) ,
which implies that
d ( l 2 n + 2 , u n ) ϖ d ( l 2 n + 1 , l * ) ,
for all n N . Now from triangular property and (34), we have
d ( l * , u n ) d ( l * , l 2 n + 2 ) + d ( l 2 n + 2 , u n ) + d ( l * , l 2 n + 2 ) d ( l 2 n + 2 , u n ) d ( l * , l 2 n + 2 ) + d ( l 2 n + 2 , u n ) + ϖ d ( l * , l 2 n + 2 ) d ( l 2 n + 1 , l * ) ,
which implies that
d ( l * , u n ) d ( l * , l 2 n + 2 ) + d ( l 2 n + 2 , u n ) + ϖ d ( l * , l 2 n + 2 ) d ( l 2 n + 1 , l * ) ,
for all n N . Letting n in (35) and incorporating the known result that lim n l n = l * , we have
lim n d ( l * , u n ) = 0 ,
that is, lim n u n = l * . Since R l * is closed, l * R l * . This implies that l * is an FP of R . This completes the proof. □
Example 4. 
Let N = [ 0 , 1 ] , define d : N × N C by
d ( l , ς ) = l ς 1 + i 2 ,
for all l , ς N . First we prove that ( N , d ) is complete C-VSMS.
(i) d ( l , ς ) = l ς 1 + i 2 0 + 0 i because
R e d ( l , ς ) = l ς 0 and I m d ( l , ς ) = 1 2 l ς 0 ,
for all l , ς N . Also, d ( l , ς ) = 0 + 0 i implies l ς = 0 , which means l = ς . Conversely, if l = ς , then l ς = 0 implies d ( l , ς ) = 0 + 0 i .
(ii) d ( l , ς ) = l ς 1 + i 2 = ς l 1 + i 2 = d ( ς , l ) .
(iii)
d ( l , ς ) = l ς 1 + i 2 = l ν + ν ς 1 + i 2 l ν + ν ς 1 + i 2 + l ν ν ς 1 + i 2 2 = d ( l , ν ) + d ( ν , ς ) + d ( l , ν ) d ( ν , ς ) ,
for all l , ϖ , ς N and for some 0 . Hence ( N , d ) is a C-VSMS. Also it is complete.
Define α : N × N [ 0 , + ) by
α ( l , ς ) = max 1 , 2 l ς ,
for all l , ς N and multivalued mappings R , J : N C B ( N ) defined by
R l = 0 , l 10 and Jl = 0 , l 20 .
Then for any l , ς N , we obtain that α ( l , ς ) 1 and R l , Jl 0 , 1 . Since α ( u , v ) 1 , for all u R l and v J ς , the pairs R , J and J , R are α-closed. Moreover, if l 0 = 1 and l 1 = 1 10 R l 0 , then
α ( l 0 , l 1 ) = max 1 , 2 × 9 10 = max 1 , 18 10 1 .
Moreover, for any sequence { l n } in N with α ( l n , l n + 1 ) 1 , for all n N and l n l * as n , then α ( l 2 n , l * ) 1 and α ( l 2 n + 1 , l * ) 1 , for all n N . It is readily observed that the contractive condition of the prime theorem is satisfied when l = ς = 0 . For the sake of simplicity, we assume, without loss of generality, that neither l nor ς is zero. Now, let us consider the case where l ς . Then,
d ( l , ς ) = l ς 1 + i 2 ,
s ( R l , J ς ) = s l 10 ς 20 1 + i 2 .
Clearly, for any value of 1 5 ϖ < 1 , we have
2 l 10 ς 20 1 + i 2 ϖ l ς 1 + i 2 ,
so
ϖ d ( l , ς ) α ( l , ς ) s ( R l , J ς ) .
Therefore, all the requirements of our prime Theorem 2 are met, and 0 serves as a CFP of both R and J .
Corollary 2. 
Let ( N , d ) be a complete C-VSMS and J : N C B ( N ) . The following conditions are assumed to be true:
(i) There is a function α : N × N [ 0 , + ) such that
ϖ d ( l , ς ) α ( l , ς ) s ( Jl , J ς ) ,
for all l , ς N ;
(ii) J is α-closed;
(iii) There exist l 0 N , l 1 Jl 0 such that α ( l 0 , l 1 ) 1 ;
(iv) If { l n } is a sequence in N such that α ( l n , l n + 1 ) 1 , for all n and l n l * as n , then α ( l n , l * ) 1 , for all n N .
Then there exists a point l * N such that l * Jl * .
Proof. 
Take R = J in Theorem 2. □
Corollary 3. 
Let ( N , d ) be a complete C-VSMS and R , J : N C B ( N ) . Assume that there exists some constant ϖ [ 0 , 1 ) such that
ϖ d ( l , ς ) s ( R l , J ς ) ,
for all l , ς N . Then there exists a point l * N such that l * R l * Jl * .
Proof. 
Define α : N × N [ 0 , + ) by α ( l , ς ) = 1 , for all l , ς N in Theorem 2. □
Corollary 4. 
Let ( N , d ) be a complete C-VSMS and J : N C B ( N ) . Assume that there exists some constant ϖ [ 0 , 1 ) such that
ϖ d ( l , ς ) s ( Jl , J ς ) ,
for all l , ς N . Then there exists a point l * N such that l * Jl * .
Proof. 
Take R = J in the above corollary. □
Remark 4. 
By setting Jl = { l } for all l N in the above corollary, we derive one of the results established by Panda et al. [18].
Based on the observations in Remark 3, the following corollaries can be derived.
Corollary 5. 
Let ( N , d ) be a complete SMS and R , J : N C B ( N ) . The following conditions are assumed to be true:
(i) There exist a function α : N × N [ 0 , + ) and a constant ϖ [ 0 , 1 ) such that
α ( l , ς ) H ( R l , J ς ) ϖ d ( l , ς ) ,
for all l , ς N ;
(ii) R , J and J , R are α-closed;
(iii) There exist l 0 N , l 1 R l 0 such that α ( l 0 , l 1 ) 1 ;
(iv) If { l n } is a sequence in N such that α ( l n , l n + 1 ) 1 , for all n and l n l * as n , then α ( l 2 n , l * ) 1 and α ( l 2 n + 1 , l * ) 1 , for all n N .
Then there exists a point l * N such that l * R l * Jl * .
Corollary 6. 
Let ( N , d ) be a complete SMS and J : N C B ( N ) . The following conditions are assumed to be true:
(i) There exist a function α : N × N [ 0 , + ) and a constant ϖ [ 0 , 1 ) such that
α ( l , ς ) H ( Jl , J ς ) ϖ d ( l , ς ) ,
for all l , ς N ;
(ii) J is α-closed;
(iii) There exist l 0 N , l 1 Jl 0 such that α ( l 0 , l 1 ) 1 ;
(iv) If { l n } is a sequence in N such that α ( l n , l n + 1 ) 1 , for all n and l n l * as n , then α ( l n , l * ) 1 , for all n N .
Then there exists a point l * N such that l * Jl * .
Proof. 
Take R = J in the previous inequality. □
Corollary 7. 
Let ( N , d ) be a complete SMS and R , J : N C B ( N ) . Assume that there exists a constant ϖ [ 0 , 1 ) such that
H ( R l , J ς ) ϖ d ( l , ς ) ,
for all l , ς N . Then there exists a point l * N such that l * R l * Jl * .
Remark 5. 
By setting R = J in the above corollary, we obtain Nadler’s FP theorem [33] in the framework of SMS.
Remark 6. 
By setting R = J and defining Jl = { l } , for all l N in the above corollary, we establish a direct connection to Berzig’s main theorem [6].

5. Comparative Analysis and Significance of Results

In this section, we derive CFP theorems in C-VMSs as direct consequences of the results established in the previous sections. By adapting our findings from C-VSMSs, we demonstrate how similar FP results hold in the standard C-VMS framework under appropriate conditions. When we take = 0 in Definition 4, the notion of C-VSMS reduces to C-VMS, and this specialization allows us to derive the subsequent results within the C-VMS framework.
As a direct consequence of Theorem 1, we obtain the following result, which corresponds to one of the findings of Hussain et al. [15].
Corollary 8 
([15]). Let ( N , d ) be a complete C-VMS and R , J : N N . Assume that there is a constant ϖ [ 0 , 1 ) such that
d ( R l , J ς ) ϖ M ( l , ς ) ,
where
M ( l , ς ) = d ( l , ς ) , d ( l , R l ) , d ( ς , J ς ) , d ( l , R l ) d ( ς , J ς ) 1 + d ( l , ς ) ,
for all l , ς N , then there exists a unique point l * N such that R l * = J l * = l * .
Proof. 
Taking = 0 in Theorem 1. □
Corollary 9 
([15]). Let ( N , d ) be a complete C-VMS and J : N N . Assume that there is a constant ϖ [ 0 , 1 ) such that
d ( Jl , J ς ) ϖ M ( l , ς ) ,
where
M ( l , ς ) = d ( l , ς ) , d ( l , Jl ) , d ( ς , J ς ) , d ( l , Jl ) d ( ς , J ς ) 1 + d ( l , ς ) ,
for all l , ς N , then there exists a unique point l * N such that J l * = l * .
Proof. 
Take R = J in above corollary. □
Corollary 10. 
Let ( N , d ) be a complete C-VMS and R , J : N C B ( N ) . The following conditions are assumed to be true:
(i) There is a function α : N × N [ 0 , + ) such that
ϖ d ( l , ς ) α ( l , ς ) s ( R l , J ς )
for all l , ς N ;
(ii) R , J and J , R are α-closed;
(iii) There exist l 0 N , l 1 R l 0 such that α ( l 0 , l 1 ) 1 ;
(iv) If { l n } is a sequence in N such that α ( l n , l n + 1 ) 1 and l n l * as n , then α ( l 2 n , l * ) 1 and α ( l 2 n + 1 , l * ) 1 , for all n N .
Then there exists a point l * N such that l * R l * Jl * .
Corollary 11. 
Let ( N , d ) be a complete C-VMS and J : N C B ( N ) . The following conditions are assumed to be true:
(i) There is a function α : N × N [ 0 , + ) such that
ϖ d ( l , ς ) α ( l , ς ) s ( Jl , J ς )
for all l , ς N ;
(ii) J is α-closed;
(iii) There exist l 0 N , l 1 Jl 0 such that α ( l 0 , l 1 ) 1 ;
(iv) If { l n } is a sequence in N such that α ( l n , l n + 1 ) 1 for all n and l n l * as n , then α ( l n , l * ) 1 , for all n N .
Then there exists a point l * N such that l * Jl * .
Proof. 
Taking R = J in the above corollary. □
As a consequence of Corollary 10, we now derive a result from Ahmad et al. [16].
Corollary 12 
([16]). Let ( N , d ) be a complete C-VMS and R , J : N C B ( N ) . Assume that there exists a constant ϖ [ 0 , 1 ) such that
ϖ d ( l , ς ) s ( R l , J ς )
for all l , ς N . Then there exists a point l * N such that l * R l * Jl * .
Proof. 
Define α : N × N [ 0 , + ) by α ( l , ς ) = 1 , for all l , ς N in Corollary 10. □
The following result from Ahmad et al. [16] follows directly from the above corollary.
Corollary 13 
([16]). Let ( N , d ) be a complete C-VMS and J : N C B ( N ) . Assume that there exists a constant ϖ [ 0 , 1 ) such that
ϖ d ( l , ς ) s ( Jl , J ς )
for all l , ς N . Then there exists a point l * N such that l * Jl * .
Proof. 
Taking R = J in the above corollary. □
Remark 7. 
By applying Remark 3 and the above corollary, we can directly obtain Nadler’s main theorem [33].

6. Applications

FP theorems are a powerful tool in functional analysis, providing a framework to prove the existence and uniqueness of solutions to various mathematical equations, including integral equations. These theorems are particularly valuable in addressing complex problems such as Fredholm integral equation, where their application provides a systematic approach to establish solvability and ensure uniqueness under specific conditions (see, e.g., [34,35,36]). This equation is a fundamental equation used in many applied fields, including image processing, to model and solve various inverse problems. The general form of the equation is
φ ( t ) μ a b k ( t , ω ) φ ( ω ) d ω = f ( t )
where
  • φ ( t ) is the unknown function on [ a , b ] to be solved, representing the processed image signal;
  • μ is a scalar parameter (regularization or scaling factor);
  • The kernel function k ( t , ω ) of the equation is a given function on the [ a , b ] × [ a , b ] and this represents the interaction or blurring effects;
  • f ( t ) is a known function (observed image data);
  • The integral a b k ( t , ω ) φ ( ω ) d ω denotes the convolution-like operation over the image domain.
Image Denoising Framework.
Image denoising is a crucial task in image processing, aimed at removing unwanted noise that may corrupt an image during acquisition, transmission, or storage. The Fredholm integral equation of the second kind provides a mathematical framework to model the relationship between the observed noisy image and the true underlying image, with the kernel function representing the blurring effects introduced by noise. In the denoising process, the equation is solved to retrieve the original image, where the kernel function models the point spread function (PSF) of the imaging system. To achieve a stable solution, regularization techniques such as Tikhonov regularization are often employed. An example of image denoising using this approach can be found in medical imaging, where it helps enhance the clarity of MRI and CT scans by reducing noise and improving diagnostic accuracy.
Numerical Simulation and Graphical Representation.
To demonstrate the practical effectiveness of the proposed method, we conducted a numerical simulation on a standard test image corrupted with Gaussian noise. The results are quantified using the Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity Index (SSIM), which are widely used metrics for evaluating image denoising performance. The following steps were performed:
1.
Noise Addition: Gaussian noise with a standard deviation of σ = 25 was added to the original image.
2.
Denoising Process: The Fredholm integral equation was solved using the proposed method, with the kernel function k ( t , ω ) modeling the noise characteristics.
3.
Performance Evaluation: The PSNR and SSIM values were computed for the noisy and denoised images.
The results are summarized in the Table 1 below:
Table 1. Results.
Visual Comparison.
The Figure 1 shows the original image, the noisy image, and the denoised images obtained using the proposed method and other state-of-the-art method (BM3D).
Figure 1. Image comparison: (a) original, (b) noisy, (c) proposed method, and (d) BM3D.
Theoretical Results.
Theorem 3. 
Consider N = C [ a , b ] . Define d : C [ a , b ] × C [ a , b ] C by
d φ , ϕ = max t [ a , b ] φ ( t ) ϕ ( t ) e i θ ,
then N , d is a complete C-VSMS with θ = π 4 and = 1 . Assume that the following conditions hold:
(i) There exists a constant M > 0 such that
k ( t , ω ) M ,
for all ( t , ω ) [ a , b ] × [ a , b ] ;
(ii) The function k is continuous on [ a , b ] × [ a , b ] and f C [ a , b ] ;
(iii) There exists a constant ϖ [ 0 , 1 ) defined by
ϖ = μ M b a < 1 .
Then the integral Equation (36) has a unique solution in C [ a , b ] .
Proof. 
Define the mapping J : C [ a , b ] C [ a , b ] by
J φ ( t ) = f ( t ) + μ a b k ( t , ω ) φ ( ω ) d ω .
Consider φ , ϕ C [ a , b ] . Then
d ( J φ , J ϕ ) = max t [ a , b ] J φ ( t ) J ϕ ( t ) e i θ = μ max t [ a , b ] a b k ( t , ω ) φ ( ω ) ϕ ( ω ) d ω e i θ μ max t [ a , b ] a b k ( t , ω ) φ ( ω ) ϕ ( ω ) e i θ d ω e i θ μ M max ω [ a , b ] φ ( ω ) ϕ ( ω ) e i θ a b d ω = μ M d ( φ , ϕ ) b a = ϖ d ( φ , ϕ ) ,
where
d ( φ , ϕ ) d ( φ , ϕ ) , d ( φ , J φ ) , d ( ϕ , J ϕ ) , d ( φ , J φ ) d ( ϕ , J ϕ ) 1 + d ( φ , ϕ ) .
Hence all the conditions of Corollary 1 are satisfied. Therefore, the Fredholm integral equation admits a unique solution, identical to its unique FP. □
Example 5. 
An integral equation
φ ( t ) μ a b k ( t , ω ) φ ( ω ) d ω = f ( t )
has a unique solution φ ( t ) = t 2 3 2 , where [ a , b ] = [ 0 , 1 ] ,   f ( t ) = t 2 + 5 6 ,   k ( t , ω ) = 1 and μ = 2 .
Example 6. 
An integral equation
φ ( t ) μ a b k ( t , ω ) φ ( ω ) d ω = f ( t )
has a unique solution φ ( t ) = e t , where [ a , b ] = [ 0 , 1 ] ,   f ( t ) = e t 1 2 t ,   k ( t , ω ) = t ω and μ = 1 2 .

7. Conclusions

In conclusion, this study successfully established CFP theorems for both single-valued and multivalued mappings in the framework of C-VSMSs. A novel contraction for single-valued mappings was introduced, and a generalized Hausdorff distance was defined for multivalued mappings, paving the way for new results in FP theory. These theoretical advancements were applied to C-VMSs and SMSs, resulting in the derivation of several FP theorems as direct consequences of our main results. The applicability of these theorems was demonstrated through an illustrative example, showcasing their potential for solving nonlinear problems.
Furthermore, we highlighted the practical relevance of our findings by applying them to Fredholm integral equations of the second kind, a key mathematical tool for modeling real-world phenomena such as image denoising. In this context, the Fredholm integral equation models the relationship between the observed noisy image and the true underlying image, where the kernel function captures the blurring effects introduced by noise. The denoising process, involving the solution of the equation, retrieves the original image, with regularization techniques such as Tikhonov regularization ensuring a stable solution.
Beyond these applications, our results open avenues for algorithmic implementations in numerical analysis and computational mathematics. FP algorithms based on our theorems could be developed to enhance denoising techniques, particularly in scenarios involving iterative regularization methods. Additionally, our findings provide a theoretical foundation for comparing different denoising techniques, such as wavelet-based methods, variational models, and deep-learning-based approaches, through an FP framework. These contributions not only extend the understanding of FP theory but also provide a bridge between abstract mathematical principles and practical computational applications in image processing and beyond.

8. Future Work and Open Problems

This study establishes new CFP theorems in C-VSMSs, providing a foundation for further exploration in both theoretical and applied settings. However, several open questions remain that offer avenues for future research:
Generalization to Other Mathematical Structures.
  • Extending the current results to more generalized spaces, such as complex-valued extended supra b-metric spaces, elliptic-valued supra metric spaces, and quaternion-valued supra metric spaces.
  • Investigating the existence of FPs under weaker contraction conditions or in hybrid metric structures.
  • Exploring cyclic, asymptotic, and quasi-contractive mappings for multivalued mappings.
Establishing FP results in these spaces can extend applications to physics, differential equations, and optimization, while relaxing conditions enhances real-world applicability where strict contractions may not hold.
Applications to Partial and Functional Differential Equations.
While this work applies FP results to integral equations, another promising direction is their application to partial differential equations (PDEs) and functional differential equations:
  • Studying the existence and stability of solutions to elliptic and parabolic PDEs using fixed-point techniques.
  • Extending the results to delay differential equations, particularly in models involving memory effects or time delays.
  • Investigating fractional differential equations where non-local operators arise naturally in physics, finance, and biology.
The adaptation of FP theory to these classes of differential equations could lead to significant theoretical and computational advancements.
Computational Methods and Algorithmic Implementations.
While the current study is theoretical, computational aspects are equally important. Future work could involve
  • Developing iterative numerical algorithms to approximate FPs, particularly for solving Fredholm integral equations and nonlinear PDEs.
  • Implementing machine learning approaches to optimize FP computations and their applications in image denoising.
  • Comparing the efficiency and accuracy of different denoising techniques, such as variational methods, wavelet transforms, and deep-learning-based methods, using a FP framework.
  • Exploring parallel computing strategies to improve the convergence speed of FP algorithms in large-scale problems.
Such computational approaches would help validate theoretical findings and provide insights into their real-world applicability.

Funding

This work was funded by the University of Jeddah, Jeddah, Saudi Arabia under grant No. (UJ-25-DR-3126).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Acknowledgments

This work was funded by the University of Jeddah, Jeddah, Saudi Arabia, under grant (No. UJ-25-DR-3126). The author acknowledges with thanks the University of Jeddah technical and financial support.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Frechet, M. Sur quelques points du calcul fonctionnel. Rend. Circ. Mat. Palermo. 1906, 22, 1–72. [Google Scholar] [CrossRef] [Scilit]
  2. Matthews, S.G. Partial metric topology. Ann. N. Y. Acad. Sci. 1994, 728, 183–197. [Google Scholar] [CrossRef] [Scilit]
  3. Bakhtin, I.A. The contraction mapping principle in almost metric space. Funct. Anal. 1989, 30, 26–37. [Google Scholar]
  4. Branciari, A. A fixed point theorem of Banach-Caccioppoli type on a class of generalized metric spaces. Publ. Math. Debrecen. 2000, 57, 31–37. [Google Scholar] [CrossRef] [Scilit]
  5. Huang, L.G.; Zhang, X. Cone metric spaces and fixed point theorems of contractive mappings. J. Math. Anal. Appl. 2007, 332, 1468–1476. [Google Scholar] [CrossRef] [Scilit]
  6. Berzig, M. First results in suprametric spaces with applications. Mediterr. J. Math. 2022, 19, 226. [Google Scholar] [CrossRef] [Scilit]
  7. Berzig, M. Fixed point results in generalized suprametric spaces. Topol. Algebra Its Appl. 2023, 11, 20230105. [Google Scholar] [CrossRef] [Scilit]
  8. Berzig, M. Nonlinear contraction in b-suprametric spaces. J. Anal. 2024, 32, 2401–2414. [Google Scholar] [CrossRef] [Scilit]
  9. Berzig, M. Strong b-suprametric spaces and fixed point principles. Complex. Anal. Oper. Theory 2024, 18, 148. [Google Scholar] [CrossRef] [Scilit]
  10. Antón-Sancho, Á. Fixed points of principal E6-bundles over a compact algebraic curve. Quaest. Math. 2024, 47, 501–513. [Google Scholar] [CrossRef] [Scilit]
  11. Antón-Sancho, Á. Fixed points of involutions of G-Higgs bundle moduli spaces over a compact Riemann surface with classical complex structure group. Front. Math. 2024, 19, 1025–1039. [Google Scholar] [CrossRef] [Scilit]
  12. Antón-Sancho, Á. Spin(8,C)-Higgs bundles and the Hitchin integrable system. Mathematics 2024, 12, 3436. [Google Scholar] [CrossRef] [Scilit]
  13. Azam, A.; Fisher, B.; Khan, M. Common fixed point theorems in complex valued metric spaces. Num. Funct. Anal. Optim. 2011, 32, 243–253. [Google Scholar] [CrossRef] [Scilit]
  14. Rouzkard, F.; Imdad, M. Some common fixed point theorems on complex valued metric spaces. Comp. Math. Appl. 2012, 64, 1866–1874. [Google Scholar] [CrossRef] [Scilit]
  15. Hussain, N.; Azam, A.; Ahmad, J.; Arshad, M. Common fixed point results in complex valued metric spaces with application to integral equations. Filomat 2014, 28, 1363–1380. [Google Scholar] [CrossRef] [Scilit]
  16. Ahmad, J.; Klin-eam, C.; Azam, A. Common fixed points for multivalued mappings in complex-valued metric spaces with applications. Abstr. Appl. Anal. 2013, 2013, 854965. [Google Scholar] [CrossRef] [Scilit]
  17. Azam, A.; Ahmad, J.; Kumam, P. Common fixed point theorems for multi-valued mappings in complex-valued metric spaces. J. Inequal. Appl. 2013, 2013, 578. [Google Scholar] [CrossRef] [Scilit]
  18. Panda, S.K.; Vijayakumar, V.; Agarwal, R.P. Complex-valued suprametric spaces, related fixed point results, and their applications to Barnsley Fern fractal generation and mixed Volterra–Fredholm integral equations. Fractal Fract. 2024, 8, 410. [Google Scholar] [CrossRef] [Scilit]
  19. Sintunavarat, W.; Kumam, P. Generalized common fixed point theorems in complex valued metric spaces and applications. J. Inequal. Appl. 2012, 2012, 84. [Google Scholar] [CrossRef] [Scilit]
  20. Sitthikul, K.; Saejung, S. Some fixed point theorems in complex valued metric spaces. Fixed Point Theory Appl. 2012, 2012, 189. [Google Scholar] [CrossRef] [Scilit]
  21. Klin-eam, C.; Suanoom, C. Some common fixed point theorems for generalized contractive type mappings on complex valued metric spaces. Abstr. Appl. Anal. 2013, 2013, 604215. [Google Scholar] [CrossRef] [Scilit]
  22. Zubair, S.T.; Aphane, M.; Mukheimer, A.; Abdeljawad, T. A fixed point technique for solving boundary value problems in branciari suprametric spaces. Results Nonlinear Anal. 2024, 7, 80–93. [Google Scholar]
  23. Hanjing, A.; Suantai, S. A fast image restoration algorithm based on a fixed point and optimization method. Mathematics 2020, 8, 378. [Google Scholar] [CrossRef] [Scilit]
  24. Kim, K.S.; Yun, J.H. Image restoration using a fixed point method for a TVL2 regularization problem. Algorithms 2020, 13, 1. [Google Scholar] [CrossRef] [Scilit]
  25. Cabello, F.; León, J.; Iano, Y.; Arthur, R. Implementation of a fixed-point 2D Gaussian filter for image processing based on FPGA. Int. J. Recent Technol. Eng. 2015, 23, 23–25. [Google Scholar]
  26. Mishra, A.; Tripathi, P.K.; Agrawal, A.K.; Joshi, D.R. A contraction mapping method in digital image processing. Int. Recent Technol. Eng. 2019, 8, 193–196. [Google Scholar]
  27. Kaur, A.; Dong, G. A complete review on image denoising techniques for medical images. Neural Process. Lett. 2023, 55, 7807–7850. [Google Scholar] [CrossRef] [Scilit]
  28. Peng, C.; Rodi, W.L.; Toksöz, M.N. A Tikhonov regularization method for image reconstruction. Acoust. Imaging. 1994, 1994, 153–164. [Google Scholar]
  29. Mesgarani, H.; Parmour, P. Application of numerical solution of linear Fredholm integral equation of the first kind for image restoration. Math. Sci. 2023, 17, 371–378. [Google Scholar] [CrossRef] [Scilit]
  30. Lu, Y.; Shen, L.; Xu, Y. Integral equation models for image restoration: High accuracy methods and fast algorithms. Inverse Problems 2010, 26, 045006. [Google Scholar] [CrossRef] [Scilit]
  31. Samet, B.; Vetro, C.; Vetro, P. Fixed point theorem for α-ψ contractive type mappings. Nonlinear Anal. 2012, 75, 2154–2165. [Google Scholar] [CrossRef] [Scilit]
  32. Abbas, M.; Rakocević, V.; Leyew, B.T. Common fixed points of (α-ψ)-generalized rational multivalued contractions in dislocated quasi b-metric spaces and applications. Filomat 2017, 31, 3263–3284. [Google Scholar] [CrossRef] [Scilit]
  33. Nadler, S.B., Jr. Multi-valued contraction mappings. Pacific J. Math. 1969, 30, 475–478. [Google Scholar] [CrossRef] [Scilit]
  34. Özger, F.; Ersoy, M.T.; Özger, Z.Ö. Existence of solutions: Investigating Fredholm integral equations via a fixed-point theorem. Axioms 2024, 13, 261. [Google Scholar] [CrossRef] [Scilit]
  35. Ezquerro, J.A.; Hernández-Verón, M.A. On the application of some fixed-point techniques to Fredholm integral equations of the second kind. J. Fixed Point Theory Appl. 2024, 26, 29. [Google Scholar] [CrossRef] [Scilit]
  36. Mani, G.; Gnanaprakasam, A.J.; Ege, O.; Fatima, N.; Mlaiki, N. Solution of Fredholm integral equation via common fixed point theorem on bicomplex valued b-metric space. Symmetry 2023, 15, 297. [Google Scholar] [CrossRef] [Scilit]
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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.