New iteration scheme for numerical reckoning fixed points of nonexpansive mappings

Abstract

The purpose of this paper is to introduce a new three step iteration scheme for approximation of fixed points of the nonexpansive mappings. We show that our iteration process is faster than all of the Picard, the Mann, the Agarwal et al., and the Abbas et al. iteration processes. We support our analytic proof by a numerical example in which we approximate the fixed point by a computer using Matlab program. We also prove some weak convergence and strong convergence theorems for the nonexpansive mappings. MSC: 47H09; 47H10

Convergence Analysis for a Three-Step Thakur Iteration for Suzuki-Type Nonexpansive Mappings with Visualization

“…x n+1 = (1 − α n )Ty n + α n Tz n y n = (1 − β n )Tx n + β n Tz n z n = (1 − γ n )x n + γ n Tx n , n ≥ 0, where {α n }, {β n }, {γ n } are real number sequences in (0, 1). In the sequel, we will consider the following iterative process defined by Thakur et al in [7] for numerical reckoning fixed points of nonexpansive mappings; see, also [8]: for an arbitrary chosen element x 0 ∈ C, the sequence {x n } is generated by…”

Approximation of Fixed Points for Suzuki's Generalized Non-Expansive Mappings

“…In 2014, Thakur et al [9] introduced the following iterative scheme for nonexpansive mappings, in this scheme the sequence {x n } is defined as:…”

CQ-Type Algorithm for Reckoning Best Proximity Points of EP-Operators

“…This was in part due to the fact that Picard's iterative sequence for nonexpansive mappings does not necessarily converge. For more recently introduced iterative schemes, one can see Noor [8], Agrawal et al [9], Abbas and Nazir, [10], Sintunavarat and Pitea [11], Thakur et al [12][13][14], etc.…”