# zbMATH — the first resource for mathematics

On T-stability of the Picard iteration for generalized $$\varphi$$-contraction mappings. (English) Zbl 1252.54035
Summary: We introduce some results on T-stability of the Picard iteration for $$\varphi$$-contraction and generalized $$\varphi$$-contraction mappings on metric spaces.

##### MSC:
 54H25 Fixed-point and coincidence theorems (topological aspects) 54E40 Special maps on metric spaces 54E50 Complete metric spaces 47J25 Iterative procedures involving nonlinear operators
Full Text:
##### References:
 [1] V. Berinde, Iterative Approximation of Fixed Points, vol. 1912 of Lecture Notes in Mathematics, Springer, Berlin, Germany, 2007. · Zbl 1165.47047 [2] A. O. Bosede and B. E. Rhoades, “Stability of Picard and Mann iteration for a general class of functions,” Journal of Advanced Mathematical Studies, vol. 3, no. 2, pp. 23-25, 2010. · Zbl 1210.47093 [3] A. M. Harder and T. L. Hicks, “Stability results for fixed point iteration procedures,” Mathematica Japonica, vol. 33, no. 5, pp. 693-706, 1988. · Zbl 0655.47045 [4] Y. Qing and B. E. Rhoades, “T-stability of Picard iteration in metric spaces,” Fixed Point Theory and Applications, vol. 2008, Article ID 418971, 4 pages, 2008. · Zbl 1145.54328 [5] Sh. Rezapour, R. H. Haghi, and B. E. Rhoades, “Some results about T-stability and almost T-stability,” Fixed Point Theory, vol. 12, no. 1, pp. 179-186, 2011. · Zbl 1281.47052 [6] B. E. Rhoades, “Fixed point theorems and stability results for fixed point iteration procedures,” Indian Journal of Pure and Applied Mathematics, vol. 21, no. 1, pp. 1-9, 1990. · Zbl 0692.54027 [7] T. Zamfirescu, “Fix point theorems in metric spaces,” Archiv der Mathematik, vol. 23, pp. 292-298, 1972. · Zbl 0239.54030
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.