Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004)

By modification and extension of ideas which are, among others, originally due to Turan, Lehmer and Weyl, the author develops sequential and parallel algorithms for the approximation of complex polynomial zeros and establishes new upper bounds on the respective arithmetic and Boolean complexity of these methods. Questions of practical implementation are discussed as well as applications to the solution of related problems.