scientific article; zbMATH DE number 3903860

From MaRDI portal
Publication:3681841





The paper deals with total-step procedures for simultaneous factorization of polynomials which have multiple roots. It gives 3 algorithms for 3 different cases as follows: 1) Generalization of Kerner's procedure for simultaneous factorization of polynomials which have at most 2 multiple roots, into linear factors. 2) Generalization of Filippi's procedure for simultaneous factorization of polynomials which have one multiple pair of roots, into quadratic factors. 3) Algorithm based on a method of Durand for factorization of polynomials which have several multiple roots, into linear factors. All 3 algorithms solve a nonlinear system of equations containing the Vieta root functions. The third one transforms it by means of the Newton- Girard formula into the power-sums of the unknown zeros of the polynomial in question. For solving the system of equations the Newton-Raphson method is used. In the first and second case the nonlinear system of equations is overdetermined and consistent. Here the Newton correction is given by means of a left inverse of the rectangular functional matrix. The rate of convergence is quadratic in all 3 cases. The algorithms can be applied for factorization of polynomials which have close roots or pairs of roots.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3681841)