Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers
From MaRDI portal
Publication:4610025
DOI10.1007/978-3-319-56932-1_27zbMath1393.11086OpenAlexW2619134880MaRDI QIDQ4610025
Elias P. Tsigaridas, Adam Wojciech Strzeboński
Publication date: 5 April 2018
Published in: Applications of Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01001820/file/st-rs-log%20%281%29.pdf
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Algebraic numbers; rings of algebraic integers (11R04)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving bivariate systems using rational univariate representations
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
- A deterministic algorithm for isolating real roots of a real polynomial
- Khovanskii-Rolle continuation for real solutions
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Complete numerical isolation of real roots in zero-dimensional triangular systems
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Computing the real roots of a polynomial by the exclusion algorithm
- Linear forms in two logarithms and Schneider's method
- Approximating the zeros of analytic functions by the exclusion algorithm
- On nearest-neighbor graphs
- Efficient isolation of polynomial's real roots.
- An algorithm for isolating the real solutions of semi-algebraic systems
- 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
- On location and approximation of clusters of zeros of analytic functions
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
- Modern Computer Algebra
- A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers
- Random polynomials and expected complexity of bisection methods for real solving
- The DMM bound
- On the boolean complexity of real root refinement
- Modern Computer Arithmetic
- Fast Multiple-Precision Evaluation of Elementary Functions
- How many zeros of a random polynomial are real?
- Univariate real root isolation in multiple extension fields
- Univariate real root isolation in an extension field
- Computer Algebra in Scientific Computing
- Linear forms in the logarithms of algebraic numbers (IV)
