The Fast Halley Algorithm for Finding all Zeros of a Polynomial

Based on the Halley circular iteration method,a fast Halley algorithm is constructed by circular arithmetic for finding all zeros of a polynomial,and the convergence has been established under the same condition as that for the Halley iteration method,the convergence rate of seventh order is obtained.The numerical experiments show the efficiency of the proposed algorithm.