|
Abstract
|
In computational mathematics, the comparison of convergence rate in different iterative
methods is an important concept from theoretical point of view. The importance of this comparison
is relevant for researchers who want to discover which one of these iterations converges to the fixed
point more rapidly. In this article, we study the different numerical methods to calculate fixed point
in digital metric spaces, introduce a new k-step iterative process and conduct an analysis on the strong
convergence, stability and data dependence of the mentioned scheme. Some illustrative examples are
given to show that this iteration process converges faster.
|