Mann-Ishikawa iterations and Mann-Ishikawa iterations with errors are equivalent models

Abstract


Mann-Ishikawa iterations and Mann-Ishikawa iterations with errors are equivalent models for several classes of operators.

Authors

Stefan M. Soltuz
Tiberiu Popoviciu Institute of Numerical Analysis

Keywords

Mann-Ishikawa iterations, Mann-Ishikawa iterations with errors

Paper coordinates

Ş.M. Şoltuz, Mann-Ishikawa iterations and Mann-Ishikawa iterations with errors are equivalent models, Math. Commun. 8 (2003) no. 2, 139-151.

PDF

About this paper

Journal

Mathematical Communications

Publisher Name
DOI
Print ISSN

 

Online ISSN

1848-8013

google scholar link

[1] K. Deimling, Zeroes of accretive operators, Manuscripta Math. 13(1974), 365-374.
[2] S. Ishikawa, Fixed points by a new iteration method, Proc. Amer. Math. Soc. 44(1974), 147-150.
[3] L.-S. Liu, Ishikawa and Mann iterative process with errors for nonlinear strongly accretive mappings in Banach spaces, J. Math. Anal. Appl. 194(1995), 114-125.
[4] W. R. Mann, Mean value in iteration, Proc. Amer. Math. Soc. 4(1953), 506-510.
[5] R. H. Martin Jr, A global existence theorem for autonomous differential equations in Banach spaces, Proc. Amer. Math. Soc. 26(1970), 307-314.
[6] C. Morales, Surjectivity theorems for multi-valued mappings of accretive type, Comm. Math. Univ. Carolinae 26(1985), 397-413.
[7] B. E. Rhoades, Comments on two fixed point iteration methods, J. Math. Anal. Appl. 56(1976), 741-750.
[8] B. E. Rhoades, S¸. M. S¸oltuz, On the equivalence of Mann and Ishikawa iteration methods, International Journal of Mathematicsand Mathematical Science 33(2003), 451-459.

Paper (preprint) in HTML form

Mann-Ishikawa iterations and Mann-Ishikawa iterations with errors are equivalent models

Ştefan M. Şoltuz
Abstract

Mann-Ishikawa iterations and Mann-Ishikawa iterations with errors are equivalent models for several classes of operators.

Key words: Mann-Ishikawa iterations, Mann-Ishikawa iterations with errors

AMS subject classifications: 47 H 10
Received February 14, 2003
Accepted March 19, 2003

1. Preliminaries

Introduced in [4], Mann iteration is a viable method to approximate the fixed point of an operator, when Banach principle is not functional. Let XX be a Banach space, let T:XXT:X\rightarrow X be a map. Let x1Xx_{1}\in X. Mann iteration is given by:

xn+1=(1αn)xn+αnTxn.x_{n+1}=\left(1-\alpha_{n}\right)x_{n}+\alpha_{n}Tx_{n}. (1)

The sequence (αn)n(0,1)\left(\alpha_{n}\right)_{n}\subset(0,1) is convergent, such that limnαn=0\lim_{n\rightarrow\infty}\alpha_{n}=0, and n=1αn=\sum_{n=1}^{\infty}\alpha_{n}=\infty. Ishikawa introduced later in [2] the following iteration,

xn+1\displaystyle x_{n+1} =(1αn)xn+αnTyn,\displaystyle=\left(1-\alpha_{n}\right)x_{n}+\alpha_{n}Ty_{n}, (2)
yn\displaystyle y_{n} =(1βn)xn+βnTxn,n=1,2,\displaystyle=\left(1-\beta_{n}\right)x_{n}+\beta_{n}Tx_{n},\quad n=1,2,\ldots

Sequences (αn)n,(βn)n(0,1)\left(\alpha_{n}\right)_{n},\left(\beta_{n}\right)_{n}\subset(0,1) are convergent such that

limnαn=0,limnβn=0, and n=1αn=.\lim_{n\rightarrow\infty}\alpha_{n}=0,\lim_{n\rightarrow\infty}\beta_{n}=0,\text{ and }\sum_{n=1}^{\infty}\alpha_{n}=\infty.

In [2] the conditions on the above sequences were 0<αnβn<10<\alpha_{n}\leq\beta_{n}<1. A better condition, introduced in [7], is 0<αn,βn<10<\alpha_{n},\beta_{n}<1. Now, letting βn=0,nN\beta_{n}=0,\forall n\in N from Ishikawa iteration (2), we get Mann iteration (1). Let us consider the following iteration, see [3]:

un+1=(1αn)un+αnTun+en.u_{n+1}=\left(1-\alpha_{n}\right)u_{n}+\alpha_{n}Tu_{n}+e_{n}. (3)
00footnotetext: "T. Popoviciu" Institute of Numerical Analysis, P.O. Box 68-1, 3400 Cluj-Napoca, Romania, e-mail: soltuzul@yahoo.com, soltuz@itwm.fhg.de, stefansoltuz@personal.ro

Errors (en)nX\left(e_{n}\right)_{n}\subset X satisfy n=1en<\sum_{n=1}^{\infty}\left\|e_{n}\right\|<\infty. This iteration is known as Mann iteration with errors. In [3] Ishikawa iteration with errors is defined as

un+1\displaystyle u_{n+1} =(1αn)un+αnTvn+pn\displaystyle=\left(1-\alpha_{n}\right)u_{n}+\alpha_{n}Tv_{n}+p_{n} (4)
vn\displaystyle v_{n} =(1βn)un+βnTun+qn,n=1,2,\displaystyle=\left(1-\beta_{n}\right)u_{n}+\beta_{n}Tu_{n}+q_{n},\quad n=1,2,\ldots

Errors (pn)n,(qn)n\left(p_{n}\right)_{n},\left(q_{n}\right)_{n} and (en)nX\left(e_{n}\right)_{n}\subset X satisfy

n=1pn<,limnqn=0,n=1en<\sum_{n=1}^{\infty}\left\|p_{n}\right\|<\infty,\lim_{n\rightarrow\infty}\left\|q_{n}\right\|=0,\sum_{n=1}^{\infty}\left\|e_{n}\right\|<\infty (5)

where (αn)n\left(\alpha_{n}\right)_{n} and (βn)n\left(\beta_{n}\right)_{n} are the same as those from (1)and (2). When en=0e_{n}=0, respectively pn=qn=0,nNp_{n}=q_{n}=0,\forall n\in N then we deal with Mann and Ishikawa iteration.

In [8] it was proven that for several classes of Lipschitzian operators, Mann and Ishikawa iteration methods are equivalent. We will prove further that Mann and Ishikawa iterations are equivalent models with Mann and Ishikawa iterations with errors. Thus the study of convergence of the above iterations is reduced to the study of Mann iteration, which is more convenient to be used.

