Iterative methods for strict pseudo-contractions in Hilbert spaces

Let {Ti}i=1N be NN strict pseudo-contractions defined on a closed convex subset CC of a real Hilbert space HH. Consider the problem of finding a common fixed point of these mappings and consider the parallel and cyclic algorithms for solving this problem. We will prove the weak convergence of these algorithms. Moreover, by applying additional projections, we further prove that these algorithms can be modified to have strong convergence.