On zeros of a complex polynomial (Q1891444)

In this paper the authors develop an algorithm to find the zeros of polynomials having complex coefficients. The procedure is based upon a technique that combines integer preserving Bareiss's algorithm or Euclidean algorithm, iterative division using Newton's method for solving system of equations, argument-principle and deflated polynomial approximations. It is observed that the method works well and produces accurate zeros within a specified accuracy.