Approximating common fixed points by a new faster iteration process

In this paper, we propose a three-step iteration process and show that this process converges faster than a number of existing iteration processes. We give a numerical example followed by graphs to validate our claim. We prove strong and weak convergence results for approximating common fixed points for two nonexpansive mappings. Again we reconfirm our results by examples and tables. Further, we provide some applications of the our iteration process.