Let us denote the identity map by II.
Definition 1. Let XX be a real Banach space. A map T:XXT:X\rightarrow X is called strongly pseudocontractive if there exists k(0,1)k\in(0,1) such that we have

xyxy+r[(ITkI)x(ITkI)y],\|x-y\|\leq\|x-y+r[(I-T-kI)x-(I-T-kI)y]\|, (6)

for all x,yXx,y\in X, and r>0r>0.
The following lemma can be found in [3].
Lemma 1 [[3]]. Let (an)n\left(a_{n}\right)_{n} be a nonnegative sequence which satisfies the following inequality

an+1(1λn)an+σn+wna_{n+1}\leq\left(1-\lambda_{n}\right)a_{n}+\sigma_{n}+w_{n} (7)

where λn(0,1),wn0,n,n=1λn=,n=1wn<\lambda_{n}\in(0,1),w_{n}\geq 0,\forall n\in\mathbb{N},\sum_{n=1}^{\infty}\lambda_{n}=\infty,\sum_{n=1}^{\infty}w_{n}<\infty, and σn=o(λn)\sigma_{n}=o\left(\lambda_{n}\right). Then limnan=0\lim_{n\rightarrow\infty}a_{n}=0.

2. Main result

Let us denote F(T)={x:Tx=x}F(T)=\left\{x^{*}:Tx^{*}=x^{*}\right\}. We are able now to give the following result:

Theorem 1. Let XX be a Banach space and let T:XXT:X\rightarrow X be a Lipschitzian with L1L\geq 1, strongly pseudocontractive map. If u1=x1Xu_{1}=x_{1}\in X, let limnαn=\lim_{n\rightarrow\infty}\alpha_{n}= 0 , limnβn=0\lim_{n\rightarrow\infty}\beta_{n}=0, and n=1αn=\sum_{n=1}^{\infty}\alpha_{n}=\infty, suppose that for iteration (4) the errors satisfy (5); then the following two assertions are equivalent:
(i) Ishikawa iteration (2) converges to xF(T)x^{*}\in F(T),
(ii) Ishikawa iteration with errors (4) converges to the same xF(T)x^{*}\in F(T).

Proof. Corollary 1 from [1] assures that F(T)F(T)\neq\emptyset; strong pseudocontractivity assures the uniqueness of the fixed point.

Supposing Ishikawa iteration with errors (4) converges and taking pn=qn=0,nNp_{n}=q_{n}=0,\forall n\in N, we get the convergence of (2). We will prove that the convergence of Ishikawa iteration (2) implies the convergence of Ishikawa iteration with errors (4). The proof is similar to the proof of Theorem 4 from [8]. We have

xn=\displaystyle x_{n}= xn+1+αnxnαnTyn\displaystyle x_{n+1}+\alpha_{n}x_{n}-\alpha_{n}Ty_{n} (8)
=\displaystyle= (1+αn)xn+1+αn(ITkI)xn+1+\displaystyle\left(1+\alpha_{n}\right)x_{n+1}+\alpha_{n}(I-T-kI)x_{n+1}+
(2k)αnxn+1+αnxn+αn(Txn+1Tyn)\displaystyle-(2-k)\alpha_{n}x_{n+1}+\alpha_{n}x_{n}+\alpha_{n}\left(Tx_{n+1}-Ty_{n}\right)
=\displaystyle= (1+αn)xn+1+αn(ITkI)xn+1+\displaystyle\left(1+\alpha_{n}\right)x_{n+1}+\alpha_{n}(I-T-kI)x_{n+1}+
(2k)αn[(1αn)xn+αnTyn]+αnxn+αn(Txn+1Tyn)\displaystyle-(2-k)\alpha_{n}\left[\left(1-\alpha_{n}\right)x_{n}+\alpha_{n}Ty_{n}\right]+\alpha_{n}x_{n}+\alpha_{n}\left(Tx_{n+1}-Ty_{n}\right)
=\displaystyle= (1+αn)xn+1+αn(ITkI)xn+1+\displaystyle\left(1+\alpha_{n}\right)x_{n+1}+\alpha_{n}(I-T-kI)x_{n+1}+
(1k)αnxn+(2k)αn2(xnTyn)+αn(Txn+1Tyn)\displaystyle-(1-k)\alpha_{n}x_{n}+(2-k)\alpha_{n}^{2}\left(x_{n}-Ty_{n}\right)+\alpha_{n}\left(Tx_{n+1}-Ty_{n}\right)

Also

un=\displaystyle u_{n}= un+1+αnunαnTvnpn\displaystyle u_{n+1}+\alpha_{n}u_{n}-\alpha_{n}Tv_{n}-p_{n} (9)
=\displaystyle= (1+αn)un+1+αn(ITkI)un+1+\displaystyle\left(1+\alpha_{n}\right)u_{n+1}+\alpha_{n}(I-T-kI)u_{n+1}+
(2k)αnun+1+αnun+αn(Tun+1Tvn)pn\displaystyle-(2-k)\alpha_{n}u_{n+1}+\alpha_{n}u_{n}+\alpha_{n}\left(Tu_{n+1}-Tv_{n}\right)-p_{n}
=\displaystyle= (1+αn)un+1+αn(ITkI)un+1+\displaystyle\left(1+\alpha_{n}\right)u_{n+1}+\alpha_{n}(I-T-kI)u_{n+1}+
(2k)αn[(1αn)un+αnTvn+pn]+\displaystyle-(2-k)\alpha_{n}\left[\left(1-\alpha_{n}\right)u_{n}+\alpha_{n}Tv_{n}+p_{n}\right]+
+αnun+αn(Tun+1Tvn)pn\displaystyle+\alpha_{n}u_{n}+\alpha_{n}\left(Tu_{n+1}-Tv_{n}\right)-p_{n}
=\displaystyle= (1+αn)un+1+αn(ITkI)un+1+\displaystyle\left(1+\alpha_{n}\right)u_{n+1}+\alpha_{n}(I-T-kI)u_{n+1}+
(1k)αnun+(2k)αn2(unTvn)+αn(Tun+1Tvn)\displaystyle-(1-k)\alpha_{n}u_{n}+(2-k)\alpha_{n}^{2}\left(u_{n}-Tv_{n}\right)+\alpha_{n}\left(Tu_{n+1}-Tv_{n}\right)
pn(2k)αnpn\displaystyle-p_{n}-(2-k)\alpha_{n}p_{n}
=\displaystyle= (1+αn)un+1+αn(ITkI)un+1+\displaystyle\left(1+\alpha_{n}\right)u_{n+1}+\alpha_{n}(I-T-kI)u_{n+1}+
(1k)αnun+(2k)αn2(unTvn)+αn(Tun+1Tvn)\displaystyle-(1-k)\alpha_{n}u_{n}+(2-k)\alpha_{n}^{2}\left(u_{n}-Tv_{n}\right)+\alpha_{n}\left(Tu_{n+1}-Tv_{n}\right)
pn(1+(2k)αn)\displaystyle-p_{n}\left(1+(2-k)\alpha_{n}\right)

