Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

A New Iterative Scheme for Approximation of Fixed Points of Suzuki's Generalized Nonexpansive Mappings

View through CrossRef
In this paper, we introduce a new iteration scheme, named as the S**-iteration scheme, for approximation of fixed point of the nonexpansive mappings. This scheme is faster than Picard, Mann, Ishikawa, Noor, Agarwal, Abbas, Thakur, and Ullah iteration schemes. We show the stability of our instigated scheme and give a numerical example to vindicate our claim. We also put forward some weak and strong convergence theorems for Suzuki's generalized nonexpansive mappings in the setting of uniformly convex Banach spaces. Our results comprehend, improve, and consolidate many results in the existing literature.
Title: A New Iterative Scheme for Approximation of Fixed Points of Suzuki's Generalized Nonexpansive Mappings
Description:
In this paper, we introduce a new iteration scheme, named as the S**-iteration scheme, for approximation of fixed point of the nonexpansive mappings.
This scheme is faster than Picard, Mann, Ishikawa, Noor, Agarwal, Abbas, Thakur, and Ullah iteration schemes.
We show the stability of our instigated scheme and give a numerical example to vindicate our claim.
We also put forward some weak and strong convergence theorems for Suzuki's generalized nonexpansive mappings in the setting of uniformly convex Banach spaces.
Our results comprehend, improve, and consolidate many results in the existing literature.

Related Results

Convergence of AA-Iterative Algorithm for Generalized α-Nonexpansive Mappings with an Application
Convergence of AA-Iterative Algorithm for Generalized α-Nonexpansive Mappings with an Application
The aim of this paper is to approximate the fixed points of generalized α-nonexpansive mappings using AA-iterative algorithm. We establish some weak and strong convergence results ...
Biomappings: Community curation of mappings between biomedical entities
Biomappings: Community curation of mappings between biomedical entities
Many related biomedical resources propose their own identifiers for genes, proteins, chemicals, biological processes, and other entities of biological interest. The integration of ...
A class of Yosida inclusion and graph convergence on Yosida approximation mapping with an application
A class of Yosida inclusion and graph convergence on Yosida approximation mapping with an application
The proposed work is presented in two folds. The first aim is to deals with the new notion called generalized ?i?j-Hp(., ., ...)-accretive mappings that are the sum of two sy...
A Quicker Iteration Method for Approximating the Fixed Point of Generalized α-Reich-Suzuki Nonexpansive Mappings with Applications
A Quicker Iteration Method for Approximating the Fixed Point of Generalized α-Reich-Suzuki Nonexpansive Mappings with Applications
Fixed point theory is a branch of mathematics that studies solutions that remain unchanged under a given transformation or operator, and it has numerous applications in fields such...
D. T. Suzuki
D. T. Suzuki
D. T. Suzuki (Daisetz [Daisetsu] Teitarō Suzuki, b. 1870–d. 1966) was a Japanese scholar of Buddhism who published extensively in both Japanese and English and who emerged as a fam...
Asymptotically isometric copies of $\ell^{1\boxplus 0}$
Asymptotically isometric copies of $\ell^{1\boxplus 0}$
Using James' Distortion Theorems, researchers have inquired relations between spaces containing nice copies of $c_0$ or $\ell^1$ and the failure of the fixed point property for non...
Strong convergence theorems for Bregman W-mappings with applications to convex feasibility problems in Banach spaces
Strong convergence theorems for Bregman W-mappings with applications to convex feasibility problems in Banach spaces
AbstractIn this paper we introduce new modified Mann iterative processes for computing fixed points of an infinite family of Bregman W-mappings in reflexive Banach spaces. Let $W_{...

Back to Top