The new fastest hybrid iteration process (Q2923282)

In order to approximate the unique fixed point (presumed to exist) of a mapping \(T: X\rightarrow X\) satisfying the contraction condition NEWLINE\[NEWLINE |Tx-Ty|\leq \delta |x-y|+\Phi (|x-Tx|) \text{ for all } x, y\in X NEWLINE\]NEWLINE in a \(K\)-normed linear space \(X\), the author uses the Picard iteration of the iterate \(T^2\) and shows that this method converges faster than the Picard-Mann iteration with respect to the convergence order introduced by the reviewer in [Fixed Point Theory Appl. 2004, No. 2, 97--105 (2004; Zbl 1090.47053)].