Comparison of The Speed of Convergence Among Various Iterative Schemes

2014/02/25 by Vatan Karakaya, Karakaya, Vatan, Faik Gürsoy +3
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #FOS: Mathematics #Fixed Point Theorems Analysis #Functional Analysis (math.FA) #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.1402.6080

openalex publication_date 2014/02/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We show that iterative scheme due to Karahan and Özdemir (2013) can be used to approximate fixed point of contraction mappings. Furthermore, we prove that CR iterative scheme converges faster than the iterative scheme due to Karahan and Özdemir (2013) for the class contraction mappings. Finally, we prove a data dependence result for contraction mappings by employing iterative scheme due to Karahan and Özdemir (2013).

Related

• The Impact of Data Dependence, Convergence and Stability by AT Iterative Algorithms
• A Picard-S Iterative Scheme for Approximating Fixed Point of Weak-Contraction Mappings
• A Converse to Banach's Fixed Point Theorem and its CLS Completeness
• Data dependence results of a new multistep and S-iterative schemes for\n contractive-like operators
• Some remarks on "Convergence of Picard's iteration using projection algorithm for noncyclic contractions" [Indag. Math. 30 (2019) 227--239]