Numerical factorization of a polynomial by rational Hermite interpolation
Bairstow methodlocal and global convergencenumerical examplesnumerical factorizationrational Hermite interpolationroot finding algorithm
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)
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.
- A divide and conquer method for polynomial zeros
- A high-order iterative formula for simultaneous determination of zeros of a polynomial
- A Property of Euclid’s Algorithm and an Application to Padé Approximation
- An iterative method for algebraic equation by Padé approximation
- On the use of Kronecker's algorithm in the generalized rational interpolation problem
- Root determination by use of Padé approximants
- Some iterations for factoring polynomials
This page was built for publication: Numerical factorization of a polynomial by rational Hermite interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688142)