On Some Optimal Multiple Root-Finding Methods and their Dynamics

Finding multiple zeros of nonlinear functions pose many difficulties for many of the iterative methods. In this paper, we present an improved optimal class of higher-order methods for multiple roots having quartic convergence. The present approach of deriving an optimal class is based on weight function approach. In terms of computational cost, all the proposed methods require three functional evaluations per full iteration, so that their efficiency indices are 1.587 and, are optimal in the sense of Kung-Traub conjecture. It is found by way of illustrations that they are useful in high precision computing enviroments. Moreover, basins of attraction of some of the higher-order methods in the complex plane are also given