From approximate factorization to root isolation

DOI10.1145/2465506.2465523zbMath1360.68944OpenAlexW2069507832MaRDI QIDQ2963246

Michael Sagraloff, Pengming Wang, Kurt 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

zbMATH Keywords

cylindrical algebraic decompositionnumerical algorithmsbit complexityroot isolationroot refinementcertified algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) 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)

Related Items (6)

On the complexity of the Descartes method when using approximate arithmetic ⋮ Separating linear forms and rational univariate representations of bivariate systems ⋮ Root refinement for real polynomials using quadratic interval refinement ⋮ From approximate factorization to root isolation with application to cylindrical algebraic decomposition ⋮ On the complexity of computing with planar algebraic curves ⋮ Bounds for polynomials on algebraic numbers and application to curve topology

This page was built for publication: From approximate factorization to root isolation