From (8) and (9) we get

xnun=\displaystyle x_{n}-u_{n}= (1+αn)(xn+1un+1)\displaystyle\left(1+\alpha_{n}\right)\left(x_{n+1}-u_{n+1}\right) (10)
+αn((ITkI)xn+1(ITkI)un+1)\displaystyle+\alpha_{n}\left((I-T-kI)x_{n+1}-(I-T-kI)u_{n+1}\right)
(1k)αn(xnun)+(2k)αn2(xnunTyn+Tvn)\displaystyle-(1-k)\alpha_{n}\left(x_{n}-u_{n}\right)+(2-k)\alpha_{n}^{2}\left(x_{n}-u_{n}-Ty_{n}+Tv_{n}\right)
+αn(Txn+1Tun+1Tyn+Tvn)+pn(1+(2k)αn)\displaystyle+\alpha_{n}\left(Tx_{n+1}-Tu_{n+1}-Ty_{n}+Tv_{n}\right)+p_{n}\left(1+(2-k)\alpha_{n}\right)

Taking (1+αn)(xn+1un+1)+αn((ITkI)xn+1(ITkI)un+1)\left(1+\alpha_{n}\right)\left(x_{n+1}-u_{n+1}\right)+\alpha_{n}\left((I-T-kI)x_{n+1}-(I-T-kI)u_{n+1}\right) in norm we have

(1+αn)(xn+1un+1)+αn((ITkI)xn+1(ITkI)un+1)\displaystyle\left\|\left(1+\alpha_{n}\right)\left(x_{n+1}-u_{n+1}\right)+\alpha_{n}\left((I-T-kI)x_{n+1}-(I-T-kI)u_{n+1}\right)\right\|
=(1+αn)(xn+1un+1)+αn1+αn((ITkI)xn+1(ITkI)un+1)\displaystyle=\left(1+\alpha_{n}\right)\left\|\left(x_{n+1}-u_{n+1}\right)+\frac{\alpha_{n}}{1+\alpha_{n}}\left((I-T-kI)x_{n+1}-(I-T-kI)u_{n+1}\right)\right\|

and using (6) with x:=xn+1x:=x_{n+1} and y:=un+1y:=u_{n+1}, we obtain

(1+αn)(xn+1un+1)+αn((ITkI)xn+1(ITkI)un+1)\displaystyle\left\|\left(1+\alpha_{n}\right)\left(x_{n+1}-u_{n+1}\right)+\alpha_{n}\left((I-T-kI)x_{n+1}-(I-T-kI)u_{n+1}\right)\right\|
(1+αn)xn+1un+1.\displaystyle\geq\left(1+\alpha_{n}\right)\left\|x_{n+1}-u_{n+1}\right\|. (11)

Taking the norm in (10) and then using (11), we get

xnun\displaystyle\left\|x_{n}-u_{n}\right\|
(1+αn)(xn+1un+1)+αn((ITkI)xn+1(ITkI)un+1)\displaystyle\geq\left\|\left(1+\alpha_{n}\right)\left(x_{n+1}-u_{n+1}\right)+\alpha_{n}\left((I-T-kI)x_{n+1}-(I-T-kI)u_{n+1}\right)\right\|
(1k)αnxnun(2k)αn2xnunTyn+Tvn\displaystyle\quad-(1-k)\alpha_{n}\left\|x_{n}-u_{n}\right\|-(2-k)\alpha_{n}^{2}\left\|x_{n}-u_{n}-Ty_{n}+Tv_{n}\right\|
αnTxn+1Tun+1Tyn+Tvnpn(1+(2k)αn)\displaystyle\quad-\alpha_{n}\left\|Tx_{n+1}-Tu_{n+1}-Ty_{n}+Tv_{n}\right\|-\left\|p_{n}\right\|\left(1+(2-k)\alpha_{n}\right)
(1+αn)xn+1un+1(1k)αnxnun(2k)αn2\displaystyle\geq\left(1+\alpha_{n}\right)\left\|x_{n+1}-u_{n+1}\right\|-(1-k)\alpha_{n}\left\|x_{n}-u_{n}\right\|-(2-k)\alpha_{n}^{2}
xnunTyn+TvnαnTxn+1Tun+1Tyn+Tvn\displaystyle\quad\left\|x_{n}-u_{n}-Ty_{n}+Tv_{n}\right\|-\alpha_{n}\left\|Tx_{n+1}-Tu_{n+1}-Ty_{n}+Tv_{n}\right\|
pn(1+(2k)αn).\displaystyle\quad-\left\|p_{n}\right\|\left(1+(2-k)\alpha_{n}\right).

We obtain

(1+αn)xn+1un+1\displaystyle\left(1+\alpha_{n}\right)\left\|x_{n+1}-u_{n+1}\right\| (12)
(1+(1k)αn)xnun+(2k)αn2xnunTyn+Tvn\displaystyle\leq\left(1+(1-k)\alpha_{n}\right)\left\|x_{n}-u_{n}\right\|+(2-k)\alpha_{n}^{2}\left\|x_{n}-u_{n}-Ty_{n}+Tv_{n}\right\|
+αnTxn+1Tun+1Tyn+Tvn+pn(1+(2k)αn)\displaystyle+\alpha_{n}\left\|Tx_{n+1}-Tu_{n+1}-Ty_{n}+Tv_{n}\right\|+\left\|p_{n}\right\|\left(1+(2-k)\alpha_{n}\right)
(1+(1k)αn)xnun+(2k)αn2unTvn\displaystyle\leq\left(1+(1-k)\alpha_{n}\right)\left\|x_{n}-u_{n}\right\|+(2-k)\alpha_{n}^{2}\left\|u_{n}-Tv_{n}\right\|
+(2k)αn2xnTyn+αnTxn+1Tyn\displaystyle+(2-k)\alpha_{n}^{2}\left\|x_{n}-Ty_{n}\right\|+\alpha_{n}\left\|Tx_{n+1}-Ty_{n}\right\|
+αnTun+1Tvn+pn(1+(2k)αn).\displaystyle+\alpha_{n}\left\|Tu_{n+1}-Tv_{n}\right\|+\left\|p_{n}\right\|\left(1+(2-k)\alpha_{n}\right).

We aim to evaluate unTvn\left\|u_{n}-Tv_{n}\right\| and Tun+1Tvn\left\|Tu_{n+1}-Tv_{n}\right\| :

