Quadratic interval refinement for real roots

DOI10.1145/2644288.2644291zbMath1314.65068arXiv1203.1227OpenAlexW1984088467MaRDI QIDQ5255832

John Abbott

Publication date: 19 June 2015

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.1227

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of roots of polynomial equations (65H04)

Related Items (12)

Near optimal subdivision algorithms for real root isolation ⋮ Unnamed Item ⋮ Exact symbolic-numeric computation of planar algebraic 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 ⋮ A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics ⋮ Koszul Algebras and Computations ⋮ Computing real roots of real polynomials ⋮ A new trigonometrical algorithm for computing real root of non-linear transcendental equations ⋮ On the asymptotic and practical complexity of solving bivariate systems over the reals ⋮ Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image ⋮ Accelerated subdivision for clustering roots of polynomials given by evaluation oracles

This page was built for publication: Quadratic interval refinement for real roots