Robustness of Krasnoselski-Mann's algorithm for asymptotically nonexpansive mappings (Q642852): Difference between revisions

Summary: Iterative approximation of fixed points of nonexpansive mapping is a very active theme in many aspects of mathematical and engineering areas, in particular, in image recovery and signal processing. Because the errors usually occur in few places, it is necessary to show whether the iterative algorithm is robust or not. In the present work, we prove that Krasnoselski-Mann's algorithm is robust for asymptotically nonexpansive mapping in a Banach space setting. Our results generalize the corresponding results existing in the literature.