Next Article in Journal
Coefficients of a Comprehensive Subclass of Meromorphic Bi-Univalent Functions Associated with the Faber Polynomial Expansion
Next Article in Special Issue
Note on Common Fixed Point Theorems in Convex Metric Spaces
Previous Article in Journal
A New Inverted Topp-Leone Distribution: Applications to the COVID-19 Mortality Rate in Two Different Countries
Previous Article in Special Issue
A Strong Convergence Theorem for Split Null Point Problem and Generalized Mixed Equilibrium Problem in Real Hilbert Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Approximation of the Fixed Point for Unified Three-Step Iterative Algorithm with Convergence Analysis in Busemann Spaces

1
Department of Mathematics, College of Sciences, Jazan Univesity, Jazan 45142, Saudi Arabia
2
Department of Mathematics, Faculty of Science, Sohag University, Sohag 82524, Egypt
3
Department of Mathematics, Pt. J.L.N. Govt. College, Faridabad 121002, India
*
Author to whom correspondence should be addressed.
Axioms 2021, 10(1), 26; https://doi.org/10.3390/axioms10010026
Submission received: 12 January 2021 / Revised: 23 February 2021 / Accepted: 23 February 2021 / Published: 27 February 2021
(This article belongs to the Special Issue Theory and Application of Fixed Point)

Abstract

:
In this manuscript, a new three-step iterative scheme to approximate fixed points in the setting of Busemann spaces is introduced. The proposed algorithms unify and extend most of the existing iterative schemes. Thereafter, by making consequent use of this method, strong and Δ -convergence results of mappings that satisfy the condition ( E μ ) in the framework of uniformly convex Busemann space are obtained. Our results generalize several existing results in the same direction.
MSC: AMS Subject Classification:
47H09; 47H10; 54H25; 54E40

1. Introduction

