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
Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
An algorithm for isolating the real solutions of semi-algebraic systems
Journal of Symbolic Computation
Towards faster real algebraic numbers
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Towards faster real algebraic numbers
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
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
Improved algorithms for computing determinants and resultants
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Change of order for bivariate triangular sets
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Real solution isolation using interval arithmetic
Computers & Mathematics with Applications
On the asymptotic and practical complexity of solving bivariate systems over the reals
Journal of Symbolic Computation
Complete numerical isolation of real roots in zero-dimensional triangular systems
Journal of Symbolic Computation
A Separation Bound for Real Algebraic Expressions
Algorithmica
Lower bounds for zero-dimensional projections
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
The DMM bound: multivariate (aggregate) separation bounds
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
A deterministic algorithm for isolating real roots of a real polynomial
Journal of Symbolic Computation
Algorithms for computing triangular decompositions of polynomial systems
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Efficient real root approximation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Univariate real root isolation in an extension field
Proceedings of the 36th international symposium on Symbolic and algebraic computation
A descartes algorithm for polynomials with bit-stream coefficients
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Algorithms for computing triangular decomposition of polynomial systems
Journal of Symbolic Computation
When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Computation in real closed infinitesimal and transcendental extensions of the rationals
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Hi-index | 0.00 |
We present algorithmic, complexity and implementation results for the problem of isolating the real roots of a univariate polynomial in Bα ∈ L[y], where L = Q(α1,..., αℓ) is an algebraic extension of the rational numbers. Our bounds are single exponential in ℓ and match the ones presented in [34] for the case ℓ = 1. We consider two approaches. The first, indirect approach, using multivariate resultants, computes a univariate polynomial with integer coefficients, among the real roots of which are the real roots of Bα. The Boolean complexity of this approach is OB(N4ℓ+4), where N is the maximum of the degrees and the coefficient bitsize of the involved polynomials. The second, direct approach, tries to solve the polynomial directly, without reducing the problem to a univariate one. We present an algorithm that generalizes Sturm algorithm from the univariate case, and modified versions of well known solvers that are either numerical or based on Descartes' rule of sign. We achieve a Boolean complexity of OB [equation], respectively. We implemented the algorithms in C as part of the core library of Mathematica and we illustrate their efficiency over various data sets.