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.

in this paper, we obtained the convergence of modified noor iterative scheme for nearly lipschitzian maps in real banach spaces. our results contribute to the literature in this area of re- search.

0

We discuss the problem of finding approximate solutions of the equation 0 ) (  x f (1) In some cases it is possible to find the exact roots of the equation (1) for example when ) (x f is a quadratic on cubic polynomial otherwise, in general, is interested in finding approximate solutions using some numerical methods. Here, we will discuss a method called fixed point iteration method and a part...