On the convergence order for some methods of simultaneous root finding for polynomials using a computer algebra system

Abstract

In this paper several methods for finding the roots of a polynomial simultaneously are revised, together with a general method for proving their convergence. The theorem used states a lower bound of the convergence order, too. The conditions of this theorem may be easily verified using a Computer Algebra System, like Mathematica. The verification is carried out on a particular polynomial.