Abstract
For approximating the fixed points of enriched nonexpansive mappings in Hilbert spaces, we consider a modified Krasnosel’skiǐ–Mann algorithm for which we prove a strong convergence theorem. We also empirically compare the rate of convergence of the modified Krasnosel’skiǐ–Mann algorithm and of the simple Krasnosel’skiǐ fixed point algorithm. Based on the numerical experiments reported in the paper we conclude that, for the class of enriched nonexpansive mappings, it is more convenient to work with the simple Krasnosel’skiǐ fixed point algorithm than with the modified Krasnosel’skiǐ–Mann algorithm.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference25 articles.
1. Fixed point theory for Lipschitzian-type mappings with applications;Agarwal,2009
2. Iterative approximation of fixed points;Berinde,2007
3. Geometric properties of Banach spaces and nonlinear iterations;Chidume,2009
4. Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings;Goebel,1984
5. Mean value methods in iteration
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献