Numerical reckoning fixed points via new faster iteration process.

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 this new iteration process, some fixed point convergence results for generalized ff-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. [ABSTRACT FROM AUTHOR]