Scholarlink

In this paper, we introduce a new iterative method to approximate fixed points of contraction mappings. We prove the convergence theorem and compare its rate of convergence with CR, SM, Piri and \(S^*\) iterative algorithms. We also give data dependence and stability results. Moreover, we numerically compare our algorithm with \(S^*\) , Piri, SM and CR iterative algorithms.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Data Dependence, Stability and Convergence Rate of Novel Iterative Algorithm

  • 章节

  • 发表日期：

    2025年

查看全文
  • Meenakshi Gugnani,
  • Charu Batra

摘要

In this paper, we introduce a new iterative method to approximate fixed points of contraction mappings. We prove the convergence theorem and compare its rate of convergence with CR, SM, Piri and \(S^*\) iterative algorithms. We also give data dependence and stability results. Moreover, we numerically compare our algorithm with \(S^*\) , Piri, SM and CR iterative algorithms.