Simple algorithms for approximating all roots of a polynomial with real roots
- 1 December 1990
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 6 (4) , 417-442
- https://doi.org/10.1016/0885-064x(90)90032-9
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real RootsSIAM Journal on Computing, 1988
- On computing the determinant in small parallel time using a small number of processorsInformation Processing Letters, 1984
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967
- An inequality for the discriminant of a polynomial.The Michigan Mathematical Journal, 1964