A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane

Abstract

A numerical method for solving polynomial equations ms presented Its basic module is a method. using Sturm sequences, for counting the zeros which lie m a given rectangle m the complex plane The method ms deflation-free, handles multiple complex zeros, and contains budt-m safeguards against buildup of roundoff error