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.
Keywords:
fixed points; complex-valued suprametric spaces; Fredholm integral equation; image processing MSC:
94A08; 54H25; 46S40
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 -bundles over compact algebraic curves, involutions of G-Higgs bundle moduli spaces over compact Riemann surfaces, and the study of Spin(8,)-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 . 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 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 and be a function that fulfills the following axioms:
- (i)
- and ⇔ ;
- (ii)
- (iii)
for all then is called an MS.
Berzig [6] introduced the concept of SMS in this way.
Definition 2
([6]). Let and ⋏ be a non-negative real constant. Consider a function that satisfies the following properties:
- (i)
- and ⇔ ;
- (ii)
- (iii)
for all then is called an SMS.
Example 1.
Let Define the function as follows:
and
Let us choose Then is an SMS but not an MS because the triangle of MS is not satisfied; that is,
The concept of a partial order on the set is introduced as follows:
for all It follows that
if one of these conditions is met:
Azam et al. [13] defined the concept of CVMS as follows:
Definition 3
([13]). Let and be a function that satisfies the subsequent axioms:
- (i)
- and ⇔ ;
- (ii)
- (iii)
for all ; then is said to be a CVMS.
Example 2
([13]). Let and Define by
Then is a CVMS.
Very recently, Panda et al. [18] defined the notion of C-VSMS in this manner.
Definition 4
([18]). Let and be a mapping satisfying
- (i)
- and ⇔ ;
- (ii)
- (iii)
for all then is considered as C-VSMS.
Example 3.
Let and is defined as
for all . Then (,d) is a C-VSMS with .
Remark 1.
By setting ⋏ to zero in Definition 4, the idea of C-VSMS is simplified to C-VMS.
Lemma 1
([18]). Let be a C-VSMS and let . Then converges to if and only if as
Lemma 2
([18]). Let be a C-VSMS and let . Then is a Cauchy sequence if and only if as where
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 be a complete C-VSMS and consider mappings . Suppose that there is a constant such that
where
holds for all . Then and possess a unique CFP.
Proof.
Let be given. Define the sequence {} inductively by
for all where are the self mappings. By (1) and (2), we have
where
If then from (3), we have
for all which implies that
for all If then from (3), we have
signifying that
for all If then from (3), we have
which yields that
and because we get a contradiction. Hence Now if
then from (3), we have
which implies that
because and But since so we have
a contradiction. Hence Thus from all the cases, we have
for all Similarly, from (1) and (2), we have
where
If then from (5), we have
for all which yields that
for all If then from (5), we have
for all It further implies that
and because we get a contradiction. Hence for all If then from (5), we have
for all This yields that
for all If then from (5), we have
which implies that
because and But since so we have
a contradiction. Hence Thus in all cases, we have
for all Hence from (4) and (6), we have
for all Hence
for all If , then we find
Now, we can apply the triangle inequality again to the second term so we have
Now, we can apply the triangle inequality again to the second term so we have
and so on
Recursively substituting each inequality into the preceding one (8) and simplifying, we have
By the inequality (7), we have
Now observe that for all Therefore,
Now with the product term bounded below by 1, we can simplify the summation
since is a finite geometric series with the first term and the common ratio The sum of a finite geometric series is given by
As Therefore, the sum converges to that is,
Since the expression approaches 0 as Letting in (8) and employing the established facts, we arrive at
which implies that is Cauchy. As is complete, so there exists such that as Thus,
Now, we show that is an FP of From (1) and (2), we have
which implies
where
Taking in the inequality stated above, we arrive at the following result
and
because Therefore, the remaining task is to find We discuss the following four cases. If then from (13), we have
implying If then from (13), we have
which is a contradiction because Hence Now if then from (13), we have
which yields that Now if then from (13), we have
which implies that Thus is an FP of . Similarly, from (1) and (2), we have
which further yields that
where
Taking in the previous inequality, we obtain the following
and
because Therefore, the remaining task is to find We discuss the following four cases. If then from (14), we have
implying If then from (14), we have
which yields that If then from (14), we have
a contradiction because Hence If then from (14), we have
implying that Thus is an FP of Hence is a CFP of and . To prove the uniqueness of suppose, for contradiction, that another CFP of and exists, i.e., with Then, from (1) and (2), we have
where
Then we have only which implies by (15) that
which is a contradiction because . Hence Hence CFP is unique. □
Corollary 1.
Let be a complete C-VSMS and . Suppose that there is a constant such that
where
for all . Then has a unique FP.
Proof.
Take 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 defined by
for Here, ⪯ is a partial order defined on in the context of C-VSMSs. To ensure that is nonempty, we assume that the partial order ⪯ on is reflexive. Under this condition, for any , there exists at least one element such that guaranteeing that is nonempty. For the remainder of this section, let denote a C-VSMS. We represent the collection of all nonempty subsets of by the set of all closed subsets of by and the set of all closed and bounded subsets of by A subset is said to be closed if, for every sequence that converges to some , the limit point also belongs to The subset is bounded if there exists an element such that
for all We define
for and For we define the generalized Hausdorff distance in the following
Lemma 3.
Let be a C-VSMS.
- (i)
- Let If , then
- (ii)
- Let and If then
- (iii)
- Let and let and If then
- (iv)
- Let and then
Proof.
(i): Assume that for and let be an arbitrary element. Then by the definition of we have
Now since and by the transitivity of we have Hence Thus
(ii). Assume that for and By definition,
So, means that there exists some such that Then by the definition of we have
which implies for some It follows that
(iii) If we assume that then by the definition of we have
Since it follows that for every
(iv) It is obvious. □
Remark 2.
Let be a C-VSMS. Then
Remark 3.
Let be a C-VSMS. If then reduces to an MS. Moreover, for any the Hausdorff distance induced by d is given by
The concept of -admissible mappings was defined by Samet et al. [31] in 2012.
Definition 5
([31]). Let and . Then, is termed an α-admissible mapping when
Abbas et al. [32] gave the concept of α-closed mappings in this way.
Definition 6
([32]). Let , and . Consequently, is deemed α-closed if
Definition 7
([32]). Let , and . Then the pair is said to be α-closed if
for any and
Theorem 2.
Let be a complete C-VSMS and . The following conditions are assumed to be true:
(i) There exists such that
for all
(ii) and are α-closed;
(iii) there exist such that ;
(iv) if is a sequence in such that for all n and as then and for all
Then there exists a point such that
Proof.
If we let be an arbitrary point in , then and So there exists such that . By (16), we have
By the definition of the generalized Hausdorff distance function “s”, we have
which implies
for all Since we have
This implies that
Since so there exists such that we have
By Lemma 3 (iv), we have
Therefore,
Since we have
which implies
Now, if , then is the required FP. And we have nothing to prove. So we suppose that . As and the pairs and are -closed, then Now from (16), we have
This yields that
By the definition of the generalized Hausdorff distance function “s”, we have
for all Since we have
This implies that
Since there exists such that and we have
By Lemma 3 (iv), we have
Therefore,
Since we have
which yields
Now, if , then is the required FP. And we have nothing to prove. So we suppose that . As and the pairs and are -closed, Now from (16), we have
This implies that
which yields
for all Since we have
This implies that
Since so there exists such that we have
By Lemma 3 (iv), we have
Therefore,
Since we have
which implies that
Iterating this procedure yields a sequence in such that
and and
which leads to
for all n. Hence
for all Now, for any natural number m greater than n, we have
Now, we can apply the triangle inequality again to the second term we have
Now, we can apply the triangle inequality again to the second term we have
and so on
Recursively substituting each inequality into the preceding one (26) and simplifying, we have
By the inequality (25), we have
Now observe that for all Therefore,
Now with the product term bounded below by 1, we can simplify the summation
since is a finite geometric series with the first term and the common ratio The sum of a finite geometric series is given by
As Therefore, the sum converges to that is,
Since the expression approaches 0 as Letting in inequality (27) and employing the established facts, we arrive at
which implies that is Cauchy. As is complete, so there exists such that as Thus,
As we have a sequence in such that for all n and as then by assumption, we have for all n. From (16), we have
for all By the definition of the generalized Hausdorff distance function “s”, we have
which implies that
for all Since we have
This implies that
Since so there exists such that we have
By Lemma 3 (iv), we have
Therefore,
Since we have
which implies that
for all Now from triangular property and (31), we have
for all It yields that
Taking the limit as in (32) and considering that we have
that is, Since is closed, This implies that is an FP of . As we have a sequence in such that for all n and as then by assumption, we have for all n. Similarly by (16), we have
for all This implies that
which yields that
for all Since we have
This implies that
Since so there exists such that we have
By Lemma 3 (iv), we have
Therefore,
Since we have
which implies that
for all Now from triangular property and (34), we have
which implies that
for all Letting in (35) and incorporating the known result that we have
that is, Since is closed, This implies that is an FP of . This completes the proof. □
Example 4.
Let define by
for all First we prove that is complete C-VSMS.
(i) because
for all . Also, implies which means Conversely, if then implies
(ii)
(iii)
for all and for some Hence is a C-VSMS. Also it is complete.
Define by
for all and multivalued mappings defined by
Then for any , we obtain that and , Since for all and , the pairs and are α-closed. Moreover, if and then
Moreover, for any sequence in with for all and as then and for all It is readily observed that the contractive condition of the prime theorem is satisfied when For the sake of simplicity, we assume, without loss of generality, that neither nor ς is zero. Now, let us consider the case where Then,
Clearly, for any value of we have
so
Therefore, all the requirements of our prime Theorem 2 are met, and 0 serves as a CFP of both and .
Corollary 2.
Let be a complete C-VSMS and . The following conditions are assumed to be true:
(i) There is a function such that
for all
(ii) is α-closed;
(iii) There exist such that ;
(iv) If is a sequence in such that for all n and as then , for all
Then there exists a point such that
Proof.
Take in Theorem 2. □
Corollary 3.
Let be a complete C-VSMS and . Assume that there exists some constant such that
for all . Then there exists a point such that
Proof.
Define by for all in Theorem 2. □
Corollary 4.
Let be a complete C-VSMS and . Assume that there exists some constant such that
for all . Then there exists a point such that
Proof.
Take in the above corollary. □
Remark 4.
By setting for all 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 be a complete SMS and . The following conditions are assumed to be true:
(i) There exist a function and a constant such that
for all
(ii) and are α-closed;
(iii) There exist such that ;
(iv) If is a sequence in such that for all n and as then and for all
Then there exists a point such that
Corollary 6.
Let ( be a complete SMS and . The following conditions are assumed to be true:
(i) There exist a function and a constant such that
for all
(ii) is α-closed;
(iii) There exist such that ;
(iv) If is a sequence in such that for all n and as then for all
Then there exists a point such that
Proof.
Take in the previous inequality. □
Corollary 7.
Let ( be a complete SMS and . Assume that there exists a constant such that
for all Then there exists a point such that
Remark 5.
By setting in the above corollary, we obtain Nadler’s FP theorem [33] in the framework of SMS.
Remark 6.
By setting and defining for all 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 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 be a complete C-VMS and . Assume that there is a constant such that
where
for all , then there exists a unique point such that
Proof.
Taking in Theorem 1. □
Corollary 9
([15]). Let be a complete C-VMS and . Assume that there is a constant such that
where
for all , then there exists a unique point such that
Proof.
Take in above corollary. □
Corollary 10.
Let be a complete C-VMS and . The following conditions are assumed to be true:
(i) There is a function such that
for all
(ii) and are α-closed;
(iii) There exist such that ;
(iv) If is a sequence in such that and as then and for all
Then there exists a point such that
Corollary 11.
Let be a complete C-VMS and . The following conditions are assumed to be true:
(i) There is a function such that
for all
(ii) is α-closed;
(iii) There exist such that ;
(iv) If is a sequence in such that for all n and as then for all
Then there exists a point such that
Proof.
Taking in the above corollary. □
As a consequence of Corollary 10, we now derive a result from Ahmad et al. [16].
Corollary 12
([16]). Let be a complete C-VMS and . Assume that there exists a constant such that
for all Then there exists a point such that
Proof.
Define by for all in Corollary 10. □
The following result from Ahmad et al. [16] follows directly from the above corollary.
Corollary 13
([16]). Let be a complete C-VMS and . Assume that there exists a constant such that
for all Then there exists a point such that
Proof.
Taking 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
where
- is the unknown function on to be solved, representing the processed image signal;
- is a scalar parameter (regularization or scaling factor);
- The kernel function of the equation is a given function on the and this represents the interaction or blurring effects;
- is a known function (observed image data);
- The integral 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 was added to the original image.
- 2.
- Denoising Process: The Fredholm integral equation was solved using the proposed method, with the kernel function 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 . Define by
then is a complete C-VSMS with and . Assume that the following conditions hold:
(i) There exists a constant such that
for all
(ii) The function k is continuous on and
(iii) There exists a constant defined by
Then the integral Equation (36) has a unique solution in .
Proof.
Define the mapping by
Consider Then
where
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
has a unique solution where and .
Example 6.
An integral equation
has a unique solution where and .
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
- Frechet, M. Sur quelques points du calcul fonctionnel. Rend. Circ. Mat. Palermo. 1906, 22, 1–72. [Google Scholar] [CrossRef] [Scilit]
- Matthews, S.G. Partial metric topology. Ann. N. Y. Acad. Sci. 1994, 728, 183–197. [Google Scholar] [CrossRef] [Scilit]
- Bakhtin, I.A. The contraction mapping principle in almost metric space. Funct. Anal. 1989, 30, 26–37. [Google Scholar]
- 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]
- 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]
- Berzig, M. First results in suprametric spaces with applications. Mediterr. J. Math. 2022, 19, 226. [Google Scholar] [CrossRef] [Scilit]
- Berzig, M. Fixed point results in generalized suprametric spaces. Topol. Algebra Its Appl. 2023, 11, 20230105. [Google Scholar] [CrossRef] [Scilit]
- Berzig, M. Nonlinear contraction in b-suprametric spaces. J. Anal. 2024, 32, 2401–2414. [Google Scholar] [CrossRef] [Scilit]
- Berzig, M. Strong b-suprametric spaces and fixed point principles. Complex. Anal. Oper. Theory 2024, 18, 148. [Google Scholar] [CrossRef] [Scilit]
- Antón-Sancho, Á. Fixed points of principal E6-bundles over a compact algebraic curve. Quaest. Math. 2024, 47, 501–513. [Google Scholar] [CrossRef] [Scilit]
- 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]
- Antón-Sancho, Á. Spin(8,C)-Higgs bundles and the Hitchin integrable system. Mathematics 2024, 12, 3436. [Google Scholar] [CrossRef] [Scilit]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Sitthikul, K.; Saejung, S. Some fixed point theorems in complex valued metric spaces. Fixed Point Theory Appl. 2012, 2012, 189. [Google Scholar] [CrossRef] [Scilit]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Peng, C.; Rodi, W.L.; Toksöz, M.N. A Tikhonov regularization method for image reconstruction. Acoust. Imaging. 1994, 1994, 153–164. [Google Scholar]
- 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]
- 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]
- Samet, B.; Vetro, C.; Vetro, P. Fixed point theorem for α-ψ contractive type mappings. Nonlinear Anal. 2012, 75, 2154–2165. [Google Scholar] [CrossRef] [Scilit]
- 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]
- Nadler, S.B., Jr. Multi-valued contraction mappings. Pacific J. Math. 1969, 30, 475–478. [Google Scholar] [CrossRef] [Scilit]
- Ö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]
- 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]
- 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. |
© 2025 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
