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.
Alecsa, C. (2017). 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(1), 353-388. doi: 10.22075/ijnaa.2017.11144.1543
MLA
Cristian 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, 1, 2017, 353-388. doi: 10.22075/ijnaa.2017.11144.1543
HARVARD
Alecsa, C. (2017). '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(1), pp. 353-388. doi: 10.22075/ijnaa.2017.11144.1543
VANCOUVER
Alecsa, C. 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, 2017; 8(1): 353-388. doi: 10.22075/ijnaa.2017.11144.1543
)