The main purpose of this work is to connect the recently introduced iterative approximation scheme known as [Formula: see text]-iterative scheme with the class of generalized [Formula: see text]-nonexpansive mappings. We consider the setting of a Banach space to prove our weak and strong convergence results. Once again, we prove that the class of [Formula: see text]-nonexpansive mapping includes properly the classes of Suzuki nonexpansive, generalized [Formula: see text]-nonexpansive and as well Reich–Suzuki type nonexpansive mappings by providing a numerical example. Eventually, we prove that [Formula: see text]-iterative scheme of this example is essentially more efficient than the other well-known iterative scheme of the literature. The presented work is new and extends some other well-known results in the iterations theory.
In this article, we considered the class of generalized
α
,
β
-nonexpansive (GABN) mappings that properly includes all nonexpansive, Suzuki nonexpansive (SN), generalized
α
-nonexpansive (GAN), and Reich–Suzuki nonexpansive (RSN) mappings. We used the iterative scheme JA for finding fixed points of these mappings in a Banach space setting. We provided both weak and strong convergence results under some mild conditions on the mapping, domain, and on the parameters involved in our iterative scheme. To support these results numerically, we constructed a new example of GABN mappings and proved that the JA iterative scheme converges to its fixed point. Moreover, we proved that JA iterative scheme converges faster to the fixed point corresponding to the some other iterative schemes of the literature. Eventually, we carried out an application of our main outcome to solve a split feasibility of problems (SFPs) in the setting of GABN mappings. Thus, our results were new in the literature and improved well-known results of the literature.
We consider the class of generalized α-nonexpansive mappings in a setting of Banach spaces. We prove existence of fixed point and convergence results for these mappings under the K∗-iterative process. The weak convergence is obtained with the help of Opial’s property while strong convergence results are obtained under various assumptions. Finally, we construct two numerical examples and connect our K∗-iterative process with them. An application to solve a fractional differential equation (FDE) is also provided. It has been eventually shown that the K∗- iterative process of this example gives more accurate numerical results corresponding to some other iterative processes of the literature. The main outcome is new and improves some known results of the literature.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.