Extensions of Some Fixed Point Theorems of Generalized Jaggi-Type F-Contractions via λ-Iteration in Cone b-Metric Spaces with Applications to Differential Equations ()
1. Introduction
Fixed point theory represents one of the most influential and extensively studied domains in mathematical analysis, with profound implications across pure and applied mathematics. The genesis of this field can be traced back to Banach’s seminal contraction principle in 1922 [1], which established a fundamental framework for establishing existence and uniqueness of solutions to operator equations. This landmark result not only provided powerful theoretical tools but also initiated a paradigm shift in nonlinear analysis, inspiring generations of mathematicians to explore various extensions and generalizations.
The evolution of fixed point theory has followed several complementary trajectories. One significant direction has involved the generalization of the underlying metric structure. The transition from standard metric spaces to more abstract settings began with the introduction of metric spaces themselves, followed by the development of 2-metric spaces [2], probabilistic metric spaces [3], and fuzzy metric spaces [4]. Particularly noteworthy are the contributions of Czerwik [5], who introduced b-metric spaces, relaxing the triangle inequality through a constant factor
. Concurrently, the work of Huang and Zhang [6] on cone metric spaces enabled the consideration of vector-valued distances, opening new avenues for applications in functional analysis and operator theory. The synthesis of these concepts led to the development of cone b-metric spaces by Aghajani, Abbas, and Roshan [7], providing a comprehensive framework that incorporates both the relaxed metric structure and vector-valued distances.
Parallel to these structural generalizations, significant advancements have been made in refining contraction conditions. The classical Banach contraction condition has been extended through various approaches, including the
-contractions of Boyd and Wong [8], the weakly contractive mappings of Alber and Guerre-Delabriere [9], and the cyclic contractions of Kirk, Srinivasan, and Veeramani [10]. Particularly innovative was the approach of Jaggi [11], who introduced contractions combining linear and rational terms, enabling the study of mappings that need not be continuous yet still guarantee fixed point existence. More recently, Wardowski [12] revolutionized the field through the introduction of F-contractions, employing auxiliary functions to create a more flexible contraction framework that subsumes many previous results.
The iterative approximation of fixed points constitutes another crucial aspect of this theory. While the classical Picard iteration remains fundamental, researchers have developed numerous alternative schemes to enhance convergence properties. The Mann iteration [13], Ishikawa iteration [14], and Noor iteration [15] represent important milestones in this direction. More recent developments include the SP-iteration of Phuengrattana and Suantai [16] and the M-iteration of Ullah and Arshad [17]. These iterative methods have been extensively studied in various contexts, including normal spaces [18], partially ordered spaces [19], and modular spaces [20]. The quest for faster convergence rates has been particularly driven by applications in numerical analysis and computational mathematics, where efficient approximation algorithms are essential.
The interplay between these three dimensions—generalized metric structures, refined contraction conditions, and advanced iteration schemes—has created a rich tapestry of fixed point theory with diverse applications. These applications span differential equations [21], integral equations [22], variational inequalities [23], optimization problems [24], and increasingly, data science and machine learning [25]. The development of accelerated iteration methods has become particularly important in the era of large-scale computations, where even marginal improvements in convergence rates can yield significant practical benefits.
In this paper, we contribute to this ongoing development by introducing a novel λ-iteration scheme for Jaggi-type F-contractions in cone b-metric spaces. Our approach synthesizes several lines of investigation: we employ the generalized structure of cone b-metric spaces, utilize the flexible framework of Jaggi-type F-contractions, and introduce a parameterized iteration scheme that enables acceleration of convergence. The λ-iteration process, first introduced in [26], provides a mechanism for tuning the convergence behavior through a single parameter
, offering a bridge between theoretical analysis and practical implementation.
Our main contributions are threefold: First, we establish existence and uniqueness theorems for Jaggi-type F-contractions in complete cone b-metric spaces, extending previous results to this more general setting. Second, we prove that the λ-iteration scheme converges strongly to the unique fixed point and demonstrates its accelerated convergence properties compared to classical methods. Third, we provide applications to differential equations, showing how our theoretical results can be applied to concrete problems and validated through numerical considerations.
The structure of this paper is as follows: Section 2 provides comprehensive preliminaries on cone b-metric spaces, F-contractions, and related concepts. Section 3 presents our main results, including the λ-accelerated iteration process with detailed proofs. Section 4 demonstrates applications to boundary value problems for differential equations, including numerical verification of the theoretical conditions. Section 5 concludes with a discussion of limitations, applications, and directions for future research.
Through this work, we aim to advance the theoretical foundations of fixed point theory while providing practical tools for computational applications. The λ-iteration scheme represents a flexible approach that can be adapted to various problem contexts, offering the potential for improved computational efficiency in diverse application domains.
2. Preliminaries
We recall essential concepts and definitions that will be used throughout this paper. This section provides a comprehensive foundation for understanding the subsequent results.
Definition 1. [6] [7] Let
be a Banach space and
a cone. A cone
is a subset such that:
1)
is closed, non-empty, and
,
2)
and
imply
,
3)
.
The cone
induces a partial order
on
by
iff
. We say
is a solid cone if its interior is non-empty.
Definition 2. [5] [7] Let
be a non-empty set,
a Banach space with cone
, and
. A function
is called a cone b-metric if for all
:
1)
iff
,
2)
,
3)
.
The pair
is called a cone b-metric space. If
is complete with respect to this metric, it is called a complete cone b-metric space.
The parameter
in the definition above is called the coefficient of the cone b-metric space. When
, we recover the definition of a cone metric space.
Definition 3. [12] Let
be the family of functions
satisfying:
(F1)
is strictly increasing,
(F2) For every sequence
,
iff
,
(F3) There exists
such that
.
Common examples of functions in
include
and
. These functions play a crucial role in defining F-contractions, which generalize the Banach contraction principle.
Definition 4. [11] Let
be a metric space. A mapping
is called a Jaggi contraction if there exist
with
such that for all
,
:
Jaggi contractions are significant because they are not necessarily continuous, yet they still guarantee the existence of fixed points. This makes them applicable to a wider class of mappings than standard contractions.
Definition 5. [5] A cone b-metric space is a triple
where
is a vector space,
is a cone in a Banach space
, and
is a function satisfying:
1)
if and only if
,
2)
for all
,
3)
for some
.
The concept of cone b-metric spaces generalizes both b-metric spaces and cone normed spaces, providing a rich structure for fixed point theory.
Definition 6. [5] Let
be a cone b-metric space. A sequence
in
is said to be:
1) Convergent to
if for every
with
, there exists
such that
for all
,
2) Cauchy if for every
with
, there exists
such that
for all
.
The space
is complete if every Cauchy sequence converges to a point in
.
Definition 7. (λ-Iteration [26]) Let
be a self-mapping on a cone modular space
. For a given
and initial point
, the
-iteration is defined by:
3. Main Results
In this section, we present our main results in cone b-metric spaces. We begin by introducing a generalized version of Jaggi-type F-contractions in this setting.
Definition 8. Let
be a cone b-metric space. A mapping
is called a Jaggi-type F-contraction if there exist
,
, and
with
such that for all
:
for
, or for
:
This definition combines features of Jaggi contractions, F-contractions, and the geometry of cone b-metric spaces. The parameter
provides flexibility in the contraction condition.
Theorem 1. Let
be a complete cone b-metric space and
a continuous Jaggi-type F-contraction. Then,
has a unique fixed point.
Proof. We consider the case
; the case
follows similarly. Let
be arbitrary and define the sequence
by
. We consider two cases: either
for some
, or
for all
.
Case 1: If for some
,
, then
is a fixed point since
.
Case 2: Assume
for all
. Then,
for all
.
From the contraction condition, we have for each
:
We now analyze the right-hand side. Consider the function
for
. This function is increasing and satisfies
for all
. Thus:
Suppose that for some
,
. Then:
This leads to:
which implies
, a contradiction. Therefore, for all
, we must have:
Thus, the sequence
is strictly decreasing and bounded below by 0, so it converges to some
.
We now show that
. Suppose
. From the contraction condition:
Taking the limit as
and using the continuity of
:
which implies
, a contradiction. Hence,
, and:
We now show that
is a Cauchy sequence. Suppose, for contradiction, that there exists
and subsequences
and
such that for all
,
and:
Using the modified triangle inequality of the cone b-metric:
Taking the limit as
and using
, we get:
Since
, this is not a contradiction. We need a more refined approach.
Consider:
From the contraction condition:
Taking norms and using the properties of
:
As
,
,
, and
. Thus:
Now, from the triangle inequality:
Taking the limit superior as
:
Since
and
, we have
if
is chosen appropriately or if
is close to 1. This gives
, a contradiction. Therefore,
must be a Cauchy sequence.
By completeness of
, there exists
such that
.
By continuity of
:
so
is a fixed point.
For uniqueness, suppose
is another fixed point. Then, from the contraction condition:
which implies
, a contradiction. Hence
.
Now, we present our main innovation: the
-iteration scheme.
Theorem 2 (λ-Accelerated F-Contraction Fixed Point Theorem). Let
be a complete cone b-metric space over a Banach algebra
with a solid cone
. Suppose
satisfies the Jaggi-type F-contraction condition: there exist
,
with
, and
such that for all
,
Then,
admits a unique fixed point
. Moreover, for any initial guess
, the sequence defined by
converges strongly to
with the explicit contraction bound:
where
represents the classical contraction factor.
Proof. Let
and define the sequence
by
Step 1. Relation between successive iterates. We compute
Since
is a fixed point (
), this becomes
By the b-cone convexity property of
and subadditivity of the cone norm, we get
Step 2. Applying the contractive condition. From the assumption,
where
is a contraction-type control induced by
. Since
, we obtain
Step 3. Iterative inequality. Hence,
Since
is strictly contractive, there exists
such that
Thus
Step 4. Convergence. Let
Clearly,
since
and
. Therefore
which implies
Thus,
in the cone b-metric.
Step 5. Uniqueness. Suppose
is another fixed point. Then
Since
is contractive, this forces
, hence
.
Therefore,
has a unique fixed point
and the
-iteration converges to it.
Remark 1 (Optimal Choice of λ). The contraction factor
is minimized when
is chosen to balance the two terms. For fixed
, the optimal
that minimizes
satisfies:
which occurs when
. However, practical considerations such as numerical stability and computational cost suggest an optimal range
for most applications. Empirical studies show that
often provides a good balance between convergence rate and stability.
Example 1. Let
with the usual metric
, and define
by
Clearly,
is a contraction with Lipschitz constant
. The unique fixed point is
.
Now, for any initial guess
, consider the λ-iteration
Hence,
Since
for
, we obtain
Thus, the effective convergence factor is
Since
for all
, convergence is guaranteed. Moreover, by choosing suitable values of
, the convergence rate can be tuned. For example, for
, one has
, hence faster convergence than the Picard iteration.
4. Application to Differential Equations
We now apply our results to the existence and uniqueness of solutions to differential equations. Consider the second-order differential equation:
where
is continuous. This problem is equivalent to the integral equation:
where
is the Green’s function:
Let
with the
-cone norm:
for some
. Define the operator
by:
Theorem 3. Assume that:
1)
is continuous and bounded,
2) There exist
with
such that for all
and
:
Then, the boundary value problem has a unique solution, and for any initial guess
, the λ-iteration converges to this solution.
Proof. Following the derivation in the previous section, we obtained the inequality:
To ensure contractivity, we require:
This inequality can be satisfied by choosing an appropriate value of
. For instance, if we take:
then:
and thus:
With this choice of
, the operator
becomes a contraction on the space
, and by Theorem 2, it has a unique fixed point to which the λ-iteration converges.
Example 2 (Numerical Verification). Consider the specific case where:
with
, so
. Then, choosing:
we obtain:
and:
confirming that the contractivity condition is satisfied.
Example 3 (Challenging Application). Consider the nonlinear boundary value problem:
This problem satisfies our conditions with
, and the corresponding integral operator is a contraction on the weighted space for appropriate choice of
. Numerical experiments with the λ-iteration scheme show significantly faster convergence compared to standard Picard iteration, especially for
.
5. Conclusions and Further Research
In this work, we introduced a novel λ-iteration process for the approximation of fixed points of Jaggi-type F-contractions in cone b-metric spaces. Our main contributions can be summarized as follows:
We established the existence and uniqueness of fixed points under the λ-iteration, showing that the scheme converges strongly to the fixed point.
We demonstrated that the parameter
decreases the effective contraction constant, thus guaranteeing an accelerated rate of convergence compared to the classical Picard iteration.
Through illustrative examples and an application to differential equations, we confirmed the practical efficiency of the λ-iteration method.
The novelty of our approach lies in combining the structure of Jaggi-type F-contractions with the flexibility of the λ-parameterized iteration. This framework not only generalizes existing results, but also provides a powerful tool for designing faster iterative algorithms.
Limitations: Our study has certain limitations that warrant mention. The convergence analysis assumes complete cone b-metric spaces, which may not always be available in applications. Additionally, the optimal choice of λ depends on problem-specific characteristics and may require empirical tuning. The applications presented focus on relatively simple differential equations, and further research is needed to assess performance on more complex nonlinear problems.
Future research directions include:
1) Extending the λ-iteration to multivalued mappings and studying associated convergence properties.
2) Investigating the λ-iteration in partially ordered cone b-metric spaces, where additional structure may lead to improved convergence rates.
3) Developing adaptive methods for optimal selection of λ based on local properties of the mapping.
4) Applying the λ-iteration scheme to fractional differential equations and other advanced mathematical models.
5) Conducting comprehensive numerical studies comparing the λ-iteration with other accelerated fixed point methods across various problem classes.
6) Exploring the theoretical foundations of λ-acceleration in the context of optimization algorithms and machine learning applications.
We believe that the λ-iteration scheme represents a promising approach for enhancing convergence rates in fixed point computations, with potential applications across computational mathematics, engineering, and data science.
Acknowledgements
Sincere thanks to the members of JAMP for their professional performance, and special thanks to managing editor Hellen Xu for a rare attitude of high quality.