Convergence analysis for a new faster iteration method

MaRDI QIDQ6263197zbMATH OpenFDO

Authors Vatan Karakaya, Yunus Atalan, Kadri Doğan, Nour El Houda Bouzara

Publication date 1 July 2015

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10)

Abstract: In this paper, we introduce a new iteration method and show that this iteration method can be used to approximate fixed point of almost contraction mappings. Furthermore, we prove that the new iteration method is equivalent to both Mann iteration method and Picard-Mann hybrid iteration method and also converges faster than Picard-Mann hybrid iteration method for the class of almost contraction mappings. In addition to these we give a table and graphics for support this result. Finally, we prove a data dependence result for almost contraction mappings by using the new iteration method.

This page was built for publication: Convergence analysis for a new faster iteration method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6263197)