unTvn\displaystyle\left\|u_{n}-Tv_{n}\right\| unxn+xnTxn+TxnTvn\displaystyle\leq\left\|u_{n}-x_{n}\right\|+\left\|x_{n}-Tx_{n}\right\|+\left\|Tx_{n}-Tv_{n}\right\|
xnun+xnTxn+Lxnvn\displaystyle\leq\left\|x_{n}-u_{n}\right\|+\left\|x_{n}-Tx_{n}\right\|+L\left\|x_{n}-v_{n}\right\|
xnvn\displaystyle\left\|x_{n}-v_{n}\right\| (13)
=(1βn)(xnun)+βn(xnTun)qn\displaystyle=\left\|\left(1-\beta_{n}\right)\left(x_{n}-u_{n}\right)+\beta_{n}\left(x_{n}-Tu_{n}\right)-q_{n}\right\|
(1βn)xnun+βnxnTun+qn\displaystyle\leq\left(1-\beta_{n}\right)\left\|x_{n}-u_{n}\right\|+\beta_{n}\left\|x_{n}-Tu_{n}\right\|+\left\|q_{n}\right\|
(1βn)xnun+βn[TxnTun+xnTxn]+qn\displaystyle\leq\left(1-\beta_{n}\right)\left\|x_{n}-u_{n}\right\|+\beta_{n}\left[\left\|Tx_{n}-Tu_{n}\right\|+\left\|x_{n}-Tx_{n}\right\|\right]+\left\|q_{n}\right\|
(1βn)xnun+βnLxnun+βnxnTxn+qn\displaystyle\leq\left(1-\beta_{n}\right)\left\|x_{n}-u_{n}\right\|+\beta_{n}L\left\|x_{n}-u_{n}\right\|+\beta_{n}\left\|x_{n}-Tx_{n}\right\|+\left\|q_{n}\right\|
=(1βn+βnL)xnun+βnxnTxn+qn\displaystyle=\left(1-\beta_{n}+\beta_{n}L\right)\left\|x_{n}-u_{n}\right\|+\beta_{n}\left\|x_{n}-Tx_{n}\right\|+\left\|q_{n}\right\|
Lxnun+βnxnTxn+qn,\displaystyle\leq L\left\|x_{n}-u_{n}\right\|+\beta_{n}\left\|x_{n}-Tx_{n}\right\|+\left\|q_{n}\right\|,

because 1L1βn+βnLL1\leq L\Rightarrow 1-\beta_{n}+\beta_{n}L\leq L.
We have

unTvn\displaystyle\left\|u_{n}-Tv_{n}\right\|
xnun+xnTxn+L(Lxnun+βnxnTxn+qn)\displaystyle\leq\left\|x_{n}-u_{n}\right\|+\left\|x_{n}-Tx_{n}\right\|+L\left(L\left\|x_{n}-u_{n}\right\|+\beta_{n}\left\|x_{n}-Tx_{n}\right\|+\left\|q_{n}\right\|\right)
(1+L2)xnun+(1+Lβn)xnTxn+Lqn.\displaystyle\leq\left(1+L^{2}\right)\left\|x_{n}-u_{n}\right\|+\left(1+L\beta_{n}\right)\left\|x_{n}-Tx_{n}\right\|+L\left\|q_{n}\right\|.

Now, Tun+1Tvn\left\|Tu_{n+1}-Tv_{n}\right\| satisfies

Tun+1Tvn\displaystyle\left\|Tu_{n+1}-Tv_{n}\right\| Lun+1vn=L(1αn)un+αnTvnvn+pn\displaystyle\leq L\left\|u_{n+1}-v_{n}\right\|=L\left\|\left(1-\alpha_{n}\right)u_{n}+\alpha_{n}Tv_{n}-v_{n}+p_{n}\right\|
L[(1αn)unvn+αnTvnvn+pn]\displaystyle\leq L\left[\left(1-\alpha_{n}\right)\left\|u_{n}-v_{n}\right\|+\alpha_{n}\left\|Tv_{n}-v_{n}\right\|+\left\|p_{n}\right\|\right]

Using (13) we evaluate:

Tvnvn\displaystyle\left\|Tv_{n}-v_{n}\right\|\leq TvnTxn+Txnxn+xnvn\displaystyle\left\|Tv_{n}-Tx_{n}\right\|+\left\|Tx_{n}-x_{n}\right\|+\left\|x_{n}-v_{n}\right\|
\displaystyle\leq (1+L)xnvn+Txnxn\displaystyle(1+L)\left\|x_{n}-v_{n}\right\|+\left\|Tx_{n}-x_{n}\right\|
\displaystyle\leq (1+L)[Lxnun+βnTxnxn+qn]+Txnxn\displaystyle(1+L)\left[L\left\|x_{n}-u_{n}\right\|+\beta_{n}\left\|Tx_{n}-x_{n}\right\|+\left\|q_{n}\right\|\right]+\left\|Tx_{n}-x_{n}\right\|
=\displaystyle= (1+L)Lxnun+[(1+L)βn+1]Txnxn\displaystyle(1+L)L\left\|x_{n}-u_{n}\right\|+\left[(1+L)\beta_{n}+1\right]\left\|Tx_{n}-x_{n}\right\|
+(1+L)qn\displaystyle+(1+L)\left\|q_{n}\right\|

and

unvn\displaystyle\left\|u_{n}-v_{n}\right\| =un(1βn)unβnTunqn=βnunTun+qn\displaystyle=\left\|u_{n}-\left(1-\beta_{n}\right)u_{n}-\beta_{n}Tu_{n}-q_{n}\right\|=\beta_{n}\left\|u_{n}-Tu_{n}\right\|+\left\|q_{n}\right\|
βn[unxn+Txnxn+TunTxn]+qn\displaystyle\leq\beta_{n}\left[\left\|u_{n}-x_{n}\right\|+\left\|Tx_{n}-x_{n}\right\|+\left\|Tu_{n}-Tx_{n}\right\|\right]+\left\|q_{n}\right\|
βn((1+L)xnun+Txnxn)+qn\displaystyle\leq\beta_{n}\left((1+L)\left\|x_{n}-u_{n}\right\|+\left\|Tx_{n}-x_{n}\right\|\right)+\left\|q_{n}\right\|

One obtains

