A Picard S∗ iterative algorithm for approximating fixed points of generalized α-nonexpansive mappings

Pinki Lamba, Anju Panwar

Abstract


In this article, we introduce a new iterative algorithm called Picard-S∗ iterative algorithm. We show that the Picard-S∗ iterative algorithm can be used to approximate fixed points of generalized α-nonexpansive mappings. We discuss the convergence results of generalized α-nonexpansive mappings in the framework of CAT(0) spaces using Picard S∗ iteration process and demiclosed principle for the aforementioned class of mappings in CAT(0) spaces. This is the nonlinear version of some known results that have been demonstrated in Banach spaces. Some useful examples are obtained to illustrate facts. Some known iteration processes are also compared using numerical calculations. Our results broaden and improve the corresponding recent results announced by many authors.

Full Text: PDF

Published: 2021-04-13

How to Cite this Article:

Pinki Lamba, Anju Panwar, A Picard S∗ iterative algorithm for approximating fixed points of generalized α-nonexpansive mappings, J. Math. Comput. Sci., 11 (2021), 2874-2892

Copyright © 2021 Pinki Lamba, Anju Panwar. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

 

Copyright ©2022 JMCS