Abstract
In this paper, we propose a new iteration process which is faster than the leading S [J. Nonlinear Convex Anal. 8, no. 1 (2007), 61-79], Thakur et al. [App. Math. Comp. 275 (2016), 147-155] and M [Filomat 32, no. 1 (2018), 187-196] iterations for numerical reckoning fixed points. Using new iteration process, some fixed point convergence results for generalized α-nonexpansive mappings in the setting of uniformly convex Banach spaces are proved. At the end of paper, we offer a numerical example to compare the rate of convergence of the proposed iteration process with the leading iteration processes.
Publisher
Universitat Politecnica de Valencia
Reference38 articles.
1. M. Abbas and T. Nazir, A new faster iteration process applied to constrained minimization and feasibility problems, Mat. Vesnik 66, no. 2 (2014) 223-234.
2. R. P. Agarwal, D. O'Regan and D. S. Sahu, Fixed Point Theory for Lipschitzian-type Mappings with Applications Series: Topological Fixed Point Theory and Its Applications, vol. 6. Springer, New York (2009).
3. https://doi.org/10.1155/2009/439176
4. R. P. Agarwal, D. O'Regan and D. R. Sahu, Iterative construction of fixed points of nearly asymptotically nonexpansive mappings, J. Nonlinear Convex Anal. 8, no. 1 (2007), 61-79. [6]
5. K. Aoyama and F. Kohsaka, Fixed point theorem for α-nonexpansive mappings in Banach spaces, Nonlinear Anal. 74 (2011), 4387-4391.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献