We introduce a new iteration process and prove that it is faster than all of
Picard, Mann and Agarwal et al. processes. We support analytic proof by a numerical example.
Our process is independent of all three processes just mentioned. We also prove some weak and
strong convergence theorems for two nonexpansive mappings. Moreover, we apply our results to
find solutions of constrained minimization problems and feasibility problems.