Univariate real root isolation in an extension field and applications
From MaRDI portal
Publication:1757003
DOI10.1016/j.jsc.2017.12.001zbMath1408.68148OpenAlexW2626508605MaRDI QIDQ1757003
Adam Wojciech Strzeboński, Elias P. Tsigaridas
Publication date: 28 December 2018
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01248390v2/file/st-rsef-jsc.pdf
algebraic polynomialfield extensionSturm sequencesreal root isolationDescartes' rule of signseparation bounds
Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)
Related Items (4)
\texttt{PTOPO}: computing the geometry and the topology of parametric curves ⋮ On Isolating Roots in a Multiple Field Extension ⋮ Clustering complex zeros of triangular systems of polynomials ⋮ Bounds for polynomials on algebraic numbers and application to curve topology
Uses Software
Cites Work
- Separating linear forms and rational univariate representations of bivariate systems
- A deterministic algorithm for isolating real roots of a real polynomial
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- On the complexity of isolating real roots and computing with certainty the topological degree
- Complete numerical isolation of real roots in zero-dimensional triangular systems
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Efficient isolation of polynomial's real roots.
- An algorithm for isolating the real solutions of semi-algebraic systems
- Towards faster real algebraic numbers
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- On the Davenport-Mahler bound
- Real solution isolation using interval arithmetic
- On the complexity of real root isolation using continued fractions
- The DMM bound
- Almost tight recursion tree bounds for the Descartes method
- Change of order for bivariate triangular sets
- On the boolean complexity of real root refinement
- Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
- When Newton meets Descartes
- Univariate real root isolation in an extension field
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- Computer Algebra in Scientific Computing
- Nearly optimal computations with structured matrices
- Algorithms in real algebraic geometry
- Sylvester-Habicht sequences and fast Cauchy index computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Univariate real root isolation in an extension field and applications
