On Convergence of an Accelerated Modified Newton Method for Nonlinear Equations

Newton’s iteration is a fundamental tool for root-finding and numerical solutions of systems of equations. The iteration rapidly refines the initial approximation to the exact root, and in general, the convergence is quadratic. Since the method requires finding the function value and its derivative at each iteration, in some cases, it may not converge. This is because the value of the derivative gets close to zero. In this paper, we introduce a modified and stable algorithm of Newton’s iteration method that addresses this issue, reduces computational cost, and improves efficiency. In addition, we analyze the convergence properties of the modified method to demonstrate its effectiveness.