Numerical factorization of a polynomial by rational Hermite interpolation (Q688142)

The authors derive a class of iterative formulae to find numerically a factor of arbitrary degree of a polynomial \(f(x)\) based on rational Hermite interpolation. The iterative formula generates a sequence of polynomials which converges to a factor of \(f(x)\). Local and global convergence are studied. CPU-time and the number of iterations of Bairstow's and the authors' method are compared. The best results and the low costs are obtained with the authors' algorithm. Two examples are included and commented on.