T\displaystyle\|T un+1Tvn\displaystyle u_{n+1}-Tv_{n}\|
\displaystyle\leq L[(1αn)unvn+αnTvnvn+pn]\displaystyle L\left[\left(1-\alpha_{n}\right)\left\|u_{n}-v_{n}\right\|+\alpha_{n}\left\|Tv_{n}-v_{n}\right\|+\left\|p_{n}\right\|\right]
\displaystyle\leq L{(1αn)(βn((1+L)xnun+Txnxn)+qn)\displaystyle L\left\{\left(1-\alpha_{n}\right)\left(\beta_{n}\left((1+L)\left\|x_{n}-u_{n}\right\|+\left\|Tx_{n}-x_{n}\right\|\right)+\left\|q_{n}\right\|\right)\right.
+αn((1+L)Lxnun+[(1+L)βn+1]Txnxn\displaystyle+\alpha_{n}\left((1+L)L\left\|x_{n}-u_{n}\right\|+\left[(1+L)\beta_{n}+1\right]\left\|Tx_{n}-x_{n}\right\|\right.
+(1+L)qn)+pn}\displaystyle\left.\left.+(1+L)\left\|q_{n}\right\|\right)+\left\|p_{n}\right\|\right\}
=\displaystyle= (1αn)βn(1+L)Lxnun+L(1αn)βnTxnxn\displaystyle\left(1-\alpha_{n}\right)\beta_{n}(1+L)L\left\|x_{n}-u_{n}\right\|+L\left(1-\alpha_{n}\right)\beta_{n}\left\|Tx_{n}-x_{n}\right\|
+L(1αn)qn+αn(1+L)L2xnun\displaystyle+L\left(1-\alpha_{n}\right)\left\|q_{n}\right\|+\alpha_{n}(1+L)L^{2}\left\|x_{n}-u_{n}\right\|
+αnL[(1+L)βn+1]Txnxn+αnL(1+L)qn+Lpn\displaystyle+\alpha_{n}L\left[(1+L)\beta_{n}+1\right]\left\|Tx_{n}-x_{n}\right\|+\alpha_{n}L(1+L)\left\|q_{n}\right\|+L\left\|p_{n}\right\|
=\displaystyle= (L(1αn)βn(1+L)+αn(1+L)L2)xnun\displaystyle\left(L\left(1-\alpha_{n}\right)\beta_{n}(1+L)+\alpha_{n}(1+L)L^{2}\right)\left\|x_{n}-u_{n}\right\|
+(βnL(1αn)+αnL[(1+L)βn+1])Txnxn\displaystyle+\left(\beta_{n}L\left(1-\alpha_{n}\right)+\alpha_{n}L\left[(1+L)\beta_{n}+1\right]\right)\left\|Tx_{n}-x_{n}\right\|
+((1+L)αn+(1αn))Lqn+Lpn\displaystyle+\left((1+L)\alpha_{n}+\left(1-\alpha_{n}\right)\right)L\left\|q_{n}\right\|+L\left\|p_{n}\right\|

Also, we have

unTvn\displaystyle\left\|u_{n}-Tv_{n}\right\|\leq xnun+xnTxn+Lxnvn\displaystyle\left\|x_{n}-u_{n}\right\|+\left\|x_{n}-Tx_{n}\right\|+L\left\|x_{n}-v_{n}\right\|
\displaystyle\leq xnun+xnTxn\displaystyle\left\|x_{n}-u_{n}\right\|+\left\|x_{n}-Tx_{n}\right\|
+L[Lxnun+βnxnTxn+qn]\displaystyle+L\left[L\left\|x_{n}-u_{n}\right\|+\beta_{n}\left\|x_{n}-Tx_{n}\right\|+\left\|q_{n}\right\|\right]
=\displaystyle= (1+L2)xnun+(1+βnL)xnTxn+Lqn.\displaystyle\left(1+L^{2}\right)\left\|x_{n}-u_{n}\right\|+\left(1+\beta_{n}L\right)\left\|x_{n}-Tx_{n}\right\|+L\left\|q_{n}\right\|.

Taking (12) with the above evaluations for unTvn,Tun+1Tvn\left\|u_{n}-Tv_{n}\right\|,\left\|Tu_{n+1}-Tv_{n}\right\|, and
using the following inequalities (1+αn)11αn+αn2,(1+αn)11\left(1+\alpha_{n}\right)^{-1}\leq 1-\alpha_{n}+\alpha_{n}^{2},\left(1+\alpha_{n}\right)^{-1}\leq 1, we get

(1+αn)\displaystyle\left(1+\alpha_{n}\right)\| xn+1un+1\displaystyle x_{n+1}-u_{n+1}\|
\displaystyle\leq (1+(1k)αn)xnun\displaystyle\left(1+(1-k)\alpha_{n}\right)\left\|x_{n}-u_{n}\right\|
+(2k)αn2((1+L2)xnun+(1+βnL)xnTxn+Lqn)\displaystyle+(2-k)\alpha_{n}^{2}\left(\left(1+L^{2}\right)\left\|x_{n}-u_{n}\right\|+\left(1+\beta_{n}L\right)\left\|x_{n}-Tx_{n}\right\|+L\left\|q_{n}\right\|\right)
+(2k)αn2xnTyn+αnTxn+1Tyn+\displaystyle+(2-k)\alpha_{n}^{2}\left\|x_{n}-Ty_{n}\right\|+\alpha_{n}\left\|Tx_{n+1}-Ty_{n}\right\|+
+αn(L(1αn)βn(1+L)+αn(1+L)L2)xnun\displaystyle+\alpha_{n}\left(L\left(1-\alpha_{n}\right)\beta_{n}(1+L)+\alpha_{n}(1+L)L^{2}\right)\left\|x_{n}-u_{n}\right\|
+αn(βnL(1αn)+αnL[(1+L)βn+1])xnTxn\displaystyle+\alpha_{n}\left(\beta_{n}L\left(1-\alpha_{n}\right)+\alpha_{n}L\left[(1+L)\beta_{n}+1\right]\right)\left\|x_{n}-Tx_{n}\right\|
+αn((1+L)αn+(1αn))Lqn\displaystyle+\alpha_{n}\left((1+L)\alpha_{n}+\left(1-\alpha_{n}\right)\right)L\left\|q_{n}\right\|
+αnLpn+pn(1+(2k)αn)\displaystyle+\alpha_{n}L\left\|p_{n}\right\|+\left\|p_{n}\right\|\left(1+(2-k)\alpha_{n}\right)
\displaystyle\leq {(1+(1k)αn)+(2k)αn2(1+L2)\displaystyle\left\{\left(1+(1-k)\alpha_{n}\right)+(2-k)\alpha_{n}^{2}\left(1+L^{2}\right)\right.
+αnL(1+L)((1αn)βn+αnL)}xnun\displaystyle\left.+\alpha_{n}L(1+L)\left(\left(1-\alpha_{n}\right)\beta_{n}+\alpha_{n}L\right)\right\}\left\|x_{n}-u_{n}\right\|
+{(2k)αn2(1+βnL)+\displaystyle+\left\{(2-k)\alpha_{n}^{2}\left(1+\beta_{n}L\right)+\right.
+αn[βnL(1αn)+αnL[(1+L)βn+1]]}xnTxn\displaystyle\left.+\alpha_{n}\left[\beta_{n}L\left(1-\alpha_{n}\right)+\alpha_{n}L\left[(1+L)\beta_{n}+1\right]\right]\right\}\left\|x_{n}-Tx_{n}\right\|
+(2k)αn2xnTyn+Lαnxn+1yn+\displaystyle+(2-k)\alpha_{n}^{2}\left\|x_{n}-Ty_{n}\right\|+L\alpha_{n}\left\|x_{n+1}-y_{n}\right\|+
+αnL((1αn)+(1+L)αn+(2k)αn)qn\displaystyle+\alpha_{n}L\left(\left(1-\alpha_{n}\right)+(1+L)\alpha_{n}+(2-k)\alpha_{n}\right)\left\|q_{n}\right\|
+(1+(2k)αn+αnL)pn.\displaystyle+\left(1+(2-k)\alpha_{n}+\alpha_{n}L\right)\left\|p_{n}\right\|.
xn+1un+1\displaystyle\left\|x_{n+1}-u_{n+1}\right\|\leq {(1+(1k)αn)(1αn+αn2)+(2k)αn2(1+L2)\displaystyle\left\{\left(1+(1-k)\alpha_{n}\right)\left(1-\alpha_{n}+\alpha_{n}^{2}\right)+(2-k)\alpha_{n}^{2}\left(1+L^{2}\right)\right.
+αnL(1+L)((1αn)βn+αnL)}xnun\displaystyle\left.+\alpha_{n}L(1+L)\left(\left(1-\alpha_{n}\right)\beta_{n}+\alpha_{n}L\right)\right\}\left\|x_{n}-u_{n}\right\|
+{(2k)αn2(1+βnL)\displaystyle+\left\{(2-k)\alpha_{n}^{2}\left(1+\beta_{n}L\right)\right.
+αn[βnL(1αn)+αnL[(1+L)βn+1]]}xnTxn\displaystyle\left.+\alpha_{n}\left[\beta_{n}L\left(1-\alpha_{n}\right)+\alpha_{n}L\left[(1+L)\beta_{n}+1\right]\right]\right\}\left\|x_{n}-Tx_{n}\right\|
+(2k)αn2xnTyn+Lαnxn+1yn\displaystyle+(2-k)\alpha_{n}^{2}\left\|x_{n}-Ty_{n}\right\|+L\alpha_{n}\left\|x_{n+1}-y_{n}\right\|
+αnL((1αn)+(1+L)αn+(2k)αn)qn\displaystyle+\alpha_{n}L\left(\left(1-\alpha_{n}\right)+(1+L)\alpha_{n}+(2-k)\alpha_{n}\right)\left\|q_{n}\right\|
+(1+(2k)αn+αnL)pn.\displaystyle+\left(1+(2-k)\alpha_{n}+\alpha_{n}L\right)\left\|p_{n}\right\|.

