On the boolean complexity of real root refinement

DOI10.1145/2465506.2465938zbMath1360.65140OpenAlexW2005187819MaRDI QIDQ2963249

Pan, Victor Y., Elias P. Tsigaridas

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://hal.inria.fr/hal-00816214/file/pt-refine.pdf

zbMATH Keywords

polynomialBoolean complexityreal root refinementreal root problem

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)

Related Items (12)

On the complexity of computing the topology of real algebraic space curves ⋮ A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration ⋮ Nearly optimal refinement of real roots of a univariate polynomial ⋮ Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation ⋮ Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers ⋮ Transformations of matrix structures work again ⋮ A generic position based method for real root isolation of zero-dimensional polynomial systems ⋮ Root refinement for real polynomials using quadratic interval refinement ⋮ Univariate real root isolation in an extension field and applications ⋮ New Practical Advances in Polynomial Root Clustering ⋮ Bounds for polynomials on algebraic numbers and application to curve topology ⋮ Accelerated approximation of the complex roots and factors of a univariate polynomial

This page was built for publication: On the boolean complexity of real root refinement