Multiplicity estimating algorithm for zeros of a complex polynomial and its applications (Q1801851)

In previous paper the author has studied in detail the behaviour of the iterates of the Durand-Kerner method near a multiple zero of a complex polynomial. In the present paper she uses results to construct an algorithm which gives at each step of the Durand-Kerner iteration also an estimate for the multiplicities of the zeros. This can then be used to speed up the convergence and to improve the accuracy of the result.