New iteration scheme for numerical reckoning fixed points of nonexpansive mappings (Q257871)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New iteration scheme for numerical reckoning fixed points of nonexpansive mappings |
scientific article; zbMATH DE number 6557502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New iteration scheme for numerical reckoning fixed points of nonexpansive mappings |
scientific article; zbMATH DE number 6557502 |
Statements
New iteration scheme for numerical reckoning fixed points of nonexpansive mappings (English)
0 references
17 March 2016
0 references
The authors introduce and study a new iterative scheme to prove both strong and weak convergence theorems for nonexpansive mappings in uniformly convex Banach spaces. Backed by numerical examples in their paper, they show that their new scheme is faster to converge than the Picard, the Mann, the Noor, the Agarwal et al., and the Abass et al. iteration processes for contractions in the sense of \textit{V. Berinde} [Fixed Point Theory Appl. 2004, No. 2, 97--105 (2004; Zbl 1090.47053)].
0 references
fixed point
0 references
nonexpansive mapping
0 references
weak convergence
0 references
strong convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9369094371795654
0 references
0.9274497628211976
0 references
0.9218279719352722
0 references
0.8780867457389832
0 references