This study introduces a novel, iterative algorithm that achieves fourth-order convergence for solving nonlinear equations. Satisfying the Kung–Traub conjecture, the proposed technique achieves an optimal order of four with an efficiency index (I) of 1.587 , requiring three function evaluations. An analysis of convergence is presented to show the optimal fourth-order convergence. To verify the theoretical results, in-depth numerical comparisons are presented for both real and complex domains. The proposed algorithm is specifically examined on a variety of polynomial functions, and it is shown by the efficient and accurate results that it outperforms many existing algorithms in terms of speed and accuracy. The study not only explores the proposed method's convergence properties, computational efficiency, and stability but also introduces a novel perspective by considering the count of black points as an indicator of a method's divergence. By analyzing the mean number of iterations necessary for methods to converge within a cycle and measuring CPU time in seconds, this research provides a holistic assessment of both the efficiency and speed of iterative methods. Notably, the analysis of basins of attraction illustrates that our proposed method has larger sets of initial points that yield convergence. [ABSTRACT FROM AUTHOR]

Copyright of Axioms (2075-1680) is the property of MDPI and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)