1. Introduction
Nonlinear functional analysis is closely linked to fixed-point theory, which provides a robust framework for the examination of numerous nonlinear problems that are challenging to address through conventional analytical methods. Fixed-point approximation techniques are particularly valuable in this domain, especially when determining exact solutions is unattainable.
In many areas of applied science, a common and effective strategy is to convert a nonlinear problem into an equivalent fixed-point problem defined by an appropriate operator. This approach is valuable because solving the operator equation directly provides a solution to the original problem. A well-known example of this idea is the Banach Contraction Principle (BCP) [
1], which ensures the convergence of the basic iterative process known as Picard iteration. This method is the cornerstone of many iterative techniques. Iterative methods play a central role in approximating the fixed points of nonlinear mappings within Hilbert and Banach spaces [
2]. Kirk [
3] also introduced the concept of asymptotically nonexpansive mappings. An important extension of this framework arises in hyperbolic spaces, a class of metric spaces characterized by the presence of convex structures. The notion of hyperbolic space has been developed in several ways due to the variety of convex structures that can be defined in such spaces. Kohlenbach [
4] showed that Banach spaces can, in fact, be viewed as special instances of hyperbolic spaces. The authors in [
5] established existence and uniqueness results for relevant operator equations, demonstrating the effectiveness of the fixed-point approach in generalized metric contexts. Some work [
6,
7,
8] highlights the structural advantages of W-hyperbolic spaces in studying iterative schemes and provides new insights into the stability and behaviour of three-step algorithms. Recently, Agarwal et al. [
9] explored fixed-point theorems and established convergence results for monotone, nearly asymptotically nonexpansive mappings in partially ordered hyperbolic metric spaces (2019). Khan, Fukhar-Ud-Din, and Ahmad Khan [
10] proposed an implicit iterative algorithm for two finite families of nonexpansive mappings in hyperbolic spaces, establishing strong and weak convergence results under suitable conditions. Questions related to hyperbolic groups, one of the primary subjects of study in geometric group theory, have motivated and dominated the study of hyperbolic spaces. The nonlinear class of hyperbolic spaces provides a rich geometrical structure and a comprehensive abstract theoretical framework for metric fixed-point theory. Fixed-point theory and approximation methods have been extended to include hyperbolic spaces [
2].
Let
T be a nonempty subset of a Banach space
, and let
be a mapping. A sequence
in
T is said to be an
approximating fixed-point sequence if
The mapping
X is said to be Lipschitzian if, for each
, there exists a positive number
such that
A Lipschitzian mapping X is called uniformly k-Lipschitzian if for all , and asymptotically non-expansive if for all a with . Clearly, every non-expansive mapping X (i.e., for all ) is asymptotically non-expansive.
Goebel and Kirk [
3] introduced the class of asymptotically non-expansive mappings as an important generalization of non-expansive mappings. Schu [
11] initiated the study of convergence of the iteration process to a fixed point of an asymptotically nonexpansive mapping using an improved version of the Mann scheme:
Many authors have studied iterative methods for determining fixed points in asymptotically nonexpansive mappings. Şahin and Başarır established strong convergence results for a modified S-iteration process applied to asymptotically quasi-nonexpansive mappings in CAT(0) spaces. Khan analyzed the convergence of iterative sequences with errors for asymptotically quasi-nonexpansive mappings and demonstrated their applicability to various operator equations. Qihou investigated iterative sequences for asymptotically quasi-nonexpansive mappings, providing foundational convergence results in nonlinear analysis. Kaczor proved weak convergence properties for almost orbits of asymptotically nonexpansive commutative semigroups in metric settings. They developed fixed-point iteration processes for non-Lipschitzian asymptotically quasi-nonexpansive mappings, establishing new convergence criteria [
4]. Their results provided a foundation for analyzing the stability and convergence behavior of iterative schemes in both linear and nonlinear settings.
Building on these developments, several researchers have extended such methods to hyperbolic and uniformly convex spaces for a wider class of nonlinear mappings. In this context, our proposed scheme contributes to the ongoing effort by demonstrating strong convergence under generalized contractive conditions in hyperbolic spaces. Tan and Xu [
12] examined the convergence of the modified Ishikawa iterative algorithm:
where
and
. Recently, Agarwal et al. [
9], in an attempt to achieve a faster convergence rate, proposed a modified iteration called the S-iteration technique:
Research on iterative approximation in hyperbolic metric spaces has grown significantly over the last ten years. The literature defines many types of hyperbolic spaces, with Kohlenbach’s concept being the most frequently used definition [
13].
Suppose that a hyperbolic space is a triplet where is a metric space and a mapping fulfills the following:
,
,
,
.
Where and all .
Example
.
X preserves the Poincaré distance:
Fixed point: solve . So is a fixed point (if , then X is the identity and every point is fixed).
Therefore,
X is a simple non-expansive map on a hyperbolic space that clearly has a fixed point. Saluja [
14] modified Equations (1) and (2) introduced by Khan et al. [
15] to approximate a common fixed point in hyperbolic space as follows:
where
is a hyperbolic space,
X is a self-mapping,
, and all
.
Researchers studied iterative schemes to improve convergence to common fixed points. Dass and Debaita [
16] initiated the study of two iterative mapping procedures. The iterative processes of Saluja [
14] and Khan et al. [
15] in hyperbolic spaces have also been updated.
The modified scheme defined by JA in hyperbolic space is as follows:
Based on the above motivation, we define a new modified TI scheme to approximate the common fixed point of two mappings that converge faster:
where
are asymptotically quasi-nonexpansive mappings,
is a hyperbolic space,
, and all
.
3. Main Results
This section presents and examines a modified iterative TI-approach for approximating the common fixed points of two mappings in a hyperbolic space that are asymptotically nonexpansive.
Lemma 5. Let T be a nonempty uniform convex subset of a uniformly convex hyperbolic space . A mapping of has a sequence fulfills the conditions
- (i)
- (ii)
If a sequence is defined by (
5)
, then limits and exist. Proof. From the definition, we observe
and
and
Therefore
where
. Using the hypothesis that
, we conclude from Lemma 1
at this point. Let
where
. Using this inequality, we have
Now we take the lim sup on both sides, we get
Therefore
So,
Thus , it proves that a limit exists. □
Theorem 1. Let T be a nonempty uniform convex subset of a uniformly convex hyperbolic space . A mapping has a sequence fulfills the conditions
- (i)
- (ii)
Then a sequence defined by (
5)
has strong convergence. Proof. Assume that a sequence
converges to a common fixed point of
X and
Y, then
. Let
. Now using the above Lemma 5,
applying inf over
, so
Thus we know that
converges, so it is clear
. Therefore, there exists a positive integer N; therefore,
Here it is
also we here easily find
, so that using Equation (
6), we observe
Thus, it is stated that
, the infinite product
converges to a positive real number l.
This proves that it is a Cauchy sequence and converges. □
Theorem 2. Let T be a nonempty closed convex subset of a uniformly convex hyperbolic space . A mapping has a sequence fulfill the conditions
- (i)
- (ii)
There exists such that for every a
If there is any limit, then the sequences converge strongly.
Proof. Hence
by the Lemma 5 we have,
Now, by applying the limit sup to the above inequality, we get
and
so we get,
and
Through the Equation (
7) and Lemma 4, it becomes
.
Now again using Lemma 4, we have
Hence
.
and through
In the same case, we can also prove that
Now using Equations (8) and (9), we obtain
. Therefore, by the Equation (
12)
From the aforementioned claims, the facts that follow can be written as
Hence
, so
Thus, it entails that
, additionally
although
Now using (13) and (14), we deduce
After applying the limit , the sequence converges and tends towards 0. Now in similar manner . We also observed that and
Now we assume that it is demi-convex. Hence
Equation (
17)
as
. This implies that
,
and
.
. It is proved that it converges strongly and
lies in
This completes this proof. □
Theorem 3. Let T be a non-empty closed convex subset of a uniformly convex hyperbolic space . A mapping of be asymptotically nonexpansive with and , and let be a sequence with satisfying . For an arbitrary initial point , define the sequence by the iterative process (1.5) then Δ-converges to a point in .
Proof. From Lemma 5, we have and as . Since is bounded, Lemma 4 guarantees that every bounded sequence has a unique asymptotic center.
Let be an arbitrary subsequence of . Since is bounded, therefore is also bounded. Denote the asymptotic centers of the sequence and the subsequence as and , respectively. Our purpose is to prove that and that r is a common fixed point of X and Y.
First, we show
. From the asymptotic nonexpansive property of
X, it follows that
for any
. For any positive integers
u and
v, we derive the following inequality:
Taking the limit as
for a fixed
u, we obtain
Now, taking the limit as
and
, we find
However, since
r is the unique asymptotic center of
, we have
for every
u. This implies
Using Definition 4, this states , and hence . An identical argument shows that , so .
It remains to show that,
. Suppose, for contradiction, that
. Since
, Lemma 5 implies that
exists. Using the uniqueness of asymptotic centers, we deduce the following chain of inequalities:
This is a contradiction, as the first and last terms are identical. Therefore,
. Since the subsequence
was arbitrary and
for all such subsequences, we conclude that
-converges to
p, which is a common fixed point of
X and
Y. □
4. Numerical Example
To thoroughly evaluate the applicability of the iterative scheme (1.3) in approximating fixed points of generalized nonexpansive mappings. The following example demonstrates the effectiveness of the proposed method.
We presently give a specific instance and show how convergence to a certain point occurs mathematically and graphically using our defined iterative scheme.
Example 1. Consider T = B(0;1), this T is a ball with center 0 and radius 1 in . Let us define self-maps X and Y as and , as it is clear and take and
Let be and , therefore, we haveAssume and . Let take . Then it is obvious as . Thus As it is clear that Y is an asymptotically nonexpansive mapping and X also has the same property, (0,0) is a common fixed point of both maps.
Example 2. Consider T = B(0;1), this T is taken as a ball with center 0 and radius 1 in . Let us define self-map X and Y as and . It can be observed that neither mapping is nonexpansive. Let and . Then Suppose that . Hence X is asymptotically nonexpansive mapping; then, for any defined a sequence is defined by Let , and , and . Thenand Thus and , it is clear that converges to a common fixed point (0,0). A table comparison shows that our modified TI-algorithm has a faster rate of convergence, and also graphical representation is also provided. We take and A convergence of the iterative scheme is obtained in the given Table 1, and Figure 1 and Figure 2 illustrates the variation in values for different algorithms. The proposed iterative method exhibits fast convergence as compared to the existing schemes, primarily due to its faster convergence behavior and reduced iteration count. Specifically, the proposed approach attains convergence at the second iteration, whereas the competing methods require the 4th, 5th, and even the 22nd iteration to achieve similar results. This substantial reduction in computational effort highlights the effectiveness of the method in terms of accuracy and speed.
Example 3. Let be the closed unit ball centered at the origin and let be a sequence with for all n. For each index n define maps by(These maps preserve T because .) Let . For and the mean value inequality gives Applying this with yields the uniform bound (independent of ): Thus the Lipschitz constants for and on the whole domain T arewhich is uniform (depends only on n, not on the points ). Example 4. Still let and let satisfy . Define maps by As in Example 3, for any we get the uniform estimatesand Thus, the same uniform Lipschitz constants .