2021
DOI: 10.1186/s13663-020-00685-x
|View full text |Cite
|
Sign up to set email alerts
|

On Berinde’s method for comparing iterative processes

Abstract: In the literature there are several methods for comparing two convergent iterative processes for the same problem. In this note we have in view mostly the one introduced by Berinde in (Fixed Point Theory Appl. 2:97–105, 2004) because it seems to be very successful. In fact, if IP1 and IP2 are two iterative processes converging to the same element, then IP1 is faster than IP2 in the sense of Berinde. The aim of this note is to prove this almost obvious assertion and to discuss briefly several papers that cite t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 54 publications
0
1
0
Order By: Relevance
“…The choice of one iterative method over another is influenced by a few key elements, including speed, stability, and dependence. In recent years, academics have become increasingly interested in iterative algorithms with FPs that depend on data; for further information, see [28][29][30][31].…”
Section: Introductionmentioning
confidence: 99%
“…The choice of one iterative method over another is influenced by a few key elements, including speed, stability, and dependence. In recent years, academics have become increasingly interested in iterative algorithms with FPs that depend on data; for further information, see [28][29][30][31].…”
Section: Introductionmentioning
confidence: 99%