Comparison of The Speed of Convergence Among Various Iterative Schemes

Abstract

We show that iterative scheme due to Karahan and Özdemir (2013) can be used to approximate fixed point of contraction mappings. Furthermore, we prove that CR iterative scheme converges faster than the iterative scheme due to Karahan and Özdemir (2013) for the class contraction mappings. Finally, we prove a data dependence result for contraction mappings by employing iterative scheme due to Karahan and Özdemir (2013).

Cited by in corpus (3)

• Fixed Point Approximation of Suzuki Generalized Nonexpansive Mappings via New Faster Iteration Process
• On Berinde's method for comparing iterative processes
• A Picard-S Iterative Scheme for Approximating Fixed Point of Weak-Contraction Mappings