The aim of this article is to design a new iteration process for solving certain fixed-point problems. In particular, we prove weak and strong convergence theorems for generalized nonexpansive mappings in the framework of uniformly convex Banach spaces. In addition, we discuss the stability of the solution under mild conditions. Further, we provide some numerical examples to indicate that the proposed method works properly.
Fixed point theory is a branch of mathematics that studies solutions that remain unchanged under a given transformation or operator, and it has numerous applications in fields such as mathematics, economics, computer science, engineering, and physics. In the present article, we offer a quicker iteration technique, the iteration technique, for approximating fixed points in generalized -nonexpansive mappings and nearly contracted mappings. In uniformly convex Banach spaces, we develop weak and strong convergence results for the iteration approach to the fixed points of generalized -nonexpansive mappings. In order to demonstrate the effectiveness of our recommended iteration strategy, we provide comprehensive analytical, numerical, and graphical explanations. Here, we also demonstrate the stability consequences of the new iteration technique. We approximately solve a fractional Volterra–Fredholm integro-differential problem as an application of our major findings. Our findings amend and expand upon some previously published results.
The major aim of this article is to show how to estimate direct errors using the J iteration method. Direct error estimation of iteration processes is being investigated in different journals. We also illustrate that an error in the J iteration process can be controlled. Furthermore, we express J iteration convergence by using distinct initial values.