RATE OF CONVERGENCE AND DATA DEPENDENCY OF ALMOST PRESIC CONTRACTIVE OPERATORS

We introduce the notion of almost Presic contractive operator and approximate its unique fixed point through some well-known iterative algorithms. We show that Picard-Picard hybrid iterative algorithm is faster than the others. Moreover, Mann and Ishikawa iterative algorithms have the same rate of convergence. The corresponding data dependence results and examples to validate our findings are also given. Our results hold in normed spaces and CAT (0) spaces, simultaneously.