That is

an+1γnan+σn+wn,a_{n+1}\leq\gamma_{n}a_{n}+\sigma_{n}+w_{n},

where

an:=\displaystyle a_{n}= xnun,\displaystyle\left\|x_{n}-u_{n}\right\|,
γn:=\displaystyle\gamma_{n}= [1+(1k)αn](1αn+αn2)+(2k)(1+L2)αn2\displaystyle{\left[1+(1-k)\alpha_{n}\right]\left(1-\alpha_{n}+\alpha_{n}^{2}\right)+(2-k)\left(1+L^{2}\right)\alpha_{n}^{2}}
+αnL(1+L)[βn(1αn)+Lαn],\displaystyle+\alpha_{n}L(1+L)\left[\beta_{n}\left(1-\alpha_{n}\right)+L\alpha_{n}\right],
wn:=\displaystyle w_{n}= pn(1+(2k)αn+αnL),\displaystyle\left\|p_{n}\right\|\left(1+(2-k)\alpha_{n}+\alpha_{n}L\right),
σn:=\displaystyle\sigma_{n}= αn{{(2k)αn(1+βnL)\displaystyle\alpha_{n}\left\{\left\{(2-k)\alpha_{n}\left(1+\beta_{n}L\right)\right.\right.
+[βnL(1αn)+αnL[(1+L)βn+1]]}xnTxn\displaystyle\left.+\left[\beta_{n}L\left(1-\alpha_{n}\right)+\alpha_{n}L\left[(1+L)\beta_{n}+1\right]\right]\right\}\left\|x_{n}-Tx_{n}\right\|
+(2k)αnxnTyn+Lxn+1yn\displaystyle+(2-k)\alpha_{n}\left\|x_{n}-Ty_{n}\right\|+L\left\|x_{n+1}-y_{n}\right\|
+Lqn((1αn)+(3+Lk)αn)}.\displaystyle\left.+L\left\|q_{n}\right\|\left(\left(1-\alpha_{n}\right)+(3+L-k)\alpha_{n}\right)\right\}.

Remark that γn\gamma_{n} is the same as in formula (27) from [8]. The same motivation as in [8] leads us to

γn1k2αn, from a sufficient large n.\gamma_{n}\leq 1-k^{2}\alpha_{n},\text{ from a sufficient large }n.

We get relation (7) with λn:=k2αn\lambda_{n}:=k^{2}\alpha_{n}

an+1(1λn)an+σn+wna_{n+1}\leq\left(1-\lambda_{n}\right)a_{n}+\sigma_{n}+w_{n}

Using (5) and using that Ishikawa iteration (2) converges i.e. limnxn=x\lim_{n\rightarrow\infty}x_{n}=x^{*}, (more precisely using limnxn+1yn=0,limnxnTxn=0\lim_{n\rightarrow\infty}\left\|x_{n+1}-y_{n}\right\|=0,\lim_{n\rightarrow\infty}\left\|x_{n}-Tx_{n}\right\|=0 ), it is easy to see that σn=o(λn)\sigma_{n}=o\left(\lambda_{n}\right), and n=1wn<\sum_{n=1}^{\infty}w_{n}<\infty. All the assumptions from Lemma 1 are satisfied, hence we have limnan=0\lim_{n\rightarrow\infty}a_{n}=0. That is

limnxnun=0\lim_{n\rightarrow\infty}\left\|x_{n}-u_{n}\right\|=0 (14)

We suppose that limnxn=x\lim_{n\rightarrow\infty}x_{n}=x^{*}. Relation (14) and the following inequality

unxxnun+xnx0,(n)\left\|u_{n}-x^{*}\right\|\leq\left\|x_{n}-u_{n}\right\|+\left\|x_{n}-x^{*}\right\|\rightarrow 0,(n\rightarrow\infty)

lead us to limnun=x\lim_{n\rightarrow\infty}u_{n}=x^{*}.
If we consider βn=0\beta_{n}=0, in (2) and (4), then we have the following result
Theorem 2. Let XX be a Banach space and T:XXT:X\rightarrow X be a Lipschitzian with L1L\geq 1, strongly pseudocontractive map. If u1=x1Xu_{1}=x_{1}\in X, let limnαn=0\lim_{n\rightarrow\infty}\alpha_{n}=0 and n=1αn=\sum_{n=1}^{\infty}\alpha_{n}=\infty, suppose that the errors satisfy (5), then the following two assertions are equivalent:
(i) Mann iteration (1) converges to xF(T)x^{*}\in F(T),
(ii) Mann iteration with errors (3) converges to the same xF(T)x^{*}\in F(T).

