Roots of a polynomial and its derivatives

Authors:
Don Coppersmith;C. Andrew Neff
Affiliations:
IBM Research, T. J. Watson Research Center, Yorktown Heights, NY;IBM Research, T. J. Watson Research Center, Yorktown Heights, NY
Venue:
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Year:
1994

Citing 1
Cited 3

On the worst-case arithmetic complexity of approximating zeros of polynomials

Journal of Complexity

Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Univariate polynomials: nearly optimal algorithms for factorization and rootfinding

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001

Quantified Score

Hi-index	0.00

Visualization

Abstract