On new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces

Abstract

In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.