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

Abstract

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.

Authors

Cristian Daniel Alecsa
Babes-Bolyai University, Department of Mathematics, Cluj-Napoca, Romania,
Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy, Cluj-Napoca, Romania

Keywords

convex metric space; fixed point; iterative algorithm; rate of convergence; convex combination.

Paper coordinates

C.-D. Alecsa, 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, 8 (2019) no. 1, pp. 353-388.
doi: 10.22075/ijnaa.2017.11144.1543

PDF

Journal

International Journal of Nonlinear Analysis and Applications

2008-6822