Locating multiple zeros interactively (Q1067359)

The paper is concerned with an algorithm, which is implemented interactively, for the total or partial factorization of a polynomial. In the first phase, a parallel search algorithm is used to locate successively smaller circles containing zeros. This continues until a reliable estimation of the multiplicities of the zeros is possible. In the second phase, an iteration is applied which provides convergence of order 3 or 4. It is considered as important that in the second phase no deflation of the given polynomial is necessary because of the separation of the zeros. There are comments on various inclusion tests. The list of references contains 33 items.