Approximate square-free decomposition and root-finding of lll-conditioned algebraic equations
Journal of Information Processing
Mathematics for computer algebra
Mathematics for computer algebra
Approximate GCD and its application to ill-conditioned algebraic equations
ISCM '90 Proceedings of the International Symposium on Computation mathematics
Finding a cluster of zeros of univariate polynomials
Journal of Complexity
A formula for separating small roots of a polynomial
ACM SIGSAM Bulletin
Hi-index | 0.00 |
Let P(z) be a univariate polynomial over C, having m close roots around the origin. We present a theorem which separates a cluster of m - k close roots of dk P/dzk around the origin from the other roots, where 0 ≤ k m. We compare our theorem with those of Marden-Walsh and Yakoubsohn, and show superiority of our theorem.