2022
DOI: 10.3390/sym14010123
|View full text |Cite
|
Sign up to set email alerts
|

A Modified Krasnosel’skiǐ–Mann Iterative Algorithm for Approximating Fixed Points of Enriched Nonexpansive Mappings

Abstract: For approximating the fixed points of enriched nonexpansive mappings in Hilbert spaces, we consider a modified Krasnosel’skiǐ–Mann algorithm for which we prove a strong convergence theorem. We also empirically compare the rate of convergence of the modified Krasnosel’skiǐ–Mann algorithm and of the simple Krasnosel’skiǐ fixed point algorithm. Based on the numerical experiments reported in the paper we conclude that, for the class of enriched nonexpansive mappings, it is more convenient to work with the simple K… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
1
1

Relationship

2
3

Authors

Journals

citations
Cited by 12 publications
(15 citation statements)
references
References 22 publications
0
15
0
Order By: Relevance
“…, and 𝛿 n = 0 for each n ≥ 0, then Algorithm 1 reduces to the algorithm (6) of Berinde [12,Theorem 2] for enriched nonexpansive mapping.…”
Section: Corollary 33 Let H 1 and H 2 Be Two Real Hilbert Spaces And ...mentioning
confidence: 99%
See 4 more Smart Citations
“…, and 𝛿 n = 0 for each n ≥ 0, then Algorithm 1 reduces to the algorithm (6) of Berinde [12,Theorem 2] for enriched nonexpansive mapping.…”
Section: Corollary 33 Let H 1 and H 2 Be Two Real Hilbert Spaces And ...mentioning
confidence: 99%
“…In this section, we present numerical experiments to demonstrate the behaviors of the proposed algorithms. Furthermore, we also compare it with some existing methods, namely, the Krasnosel'ski ǐ iteration (3) [6], the modified Krasnosel'ski ǐ-Mann iteration (6) in Berinde [12], and algorithm (9) in Shehu and Ogbuisi [23]. For more convenient, we shall denote by ALG 1, ALG 2, KRAS (3), MKMB (6), and SHOG (9), Algorithm 1, Algorithm 2, (6), and (9), respectively.…”
Section: Numerical Experimentsmentioning
confidence: 99%
See 3 more Smart Citations