The following result is from [8].
Theorem 3 [[8]]. Let KK be a closed convex (not necessarily bounded) subset of an arbitrary Banach space XX and let TT be a Lipschitzian pseudocontractive selfmap of K Let us consider Mann iteration and Ishikawa iteration with the same initial point and with the conditions limnαn=0,limnβn=0\lim_{n\rightarrow\infty}\alpha_{n}=0,\lim_{n\rightarrow\infty}\beta_{n}=0, and n=1αn=\sum_{n=1}^{\infty}\alpha_{n}=\infty. Let xF(T)x^{*}\in F(T). Then the following conditions are equivalent:
(i) Mann iteration (1) converges to xF(T)x^{*}\in F(T),
(ii) Ishikawa iteration (2) converges to xF(T)x^{*}\in F(T).

Take K:=XK:=X in the above result. Theorem 1, Theorem 2 and Theorem 3 lead us to the conclusion:

Corollary 1. In the same assumptions as in Theorem 1 we have the equivalence between the convergences of (1), (2), (3) and (4).

3. The equivalence for strongly accretive and accretive maps

The map J:X2XJ:X\rightarrow 2^{X^{*}} given by

Jx:={xX:x,x=x2,x=x},xX,Jx:=\left\{x^{*}\in X^{*}:\left\langle x,x^{*}\right\rangle=\|x\|^{2},\left\|x^{*}\right\|=\|x\|\right\},\forall x\in X,

is called the normalized duality mapping. Let us denote the identity map by II.
Definition 2. Let XX be a Banach space. A map T:XXT:X\rightarrow X is called strongly pseudocontractive if there exists k(0,1)k\in(0,1) and j(xy)J(xy)j(x-y)\in J(x-y) such that

ReTxTy,j(xy)kxy2,\operatorname{Re}\langle Tx-Ty,j(x-y)\rangle\leq k\|x-y\|^{2},

for all x,yXx,y\in X. This is equivalent with (6).
A map S:XXS:X\rightarrow X is called strongly accretive if there exists γ(0,1)\gamma\in(0,1) and j(xy)J(xy)j(x-y)\in J(x-y) such that

ReSxSy,j(xy)γxy2.\operatorname{Re}\langle Sx-Sy,j(x-y)\rangle\geq\gamma\|x-y\|^{2}.

for all x,yXx,y\in X.
A map S:XXS:X\rightarrow X is called accretive if there exists j(xy)J(xy)j(x-y)\in J(x-y) such that

ReSxSy,j(xy)0.\operatorname{Re}\langle Sx-Sy,j(x-y)\rangle\geq 0.

for all x,yXx,y\in X.
Let us denote the identity map by II.
Remark 1. Map TT is a strongly pseudocontractive map with k(0,1)k\in(0,1) if and only if (IT)(I-T) is a strongly accretive map with (1k)(1-k).

Let us consider the following operator equation

Sx=fSx=f

where SS is a strongly accretive map and ff is given. Consider the map Tx=f+(IS)x,xXTx=f+(I-S)x,\forall x\in X. A fixed point for TT will be a solution for the equation Sx=f;Sx=f; such a solution exists, see [6]. We consider iterations (2) and (4) with f+(IS)xf+(I-S)x instead of TxTx.

xn+1\displaystyle x_{n+1} =(1αn)xn+αn(f+(IS)yn),\displaystyle=\left(1-\alpha_{n}\right)x_{n}+\alpha_{n}\left(f+(I-S)y_{n}\right), (15)
yn\displaystyle y_{n} =(1βn)xn+βn(f+(IS)xn),n=1,2,,\displaystyle=\left(1-\beta_{n}\right)x_{n}+\beta_{n}\left(f+(I-S)x_{n}\right),n=1,2,\ldots,

and

un+1\displaystyle u_{n+1} =(1αn)un+αn(f+(IS)vn)+pn\displaystyle=\left(1-\alpha_{n}\right)u_{n}+\alpha_{n}\left(f+(I-S)v_{n}\right)+p_{n} (16)
vn\displaystyle v_{n} =(1βn)un+βn(f+(IS)un)+qn,n=1,2,\displaystyle=\left(1-\beta_{n}\right)u_{n}+\beta_{n}\left(f+(I-S)u_{n}\right)+q_{n},\quad n=1,2,\ldots

Sequences (αn)n,(βn)n(0,1)\left(\alpha_{n}\right)_{n},\left(\beta_{n}\right)_{n}\subset(0,1), are convergent such that limnαn=0,limnβn=\lim_{n\rightarrow\infty}\alpha_{n}=0,\lim_{n\rightarrow\infty}\beta_{n}= 0 , and n=1αn=\sum_{n=1}^{\infty}\alpha_{n}=\infty. Errors (pn)n,(qn)n\left(p_{n}\right)_{n},\left(q_{n}\right)_{n} satisfy (5).

Theorem 1 assures that the Ishikawa iteration and Ishikawa iteration with errors are equivalent models for a strongly pseudocontractive map. Using Remark 1, observe that if SS is Lipschitzian and strongly accretive, then the map Tx=f+(IS)xTx=f+(I-S)x is Lipschitzian strongly pseudocontractive. We obtain

Theorem 4. Let XX be a Banach space, let S:XXS:X\rightarrow X be a Lipschitzian with L1L\geq 1, a strongly accretive map. If u1=x1Bu_{1}=x_{1}\in B, then the following two assertions are equivalent:
(i) Ishikawa iteration (15) converges to xF(T)x^{*}\in F(T), which is the solution of Sx=fSx=f,
(ii) Ishikawa iteration with errors (16) converges to the same xF(T)x^{*}\in F(T), which is the solution of Sx=fSx=f.

When we take βn=0\beta_{n}=0, we get a similar result for Mann iteration and Mann iteration with errors. Thus Mann iteration with errors (3) is equivalent with Mann iteration (1), when we take Tx=f+(IS)x,xXTx=f+(I-S)x,\forall x\in X.

According to observation from [8], Theorem 3 holds if we take the above operator TT, with SS strongly accretive. Theorem 4 and the equivalence between Mann iteration with errors (3) and Mann iteration (1) lead us to the following conclusion

Corollary 2. In the same assumptions as in Theorem 4 we have the equivalence between the convergences of (1), (2), (3) and (4) for a Lipschitzian strongly accretive map SS, and Tx=f+(IS)x,xXTx=f+(I-S)x,\forall x\in X.

Remark 2. If SS is an accretive map, then T=fST=f-S is a strongly pseudocontractive map.

Proof. For all x,yXx,y\in X and j(xy)J(xy)j(x-y)\in J(x-y), we have

