Abstract
We compare the convergence balls and the dynamical behaviors of two efficient weighted-Newton-like equation solvers by Sharma and Arora, and Grau-Sánchez et al. First of all, the results of ball convergence for these algorithms are established by employing generalized Lipschitz constants and assumptions on the first derivative only. Consequently, outcomes for the radii of convergence, measurable error distances and the existence–uniqueness areas for the solution are discussed. Then, the complex dynamical behaviors of these solvers are compared by applying the attraction basin tool. It is observed that the solver suggested by Grau-Sánchez et al. has bigger basins than the method described by Sharma and Arora. Lastly, our ball analysis findings are verified on application problems and the convergence balls are compared. It is found that the method given by Grau-Sánchez et al. has larger convergence balls than the solver of Sharma and Arora. Hence, the solver presented by Grau-Sánchez et al. is more suitable for practical application. The convergence analysis uses the first derivative in contrast to the aforementioned studies, utilizing the seventh derivative not on these methods. The developed process can be used on other methods in order to increase their applicability.