On new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces

	On new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
International Journal of Nonlinear Analysis and Applications
مقاله 29، دوره 8، شماره 1، 2017، صفحه 353-388 اصل مقاله (505.18 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22075/ijnaa.2017.11144.1543
نویسنده
Cristian Alecsa^*
Babec s-Bolyai University, Department of Mathematics, Cluj-Napoca, Romania, Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy, Cluj-Napoca, Romania
چکیده
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
کلیدواژه‌ها
convex metric space؛ Fixed point؛ iterative algorithm؛ rate of convergence؛ convex combination
آمار تعداد مشاهده مقاله: 16,837 تعداد دریافت فایل اصل مقاله: 11,903

پیوندهای مفید

آمار