scientific article; zbMATH DE number 3903860
factorization of polynomialsFilippi's proceduregeneralized inverse of matricesKerner's proceduremultiple rootsNewton correctionNewton-Girard formulaNewton-Raphson methodrate of convergencetotal-step methods
Polynomials in real and complex fields: factorization (12D05) Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of solutions to single equations (65H05)
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.
- Locating multiple zeros interactively
- Hankel matrices and their applications to the numerical factorization of polynomials
- On one method of factorization of polynomials
- scientific article; zbMATH DE number 3903858 (Why is no real title available?)
- scientific article; zbMATH DE number 3930240 (Why is no real title available?)
- scientific article; zbMATH DE number 3947528 (Why is no real title available?)
- scientific article; zbMATH DE number 4024643 (Why is no real title available?)
- Real arithmetic versions of simultaneous iteration methods for polynomial root finding
- On simultaneous factoring of a polynomial
- scientific article; zbMATH DE number 3220761 (Why is no real title available?)
- scientific article; zbMATH DE number 3035235 (Why is no real title available?)
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)