Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant

DOI10.1016/0898-1221(95)00078-DzbMath0839.68033MaRDI QIDQ1903781

Pan, Victor Y.

Publication date: 12 December 1995

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

derandomization; complex polynomial factorization

Mathematics Subject Classification ID

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

On the geometry of Graeffe iteration, A fast and stable algorithm for splitting polynomials, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, Optimal and nearly optimal algorithms for approximating polynomial zeros

Cites Work

• Quasi-gcd computations
• Polynomial division and its computational complexity
• Sequential and parallel complexity of approximate evaluation of polynomial zeros
• On the worst-case arithmetic complexity of approximating zeros of polynomials
• The complexity of partial derivatives
• Parametrization of Newton's iteration for computations with structured matrices and applications
• Specified precision polynomial root isolation is in NC
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• An Inequality About Factors of Polynomials
• Taylor expansion of the accumulated rounding error
• New Resultant Inequalities and Complex Polynomial Factorization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item