From approximate factorization to root isolation
DOI10.1145/2465506.2465523zbMATH Open1360.68944OpenAlexW2069507832MaRDI QIDQ2963246FDOQ2963246
Michael Sagraloff, Pengming Wang, K. Mehlhorn
Publication date: 10 February 2017
Published in: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2465506.2465523
numerical algorithmscylindrical algebraic decompositionbit complexityroot isolationroot refinementcertified algorithms
Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Computational aspects of algebraic curves (14Q05) Numerical computation of roots of polynomial equations (65H04)
Cited In (8)
- Root-neededness and approximations of neededness
- Title not available (Why is that?)
- Separating linear forms and rational univariate representations of bivariate systems
- Root refinement for real polynomials using quadratic interval refinement
- On the complexity of computing with planar algebraic curves
- On the complexity of the Descartes method when using approximate arithmetic
- Bounds for polynomials on algebraic numbers and application to curve topology
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
This page was built for publication: From approximate factorization to root isolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963246)
