It is worth mentioning that the simplicity and applicability of the BCP
paved the way for developing a new class of mappings satisfying generalized
contractive condition. Most of the generalizations of the BCP possess the
same characteristics regarding the existence of a unique fixed point which
can be constructed by the Picard iterative algorithm. However, there are
certain contractive type mappings for which the construction of fixed points
is also possible via Krasnosel'skii [1]}, Mann [2]}, [3]}, Ishikawa [4]} and Xu-Noor [5]}
iterative algorithms. In MFPT, different iterative algorithms can be
evaluated with respect to various characteristics, inter alia, convergence
characteristics and rates of convergence. The later concept has its own
importance in MFPT and therefore we adopt the concept introduced by Berinde
[6]} for a comparison of the rates of convergence of different
iterative algorithms involving a nonlinear mapping.
