Abstract
In this paper we propose a new iteration process, called AK iteration process, for approximation of fixed points for contraction mappings. We show that our iteration process is faster than the leading Vatan Two-step iteration process for contraction mappings. Numerical examples are given to support the analytic proofs. Stability of AK iteration process and data dependence result for contraction mappings by employing AK iteration process are also discussed.