Volume 2013, Issue 1 464593
Research Article
Open Access

Faster Multistep Iterations for the Approximation of Fixed Points Applied to Zamfirescu Operators

Shin Min Kang

Shin Min Kang

Department of Mathematics and RINS, Gyeongsang National University, Jinju 660-701, Republic of Korea gnu.ac.kr

Search for more papers by this author
Ljubomir B. Ćirić

Ljubomir B. Ćirić

Faculty of Mechanical Engineering, University of Belgrade, Kraljice Marije 16, Belgrade 11000, Serbia bg.ac.rs

Search for more papers by this author
Arif Rafiq

Arif Rafiq

Department of Mathematics, Lahore Leads University, Lahore 54810, Pakistan leads.edu.pk

Search for more papers by this author
Faisal Ali

Faisal Ali

Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University, Multan 54000, Pakistan bzu.edu.pk

Search for more papers by this author
Young Chel Kwun

Corresponding Author

Young Chel Kwun

Department of Mathematics, Dong-A University, Pusan 614-714, Republic of Korea donga.ac.kr

Search for more papers by this author
First published: 08 October 2013
Citations: 1
Academic Editor: Salvador Romaguera

Abstract

By taking a counterexample, we prove that the multistep iteration process is faster than the Mann and Ishikawa iteration processes for Zamfirescu operators.

1. Introduction

Let C be a nonempty convex subset of a normed space E, and let T : CC be a mapping.

(a) For arbitrary x0C, the sequence {xn} defined by
where {bn} is a sequence in [0,1], is known as the Mann iteration process [1].
(b) For arbitrary x0C, the sequence {xn} defined by
where {bn} and are sequences in [0,1], is known as the Ishikawa iteration process [2].
(c) For arbitrary x0C, the sequence {xn} defined by
where {bn} and ,  i = 1,2, …, p − 2  (p ≥ 2), are sequences in [0,1] and denoted by (RSn), is known as the multistep iteration process [3].

Definition 1 (see [4].)Suppose that {an} and {bn} are two real convergent sequences with limits a and b, respectively. Then, {an} is said to converge faster than {bn} if

()

Definition 2 (see [4].)Let {un} and {vn} be two fixed-point iteration procedures which, both, converge to the same fixed point p, say, with error estimates,

()
where lim an = 0 = lim bn. If {an} converges faster than {bn}, then {un} is said to converge faster than {vn}.

Theorem 3 (see [5].)Let (X, d) be a complete metric space, and let T : XX be a mapping for which there exist real numbers a, b, and c satisfying a ∈ (0,1) and b, c ∈ (0, 1/2) such that, for each pair x, yX, at least one of the following is true:

  • (z1) d(Tx, Ty) ≤ ad(x, y),

  • (z2) d(Tx, Ty) ≤ b[d(x, Tx) + d(y, Ty)],

  • (z3) d(Tx, Ty) ≤ c[d(x, Ty) + d(y, Tx)].

Then, T has a unique fixed point p, and the Picard iteration {xn} defined by

()
converges to p for any x0X.

Remark 4. An operator T, which satisfies the contraction conditions (z1)–(z3) of Theorem 3, will be called a Zamfirescu operator [4, 6, 7].

In [6, 7], Berinde introduced a new class of operators on a normed space E satisfying

()
for any x, yE,  0 ≤ δ < 1, and L ≥ 0.

He proved that this class is wider than the class of Zamfirescu operators.

The following results are proved in [6, 7].

Theorem 5 (see [7].)Let C be a nonempty closed convex subset of a normed space E. Let T : CC be an operator satisfying (4). Let {xn} be defined through the iterative process (Mn) and x0C. If F(T) ≠ and , then {xn} converges strongly to the unique fixed point of T.

Theorem 6 (see [6].)Let C be a nonempty closed convex subset of an arbitrary Banach space E, and let T : CC be an operator satisfying (4). Let {xn} be defined through the iterative process (In) and x0C, where {bn} and are sequences of positive numbers in [0,1] with {bn} satisfying . Then, {xn} converges strongly to the fixed point of T.

