1 Introduction

Developments in fixed point theory reflect that the iterative construction of fixed points is proposed and vigorously analyzed for various classes of maps in different spaces. The class of pseudocontractive mappings in their relation with iteration procedures has been studied by several researchers under suitable conditions; for more details, see [13] and the references therein. Also, the class of nonexpansive mappings via iteration methods has extensively been studied in this regard; see Tan and Xu [4]. The class of strongly pseudocontractive mappings has been studied by many researchers (see [57]) under certain conditions. Stability results established in metric space, normed linear space, and Banach space settings are available in the literature. There are several authors whose contributions are of colossal value in the study of stability of the fixed point iterative procedures: Imoru and Olatinwo [8], Olatinwo [9], Haghi et al. [10], Olatinwo and Postolache [11]. Reich and Zaslavski [12] in Chapter 2 established the existence and uniqueness of a fixed point for a generic mapping, convergence of the iterates of a nonexpansive mapping, stability of the fixed point under small perturbations of a mapping, convergence of Krasnosel’skii-Mann iterations of nonexpansive mappings, generic power convergence of order preserving mappings, and existence and uniqueness of positive eigenvalues and eigenvectors of order-preserving linear operators. They also studied the convergence of iterates of nonexpansive mappings in the presence of computational errors in this chapter. Harker and Hicks in [13] showed how a stability sequence could arise in practice and demonstrated the importance of investigating the stability of various iterative sequences for some kinds of nonlinear mappings.

The purpose in this paper is to study the modified Ishikawa iteration sequence with errors converging strongly to a fixed point of the uniformly Lipschitzian strongly successively pseudocontractive mapping under the lack of some conditions. On the other hand, the authors show that the modified Ishikawa iteration sequence with errors converges strongly to the unique solution of the equation Tx=f if T is a Lipschitzian strongly accretive mapping. The results of this paper improve and extend some recent results.

2 Preliminaries

Throughout this paper, we assume that E is a real Banach space with dual E . Suppose that , is the dual pair between E and E , and J:E 2 E is the normalized duality mapping defined by

J(x)= { f E : x , f = x 2 , f = x } ,xE.

First, we recall some concepts. A mapping T:EE is said to be:

  1. (i)

    uniformly Lipschizian if there exists a constant L>0 such that

    T n x T n y Lxyfor all x,yE,n1;
  2. (ii)

    strongly successively pseudocontractive if for every x,yE there exist t>1 and j(xy)J(xy) such that

    T n x T n y , j ( x y ) 1 t x y 2 for all n1;
    (2.1)
  3. (iii)

    strongly pseudocontractive if for every x,yE there exist t>1 and j(xy)J(xy) such that

    T x T y , j ( x y ) 1 t x y 2 .
    (2.2)

Example 2.1 Let E=R=(,) with the usual norm. Take K=[0,1] and define T:KK by

