Document Type : Research Paper

Author

• Cristian Alecsa

Babec s-Bolyai University, Department of Mathematics, Cluj-Napoca, Romania, Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy, Cluj-Napoca, Romania

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.

Keywords

• convex metric space
• Fixed point
• iterative algorithm
• rate of convergence
• convex combination