Convergence conditions of some methods for the simultaneous computation of polynomial zero (Q1272804): Difference between revisions

The paper is concerned with polynomial roots finding. Three known iterative methods are analyzed: Newton's method, Aberth's method and Durand-Kerner's method. The methods of Aberth and of Durand-Kerner give simultaneous approximations of the roots of a polynomial and have a local superlinear convergence, in case of simple roots. The author analyzes the convergence of these methods and, for each of the methods cited above, gives conditions on the starting approximation under which the approximation error tends to zero in a doubly exponential way.