Tx={ 0 if  x = 0 , 1 9 if  x = 1 , x 1 3 n + 1 if  1 3 n + 1 x < 1 3 ( 1 3 n + 1 + 1 3 n ) , 1 3 n x if  1 3 ( 1 3 n + 1 + 1 3 n ) x < 1 3 n

for all n0. Then F(T)={0} and T is not continuous at x=1. We can verify that

Tx 1 3 x,xK.

Thus T 2 is continuous in K and T 2 K[0, 3 n ] for all n1. Then for any xK, there exists j(x0)J(x0) satisfying

T n x T n 0 , j ( x 0 ) = T n xx 1 3 x 2

for all n1. That is, T is a strongly successively pseudocontractive mapping.

Lemma 2.2 (see [[14], Lemma 1.1])

Let E be a Banach space and x,yE. Then xx+γy for all γ>0 if and only if there exists j(x)J(x) such that Rey,j(x)0.

In the sequel, let k= t 1 t , where t is the constant appearing in (2.1). It follows from (2.1) that

( ( 1 k ) I T n ) x ( ( 1 k ) I T n ) y , j ( x y ) 0.
(2.3)

Therefore, it follows from Lemma 2.2 and (2.3) that the definition of a strongly successively pseudocontractive mapping is equivalent to the following definition.

Definition 2.3 T is strongly successively pseudocontractive if there exists t>1 such that

xy x y + s [ ( ( 1 k ) I T n ) x ( ( 1 k ) I T n ) y ]
(2.4)

for all x,yE, s>0 and n1.

Definition 2.4 Let T:EE be a mapping. For a given x 0 E. { a n }, { b n } are sequences in [0,1], and { u n }, { v n } are sequences in E. The sequence { x n }E defined by

{ x n + 1 = ( 1 a n ) x n + a n T n z n + u n , z n = ( 1 b n ) x n + b n T n x n + v n , n = 0 , 1 , ,
(2.5)

is said to be a modified Ishikawa iteration sequence with errors.

The following lemmas will be needed in proving our main results.

Lemma 2.5 (see [15])

Let { λ n }, { μ n }, { c n } be nonnegative real sequences satisfying the inequality

λ n + 1 (1+ μ n ) λ n + c n ,n1.

If n = 1 μ n < and n = 1 c n <, then (i) lim n λ n exists, and (ii) in particular, if { λ n } has a subsequence { λ n k } converging to 0, then lim n λ n =0.

From Lemma 2.5 we have the following.

Lemma 2.6 Let { λ n }, { μ n }, { d n } be nonnegative real sequences satisfying

λ n + 1 (1 t n ) λ n + μ n λ n + c n + d n ,n1,
(2.6)

where { t n } is a sequence in [0,1] such that n = 1 t n =, n = 1 μ n <, n = 1 c n < and d n =o( t n ). Then λ n 0 as n.

Proof Since d n =o( t n ), there exists a natural number n 0 such that d n t n λ n 2 for n n 0 . It follows from (2.6) that

λ n + 1 ( 1 t n 2 ) λ n + μ n λ n + c n (1+ μ n ) λ n + c n ,n n 0 .

By Lemma 2.5, we see that lim n λ n exists. Therefore, there exists D>0 such that λ n D.

Let lim n λ n =δ, then δ=0. Indeed, if δ>0, there exists a natural number N 0 such that λ n (δ/2), d n ( t n λ n )/2 for n N 0 . It follows from (2.6) that

λ n + 1 λ n t n λ n + μ n λ n + c n + d n λ n t n λ n 2 +D μ n + c n .

This implies δ t n 4 λ n t n 2 λ n λ n + 1 +D μ n + c n , n N 0 . Therefore,

δ 4 i = N 0 n t n λ N 0 +D i = N 0 n μ j + i = N 0 n c n .

Note that n = 1 μ n < and n = 1 c n <, and we have n = 1 t n <, a contradiction with n = 1 t n =. Then lim n λ n =0. This completes the proof of Lemma 2.6. □

Let E be a Banach space and T a self-map of E. Suppose x 0 E and x n + 1 =f( x n ,T) defines an iteration procedure which yields a sequence of points { x n }E. Let F(T)={pE:Tp=p} denote the fixed point of T and let { x n } converge to a fixed point p of T. Let { y n }E and let ε n = y n + 1 f( y n ,T) be a sequence in [0,).

Definition 2.7 (see [13, 16, 17])

If lim n ε n =0 implies that lim n y n =p, then the iteration procedure defined by x n + 1 =f( x n ,T) is said to be T-stable. If n = 0 ε n < implies lim n y n =p, then the iteration procedure defined by x n + 1 =f( x n ,T) is said to be almost T-stable.

3 Main results

Theorem 3.1 Let T:EE be a uniformly Lipschitzian and strongly successively pseudocontractive mapping with F(T). Let { x n } be defined by (2.5) and { a n },{ b n }[0,1] and { u n },{ v n }E satisfying the conditions:

  1. (i)

    u n =o( a n ), v n 0 as n; n = 1 a n =;

  2. (ii)

    lim n sup a n <k/( ( L + 1 ) 3 +2) and n = 1 a n b n <.

Suppose { y n }E and define { ε n } by

s n = ( 1 b n ) y n + b n T n y n + v n , ε n = y n + 1 ( 1 a n ) y n a n T n s n u n , n 0 .

Then the following assertions hold:

  1. (1)

    { x n } converges strongly to a unique fixed point of T in E;

  2. (2)

    { x n } is almost T-stable;

  3. (3)

    if lim n ε n / a n =0 implies lim n y n =p, then the iteration procedure defined by x n + 1 =f( x n ,T) is said to be a weakly T-stable. Thus { x n } is also weakly T-stable.

Proof We will show that F(T) is a singleton. Indeed, if p 1 , p 2 F(T), by the definition of strongly successively pseudocontractive of T, there exists a j( p 1 p 2 )J( p 1 p 2 ) such that

p 1 p 2 2 = T p 1 T p 2 , j ( p 1 p 2 ) = T n p 1 T n p 2 , j ( p 1 p 2 ) 1 t p 1 p 2 2 ,

and, since t>1, this implies that p 1 = p 2 .

It follows from (2.5) that

z n p = ( 1 b n ) ( x n p ) + b n ( T n x n p ) + v n z n p ( 1 b n ) x n p + b n T n x n p + v n z n p x n p + T n x n p + v n z n p ( L + 1 ) x n p + v n ,
(3.1)
x n T n z n x n p+L z n p ( 1 + L ( L + 1 ) ) x n p+L v n .
(3.2)

It follows from (2.5), (3.1), and (3.2) that

T n x n + 1 T n z n L x n + 1 z n = L ( x n z n ) + a n ( T n z n x n ) + u n L x n z n + L a n T n z n x n + L u n = L b n ( x n T n x n ) v n + L a n T n z n x n + L u n L b n x n T n x n + L v n + L a n T n z n x n + u n L b n x n T n x n + L v n + L a n T n z n z n + L u n [ L ( L + 1 ) b n + L ( L 2 + L + 1 ) a n ] x n p + L ( 1 + L ) v n + L u n .
(3.3)

It follows from (2.5) that

x n = x n + 1 + a n x n a n T n z n u n = x n + 1 + ( 2 k ) a n x n a n T n z n ( 1 k ) a n x n u n = x n + 1 + ( 2 k ) a n ( x n + 1 + a n ( x n T n z n ) u n ) a n T n z n ( 1 k ) a n x n u n = ( 1 + a n ) x n + 1 + ( 1 k ) a n x n + 1 a n T n x n + 1 + a n T n x n + 1 a n T n z n + ( 2 k ) a n 2 ( x n T n z n ) ( 1 k ) a n x n ( 2 k ) a n u n u n = ( 1 + a n ) x n + 1 + a n ( I T n k I ) x n + 1 ( 1 k ) a n x n + ( 2 k ) a n 2 ( x n T n z n ) + a n ( T n x n + 1 T n z n ) [ ( 2 k ) a n + 1 ] u n .

For pF(T), we have p=(1+ a n )p+ a n (I T n kI)p(1k) a n p. Therefore, we get

x n p = ( 1 + a n ) ( x n + 1 p ) + a n [ ( I T n k I ) x n + 1 ( I T n k I ) p ] ( 1 k ) a n ( x n p ) + ( 2 k ) a n 2 ( x n T n z n ) + a n ( T n x n + 1 T n z n ) [ ( 2 k ) a n + 1 ] u n .
(3.4)

It follows from (3.4) and (2.4) that

x n p = ( 1 + a n ) ( x n + 1 p ) + a n [ ( I T n k I ) x n + 1 ( I T n k I ) p ] ( 1 k ) a n ( x n p ) + ( 2 k ) a n 2 ( x n T n z n ) + a n ( T n x n + 1 T n z n ) [ ( 2 k ) a n + 1 ] u n ( 1 + a n ) x n + 1 p ( 1 k ) a n x n p ( 2 k ) a n 2 x n T n z n a n T n x n + 1 T n z n [ ( 2 k ) a n + 1 ] u n ( 1 + a n ) x n + 1 p ( 1 k ) a n x n p ( 2 k ) a n 2 [ ( 1 + L + L 2 ) x n p + L v n ] a n [ L ( L + 1 ) b n + L ( L 2 + L + 1 ) a n ] x n p L a n u n L ( L + 1 ) a n v n [ ( 2 k ) a n + 1 ] u n .

Since ( 1 + a n ) 1 1, ( 1 + a n ) 1 1 a n + a n 2 , and (1+(1k) a n )(1 a n + a n 2 )=1k a n +k a n 2 +(1k) a n 3 1k a n +k a n 2 +(1k) a n 2 =1k a n + a n 2 , we have

x n + 1 p 1 + ( 1 k ) a n 1 + a n x n p + [ L ( L + 1 ) a n b n + ( L 3 + 3 L 2 + 3 L + 2 ) a n 2 ] x n p + ( L + 3 ) u n + L ( L + 3 ) a n v n ( 1 + ( 1 k ) a n ) ( 1 a n + a n 2 ) x n p + [ L ( L + 1 ) a n b n + ( L 3 + 3 L 2 + 3 L + 2 ) a n 2 ] x n p + ( L + 3 ) u n + L ( L + 3 ) a n v n ( 1 k a n ) x n p + [ L ( L + 1 ) a n b n + ( L 3 + 3 L 2 + 3 L + 3 ) a n 2 ] x n p + ( L + 3 ) u n + L ( L + 3 ) a n v n .
(3.5)

Note that lim n sup a n <k/( ( L + 1 ) 3 +2), then there exists a natural number N 1 such that γ= sup n N 1 a n <k/( ( L + 1 ) 3 +2). It follows from (3.5) that

x n + 1 p [ 1 ( k γ ( ( L + 1 ) 3 + 2 ) ) a n ] x n p + L ( L + 1 ) a n b n x n p + ( L + 3 ) u n + L ( L + 3 ) a n v n
(3.6)

holds for n N 1 . Let λ n := x n p, μ n :=L(L+1) a n b n , c n =0, d n :=(L+3) u n +L(L+3) a n v n , t n :=(kγ( ( L + 1 ) 3 +2)) a n . Thus, (3.6) becomes

λ n + 1 (1 t n ) λ n + μ n λ n + d n ,n N 1 .

Since n = 1 μ n <, d n =o( t n ), it follows from Lemma 2.6 that we have lim n λ n =0. That is, { x n } converges strongly to p.

Next, we prove the conclusion (2). Let

p n =(1 a n ) y n + a n T n s n + u n .
(3.7)

For pF(T), we have

y n + 1 p = y n + 1 ( 1 a n ) y n a n T n s n u n + ( 1 a n ) y n + a n T n s n + u n p ε n + p n p .
(3.8)

It follows from (3.7) that

y n = p n + a n y n a n T n s n u n = ( 1 + a n ) p n + a n ( I T n k I ) p n ( 1 k ) a n y n + ( 2 k ) a n 2 ( y n T n s n ) + a n ( T n p n T n s n ) [ ( 2 k ) a n + 1 ] u n .

By using a similar method to proving (3.6), we can prove that

p n p [ 1 ( k γ ( ( L + 1 ) 3 + 2 ) ) a n ] y n p + L ( L + 1 ) a n b n y n p + ( L + 3 ) u n + L ( L + 3 ) a n v n .
(3.9)

Substituting (3.9) into (3.8) for n N 0 we get

y n + 1 p [ 1 ( k γ ( ( L + 1 ) 3 + 2 ) ) a n ] y n p + L ( L + 1 ) a n b n y n p + ( L + 3 ) u n + L ( L + 3 ) a n v n + ε n .
(3.10)

If n = 1 ε n <, setting λ n := y n p, μ n :=L(L+1) a n b n , c n = ε n , d n :=(L+3) u n +L(L+3) a n v n , t n :=(kγ( ( L + 1 ) 3 +2)) a n in Lemma 2.6, we have y n p as n, i.e., { x n } is almost T-stable.

If lim n ε n a n =0, setting λ n := y n p, μ n :=L(L+1) a n b n , c n =0, d n :=(L+3) u n +L(L+3) a n v n + ε n , t n :=(kγ( ( L + 1 ) 3 +2)) a n in Lemma 2.6, we have y n p as n, i.e., { x n } is weakly T-stable. This completes the proof. □

Similar to the proof of Theorem 3.1, we have the following.

Theorem 3.2 Let T:EE be a uniformly Lipschitzian and strictly asymptotically pseudocontractive mapping with F(T). Let { x n } be defined by (2.5). Assume that { a n },{ b n }[0,1] and { u n },{ v n }E satisfy the conditions:

  1. (i)

    u n =o( a n ), v n 0 as n;

  2. (ii)

    there exists δ(0,1k) such that lim n sup a n <δ/( ( L + 1 ) 3 +2);

  3. (iii)

    n = 1 a n b n < and n = 1 a n =.

Suppose { y n }E and define { ε n } by

s n = ( 1 b n ) y n + b n T n y n + v n , ε n = y n + 1 ( 1 a n ) y n a n T n s n u n , n 0 .

Then the following assertions hold:

  1. (1)

    { x n } converges strongly to a unique fixed point of T in E;

  2. (2)

    { x n } is both almost T-stable and weakly T-stable.

Theorem 3.3 Let T:EE be a Lipschitzian and strongly accretive mapping. Let { a n },{ b n }[0,1], and { u n },{ v n }E satisfy the conditions:

  1. (i)

    u n =o( a n ), v n 0 as n;

  2. (ii)

    lim n sup a n <k/( ( L + 1 ) 3 +2), where k is the constant of strongly accretive mapping T, and L is the Lipschitzian constant of mapping IT;

  3. (iii)

    n = 1 a n b n < and n = 1 a n =.

For arbitrary x 0 E, the sequence { x n } defined by

{ x n + 1 = ( 1 a n ) x n + a n ( f + ( I T ) z n ) + u n , z n = ( 1 b n ) x n + b n ( f + ( I T ) x n ) + v n , n 0 ,
(3.11)

converges strongly to a solution p of Tx=f.

Proof From the result of [5], we obtain the existence of a solution for Tx=f. Since T is strongly accretive with a constant k(0,1), we can prove that the solution of Tx=f is unique. Define Sx=f+(IT)x, then S is a strongly pseudocontractive mapping and has a fixed point p, and it is also a Lipschitzian mapping with a constant L. For all x,yE, there exists s>0 such that

xy x y + s [ ( ( 1 k ) I S ) x ( ( 1 k ) I S ) y ] .

The rest of the proof is similar to the proof of Theorem 3.1. This completes the proof. □

Remark 3.4 (1) Theorem 3.3 extends the main result of [6] from a uniformly smooth Banach space to a real Banach space and without the boundedness assumption of D(T)=R(T) and lim n a n = lim n b n =0; (2) Theorem 3.3 extends and improves the corresponding results of [7] by removing the assumptions b n a n and n = 1 a n 2 <.