Throughout this paper, R , R + , and f denote the set of all real numbers, positive real numbers, and fixed points of the mapping , respectively.
The fixed point theory is considered one of the most powerful analytical techniques in mathematics, especially in nonlinear analysis, where it plays a prominent role in algorithm technology. The purpose of investing in algorithms is to obtain the best algorithms with a faster convergence rate, because the lower the convergence rate, the faster the speed of obtaining the solution. This is probably the drawback of using the iterative methods.
It should be noted that the Mann iteration converges faster than the Ishikawa iteration for the class of Zamfirescu operators [1], and hence the convergence behavior of proclaimed and empirically proven faster iterative schemes need not always be faster. There was extensive literature on proclaimed new and faster iteration schemes in ancient times. Some of the iteration schemes are undoubtedly better versions of previously existed iteration schemes, whereas a few are only the special cases. There are more than twenty iteration schemes in the present literature. Our analysis’s focal objective is to unify the existing results in the framework of Busemann spaces (see [2] for the precise definitions and properties of Busemann spaces). This analysis has a special significance in terms of unification, and numerous researchers have intensively investigated various aspects of it.
Apart from Picard, Mann, and Ishikawa, many iterative schemes with better convergence rates are obtained; see, for example, [3,4,5,6,7,8,9,10,11]. In many cases, these algorithms cannot obtain strong convergence; therefore, it was necessary to investigate new effective algorithms. Recently, several authors were able to apply the strong convergence of algorithms, see [12,13,14,15,16].
Recall that a metric space ( B , ) is called a g e o d e s i c path (or simply a g e o d e s i c [17]) in B if there is a path γ : [ a , b ] B , such that γ is an isometry for [ a , b ] [ 0 , ) . A g e o d e s i c r a y is an isometry γ : R + B , and a g e o d e s i c line is an isometry γ : R B . For more details about g e o d e s i c path in metric fixed point theory, see [18,19,20,21,22,23,24].
Definition 1 ([17]).
Let ( B , ) be a metric space and j , B . A g e o d e s i c path joining j to ℓ is a mapping γ : [ α , β ] R + B such that γ ( α ) = j , γ ( β ) = and
( γ ( t ) , γ ( t ) ) = | t t |
for all t , t [ α , β ] . Particularly, γ is an isometry and ( j , ) = β α .
A g e o d e s i c segment joining j and ℓ in B is the image of a g e o d e s i c path in B . The space B is said to be a g e o d e s i c space, if every two points of j are joined by a g e o d e s i c .
Definition 2 ([17]).
A metric space B is said to be a g e o d e s i c space if given two arbitrary points of B there exists a g e o d e s i c path that joins them.
Definition 3 ([17]).
The g e o d e s i c metric space ( B , ) is said to be Busemann space, if for any two affinely reparametrized g e o d e s i c e s γ : [ α , β ] B and γ : [ α , β ] B , the map D γ . γ : [ α , β ] × [ α , β ] R defined by
D γ . γ ( t , t ) = ( γ ( t ) , γ ( t ) )
is a convex; that is, the metric of Busemann space is convex. In a Busemann space the g e o d e s i c joining any two points is unique.
Proposition 1 ([25]).
In such spaces, the hypotheses below hold:
(1) 
( ε , ( 1 α ) j   α ) ( 1 α ) ( ε , j ) + α ( ε , ) ,
(2) 
( ( 1 α ) j   α ) , ( 1 α ) j   α ) = | α α | ( j , ) ,
(3) 
( 1 α ) j   α = α ( 1 α ) j ,
(4) 
( ( 1 α ) j   α ε , ( ( 1 α ) α ω ) ) ( 1 α ) ( j , ) + α ( ε , ω ) ,
where j , , ε , ω B and α , α [ 0 , 1 ] .
Busemann spaces are also hyperbolic spaces, which were introduced by Kohlenbach [26]. Further, B is said to be uniquely geodesic [17] if there is exactly one g e o d e s i c joining j and for each j , B .
Definition 4 ([17]).
Suppose that B is a uniquely g e o d e s i c space and γ ( [ α , β ] ) is a g e o d e s i c segment joining j and ℓ and α [ 0 , 1 ] . Then,
ε = γ ( ( 1 α ) j + α )
will be a unique point in γ ( [ α , β ] ) satisfying
( ε , j ) = α ( j , )
and
( ε , ) = ( 1 α ) ( j , ) .
In the sequel, the notation [ j , ] is used for g e o d e s i c segment γ ( [ α , β ] ) and ε is denoted by ( 1 α ) j   α . A subset κ B is said to be g e o d e s i c a l l y convex if κ includes every geodesic segment joining any two of its points. Let B be a g e o d e s i c metric space and : B R . We say that is convex if for every g e o d e s i c path γ : [ α , β ] B , the map γ : [ α , β ] is a convex. It is known that if : B R is a convex function and : B R is an increasing convex function, then : B R is convex.
We now introduce our algorithm.
Let B be a complete Busemann space, B s be a nonempty convex subset of B and : B s B s be a mapping. For any υ 0 B s ,
η = τ η 0 υ η κ η 0 υ η ι η 0 j η   ω η 0 j η , j η = τ η 1 υ η κ η 1 υ η ι η 1 η   ω η 1 η , υ n + 1 = τ η 2 υ η κ η 2 υ η ι η 2 j η   ω η 2 j η   ε η η σ η η ,
where { ε η } , { σ η } , { τ η i } , { κ η i } , { ι η i } and { ω η i } for i = 0 , 1 , 2 are sequences in [ 0 , 1 ] . Moreover, τ η 0 + κ η 0 + ι η 0 + ω η 0 = 1 , τ η 1 + κ η 1 + ι η 1 + ω η 1 = 1 and τ η 2 + κ η 2 + ι η 2 + ε η + σ η = 1 .
Remark 1.
For distinct values of ε η , { σ η } , τ η i , κ η i , ι η i and ω η i for i = 0 , 1 , 2 , we have well-known distinct iteration schemes as follows:
(1)
ι η 0 = ω η 0 = ι η 1 = κ η 1 = ι η 2 = κ η 2 = ε η = σ η = 0 , τ η 0 = ( 1 κ η 0 ) , τ η 1 = ( 1 ω η 1 ) , τ η 1 = ( 1 ω η 2 ) in the standard three-step iteration scheme, we obtain the Noor iterative scheme [27].
(2)
ι η 0 = ω η 0 = ι η 1 = τ η 1 = κ η 1 = ι η 2 = ω η 2 = ε η = σ η = 0 , τ η 0 = ( 1 κ η 0 ) , ι η 1 = ( 1 ω η 1 ) and ι η 2 = ( 1 ω η 2 ) in the standard three-step iteration scheme, we obtain the SP iterative scheme [28].
(3)
ι η 0 = ω η 0 = ι η 1 = τ η 1 = κ η 1 = τ η 2 = ι η 2 = ω η 2 = ε η = σ η = 0 , ι η 0 = ( 1 κ η 0 ) , κ η 1 = ( 1 ω η 1 ) and κ η 2 = 1 in the standard three-step iteration scheme, we obtain the Picard-S iterative scheme [29].
(4)
τ η 0 = κ η 0 = ι η 0 = ω η 0 = ι η 1 = ω η 1 = τ η 2 = κ η 2 = ε η = σ η = 0 and τ η 0 = ( 1 κ η 0 ) , κ η 1 = ( 1 ω η 1 ) and ι η 2 = ( 1 ω η 2 ) in the standard three-step iteration scheme, we obtain the C R iterative scheme [30].
(5)
τ η 0 = κ η 0 = ι η 1 = τ η 1 = τ η 2 = ι η 2 = ε η = σ η = 0 , τ η 1 = ( 1 κ η 1 ) , κ η 1 = ( 1 ω η 1 ) in the standard three-step iteration scheme, we obtain the Abbas and Nazir iterative scheme [31].
(6)
ι η 0 = ω η 0 = τ η 1 = κ η 1 = κ η 2 = ι η 2 = ω η 2 = ε η = 0 , τ η 0 = ( 1 κ η 0 ) , ι η 1 = ( 1 ω η 1 ) and σ η 2 = ( 1 ω η 2 ) in the standard three-step iteration scheme, we obtain the P iterative scheme [32].
(7)
ι η 0 = ω η 0 = τ η 1 = ι η 1 = κ η 2 = ι η 2 = τ η 2 = ε η = 0 , τ η 0 = ( 1 κ η 0 ) , κ η 1 = ( 1 ω η 1 ) and σ η 2 = ( 1 ω η 2 ) in the standard three-step iteration scheme, we obtain the D iterative scheme [33].
(8)
ι η 0 = ω η 0 = τ η 0 = κ η 0 = ι η 1 = ω η 1 = τ η 1 = κ η 1 = ω η 2 = ι η 2 = ε η = 0 , τ η 2 = ( 1 κ η 2 ) in the standard three-step iteration scheme, we obtain the Mann iterative scheme [34].
(9)
ι η 0 = ω η 0 = τ η 0 = κ η 0 = ι η 1 = ω η 1 = κ η 2 = ι η 2 = ε η = σ η = 0 , τ η 1 = ( 1 κ η 1 ) and τ η 2 = ( 1 ω η 2 ) in the standard three-step iteration scheme, we obtain the Ishikawa iterative scheme [35].

