Stability of an Iterative Algorithm

Abstract

We prove that iterative algorithm (1.7) of [7] is weak $w^{2}-$stable w.r.t. an operator $T$ in the class of weak contraction mappings.

Keywords

• Fixed Point,Stability,Iterative algorithm

References

1. [1] V. Berinde, On the approximation of fixed points of weak contractive mappings, Carpathian J. Math., 19 (2003), 7-22.
2. [2] T. Cardinali, P. Rubbioni, A generalization of the Caristi fixed point theorem in metric spaces, Fixed Point Theory, 11 (2010), 3-10.
3. [3] I. Timis, On the weak stability of Picard iteration for some contractive type mappings and coincidence theorems, Int. J. Comput. Appl., 37 (2012), 9-13.
4. [4] V. Berinde, Summable almost stability of fixed point iteration procedures, Carpathian J. Math., 19 (2003), 81-88.
5. [5] A. R. Khan, F. Gürsoy, V. Kumar, Stability and data dependence results for Jungck–Khan iterative scheme, Turkish J. Math., 40 (2016), 631-640.
6. [6] L. Maru¸ster, ¸ S. M˘aru¸ster, On the error estimation and T-stability of the Mann iteration, J. Comput. Appl. Math., 276 (2015), 110-116.
7. [7] V. Karakaya, Y. Atalan, K. Do˘gan, N. El Houda Bouzara, Some fixed point results for a new three steps iteration process in Banach spaces, Fixed Point Theory, 18 (2017), 625-640.