The following result can be found in [8].

Theorem 7. Let C be a closed convex subset of an arbitrary Banach space E. Let the Mann and Ishikawa iteration processes with real sequences {bn} and satisfy 0 ≤ bn, , and . Then, (Mn) and (In) converge strongly to the unique fixed point of T. Let   T : CC be a Zamfirescu operator, and, moreover, the Mann iteration process converges faster than the Ishikawa iteration process to the fixed point of T.

In [4], Berinde proved the following result.

Theorem 8. Let C be a closed convex subset of an arbitrary Banach space E, and let T : CC be a Zamfirescu operator. Let {yn} be defined by (Mn) and y0C with a sequence {bn} in [0,1] satisfying . Then, {yn} converges strongly to the fixed point of T, and, moreover, the Picard iteration {xn} converges faster than the Mann iteration.

Remark 9. In [9], Qing and Rhoades by taking a counterexample showed that the Mann iteration process converges more slowly than the Ishikawa iteration process for Zamfirescu operators.

In this paper, we establish a general theorem to approximate fixed points of quasi-contractive operators in a Banach space through the multistep iteration process. Our result generalizes and improves upon, among others, the corresponding results of Babu and Vara Prasad [8] and Berinde [4, 6, 7].

We also prove that the Mann iteration process and the Ishikawa iteration process converge more slowly than the multistep iteration process for Zamfirescu operators.

2. Main Results

We now prove our main results.

Theorem 10. Let C be a nonempty closed convex subset of an arbitrary Banach space E, and let T : CC be an operator satisfying (4). Let {xn} be defined through the iterative process (RSn) and x0C, where {bn} and ,  i = 1,2, …, p − 2  (p ≥ 2), are sequences in [0,1] with . If F(T) ≠ , then F(T) is a singleton, and the sequence {xn} converges strongly to the fixed point of T.

Proof. Assume that F(T) ≠ and wF(T). Then, using (RSn), we have

()

Now, for x = w and , (4) gives

()
By substituting (6) in (5), we obtain
()

In a similar fashion, again by using (RSn), we can get

()
where i = 1,2, …, p − 2  (p ≥ 2) and
()
It can be easily seen that, for i = 1,2, …, p − 2  (p ≥ 2), we have
()

Substituting (9) in (10) gives us

()
It may be noted that, for δ ∈ [0,1) and {ηn}∈[0,1], the following inequality is always true:
()
From (11) and (12), we get
()
By repeating the same procedure, finally from (7) and (10), we yield
()
By (14), we inductively obtain
()
Using the fact that 0 ≤ δ < 1,  0 ≤ bn ≤ 1, and , it results that
()
which, by (15), implies that
()
Consequently, xnwF, and this completes the proof.

Now, by a counterexample, we prove that the multistep iteration process is faster than the Mann and Ishikawa iteration processes for Zamfirescu operators.

Example 11. Suppose that T : [0,1]→[0,1] is defined by Tx = (1/2)x;  , i = 1,2, …, p − 1  (p ≥ 2), and n = 1,2, …, 15;  ,  i = 1,2, …, p − 1  (p ≥ 2), and n ≥ 16. It is clear that T is a Zamfirescu operator with a unique fixed point 0 and that all of the conditions of Theorem 10 are satisfied. Also, Mn = x0 = In = RSn,  n = 1,2, …, 15. Suppose that x0 ≠ 0. For the Mann and Ishikawa iteration processes, we have

()
where i = 1,2, …, p − 2  (p ≥ 2) implies that
()
Now, consider
()
It is easy to see that
()
Hence,
()
Thus, the Mann iteration process converges more slowly than the multistep iteration process to the fixed point 0 of T.

Similarly,

()
with
()
implies that
()
Thus, the Ishikawa iteration process converges more slowly than the multistep iteration process to the fixed point 0 of T.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

    Acknowledgments

    The authors would like to thank the editor and the referees for their useful comments and suggestions. This study was supported by research funds from Dong-A University.

        The full text of this article hosted at iucr.org is unavailable due to technical difficulties.