Abstract
We derive a class of iterative formulae to find numerically a factor of arbitrary degree of a polynomialf(x) based on the rational Hermite interpolation. The iterative formula generates the sequence of polynomials which converge to a factor off(x). It has a high convergence order even for a factor which includes multiple zeros. Some numerical examples are also included.
Similar content being viewed by others
References
L. Bairstow, The solution of algebraic equations with numerical coefficients in the case where several pairs of complex roots exist, Advisory Committee for Aeronautics, Technical Report for 1914–15 (1915) pp. 239–252.
F. Cordellier, On the use of Kronecker's algorithm in the generalized rational interpolation problem, Numer. Algorithms 1 (1991) 401–413.
T.L. Freeman, A divide and conquer method for polynomial zeros, J. Comput. Appl. Math. 30 (1990) 71–79.
R.J. McEliece and J.B. Shearer, A property of Euclid's algorithm and an application to Padé approximation, SIAM J. Appl. Math. 34 (1978) 611–615.
A.W. Nourein, Root determination by use of Padé approximants, BIT 16 (1976) 291–297.
T. Sakurai, H. Sugiura and T. Torii, An iterative method for algebraic equation by Padé approximation, Computing 46 (1991) 131–141.
T. Sakurai, H. Sugiura and T. Torii, A high order iterative formula for simultaneous determination of zeros of a polynomial, J. Comput. Appl. Math. 38 (1991) 387–397.
S. Sonoda, T. Sakurai, H. Sugiura and T. Torii, Numerical factorization of a polynomial by the divide and conquer method, Trans. Japan SIAM 1 (1991) 277–290 (in Japanese).
G.W. Stewart, Some iterations for factoring a polynomial, Numer. Math. 13 (1969) 458–471.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sakurai, T., Sugiura, H. & Torii, T. Numerical factorization of a polynomial by rational Hermite interpolation. Numer Algor 3, 411–418 (1992). https://doi.org/10.1007/BF02141948
Issue Date:
DOI: https://doi.org/10.1007/BF02141948