Numerical factorization of a polynomial by rational Hermite interpolation
From MaRDI portal
Publication:688142
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)
Recommendations
Cites work
- 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
Cited in
(3)
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)