R E S E A R C H
Open Access
Some results in fixed point theory and
application to the convergence of some
iterative processes
Najeh Redjel
1,2*and Abdelkader Dehici
1,2*Correspondence:
1Laboratory of Informatics and
Mathematics, University of Souk-Ahras, P.O. Box 1553, Souk-Ahras, 41000, Algeria
2Department of Mathematics,
University of Constantine 1, Constantine, 25000, Algeria
Abstract
In this paper, we study the existence and uniqueness of fixed points for a class of self-mappings satisfying certain rational expressions on closed, bounded and convex subsets with normal structures in reflexive Banach spaces. We show that, in particular, this class extends that introduced by Ray and Singh (Indian J. Pure Appl. Math. 9:216-221, 1978). As an application, we give an investigation of the convergence and stability of some iterative processes associated to these mappings.
MSC: 47H09; 47H10; 54H25
Keywords: Banach space; normal structure; rational expression; fixed point; Picard iteration; Mann iteration; Ishikawa iteration; Kirk iteration
1 Introduction
It is well known that the Banach contraction principle was the starting point for the de-velopment of fixed point theory allowing the advancement of the analysis and nonlinear analysis in particular. During more than fifty years, there has been a lot of production in this area and many well-known fixed theorems have been established and investigated by several authors (see, for example, [–] and the references therein).
Definition . A function: [, +∞[−→[, +∞[ is called a comparison function if it satisfies the following conditions:
(i) is monotone nondecreasing;
(ii) limn−→+∞n(t) = for allt> (nstands for thenth iterate of).
Remark . Every comparison function satisfies() = and(t) <t,∀t> .
Fixed point theory has been and will remain an important tool in the study of the istence and uniqueness of solutions of differential and integral equations. Among the ex-tensions of Banach’s principle, we quote the fixed point result of Boyd and Wong [].
Theorem .[] Let (X,d)be a complete metric space and T be a self-mapping on X satisfying that
dT(x),T(y)≤d(x,y) (whereis a comparison function).
Then T has a unique fixed point in X.
Other rational expressions generalizing the same principle have been investigated by several authors. Among the more classical ones, those that have been established by Jaggi, Dass and Gupta.
Theorem .[] Let(X,d)be a complete metric space and T:X−→X be a continuous mapping such that
dT(x),T(y)≤αd(x,T(x))d(y,T(y))
d(x,y) +βd(x,y)
for all distinct points x,y∈X,whereα,β∈[, [withα+β< .Then T has a unique fixed point.
Theorem .[] Let(X,d)be a complete metric space and let T be a mapping from X into itself satisfying
dT(x),T(y)≤αdy,T(y) +d(x,T(x))
+d(x,y) +βd(x,y)
for all distinct points x,y∈X,whereα,β∈[, [withα+β< .Then T has a unique fixed pointξ∈X.Moreover,for all x∈X,the sequence{Tn(x)}converges toξ.
Definition . Let (X, · ) be a normed space andKbe a nonempty subset ofX. A self-mappingTonKis called a nonexpansive mapping ifT(x)–T(y) ≤ x–yfor allx,y∈K.
The set of nonexpansive self-mappings onKwill be denoted byK.
We note that the existence and uniqueness of fixed points for this type of mappings are not in general ensured. However, some fixed point theorems for nonexpansive mappings have been derived by several authors (we quote, for example, [, ] and Chapter of []).
Let (X, · ) be a normed space and T be a self-mapping on X. For any nonempty bounded subsetA⊂X, the diameter ofA, which will be denoted byδ(A), is defined by
δ(A) =supx–y:x,y∈A.
Letx∈Xandn∈N, we define the orbit of ordernofxbyT as follows:
O(x,n) =x,T(x), . . . ,Tn(x).
The orbit ofxbyTis defined by
Definition . Let (X,·) be a normed space andKbe a nonempty bounded subset ofX. LetT:K−→Kbe a mapping,Tis said to be orbitally controlled if∀n∈N,n≥,∀x∈X
and for alli,j∈ {, . . . ,n}, there exists ≤k≤nsuch that
Ti(x) –Tj(x)≤x–Tk(x). ()
Remark . The integerkindicated in the above definition can be chosen independently ofi,j. Indeed, letn≥ andx∈K, and assume that for alli,j∈ {, . . . ,n}, there exists an integerk(depending oni,j) such that
Ti(x) –Tj(x)≤x–Tki,j(x).
If we definel=max{x–Tki,j(x),i,j= , . . . ,n}, then there existi
,j∈ {, . . . ,n}such that
l=x–Tki,j(x); consequently, we get
Ti(x) –Tj(x)≤x–Tki,j(x)
for alli,j∈ {, . . . ,n}(hereki,jis independent ofiandj).
IfT is orbitally controlled, then for eachx∈K andn≥, there exist ≤βx≤nand ≤βx≤nsuch thatδ(O(x,n)) =x–Tβx(x)andδ((O(T(x),n– ))) =T(x) –Tβx(x). We denote byrx(T) (resp.rx(T)) the smallest integerβx(resp.βx) such thatδ(O(x,n)) = x–Tβx(x)(resp.δ(O(T(x),n– )) =T(x) –Tβx(x). We note thatδ(O(x,n))≥δ(O(T(x),
n– )).
The set of orbitally controlled self-mappings onKwill be denoted byK.
2 Main results
First of all, we will show thatK contains in particular the set of all nonexpansive
self-mappingsK.
Proposition . Let(X, · )be a normed space and K be a nonempty bounded subset
of X.ThenK⊆K.
Proof LetT∈Kand letn∈N,n≥. Ifx∈Kandi,j∈ {, . . . ,n},j>i, we have
Tj(x) –Ti(x)≤Tj–(x) –Ti–(x)≤ · · · ≤x–Tj–i(x),
which implies thatTsatisfies () (since ≤j–i<n), thusT∈K, which gives the result.
Let us give now the definition of quasi-contraction self-mappings.
Definition . Let (X, · ) be a normed space andKbe a nonempty subset ofX. A self-mappingT onK is said to be a quasi-contraction mapping if there existsη∈[, [ such that
T(x) –T(y)≤ηmaxx–y,x–T(x),y–T(y),x–T(y),y–T(x)
The set of quasi-contraction self-mappings onKwill be denoted byK.
Proposition . Let(X, · )be a normed space and K be a nonempty bounded subset
of X.ThenK⊆K.
Proof If T ∈K andn≥. Let x∈K and let ≤i,j≤n. ThusTi(x),Tj(x)∈O(T(x), n– )⊂O(x,n) (T(x) =x). SinceT is a quasi-contraction self-mapping onK, it follows that
Ti(x) –Tj(x)=TTi–(x)–TTj–(x)
≤ηmaxTi–(x) –Tj–(x),Ti–(x) –Ti(x),Tj–(x) –Tj(x),
Ti–(x) –Tj(x),Tj–(x) –Ti(x) ≤ηδO(x,n)<δO(x,n).
This shows that () is satisfied forT and, consequently,K⊆K.
Lemma . Let(X, · )be a normed space and K be a nonempty subset of X.Let n∈N, n≥,if T∈K and x∈K such thatδ(O(x,n)) =δ(O(T(x),n– )),then rx(T) >rx(T).
Proof Assume that rx
(T)≤rx(T). By hypothesis, we obtain thatδ(O(x,n)) =δ(O(T(x),
n– )) =T(x) –Trx(T)(x)=x–Trx(T)(x). The fact thatT∈Kimplies thatδ(O(x,n)) =
δ(O(T(x),n– )) =T(x) –Trx(T)(x) ≤ x–Trx(T)–(x), which is a contradiction with
rx(T) is the smallest integerβxsuch thatδ(O(x,n)) =x–Tβx(x).
LetPbe a real polynomial given by
P(x) =λ+λx+· · ·+λnxn withλi≥,λ> , and
n
i= λi= .
Let (X, · ) be a normed space andKbe a nonempty subset ofX. LetT:K−→K be a self-mapping. ByF(T), we will designate the set of fixed points ofT inK, the convex hull ofKis denoted byco(K) and the closed convex hull ofKis denoted byco(K).
Proposition . If K is a nonempty,bounded and convex subset in X and T ∈K such that rx
(T) >rx(T)for all x∈K,then F(T) =F(P(T)).
Proof The inclusionF(T)⊆F(P(T)) is trivial. Let us show the reverse ifx∈Ksuch that
P(T)(x) =λx+λT(x) +· · ·+λnTn(x) =x. Thus,x∈co{T(x), . . . ,Tn(x)}. Now, assume that δ(O(x,n)) > . Sinceλ> , thenλ= , consequently.
x= λ
( –λ)
T(x) +
– λ ( –λ)
z,
wherez=ni=–σiTi+(x) withσi=–λλi+–λfor alli= , . . . ,n– . Moreover, it is easy to
ob-serve thatni=–σi= (since
n
thus
δO(x,n)=x–Trx(T)(x)= λ
( –λ)
T(x) +
– λ ( –λ)
z–Trx(T)(x)
≤ λ ( –λ)
T(x) –Trx(T)(x)+
– λ ( –λ)
z–Trx(T)(x)
= λ ( –λ)
T(x) –Trx(T)(x)
+
– λ ( –λ)
n–
i=
σiTi+(x) –
n–
i= σi
Trx(T)(x)
≤ λ ( –λ)
T(x) –Trx(T)(x)
+
– λ ( –λ)
n–
i=
σiTi+(x) –Tr
x
(T)(x)
≤ λ ( –λ)
T(x) –Trx(T)(x)+
– λ ( –λ)
n–
i= σi
δO(x,n).
Sinceni=–σi= , it follows that
λ ( –λ)
δO(x,n)≤ λ ( –λ)
T(x) –Trx(T)(x).
This gives thatδ(O(x,n)) =T(x) –Trx(T)(x)and, consequently,δ(O(T(x),n– )) =T(x) – Trx(T)(x), which contradicts the fact thatrx
(T) >rx(T). Thusδ(O(x,n)) = , which gives thatT(x) =xand, consequently,x∈F(T).
Remark . We note also that the conditionλ> is crucial as the following example shows.
Example . LetT : [, ]−→[, ] be defined as follows:T(x) = –x. It is easy to ob-serve thatTis nonexpansive andx= is the unique fixed point ofT. Now consider the polynomialP(z) =z+
. We obtain that
P(T) : [, ]−→[, ],
x−→P(T)(x) =x.
In this case, we observe thatF(P(T)) = [, ] and, consequently, we haveF(T)F(P(T)).
By the same techniques as in the proof of Proposition ., we prove the following propo-sition.
Proposition . If K is a nonempty,bounded and convex subset in a normed space X and
Proof Indeed, in this case, the last inequality in the proof of Proposition . becomes
λ ( –λ)
δO(x,n)≤ λ ( –λ)
T(x) –Trx(T)(x)≤ λ
( –λ)
x–T(x),
which gives thatδ(O(x,n)) =x–T(x)and shows thatrx
(T) = . By replacing in this in-equality, we get alsoδ(O(x,n)) = , which gives the desired result.
Now, we give the following important preparatory result.
Proposition . Let K be a nonempty subset of a normed space X,and let T be a self-mapping defined on K satisfying that for all(x,y)∈K×K,x=y,if y=T(x),we have nec-essarily x=T(y)together with the following condition:
T(x) –T(y)≤(x–T(x),x–T(y)) +(y–T(y),y–T(x)) (x–T(y),y–T(x))
()
for all x,y∈K,where:
(i) ,: [, +∞[×[, +∞[−→[, +∞[nondecreasing mappings relative to the first
variable and: [, +∞[×[, +∞[−→[, +∞[such that (t,t) = ⇐⇒(t,t) = (, );
(ii) (t, ) = for allt≥;
(iii) (t,t)+(t,t)
(t,t) ≤tfor allt≥and(t,t)∈[, +∞[×[, +∞[\{(, )}. Then
Tn(x) –Tn+(x)≤Tn–(x) –Tn(x);
and for all strictly positive integers m and n,we have
Tn(x) –Tm(x)≤x–T(x).
In particular T∈K.
Proof Letx∈K, then
Tn(x) –Tn+(x)=TTn–(x)–TTn(x)
≤(Tn–(x) –Tn(x),Tn–(x) –Tn+(x)) (Tn–(x) –Tn+(x),Tn(x) –Tn(x))
+ (T
n(x) –Tn+(x),Tn(x) –Tn(x))
(Tn–(x) –Tn+(x),Tn(x) –Tn(x)) .
Applying (ii) and (iii), we get
Tn(x) –Tn+(x)≤Tn–(x) –Tn(x)
.. .
Now
Tn(x) –Tm(x)=TTn–(x)–TTm–(x)
≤ (Tn–(x) –Tn(x),Tn–(x) –Tm(x)) (Tn–(x) –Tm(x),Tm–(x) –Tn(x))
+(T
m–(x) –Tm(x),Tm–(x) –Tn(x))
(Tn–(x) –Tm(x),Tm–(x) –Tn(x)) .
Using the first assertion together with the fact thatandare nondecreasing relative to the first variable and (iii), we obtain that
Tn(x) –Tm(x)≤ (x–T(x),T
n–(x) –Tm(x))
(Tn–(x) –Tm(x),Tm–(x) –Tn(x))
+ (x–T(x),T
m–(x) –Tn(x))
(Tn–(x) –Tm(x),Tm–(x) –Tn(x))
≤x–T(x).
This gives thatTsatisfies () (herek= for all integersn,m≥ and for allx∈K).
Definition . A bounded convex subsetKof a Banach spaceXis said to have a normal
structure if for each convex subsetMofKwith more than one point, there is a pointx∈M
such that
supx–y:y∈M<δ(M).
Under the assumptions of Proposition ., in the following theorem we take(t,t) = ψ(t)ψ(t),(t,t) =ψ(t)ψ(t),(t,t) =ψ(t) +ψ(t) (t,t≥), whereψ,ψ andψare self-mappings defined on [, +∞[.
Theorem . Let K be a nonempty,bounded,closed,convex subset of a reflexive Banach
space X having a normal structure,and let T be a continuous self-mapping defined on K
satisfying that for all(x,y)∈K×K,x=y,if y=T(x),we have necessarily x=T(y)together
with the following condition:
T(x) –T(y)≤ψ(x–T(x))ψ(x–T(y)) +ψ(y–T(y))ψ(y–T(x)) ψ(x–T(y)) +ψ(y–T(x))
, ()
whereψis a strictly nondecreasing function andψ(t)≤t for all t≥.
Then T has a unique fixed point in K.
Proof SinceX is a reflexive Banach space, then every descending family of nonempty
closed convex subsets ofXhas nonempty intersection. Then we can use the Zorn lemma to obtain a minimal subsetKofKwhich is closed, convex and invariant underT.
• Ifδ(K) = , the problem is solved since in this caseK={x}, and thusT(x) =x.
SinceKhas a normal structure, then there existsy∈Ksuch that
supx–y;x∈K
≤r<δ(K).
Hence,y–Tk(y) ≤rfor all k≥ and, consequently, δ(O(y))≤r. LetH ={x∈K
: δ(O(x))≤r}andG=co(T(H)), which is a nonempty convex closed subset ofX. Letg∈G. Then we will consider the following three cases.
First case:g=T(h) forh∈H. Then
g–T(g)=T(h) –T(h)≤h–T(h)≤r.
Hence
g∈H and T(g)∈G.
Second case:g=ni=λiT(hi),hi∈H,λi≥,
n i=λi= .
Then
g–T(g)=T(g) –
n
i=
λiT(hi)
≤
n
i=
λiT(g) –T(hi)
≤
n
i= λi
ψ(g–T(g))ψ(g–T(hi)) +ψ(hi–T(hi))ψ(hi–T(g)) ψ(g–T(hi)) +ψ(hi–T(g))
≤
n
i= λi
g–T(g)ψ(g–T(hi)) +rψ(hi–T(g))
ψ(g–T(hi)) +ψ(hi–T(g))
=g–T(g)
n
i= λi
ψ(g–T(hi))
ψ(g–T(hi)) +ψ(hi–T(g))
+r n i= λi
ψ(hi–T(g))
ψ(g–T(hi)) +ψ(hi–T(g))
.
We put
γ=
n
i= λi
ψ(g–T(hi))
ψ(g–T(hi)) +ψ(hi–T(g))
and
γ=
n
i= λi
ψ(hi–T(g))
ψ(g–T(hi)) +ψ(hi–T(g))
.
We observe thatγ+γ= , thus
which gives that
g–T(g)≤r
and, consequently,g∈HandT(g)∈G.
Third case: Ifgis a limit of the formni=λiT(hi),hi∈H,λi≥,
n
i=λi= , then
g–T(g)≤T(g) –T
n
i= λiT(hi)
+g–
n
i= λiT(hi)
+T
n
i= λiT(hi)
–
n
i= λiT(hi)
.
By using the second case, we have that for alln≥,
T
n
i= λiT(hi)
–
n
i=
λiT(hi)≤r.
Let> , taking into account the continuity ofT, we can choosensufficiently large such that g– n i= λiT(hi)
+T(g) –T
n
i= λiT(hi)
<
and, consequently, we infer that
g–T(g)≤r+, ∀> ,
which implies that
g–T(g)≤r.
Henceg∈HandT(g)∈G. ButKis minimal, thusK=G, it follows thatδ(K) =δ(G). Now, by taking into account the fact that ifAis a subset of a Banach spaceX, we have δ(A) =δ(co(A)), then
δ(K) =δ
coT(H)
=δT(H)
=supT(x) –T(y):x,y∈H
≤sup
ψ(x–T(x))ψ(x–T(y)) +ψ(y–T(y))ψ(y–T(x)) ψ(x–T(y)) +ψ(y–T(x))
:
x,y∈H
≤sup
ψ(r)ψ(x–T(y)) +ψ(r)ψ(y–T(x)) ψ(x–T(y)) +ψ(y–T(x))
:x,y∈H
which is a contradiction, thenδ(K) = , which gives thatK={x}and shows thatThas
a unique fixed point inK.
Remark . Ifψ(t) =ψ(t) =ψ(t) =t, we find the main result of [].
3 Applications
We start this section by giving the concept ofϕ-quasi-nonexpansive mappings.
Definition . LetT be a self-mapping defined on a metric space (X,d). We say that
T :X−→Xis aϕ-quasi-nonexpansive mapping ifF(T)=∅, and there exists a function ϕ: [, +∞[−→[, +∞[ such that
dT(x),z≤ϕd(x,z)
for allx∈X,z∈F(T).
It is easy to observe that every contraction mapping isϕ-quasi-nonexpansive withϕ(t) = αt, ≤α< andt∈[, +∞[, but the converse is false in general as the following example
shows.
Example . Letϕ: [, +∞[−→[, +∞[ be a comparison function, and letX=R, then the mappingT:R−→Rdefined by
T(x) =
ϕ(|x|)sin(x) ifx= ,
ifx= ,
isϕ-quasi-nonexpansive but not a contraction mapping. This implies that the class of ϕ-quasi-nonexpansive mappings contains strictly that of contraction mappings. In the case whereϕ=IdX, we obtain the concept of quasi-nonexpansive mappings introduced by Tri-comi [] and studied by Diaz and Metcalf [, ] (for more details on the class of ϕ-quasi-nonexpansives, we can refer to [, ]).
Definition . A function: [, +∞[−→[, +∞[ is called subadditive if for allt,t∈ [, +∞[, we have(t+t)≤(t) +(t).
Theorem . Under assumptions of Theorem.,ifψ is a subadditive function with
ψ≤min{ψ,ψ},then T is aψ-quasi-nonexpansive self-mapping on K.
Proof Letzbe the unique fixed point ofT inKandx∈Kwithx=z, then
T(x) –z=T(x) –T(z)≤ψ(x–T(x))ψ(x–z) +ψ(z–z)ψ(z–T(x)) ψ(x–z) +ψ(z–T(x))
≤ ψ(x–T(x))ψ(x–z) ψ(x–z) +ψ(z–T(x))
≤ψ(x–T(x))ψ(x–z) ψ(x–T(x))
=ψ
Several iterative processes have been defined by many mathematicians. Some of them are the following.
Picard iteration: Let (X, · ) be a normed space andT:X−→Xbe a self-mapping. Let
x∈Xbe fixed, we define the sequence{xn}nrecursively by
xn+=T(xn) =Tn+(x) for alln∈N. ()
Mann iteration([]): If (X, · ) is a normed space, Mann iteration is defined by the
following algorithm:
xn+= ( –αn)xn+αnT(xn) for alln∈N, ()
wherex∈Xand{αn}n⊂[, ].
Ishikawa iteration([]): Another iterative process of interest is the Ishikawa scheme of
two steps given as follows: Letx∈Xbe fixed, consider the sequence{xn}ndefined by
yn= ( –βn)xn+βnT(xn),
xn+= ( –αn)xn+αnT(yn) for alln∈N,
()
where{αn}nand{βn}nare sequences in [, ].
In the case whereβn= , the Ishikawa iteration reduces to the Mann iteration. In
gen-eral, there is no dependence between convergence results for Picard, Mann and Ishikawa iterations. However, some partial results on the equivalence of these processes have been given by Rhoades and Soltuz (see [–]).
Kirk iteration([]): Let (X, · ) be a normed space,Kbe a closed, convex, bounded
subset ofX. LetT be a self-mapping defined onK. For eachx∈K, the sequence{Sn(x)}
defined byS:K−→K, where
S=λI+λT+· · ·+λnTn, λi≥,λ> ,
n
i= λi= ,
is said to be Kirk’s iterative process.
By using Theorem . together with ([], Theorem .), we obtain the following result for the convergence of the iterative schemes of Mann and Ishikawa.
Proposition . Let(X, · )be a Banach space.Let{αn}nand{βn}nbe two real sequences in[, ]such that{αnβn}nconverges to some positive real number,let x∈X.Under the
assumptions of Theorem.withψ a comparison continuous function,the Ishikawa
se-quence given by()converges to the unique fixed point of T.Moreover,if{βn}nis the
con-stant sequence equal to,the Mann iteration given by()converges to the same unique
fixed point of T.
Definition . LetAbe a bounded subset of a normed space (X, · ). The Kuratowski measure of noncompactness ofAdenoted byα(A) is defined as the infimum of all> such thatAadmits a finite covering consisting of subsets with diameter less than. A continuous mappingT:X−→Xis said to be densifying if for every bounded subsetA
We denote byBXthe closed unit ball of the normed spaceX. The functionαdefined on the set of all subsets ofXdenoted byP(X) enjoys the following properties:
(a) regularity:α() = if and only ifis totally bounded; (b) nonsingularity:αis equal to zero on every one-element set; (c) monotonicity:⊆impliesα()≤α();
(d) semi-additivity:α(∪) =max{α(),α()};
(e) Lipschitzianity:|α() –α()| ≤ρ(,), whereρdenotes the Hausdorff
semi-metricρ(,) =inf{> :+BX⊃,+BX⊃};
(f ) continuity: For any∈P(X)and any, there existsδ> such that
|α() –α()|<for allsatisfyingρ(,) <δ;
(g) semi-homogeneity:α(t) =|t|α()for any numbert; (h) algebraic semi-additivity:α(+)≤α() +α();
(i) invariance under translations:α(+x) =α()for anyx∈X. The following two theorems are omitted.
Theorem .([], Theorem ..) The Kuratowski measure of noncompactness is
invari-ant under passage to the closure and to the convex hull:α() =α() =α(co()).
Let us recall the following theorem due to Diaz and Metcalf [].
Theorem . Let T be a continuous self-mapping of the metric space(X,d)such that
(i) F(T)is nonempty;
(ii) for eachy∈Xsuch thaty∈/F(T)and for eachz∈F(T),we have
dT(y),z<d(y,z).
Then one and only one of the following properties holds:
(a) for eachx∈X,the Picard sequence{Tn(x)}contains no convergent subsequences;
(b) for eachx∈X,the sequence{Tn(x)}converges to a point belonging toF(T). Theorem .([]) Let T:K−→K be a densifying mapping defined on a closed,bounded,
convex subset K of a Banach space X.Then T has at least one fixed point.
Let us define the geometric propertyP(f,f,f) given as follows.
Let (X,·) be a normed space, we say thatXhas the propertyP(f,f,f) if for allx,y∈X,
f(x+y) =f(x) +f(y) andx= ,y= , thenx=cy(c> ).
In the case wheref=f=f=IR+, this property is satisfied by strictly convex Banach
spaces.
Let (X, · ) be a Banach space andKbe a closed, bounded subset ofX. LetT:K−→K
be a self-mapping onK. We define the setTas follows:
T
=αx+βT(x) :α,β∈[, ],α+β= ,x∈K\F(T).
Theorem . Let T:K−→K be a densifying mapping defined on a closed,bounded,
convex subset of a Banach space X having the property P(ψ,ψ,ψ),whereψ(t)≤t for
all t≥andψis a nondecreasing,subadditive function withψ≤min{ψ,ψ}.Assume
that T satisfies()and F(T)∩T=∅.Then,for each x∈K,the sequence{Sn(x)}converges
to a fixed point of T.
Proof Following Theorem ., it follows thatF(T)=∅. Moreover,Sis a densifying
map-ping. Indeed, ifAis a bounded subset ofKsuch thatα(A) > , then
S(A)⊆λA+λT(A) +· · ·+λnTn(A).
Hence, by monotonicity, algebraic semi-additivity and semi-homogeneity properties, we get
αS(A)≤λα(A) +λα
T(A)+· · ·+λnα
Tn(A).
The fact thatTis densifying shows that
αT(A)<α(A),
.. .
αTn(A)≤αTn–(A)≤ · · · ≤αT(A)<α(A);
and therefore
αS(A)< (λ+· · ·+λn)α(A) =α(A).
Also, by use of Theorem .,F(S)=∅. Moreover, by taking account of Propositions . and ., it follows thatF(T) =F(S)=∅.
Forx∈K, let
A=
+∞
n=
Sn{x}.
We haveS(A) =+n=∞Sn{x} ⊂Aand, sinceA={x} ∪S(A), this gives that
α(A) =maxα{x},αS(A)
=max,αS(A)
=αS(A).
SinceSis densifying, we establish thatα(A) = , by the property of regularity, we establish thatAis totally bounded and, consequently,Ais compact (sinceX is a Banach space); therefore, the sequence{Sn(x)}contains a convergent subsequence.
Now, ifyis a fixed point ofTandx∈K\F(T), thenT(y) =yandT(x)=y; consequently,
T(x) –y≤ ψ(x–T(x))ψ(x–y)
ψ(x–y) +ψ(y–T(x))
sinceψ() =
Moreover, the fact thatψis nondecreasing subadditive andψ≤min{ψ,ψ}gives that
ψx–T(x)≤ψ
x–y+ψy–T(x).
The above inequality is strict, indeed, if
ψx–T(x)=ψ
x–y+ψy–T(x).
Using the propertyP(ψ,ψ,ψ) satisfied by the Banach spaceX, we get
x–y=cy–T(x) (c> ),
which implies thatx+cT(x) = ( +c)yand, consequently,y=+cx++ccT(x)∈T, which
is a contradiction. This gives that
T(x) –y<ψ
x–y≤ x–y,
which implies that
Tk(x) –y<x–y.
It follows that
S(x) –y=
n
k=
λkTk(x) –y
=
n
k=
λkTk(x) –
n
k= λky
≤
n
k=
λkTk(x) –y
<
n
k=
λkx–y=x–y.
Then S satisfies conditions of the theorem of Diaz and Metcalf, which implies that
limn−→+∞Sn(x) exists and belongs toF(T) =F(S).
As an immediate consequence of the proof of Theorem ., we have the following.
Theorem . Let(X, · )be a reflexive Banach space having the property P(ψ,ψ,ψ),
whereψ(t)≤t for all t≥andψ is a nondecreasing,subadditive function withψ≤
min{ψ,ψ}.Let T:K−→K be a self-mapping defined on a closed,bounded,convex subset
K with normal structure in X.Assume that T satisfies assumptions of Theorem ..If
x∈/T(where xis the unique fixed point of T in K)and S is a densifying mapping,then,
for each x∈K,the sequence{Sn(x)}converges to x
Recall that for the case of numerical stability we say that a fixed point iteration process is numerically stable if small perturbation in the initial data induces a small influence of the computed value of the fixed point. For the remainder of our study, we need the following two definitions about stability of general iterative processes.
Definition . Let (X, · ) be a normed space,T:X−→Xbe a self-mapping onX. Let {xn}n⊂Xbe the sequence generated by an iteration involvingT and defined by
xn+=f(T,xn) for alln∈N, ()
wherex∈Xandf is some function. Assume that{xn}nconverges to a fixed pointzofT. Let{yn}n⊂X, and we define
n:=yn+–f(T,yn) for alln∈N.
Then
(i) the iteration process () is said to beT-stable iflimn−→∞n= implies
limn−→∞yn=z;
(ii) the iteration process () is said to be almostT-stable ifn∈Nn<∞implies
limn−→∞yn=z.
For more information and interesting comments on these notions of stability, we can see []. On the other hand, it is easy to observe that an iterative process () which isT-stable is almostT-stable but the converse is not true in general (see the counter example given in []). Furthermore, the iterative processes can converge without being stable. Indeed, the following example given in [, ] confirms this.
Example . Let (X, · ) = (R,| · |) andT: [, ]−→[, ],T(x) =x. It is easy to observe thatF(T) = [, ].
The case of Picard iteration: Letz∈], ], andxn+=T(xn) =Tn+(x) is a stationary sequence which is equal tox, this implies that its limit isx. On the other hand, if we take
y= andyn=n forn≥, we obtain that
yn+–T(yn)=
n(n+ )−→,
butlimn−→+∞yn= =z. This shows that the Picard iteration converges but is notT -stable.
The case of Mann iteration: Letz∈], ] ,{αn}n⊆[, ] andxn+= ( –αn)xn+αnxn= xn=xfor alln≥. Letx=yandyn=n+ . Thus
n=yn+– ( –αn)yn–αnT(yn)=
(n+ )(n+ )−→,
butlimn−→+∞yn= =z. This shows that the Mann iteration converges but is notT-stable.
Corollary . Let(X, · )be a reflexive Banach space and K be a nonempty,closed,
convex and bounded subset of X with normal structure.Suppose that the assumptions of
Theorem.are satisfied withψ a continuous comparison function.If zis the unique
fixed point of T and x∈K with xn+:=T(xn),n∈Nis the Picard process and{yn}n⊂K. Define{n}nby
n:=yn+–T(yn) for all n∈N.
Ifn∈Nn<∞,thenlimn−→∞yn=z.In other words,the Picard process is almost T - stable.
Proof The result is established by combining the fact thatT isψ-quasi-nonexpansive
together with Theorem . in [].
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors contributed equally and significantly in writing this article. All authors read and approved the final manuscript.
Acknowledgements
The authors would like to thank the anonymous referees and the editor for their valuable comments which helped to improve this paper.
Received: 20 March 2015 Accepted: 28 August 2015
References
1. Abbas, M, Nazir, T, Aydi, H: Fixed points of generalized graphic contraction mappings in partial metric spaces endowed with a graph. J. Adv. Math. Stud.6(2), 130-139 (2013)
2. Caristi, J: Fixed point theorems for mappings satisfying inwardness condition. Trans. Am. Math. Soc.215, 241-251 (1976)
3. Karapınar, E: Fixed point theory for cyclicϕ-contraction. Appl. Math. Lett.24, 822-825 (2011)
4. Karapınar, E, Abdeljawad, T, Tas, K: A generalized contraction principle with control functions on partial metric spaces. Comput. Math. Appl.3(73), 716-719 (2012)
5. Redjel, N: On some extensions of Banach’s contraction principle and applications to the convergence and stability of some iterative processes. Adv. Fixed Point Theory4, 555-570 (2014)
6. Rhoades, BE: A comparison of various definitions of contractive mappings. Trans. Am. Math. Soc.226, 257-290 (1977) 7. Sehgal, V: On fixed and periodic points for a class of mappings. J. Lond. Math. Soc.5, 571-576 (1972)
8. Boyd, DW, Wong, JS: On nonlinear contractions. Proc. Am. Math. Soc.20, 458-464 (1969) 9. Jaggi, DS: Some unique fixed point theorems. Indian J. Pure Appl. Math.8, 223-230 (1977)
10. Dass, BK, Gupta, S: An extension of Banach contraction principle through rational expression. Indian J. Pure Appl. Math.6, 1455-1458 (1975)
11. Diaz, JB, Metcalf, FT: On the set of subsequential limit points of successive approximations. Trans. Am. Math. Soc.135, 459-485 (1969)
12. Kirk, WA: A fixed point theorem for mappings which do not increase distances. Am. Math. Mon.76, 1004-1007 (1965) 13. Berinde, V: Iterative Approximation of Fixed Points. Springer, Berlin (2007)
14. Ray, BK, Singh, SP: Fixed point theorems in Banach space. Indian J. Pure Appl. Math.9, 216-221 (1978)
15. Tricomi, F: Un teorema sulla convergenza delle successioni formate delle successive iterate di una funzione di una variabile reale. G. Mat. Battaglini54, 1-9 (1916)
16. Diaz, JB, Metcalf, FT: On the structure of the set of subsequential limit points of successive approximations. Bull. Am. Math. Soc.73, 516-519 (1967)
17. Olatinwo, MO: Some stability results for nonexpansive and quasi-nonexpansive operators in uniformly convex Banach spaces using the Ishikawa iteration process. Carpath. J. Math.24(1), 82-87 (2008)
18. Olatinwo, MO: Convergence and stability results for some iterative schemes. Acta Univ. Apulensis26, 225-236 (2011) 19. Mann, WR: Mean value methods in iteration. Proc. Am. Math. Soc.4, 506-510 (1953)
20. Ishikawa, S: Fixed point and iteration of a nonexpansive mapping in a Banach space. Proc. Am. Math. Soc.59, 65-71 (1976)
21. Rhoades, BE, Soltuz, SM: On the equivalence of Mann and Ishikawa iteration methods. Int. J. Math. Math. Sci.7, 451-459 (2003)
22. Rhoades, BE, Soltuz, SM: The equivalence of the Mann and Ishikawa iteration for non-Lipschitzian operators. Int. J. Math. Math. Sci.42, 2645-2652 (2003)
23. Rhoades, BE, Soltuz, SM: The equivalence between the convergence of Ishikawa and Mann iterations for asymptotically pseudocontractive map. J. Math. Anal. Appl.283, 681-688 (2003)
25. Rhoades, BE, Soltuz, SM: The equivalence between the convergence of Ishikawa and Mann iterations for
asymptotically nonexpansive in the intermediate sense and strongly successively pseudocontractive maps. J. Math. Anal. Appl.289, 266-278 (2004)
26. Soltuz, SM: The equivalence of Picard, Mann and Ishikawa iterations with dealing with quasi-contractive operators. Math. Commun.10, 81-89 (2005)
27. Kirk, WA: On successive approximations for nonexpansive mappings in Banach spaces. Glasg. Math. J.12, 6-9 (1971) 28. Ruiz, DA: Convergence and stability of some iterative processes for a class of quasinonexpansive type mappings.
J. Nonlinear Sci. Appl.5, 93-103 (2012)
29. Akhmerov, RR, Kamenskii, MI, Potapov, AS, Rodkina, AE, Sadovskii, BN: Measures of Noncompactness and Condensing Operators. Birkhäuser, Basel (1992)
30. Furi, M, Vignoli, A: A fixed point theorem in complete metric spaces. Boll. Un. Mat. Ital. (4)5, 505-509 (1969) 31. Olatinwo, MO: Some stability results for two hybrid fixed point iterative algorithms of Kirk-Ishikawa and Kirk-Mann
type. J. Adv. Math. Stud.1(1-2), 87-96 (2008)
32. Osilike, MO: Stability of the Mann and Ishikawa iteration procedures forφ-strong pseudocontractions on nonlinear equations of theφ-strongly accretive type. J. Math. Anal. Appl.227, 319-334 (1998)