Simple algorithms for approximating all roots of a polynomial with real roots
DOI10.1016/0885-064X(90)90032-9zbMATH Open0723.12011OpenAlexW2039897960MaRDI QIDQ757494FDOQ757494
Michael Ben-Or, Prasoon Tiwari
Publication date: 1990
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0885-064x(90)90032-9
Recommendations
orthogonal polynomialspolynomialparallel implementationSturm sequencereal rootssequential algorithmextended Euclidean scheme
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Real polynomials: location of zeros (26C10) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Cites Work
- On the computational power of pushdown automata
- Title not available (Why is that?)
- On computing the determinant in small parallel time using a small number of processors
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- An inequality for the discriminant of a polynomial
- Subresultants and Reduced Polynomial Remainder Sequences
- Title not available (Why is that?)
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
Cited In (14)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Specified precision polynomial root isolation is in NC
- Efficient parallel factorization and solution of structured and unstructured linear systems
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Generalized updating problems and computation of the eigenvalues of rational Toeplitz matrices
- Real polynomial root-finding by means of matrix and polynomial iterations
- Practical improvement of the divide-and-conquer eigenvalue algorithms
- Numerical computation of polynomial zeros by means of Aberth's method
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
- A new fast root-finder for black box polynomials
- Nearly optimal refinement of real roots of a univariate polynomial
- When Newton meets Descartes
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Finding polynomial roots: A fast algorithm convergent on the complex plane
This page was built for publication: Simple algorithms for approximating all roots of a polynomial with real roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757494)
