On simultaneous factoring of a polynomial

References

• Alefeld , G. and Herzberger , J. 1974 . On the convergence speed of some algorithms for the simultaneous approximation of the polynomial roots . SIAM J. Numer. Anal. , 11 : 237 – 243 .
   Web of Science ®Google Scholar
• Börsch-Supan , W. 1970 . Residuenabschätzung für Polynom-Nullstellen mittels Lagrange—Interpolation . Numer. Math. , 14 : 287 – 296 .
   Google Scholar
• Carstensen , C. 1991 . Inclusion of the roots of a polynomial based on Gershgorin's theorem . Numer. Math. , 59 : 349 – 360 .
   Google Scholar
• Carstensen , C. 1992 . On the Grau's method for simultaneous factorization of polynomials . SIAM J. Numer. Anal. , 29 : 601 – 613 .
   Google Scholar
• Fraigniaud , P. 1991 . The Durand-Kerner polynomial root-finding method in case of multiple roots . BIT , 31 : 112 – 123 .
   Google Scholar
• Grau , A. A. 1971 . The simultaneous Newton improvement of a complete set of approximate factors of a polynomial . SIAM J. Numer. Anal. , 8 : 425 – 438 .
   Google Scholar
• Guggenheimer , H. 1986 . Initial approximations in Durand-Kerner's rootfinding method . BIT , 26 : 537 – 539 .
   Google Scholar
• Petković M. S. Iterative Methods for Simultaneous Inclusion of Polynomial Zeros 1989 1387 Springer Lecture Note
   Google Scholar
• Ortega , J. M. and Rheinboldt , W. C. 1970 . “ Iterative Solution of Nonlinear Equations in Several Variables ” . New York : Academic Press .
   Google Scholar
• Stewart , G. W. 1969 . Some Iterations for Factoring a Polynomial . Numer. Math. , 13 : 458 – 471 .
   Google Scholar