Polynomial real root isolation using approximate arithmetic
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
Interval arithmetic in cylindrical algebraic decomposition
Journal of Symbolic Computation
Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Polynomial real root isolation using Descarte's rule of signs
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Efficient isolation of polynomial's real roots
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
Modular Algorithms In Symbolic Summation And Symbolic Integration (Lecture Notes in Computer Science)
Architecture-aware classical Taylor shift by 1
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Almost tight recursion tree bounds for the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Fast and exact geometric analysis of real algebraic plane curves
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
On the complexity of real root isolation using continued fractions
Theoretical Computer Science
Exact geometric-topological analysis of algebraic surfaces
Proceedings of the twenty-fourth annual symposium on Computational geometry
Complexity of real root isolation using continued fractions
Theoretical Computer Science
Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
A simple but exact and efficient algorithm for complex root isolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems
Computers & Mathematics with Applications
| Hi-index | 0.00 |
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is assumed that the coefficients can be approximated with arbitrary precision; exact computation in the field of coefficients is not required. We refer to such coefficients as bitstream coefficients. The algorithm is deterministic and has almost the same asymptotic complexity as the randomized algorithm of [12]. We also discuss a partial extension to multiple roots.