ReSxSy,j(xy)\displaystyle\operatorname{Re}\langle Sx-Sy,j(x-y)\rangle 0\displaystyle\geq 0\Leftrightarrow
Re(fT)x(fT)y,j(xy)\displaystyle\operatorname{Re}\langle(f-T)x-(f-T)y,j(x-y)\rangle 0\displaystyle\geq 0\Leftrightarrow
ReTxTy,j(xy)\displaystyle-\operatorname{Re}\langle Tx-Ty,j(x-y)\rangle 0\displaystyle\geq 0\Leftrightarrow
ReTxTy,j(xy)\displaystyle\operatorname{Re}\langle Tx-Ty,j(x-y)\rangle 0kxy2,k(0,1).\displaystyle\leq 0\leq k\|x-y\|^{2},\forall k\in(0,1).

Let us consider the following operator equation

x+Sx=fx+Sx=f

where SS is a strongly accretive map and ff is given. The existence of the solution for x+Sx=fx+Sx=f follows from [5]. It is clear that x+Sxx+Sx is Lipschitzian if SS is. Consider the map Tx=fSx,xXTx=f-Sx,\forall x\in X. A fixed point for TT will be a solution for the equation Sx=fSx=f. Using Remark 2, if SS is an accretive map, then TT is strongly pseudocontractive. Now let us consider iterations (2) with Tx=fSxTx=f-Sx

xn+1\displaystyle x_{n+1} =(1αn)xn+αn(fSyn)\displaystyle=\left(1-\alpha_{n}\right)x_{n}+\alpha_{n}\left(f-Sy_{n}\right) (17)
yn\displaystyle y_{n} =(1βn)xn+βn(fSxn),n=1,2,,\displaystyle=\left(1-\beta_{n}\right)x_{n}+\beta_{n}\left(f-Sx_{n}\right),\quad n=1,2,\ldots,

and the Ishikawa iteration with errors (4):

un+1\displaystyle u_{n+1} =(1αn)un+αn(fSvn)+pn\displaystyle=\left(1-\alpha_{n}\right)u_{n}+\alpha_{n}\left(f-Sv_{n}\right)+p_{n} (18)
vn\displaystyle v_{n} =(1βn)un+βn(fSun)+qn,n=1,2,.\displaystyle=\left(1-\beta_{n}\right)u_{n}+\beta_{n}\left(f-Su_{n}\right)+q_{n},\quad n=1,2,\ldots.

Sequences (αn)n,(βn)n(0,1)\left(\alpha_{n}\right)_{n},\left(\beta_{n}\right)_{n}\subset(0,1) are convergent such that limnαn=0\lim_{n\rightarrow\infty}\alpha_{n}=0, limnβn=0\lim_{n\rightarrow\infty}\beta_{n}=0, and n=1αn=\sum_{n=1}^{\infty}\alpha_{n}=\infty. The errors verify (5).

Theorem 1 assures that Ishikawa iteration and Ishikawa iteration with errors are equivalent models for a strongly pseudocontractive map. According to Remark 2, the map Tx=fSx,xXTx=f-Sx,\forall x\in X, is (Lipschitzian) strongly pseudocontractive map when SS is a (Lipschitzian) accretive. These arguments lead us to the following conclusion

Theorem 5. Let XX be a Banach space, let S:XXS:X\rightarrow X be a Lipschitzian with L1L\geq 1, accretive map. If u1=x1Xu_{1}=x_{1}\in X, then the following two assertions are equivalent:
(i) Ishikawa iteration (17) converges to xF(T)x^{*}\in F(T), which is the solution of x+Sx=fx+Sx=f
(ii) Ishikawa iteration with errors (18) converges to the same xF(T)x^{*}\in F(T), which is the solution of x+Sx=fx+Sx=f.

When we take βn=0\beta_{n}=0, we get a similar result for Mann iteration and Mann iteration with errors. Thus Mann iteration with errors (3) is equivalent with Mann iteration (1), when we take Tx=fSx,xXTx=f-Sx,\forall x\in X.

According to second observation from [8], Theorem 1 holds if we take Tx=fSx,xXTx=f-Sx,\forall x\in X, with SS accretive. Also Theorem 5 and the remark concerning the equivalence between Mann iteration with errors and Mann iteration for Tx=fSx,xXTx=f-Sx,\forall x\in X, lead us to

Corollary 3. In the same assumptions as in Theorem 5 we have the equivalence between the convergences of (1), (2), (3) and (4) for a Lipschitzian accretive map SS, and Tx=fSx,xXTx=f-Sx,\forall x\in X.

4. The multivalued case

In the multivalued case the following definitions hold
Definition 3. Let XX be a real Banach space. A map T:X2XT:X\rightarrow 2^{X} is called strongly pseudocontractive if there exists k(0,1)k\in(0,1) and j(xy)J(xy)j(x-y)\in J(x-y) such that

ξθ,j(xy)kxy2\langle\xi-\theta,j(x-y)\rangle\leq k\|x-y\|^{2}

for all x,yX,ξTx,θTyx,y\in X,\xi\in Tx,\theta\in Ty.
Let S:X2XS:X\rightarrow 2^{X}, the map SS is called strongly accretive if there exists γ(0,1)\gamma\in(0,1) and j(xy)J(xy)j(x-y)\in J(x-y) such that

ξθ,j(xy)γxy2\langle\xi-\theta,j(x-y)\rangle\geq\gamma\|x-y\|^{2}

for all x,yX,ξTx,θTyx,y\in X,\xi\in Tx,\theta\in Ty, etc.
We remark that all results from this paper hold in the multivalued case, provided that these multivalued maps admit single valued selections.

Acknowledgment. The author is indebted to referee and to Ioana C. Şoltuz for carefuly reading and making useful, pertinent suggestions.

References

[1] K. Deimling, Zeroes of accretive operators, Manuscripta Math. 13(1974), 365374.
[2] S. Ishikawa, Fixed points by a new iteration method, Proc. Amer. Math. Soc. 44(1974), 147-150.
[3] L.-S. Liu, Ishikawa and Mann iterative process with errors for nonlinear strongly accretive mappings in Banach spaces, J. Math. Anal. Appl. 194(1995), 114-125.
[4] W. R. Mann, Mean value in iteration, Proc. Amer. Math. Soc. 4(1953), 506510.
[5] R. H. Martin Jr, A global existence theorem for autonomous differential equations in Banach spaces, Proc. Amer. Math. Soc. 26(1970), 307-314.
[6] C. Morales, Surjectivity theorems for multi-valued mappings of accretive type, Comm. Math. Univ. Carolinae 26(1985), 397-413.
[7] B. E. Rhoades, Comments on two fixed point iteration methods, J. Math. Anal. Appl. 56(1976), 741-750.
[8] B. E. Rhoades, Ş. M. Şoltuz, On the equivalence of Mann and Ishikawa iteration methods, International Journal of Mathematics and Mathematical Science 33(2003), 451-459.

2003

Related Posts