Some Theorems of Fixed Point Approximations By Iteration Processes

Abstract The purpose of this paper, is to study different iterations algorithms types three_steps called, new iteration, M ∗ −iteration, k −iteration, and Noor-iteration, for approximation of fixed points. We show that the new iteration process is faster than the existing leading iteration processes like M ∗ −iteration, k −iteration, and Noor-iteration process, for like contraction mappings. We support our analytic proof with a numerical example.