An efficient interval Newton algorithm for univariate polynomial equation was proposed.This algorithm reduced greatly the number of iterations and computations based on Hansen’s method for univariate polynomial equation. The algorithm was implemented as a Maple program.Compared with the existing algorithm, this algorithm was dramatically fast in some cases.A large number of polynomials generated randomly by Maple were tested and the performance was reported.