In this paper we deal with the problem of locating all the zeros of a
given polynomial p(x) and approximating them to any degree of precisio
n: by combining classical iterative methods with homotopy path trackin
g techniques, we introduce a new algorithm for polynomial root finding
, prove its convergence and estimate its computational cost.