2. Preliminaries

In this section, we present some relevant and essential definitions, lemmas, and theorems needed in the sequel.
Definition 5 ([36]).
The Busemann space B is called uniformly convex if for any ζ > 0 and ϵ ( 0 , 2 ] , there exists a map δ such that for every three points α , j , B , ( j , α ) ζ , ( , α ) ζ and ( j , ) ϵ ζ implies that
( m , α ) ( 1 δ ) ζ ,
where m denotes the midpoint of any geodesic segment [ j , ] (i.e., m = 1 2 j 1 2 ) and inf { δ : ζ > 0 } . A mapping : ( 0 , ) × ( 0 , 2 ] ( 0 , 1 ] is called a modulus of uniform convexity, for ( η , ϵ ) : = δ and for a given η > 0 , ϵ ( 0 , 2 ] .
Henceforth, the uniform convexity modulus with a decreasing modulus concerning η (for a fixed ϵ ) is termed as the uniform convexity monotone modulus. The subsequent lemmas and geometric properties, which are instrumental throughout the discussion to learn about essential terms of Busemann spaces, are necessary to achieve our significant findings and are as follows:
Lemma 1.
If ℘ is a mapping satisfying condition ( E ) and has a fixed point then it is a quasi-nonexpansive mapping.
Let B s be a nonempty closed convex subset of a Busemann space B , and let { j η } be a bounded sequence in B . For j B , we set
ζ ( j , { j η } ) = lim sup η | | j η j | | .
The asymptotic radius of ζ ( { j η } is given by
ζ ( B s , { j η } ) = inf { ζ ( j , { j η } ) : j B s }
and the asymptotic center A ( { j η } ) of { j η } relative to B s is the set
A ( B s , { j η } ) = { j B s : ζ ( j , j η ) = ζ ( B s , { j η } ) } .
It is known that, in a Busemann space, A ( { j η } ) consists of exactly one point [37].
Recall that a bounded sequence { j η } B is said to be regular [38], if ζ ( { j η } ) = ζ ( { j η k } ) for every subsequence { j η k } of { j η } .
Lemma 2 ([4]).
Let B be a Busemann space and j B , { t n } a sequence in [ b , c ] , for some b , c ( 0 , 1 ) . If { j η } and { η } are sequences in B satisfying
lim sup η ( j η , j ) r
also,
lim sup η ( η , ) r
and
lim sup η ( t η j η ( 1 t η ) η , j ) = r ,
for some r 0 , then
lim η ( j η , η ) = 0 .
Lemma 3 ([5]).
If B s is a closed convex subset of a uniformly convex Busemann space B and { j η } is a bounded sequence in B s , then the asymptotic center of { j η } belongs to B s .
Lemma 4 ([38]).
Let B be a Busemann space, { j η } be a bounded sequence in B and B s be a subset of B . Then { j η } has a subsequence, which is regular in B s .
Definition 6 ([38]).
A sequence { j η } in Busemann space B is said to be Δ c o n v e r g e n t if there exists some j B such that j is the unique asymptotic center of j η k for every subsequence { j η k } of { j η } . In this case we write Δ lim η j η = j and it is called the Δ lim of { j η } .
Lemma 5 ([21]).
Every bounded sequence in a complete Busemann space always has a Δ c o n v e r g e n t subsequence.
Lemma 6 ([21]).
Suppose that B s is a closed convex subset of a Busemann space B and : B s B satisfies the condition ( E ). Then { j η } , Δ c o n v e r g e s to j and ( j η , j η ) 0 , implying that j B s and j = j .
Definition 7.
Assume that B s is a subset of a Busemann space B . For j , B s , a mapping : B s B s is called:
(i) 
Contraction if there is μ ( 0 , 1 ) so that ( j , ) μ ( j , ) ,
(ii) 
Nonexpansive if ( j , ) ( j , ) ,
(iii) 
Quasi-nonexpansive if ( j , ϰ ) ( j , ϰ ) , ϰ F ( ) and F ( ) denote the set { ϰ B : ϰ = ϰ } .
(iv) 
Satisfy Condition ( E ) if
1 2 ( j , j ) ( j , ) ( j , ) ( j , ) .
(v) 
Suzuki generalized nonexpansive if it verifies Condition ( E ) .
Garcia-Falset et al. [6] introduced the generalization for nonexpansive mappings known as condition ( E μ ).
Definition 8 ([6]).
Let μ 1 . A mapping : B s B s is said to satisfy condition ( E μ ) if for all j , B s , we have
( j , ) μ ( j , j ) + ( j , ) .
We say that ℘ satisfies condition ( E ) , if ℘ satisfies condition ( E μ ) for some μ 1 [39].
Theorem 1.
Let C s be a nonempty bounded, closed and convex subset of a complete C A T ( 0 ) space C . If : C s C s is a generalized nonexpansive mapping, then ℘ has a fixed point in C s . Moreover, f is closed and convex.

3. Main Results

We begin this section with the proof of the following lemmas:
Lemma 7.
Let B s be a nonempty closed convex subset of a complete Busemann space B , and let : B s B s be a mapping satisfying condition ( E μ ) . For an arbitrary chosen υ 0 B s , let the sequence { υ η } be generated by a standard three-step iteration algorithm with the condition
( ( τ η 1 + κ η 1 ) + ( ι η 1 + ω η 1 ) ( τ η 0 + κ η 0 ) ) ( 1 ( ι η 1 + ω η 1 ) ( ι η 0 + ω η 0 ) ) 1 1
and
( τ η 2 + κ η 2 + ι η 2 + ω η 2 + ( ε η + σ η ) ( τ η 0 + κ η 0 + ι η 0 + ω η 0 ) ) 1 .
Then, lim n ( υ η , υ * ) exists for all υ * f .
Proof. 
Let υ * f and z B s . Since satisfies condition ( E μ ) , and hence
( υ * , j ) μ ( υ * , υ * ) + ( υ * , j ) .
From standard three-step iteration algorithm, we have
( η , υ * ) = ( τ η 0 υ η κ η 0 υ η ι η 0 j η ω η 0 j η , υ * ) τ η 0 ( υ η , υ * ) + κ η 0 ( μ ( υ * , υ * ) + ( υ * , υ n ) ) + ι η 0 ( j η , υ * ) + ω η 0 ( μ ( υ * , υ * ) + ( υ * , j n ) ) τ η 0 ( υ η , υ * ) + κ η 0 ( υ η , υ * ) + ι η 0 ( j η , υ * ) + ω η 0 ( j η , υ * ) = ( τ η 0 + κ η 0 ) ( υ η , υ * ) + ( ι η 0 + ω η 0 ) ( j η , υ * ) .
Also,
( j η , υ * ) = ( τ η 1 υ η κ η 1 υ η ι η 1 η ω η 1 η , υ * ) τ η 1 ( υ η , υ * ) + κ η 1 ( υ η , υ * ) + ι η 1 ( η , υ * ) + ω η 1 ( η , υ * ) τ η 1 ( υ η , υ * ) + κ η 1 ( μ ( υ * , υ * ) + ( υ * , υ n ) ) + ι η 1 ( η , υ * ) + ω η 1 ( μ ( υ * , υ * ) + ( υ * , n ) ) = ( τ η 1 + κ η 1 ) ( υ η , υ * ) + ( ι η 1 + ω η 1 ) ( η , υ * ) .
Using the value of ( η , υ * ) , we have
( j η , υ * ) ( τ η 1 + κ η 1 ) ( υ η , υ * ) + ( ι η 1 + ω η 1 ) ( ( τ η 0 + κ η 0 ) ( υ η , υ * ) + ( ι η 0 + ω η 0 ) ( j η , υ * ) ) ( ( τ η 1 + κ η 1 ) + ( ι η 1 + ω η 1 ) ( τ η 0 + κ η 0 ) ) ( υ η , υ * ) + ( ι η 1 + ω η 1 ) ( ι η 0 + ω η 0 ) ( j η , υ * ) ( j η , υ * ) ( τ η 1 + κ η 1 ) + ( ι η 1 + ω η 1 ) ( τ η 0 + κ η 0 ) 1 ( ι η 1 + ω η 1 ) ( ι η 0 + ω η 0 ) ( υ η , υ * ) .
Since ( ( τ η 1 + κ η 1 ) + ( ι η 1 + ω η 1 ) ( τ η 0 + κ η 0 ) ) ( 1 ( ι η 1 + ω η 1 ) ( ι η 0 + ω η 0 ) ) 1 1 , we have
( j η , υ * ) ( υ η , υ * ) .
Now,
( υ n + 1 , υ * ) ( τ η 2 υ η κ η 2 υ η ι η 2 j η ω η 2 j η ε η η σ η η , υ * ) τ η 2 ( υ η , υ * ) + κ η 2 ( υ η , υ * ) + ι η 2 ( j η , υ * ) + ω η 2 ( j η , υ * ) + ε η ( η , υ * ) + σ η ( η , υ * ) τ η 2 ( υ η , υ * ) + κ η 2 ( μ ( υ * , υ * ) + ( υ η , υ * ) ) + ι η 2 ( j η , υ * ) + ω η 2 ( μ ( υ * , υ * ) + ( j η , υ η ) ) + ε η ( η , υ * ) + σ η ( μ ( υ * , υ * ) + ( η , υ * ) ) ( τ η 2 + κ η 2 ) ( υ η , υ * ) + ( ι η 2 + ω η 2 ) ( j η , υ * ) + ( ε η + σ η ) ( η , υ * ) .
Since
( j η , υ * ) ( υ η , υ * ) ,
we have
( υ n + 1 , υ * ) ( τ η 2 + κ η 2 + ι η 2 + ω η 2 ) ( υ η , υ * ) + ( ε η + σ η ) ( η , υ * ) .
On substituting
( η , υ * ) = ( τ η 0 + κ η 0 ) ( υ η , υ * ) + ( ι η 0 + ω η 0 ) ( j η , υ * ) ,
we have
( υ n + 1 , υ * ) ( τ η 2 + κ η 2 + ι η 2 + ω η 2 ) ( υ η , υ * ) + ( ( ε η + σ η ) × ( τ η 0 + κ η 0 ) ( υ η , υ * ) + ( ι η 0 + ω η 0 ) ( j η , υ * ) ) ( τ η 2 + κ η 2 + ι η 2 + ω η 2 ) ( υ η , υ * ) + ( ε η + σ η ) ( τ η 0 + κ η 0 + ι η 0 + ω η 0 ) ( υ η , υ * ) = ( τ η 2 + κ η 2 + ι η 2 + ω η 2 + ( ε η + σ η ) ( τ η 0 + κ η 0 + ι η 0 + ω η 0 ) ) ( υ η , υ * ) .
Also, it is given that
( τ η 2 + κ η 2 + ι η 2 + ω η 2 + ( ε η + σ η ) ( τ η 0 + κ η 0 + ι η 0 + ω η 0 ) ) 1 ,
we have
( υ n + 1 , υ * ) ( υ η , υ * ) .
This implies that { ( υ η , υ * ) } is bounded and non-increasing for all υ * f . Hence, lim n ( υ η , υ * ) exists, as required. □
Lemma 8.
Let B s be a nonempty closed convex subset of complete Busemann space B , and : B s B s be a mapping satisfying condition ( E μ ) . For an arbitrary chosen υ 0 B s , let the sequence { υ η } be generated by a standard three-step iteration algorithm. Then, f is nonempty if and only if { υ η } is bounded and lim n ( υ η , υ η ) = 0 for a unique asymptotic center.
Proof. 
Since f , let υ * f and z B s . Using Lemma 7, there is an existence of lim n ( υ η , υ * ) , which confirms the boundedness of { υ η } . Assuming
lim n ( υ η , υ * ) = r ,
on combining this result with the values of ( j η , υ * ) and ( η , υ * ) of Lemma 7
lim sup n ( η , υ * ) lim sup n ( υ η , υ * ) = r .
Also,
lim sup n ( υ η , υ * ) = lim sup n ( μ ( υ * , υ * ) + ( υ η , υ * ) ) lim sup n ( υ η , υ * ) = r .
On the other hand, by using the value of ( η , υ * ) of Lemma 7, we have
( υ n + 1 , υ * ) ( τ η 2 υ η κ η 2 υ η ι η 2 j η ω η 2 j η ε η η σ η , υ * ) τ η 2 ( υ η , υ * ) + κ η 2 ( υ η , υ * ) + ι η 2 ( j η , υ * ) + ω η 2 ( j η , υ * ) + ε η ( η , υ * ) + σ η ( η , υ * ) τ η 2 ( υ η , υ * ) + κ η 2 ( μ ( υ * , υ * ) + ( υ η , υ * ) ) + ι η 2 ( j η , υ * ) + ω η 2 ( μ ( υ * , υ * ) + ( j η , υ * ) ) + ε η ( η , υ * ) + σ η ( μ ( υ * , υ * ) + ( n , υ * ) ) ( τ η 2 + κ η 2 + ι η 2 + ω η 2 ) ( υ η , υ * ) + ( ε η + σ η ) ( η , υ * ) ( τ η 2 + κ η 2 + ι η 2 + ω η 2 ) ( υ η , υ * ) + ( ε η + σ η ) ( η , υ * ) ,
by the above-mentioned standard three-step iteration algorithm,
( υ n + 1 , υ * ) ( 1 ( ε η + σ η ) ) ( υ η , υ * ) + ( ε η + σ η ) ( η , υ * ) ( υ η , υ * ) ( ε η + σ η ) ( υ η , υ * ) + ( ε η + σ η ) ( η , υ * ) .
This implies that,
( υ n + 1 , υ * ) ( υ η , υ * ) ( ε η + σ η ) ( υ η , υ * ) + ( ε η + σ η ) ( η , υ * ) . ( υ η , υ * ) + ( ε η + σ η ) ( ( η , υ * ) ( υ η , υ * ) ) . ( υ n + 1 , υ * ) ( υ η , υ * ) ( ε η + σ η ) ( ( η , υ * ) ( υ η , υ * ) ) . ( υ n + 1 , υ * ) ( υ η , υ * ) ( ε η + σ η ) ( ( η , υ * ) ( υ η , υ * ) ) .
This implies that,
( υ n + 1 , υ * ) ( υ η , υ * ) ( υ n + 1 , υ * ) ( υ η , υ * ) ( ε η + σ η ) ( ( η , υ * ) ( υ η , υ * ) )
and hence, we have
( υ n + 1 , υ * ) ( η , υ * ) .
Therefore,
r lim n ( η , υ * ) .
By using Equations (1) and (2), we have
r = lim n ( η , υ * ) = lim n ( τ η 0 υ η κ η 0 υ η ι η 0 j η ω η 0 j η , υ * ) = lim n ( ( τ η 0 υ η + κ η 0 υ η , υ * ) + ( ι η 0 + ω η 0 ) ( j η , υ * ) ) = lim n ( ( τ η 0 + ι η 0 + ω η 0 ) ( υ η , υ * ) + κ η 0 ( υ η , υ * ) ) = lim n ( ( τ η 0 + ι η 0 + ω η 0 ) ( υ η , υ * ) + κ η 0 ( μ ( υ * , υ * ) + ( υ η , υ * ) ) ) = lim n ( ( 1 κ η 0 ) ( υ η , υ * ) + κ η 0 ( υ η , υ * ) ) . = lim n ( υ η , υ * ) .
Using Equations (1) and (3) and the above-mentioned inequalities, we have
lim sup n ( η , υ * ) lim sup n ( υ η , υ * ) = r ,
and hence, by Lemma 2, we have
lim n ( υ η , υ η ) = 0 .
Conversely, suppose that { υ η } is bounded and lim n ( υ η , υ η ) = 0 . Then, by Lemma 4 { υ η } has a subsequence that is regular with respect to B s . Let υ { η κ } be a subsequence of { υ η } in such a way that A ( B s , { υ η } ) = υ . Hence, we have
lim sup n ( υ η , υ * ) lim sup n ( μ ( υ η , υ η ) + ( υ η , υ ) ) lim sup n ( υ η , υ )
As a consequence, the uniqueness of the asymptotic center ensures that υ is a fixed point of so this concludes the proof. □
Now, we state and prove our main theorems in this section.
Theorem 2.
Let B s be a nonempty closed convex subset of a compete Busemann space B and : B s B s be a mapping satisfying condition ( E μ ) . For an arbitrary chosen υ 0 B s , assume that { υ η } is a sequence generated by a standard three-step iteration algorithm. Then f and { υ η } Δ converges to a fixed point of ℘.
Proof. 
Since f , so by Lemma 8, we have bounded { υ η } and
lim n ( υ η , υ η ) = 0 .
Also, let
ω ω { υ η } : = A ( υ η κ )
where the union is taken over all subsequences { υ η κ } of { υ η } . We claim that ω ω { υ η } f . Considering υ * ω ω { υ η } , then there is an existence of subsequence { υ η κ } of { υ η } in such a way that A ( { υ η } ) = { υ * } . Using Lemmas 3 and 5 there is an existence of subsequence { υ η κ } of { υ η κ } in such a way that Δ lim η { υ η κ } = υ * B s . Since lim η ( υ η κ , υ η κ ) = 0 , then by Lemma 6 υ f . We claim that υ * = υ * . In contrast, since is a mapping satisfying condition ( E ) and υ * f , then by Lemma 7 there is an existence of lim η ( υ η , υ * ) . Using the uniqueness of asymptotic centers, we have
lim sup n ( υ η , υ * ) < lim sup n ( υ η κ , υ * ) lim n ( υ η κ , υ * ) < lim n ( υ η κ , υ * ) = lim n ( υ η , υ * ) = lim n ( υ η κ , υ * )
which is a contradiction. So υ η κ = υ η κ f . To prove that { υ η } Δ converges to a fixed point of , it is sufficient to show that ω ω { υ η } consists of exactly one point. Considering a subsequence { υ η κ } of { υ η } . By Lemmas 3 and 5 there is existence of subsequence { υ η κ } of { υ η κ } , which is how Δ lim η { υ η κ } = υ * B s . Let A ( { υ η κ } ) = { υ * } and A ( { υ η } ) = υ * * . We can conclude the explanation by proving that υ * * = υ * . On the contrary, since ( υ η , υ η κ ) is convergent, then by the uniqueness of the asymptotic centers, we have
lim sup n ( υ η , υ * ) < lim sup n ( υ η κ , υ * * ) lim n ( υ η , υ * * ) < lim n ( υ η , υ * ) = lim n ( υ η κ , υ * )
which is a contradiction. Hence, f and { υ η } Δ converges to a fixed point of . □
Theorem 3.
Let B s be a nonempty closed convex and complete Busemann space B , and : B s B s be a mapping verification condition ( E μ ) . For an arbitrary chosen υ 0 B s , assume that { υ η } is a sequence generated by a standard three-step iteration algorithm. Then { υ η } converges strongly to a fixed point of ℘.
Proof. 
By Lemmas 7, 8 and Theorem 2, we have f so by Lemma 8 { υ η } is bounded and Δ converges to υ f . Suppose on the contrary that { υ η } does not converge strongly to υ . By the compactness assumption, passing to subsequences if necessary, we may assume that there exists υ B s with υ υ such that { υ η } converges strongly to υ . Therefore,
lim n ( υ η , υ ) = 0 lim n ( υ η , υ ) .
Since υ is the unique asymptotic center of { υ η } , it follows that υ = υ , which is a contradiction. Hence, { υ η } converges strongly to a fixed point of . □

4. Conclusions

The extension of the linear version of fixed point results to nonlinear domains has its own significance. To achieve the objective of replacing a linear domain with a nonlinear one, Takahashi [40] introduced the notion of a convex metric space and studied fixed point results of nonexpansive mappings in this direction. Since the standard three-step iteration scheme unifies various existing iteration schemes for different values of ε η , σ η , τ η i , κ η i , ω η i , and ι η i for i = 0 , 1 , 2 , existing results of the standard three-step iteration scheme including strong and Δ c o n v e r g e n c e results in the setting of Busemann spaces satisfying condition E are generalized.

Author Contributions

All authors have equally contributed to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This work received no external funding.

Acknowledgments

The authors are very grateful to the anonymous reviewers for their constructive comments leading to the substantial improvement of the paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Babu, G.V.R.; Prasad, K. Mann iteration converges faster than Ishikawa iteration for the class of zamfirescu operators. Fixed Point Theory Appl. 2006, 2006, 49615. [Google Scholar] [CrossRef] [Green Version]
  2. Busemann, H. Spaces with nonpositive curvature. Acta Math. 1948, 80, 259–310. [Google Scholar] [CrossRef]
  3. Sosov, E.N. On analogues of weak convergence in a special metric space. Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika 2004, 5, 84–89. [Google Scholar]
  4. Lawaong, W.; Panyanak, B. Approximating fixed points of nonexpansive nonself-mappings in CAT(0) spaces. Fixed Point Theory Appl. 2010, 2010, 367274. [Google Scholar] [CrossRef] [Green Version]
  5. Dhompongsa, S.; Inthakon, W.; Kaewkhao, A. Edelstien’s method and Fixed point theorems for some generalized nonexpansive mappings. J. Math. Anal. Appl. 2009, 350, 12–17. [Google Scholar] [CrossRef] [Green Version]
  6. Garcia-Falset, J.; Llorens-Fuster, E.; Suzuki, T. Fixed point theory for a class of generalized nonexpansive mappings. J. Math. Anal. Appl. 2011, 375, 185–195. [Google Scholar] [CrossRef] [Green Version]
  7. Ðukić, D.; Paunović, L.; Radenović, S. Convergence of iterates with errors of uniformly quasi-Lipschitzian mappings in cone metric spaces. Kragujev. J. Math. 2011, 35, 399–410. [Google Scholar]
  8. Todorčević, V. Harmonic Quasiconformal Mappings and Hyperbolic Type Metrics; Springer Nature: Cham, Switzerland, 2019. [Google Scholar]
  9. Xu, H.-K.; Altwaijry, N.; Chebbi, S. Strong convergence of mann’s iteration process in Banach Spaces. Mathematics 2020, 8, 954. [Google Scholar] [CrossRef]
  10. Ivanov, S.I. General local convergence theorems about the Picard iteration in arbitrary normed fields with applications to Super-Halley method for multiple polynomial zeros. Mathematics 2020, 8, 1599. [Google Scholar] [CrossRef]
  11. Berinde, V. Iterative Approximation of Fixed Points. In Lecture Notes in Mathematics; Springer: Berlin/Heidelberg, Germany, 2007. [Google Scholar]
  12. Ansari, Q.H.; Islam, M.; Yao, J.C. Nonsmooth variational inequalities on Hadamard manifolds. Appl. Anal. 2020, 99, 340–358. [Google Scholar] [CrossRef]
  13. Hammad, H.A.; ur Rehman, H.; De la Sen, M. Advanced Algorithms and common solutions to variational inequalities. Symmetry 2020, 12, 1198. [Google Scholar] [CrossRef]
  14. Dang, Y.; Sun, J.; Xu, H. Inertial accelerated algorithms for solving a split feasibility problem. J. Ind. Manag. Optim. 2017, 13, 1383–1394. [Google Scholar] [CrossRef] [Green Version]
  15. Hammad, H.A.; ur Rehman, H.; De la Sen, M. Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications. Math. Probl. Eng. 2020, 2020, 7487383. [Google Scholar] [CrossRef]
  16. Tuyen, T.M.; Hammad, H.A. Effect of Shrinking Projection and CQ-Methods on Two Inertial Forward-Backward Algorithms for Solving Variational Inclusion Problems. In Rendiconti del Circolo Matematico di Palermo Series 2; Available online: https://doi.org/10.1007/s12215-020-00581-8 (accessed on 27 February 2021).
  17. Papadopoulos, A. Metric Spaces, Convexity and Nonpositive Curvature. In IRMA Lectures in Mathematics and Theoretical Physics; European Mathematical Society: Strasbourg, France, 2005. [Google Scholar]
  18. Sharma, N.; Mishra, L.N.; Mishra, V.N.; Almusawa, H. End point approximation of standard three-step multivalued iteration algorithm for nonexpansive mappings. Appl. Math. Inf. Sci. 2021, 15, 73–81. [Google Scholar]
  19. Khamsi, M.A.; Kirk, W.A. An Introduction to Metric Spaces and Fixed Point Theory; John Wiley: New York, NY, USA, 2011. [Google Scholar]
  20. Bridson, M.; Haefliger, A. Metric Spaces of Non-Positive Curvature; Springer: Berlin, Germany, 1999. [Google Scholar]
  21. Kirk, W.A.; Panyanak, B. A concept of convergence in geodesic spaces. Nonlinear Anal. 2008, 68, 3689–3696. [Google Scholar] [CrossRef]
  22. Kirk, W.A. Geodesic geometry and fixed point theory. In Seminar of Mathematical Analysis; Colecc. Abierta: Malaga, Spain, 2003. [Google Scholar]
  23. Foertsch, T.; Lytchak, A.; Schroeder, V. Non-positive curvature and the Ptolemy inequality. Int. Math. Res. Not. 2007, 2007, rnm100. [Google Scholar]
  24. Kirk, W.A. Geodesic geometry and fixed point theory II. In International Conference on Fixed Point Theory and Applications; Yokohama Publ.: Yokohama, Japan, 2004; pp. 113–142. [Google Scholar]
  25. Bagherboum, M. Approximating fixed points of mappings satisfying condition (E) in Busemann space. Numer. Algorithms 2016, 71, 25–39. [Google Scholar] [CrossRef]
  26. Kohlenbach, U. Some Logical theorems with applications in functional analysis. Tran. Am. Math. Soc. 2005, 357, 89–128. [Google Scholar] [CrossRef] [Green Version]
  27. Noor, M.A. New approximation schemes for general variational inequalities. J. Math. Anal. Appl. 2000, 251, 217–229. [Google Scholar] [CrossRef] [Green Version]
  28. Phuengrattana, W.; Suantai, S. On the rate of convergence of Mann, Ishikawa, Noor and SP-iterations for continuous functions on an arbitrary interval. J. Comput. Appl. Math. 2011, 235, 3006–3014. [Google Scholar] [CrossRef] [Green Version]
  29. Gursoy, F.; Karakaya, V. A Picard-S hybrid type iteration method for solving a differential equation with retarded argument. arXiv 2014, arXiv:1403.25-46. [Google Scholar]
  30. Chugh, R.; Kumar, V.; Kumar, S. Strong Convergence of a new three step iterative scheme in Banach spaces. Am. J. Comput. Math. 2012, 2, 345–357. [Google Scholar] [CrossRef] [Green Version]
  31. Abbas, M.; Nazir, T. A new faster iteration process applied to constrained minimization and feasibility problems. Mat. Vesn. 2014, 66, 223–234. [Google Scholar]
  32. Sainuan, P. Rate of convergence of P-iteration and S-iteration for continuous functions on closed intervals. Thai J. Math. 2015, 13, 449–457. [Google Scholar]
  33. Daengsaen, J.; Khemphet, A. On the Rate of Convergence of P-Iteration, SP-Iteration, and D-Iteration Methods for Continuous Non-decreasing Functions on Closed Intervals. Abstr. Appl. Anal. 2018, 2018, 7345401. [Google Scholar] [CrossRef] [Green Version]
  34. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
  35. Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44, 147–150. [Google Scholar] [CrossRef]
  36. Goebel, K.; Reich, S. Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings; Marcel Dekker: New York, NY, USA; Basel, Switzerland, 1984. [Google Scholar]
  37. Dhompongsa, S.; Kirk, W.A.; Sims, B. Fixed points of uniformly lipschitzian mappings. Nonlinear Anal. 2006, 65, 762–772. [Google Scholar] [CrossRef]
  38. Kirk, W.; Shahzad, N. Fixed Point Theory in Distance Spaces; Springer: Cham, Switzerland; Heidelberg, Germany; New York, NY, USA; Dordrecht, The Netherlands; London, UK, 2014. [Google Scholar]
  39. Ullah, K.; Khan, B.A.; Ozer, O.; Nisar, Z. Some Convergence Results Using K* Iteration Process in Busemann Spaces. Malays. J. Math. Sci. 2019, 13, 231–249. [Google Scholar]
  40. Takahashi, T. A convexity in metric spaces and nonexpansive mappings. Kodai Math. Semin. Rep. 1970, 22, 142–149. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Almusawa, H.; Hammad, H.A.; Sharma, N. Approximation of the Fixed Point for Unified Three-Step Iterative Algorithm with Convergence Analysis in Busemann Spaces. Axioms 2021, 10, 26. https://doi.org/10.3390/axioms10010026

AMA Style

Almusawa H, Hammad HA, Sharma N. Approximation of the Fixed Point for Unified Three-Step Iterative Algorithm with Convergence Analysis in Busemann Spaces. Axioms. 2021; 10(1):26. https://doi.org/10.3390/axioms10010026

Chicago/Turabian Style

Almusawa, Hassan, Hasanen A. Hammad, and Nisha Sharma. 2021. "Approximation of the Fixed Point for Unified Three-Step Iterative Algorithm with Convergence Analysis in Busemann Spaces" Axioms 10, no. 1: 26. https://doi.org/10.3390/axioms10010026

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop