SpringerOpen Newsletter

Receive periodic news and updates relating to SpringerOpen.

Open Access Research Article

On Equivalence of Some Iterations Convergence for Quasi-Contraction Maps in Convex Metric Spaces

Zhiqun Xue1*, Guiwen Lv1 and BE Rhoades2

Author Affiliations

1 Department of Mathematics and Physics, Shijiazhuang Railway University, Shijiazhuang 050043, China

2 Department of Mathematics, Indiana University, Bloomington, IN 47405-7106, USA

For all author emails, please log on.

Fixed Point Theory and Applications 2010, 2010:252871  doi:10.1155/2010/252871

The electronic version of this article is the complete one and can be found online at: http://www.fixedpointtheoryandapplications.com/content/2010/1/252871


Received:23 July 2010
Accepted:9 September 2010
Published:19 September 2010

© 2010 Zhiqun Xue et al.

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

We show the equivalence of the convergence of Picard and Krasnoselskij, Mann, and Ishikawa iterations for the quasi-contraction mappings in convex metric spaces.

1. Introduction

Let be a complete metric space and . Denote . A continuous mapping W is said to be a convex structure on [1] if for all with such that

(11)

(12)

If satisfies the conditions of convex structure, then is called convex metric space that is denoted as .

In the following part, we will consider a few iteration sequences in convex metric space . Suppose that is a self-map of .

Picard iteration is as follows:

(13)

Krasnoselskij iteration is as follows:

(14)

where .

Mann iteration is as follows:

(15)

where .

Ishikawa iteration is as follows:

(16)

where for all .

A mapping is called contractive if there exists such that

(17)

for all .

The map is called Kannan mapping [2] if there exists such that

(18)

for all .

A similar definition of mapping is due to the work Chatterjea [3] (that is called Chatterjea mapping), if there exists such that

(19)

for all .

Combining above three definitions, Zamfirescu [4] showed the following result.

Theorem 1.1.

Let be a complete metric space and a mapping for which there exist the real numbers and satisfying such that, for any pair , at least one of the following conditions holds:

(z1)  

(z2)  

(z3)  

Then has a unique fixed point, and the Picard iteration converges to fixed point. This class mapping is called Zamfirescu mapping.

In 1974, irić [5] introduced one of the most general contraction mappings and obtained that the unique fixed point can be approximated by Picard iteration. This mapping is called quasi-contractive if there exists such that

(110)

for any .

Clearly, every quasi-contraction mapping is the most general of above mappings.

Later on, in 1992, Xu [6] proved that Ishikawa iteration can also be used to approximate the fixed points of quasi-contraction mappings in real Banach spaces.

Theorem 1.2.

Let be any nonempty closed convex subset of a Banach space and a quasi-contraction mapping. Suppose that for all and . Then the Ishikawa iteration sequence defined by (1)–(3) converges strongly to the unique fixed point of .

In this paper, we will show the equivalence of the convergence of Picard and Krasnoselskij, Mann, and Ishikawa iterations for the quasi-contraction mappings in convex metric spaces.

Lemma 1.3.

Let be a nonnegative sequence which satisfies the following inequality

(111)

where , and as . Then as (see [7]).

2. Results for Quasi-Contraction Mappings

Theorem 2.1.

Let be a convex metric space, a quasi-contraction mapping with . Suppose that are defined by the iterative processes (1.3) and (1.4), respectively. Then, the following two assertions are equivalent:

(i)Picard iteration (1.3) converges strongly to the unique fixed point ;

(ii)Krasnoselskij iteration (1.4) converges strongly to the unique fixed point .

Proof.

First, we show , that is, as as .

From (1.3), (1.4), and (1.1), we can get

(21)

Next, we consider . Using (1.10) with , to obtain

(22)

Set

(23)

Then is bounded. Without loss of generality, we let for each . Indeed, we will show this conclusion from the some following cases.

Case 1 .

Let for some . Then, from (1.10) and the above , we have

(24)

and it leads to a contradiction. Thus, . Similarity to or is also impossible.

Case 2 .

Let for some .

(i)If , then .

(ii)If , then, from (1.4) and (1.1)

(25)

that is, . By induction on , we can obtain .

(iii) If , from (1.4) and (1.1)

(26)

it implies that . By induction on , we can get .

Case 3 .

Let for some . Without loss of generality, we set . Then, from (1.4), (1.1)

(27)

it implies that , and by induction on , we may get , which is a contradiction.

Case 4 .

Let for some .

(i)If , then .

(ii)If , from (1.4), (1.1), then

(28)

it implies that and by induction on , then .

Case 5 .

Let for some .

(i)If , then .

(ii)If , then, from (1.3) and (1.10)

(29)

this is a contradiction.

Case 6 .

let for some .

(i)If , then .

(ii)If , then, from (1.4) and (1.10)

(210)

it implies that .

Case 7 .

Let for some .

(i)If , then .

(ii)If , then, from (1.3), (1.10)

(211)

it is a contradiction.

Case 8 .

let for some .

(i)If , then .

(ii)If , then, from (1.3) and (1.10)

(212)

which is a contradiction.

Set

(213)

where .

In view of the above cases, then , and we obtain that is bounded.

Indeed, suppose that for some . Then,

(214)

which implies that . Similarly, if or , we also obtain .

On the other hand, suppose that for some . Then,

(215)

which implies that . Similarly, if or , we also obtain . Therefore, from the above results, we obtain that , that is, is bounded.

For each , define

(216)

Then, using the same proof above, it can be shown that

(217)

If , and using (1.1) and (1.4), then

(218)

as . Since , hence as . Similarly, if or , , we may obtain the similar results. Therefore, from (2.1), we get

(219)

where

In (2.19), set . Then (2.19) is as follows:

(220)

By Lemma 1.3, we have as . From the inequality , we have .

Conversely, we will prove that . If , then is Picard iteration.

Theorem 2.2.

Let be as in Theorem 2.1. Suppose that are defined by the iterative processes (1.5) and (1.6), respectively, and are real sequences in such that . Then, the following two assertions are equivalent:

(i)Mann iteration (1.5) converges strongly to the unique fixed point ;

(ii)Ishikawa iteration (1.6) converges strongly to the unique fixed point .

Proof.

If the Ishikawa iteration (1.6) converges strongly to , then setting , in (1.6), we can get the convergence of Mann iteration (1.5). Conversely, we will show that . Letting , we want to prove .

From (1.5) and (1.6),

(221)

Using (1.10) with , to obtain

(222)

set

(223)

Applying the similar proof methods of Theorem 2.1, we obtain that is also bounded. The other proof is the same as that of Theorem 2.1 and is here omitted.

Acknowledgments

The authors are extremely grateful to Professor B. E. Rhoades of Indiana University for providing useful information and many help. They also thank the referees for their valuable comments and suggestions.

References

  1. Takahashi, W: A convexity in metric space and nonexpansive mappings. I. Kōdai Mathematical Seminar Reports. 22, 142–149 (1970). PubMed Abstract | Publisher Full Text OpenURL

  2. Kannan, R: Some results on fixed points. Bulletin of the Calcutta Mathematical Society. 60, 71–76 (1968)

  3. Chatterjea, SK: Fixed-point theorems. Comptes Rendus de l'Académie Bulgare des Sciences. 25, 727–730 (1972)

  4. Zamfirescu, T: Fix point theorems in metric spaces. Archiv der Mathematik. 23, 292–298 (1972). Publisher Full Text OpenURL

  5. Ćirić, LB: A generalization of Banach's contraction principle. Proceedings of the American Mathematical Society. 45, 267–273 (1974)

  6. Xu, HK: A note on the Ishikawa iteration scheme. Journal of Mathematical Analysis and Applications. 167(2), 582–587 (1992). Publisher Full Text OpenURL

  7. Weng, X: Fixed point iteration for local strictly pseudo-contractive mapping. Proceedings of the American Mathematical Society. 113(3), 727–731 (1991). Publisher Full Text OpenURL