On the rate of convergence of different implicit iterations in convex metric spaces

Abstract

In this paper, we introduce a new three-step implicit iteration process and prove that it is faster than the other implicit iteration processes. We prove some convergence theorem for generalized contraction mappings in convex metric space. We also support our results by a numerical example.