The Impact of Data Dependence, Convergence and Stability by Iterative Algorithms
arXiv:2407.03337
Abstract
This article aims to present the algorithm, a novel two-step iterative approach for approximating fixed points of weak contractions within complete normed linear spaces. The article demonstrates the convergence of algorithm towards fixed points of weak contractions. Notably, it establishes the algorithm's strong convergence properties, highlighting its faster convergence compared to established iterative methods such as , normal-, Varat, Mann, Ishikawa, , and Picard algorithms. Additionally, the study explores the algorithm's almost stable behavior for weak contractions. Emphasizing practical applicability, the paper offers data-dependent results through the algorithm and substantiates findings with illustrative numerical examples
17 pages, 2 figure