<p>By using the Ishikawa iterative algorithm, we approximate fixed points and best proximity points of a relatively nonexpansive mapping. Furthermore, we use the von Neumann sequence to prove the convergence result in a Hilbert space setting. A comparison table is prepared using a numerical example which shows that the Ishikawa iterative algorithm is faster than some known iterative algorithms such as Picard and Mann iteration.</p>

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

Convergence of Fixed Points for Relatively Nonexpansive Mappings via Ishikawa Iteration

  • Veerasamy Pragadeeswarar,
  • Raju Gopi,
  • Choonkil Park,
  • Jung Rye Lee

摘要

By using the Ishikawa iterative algorithm, we approximate fixed points and best proximity points of a relatively nonexpansive mapping. Furthermore, we use the von Neumann sequence to prove the convergence result in a Hilbert space setting. A comparison table is prepared using a numerical example which shows that the Ishikawa iterative algorithm is faster than some known iterative algorithms such as Picard and Mann iteration.