Further generalizations of the Ishikawa algorithm

Abstract

We provide an iterative algorithm for fixed point issues in vector spaces in the paragraphs that follow. We demonstrate that, compared to the Ishikawa technique in Banach spaces, the iterative algorithm presented in this study performs better under weaker conditions. In order to achieve this, we compare the convergence behavior of iterations, and taking into account a few offered cases, we support the major findings.

Keywords

• best proximity point
• fixed point
• uniformly convex banach space
• iterative sequence