Quadratic interval refinement for real roots
From MaRDI portal
Publication:5255832
DOI10.1145/2644288.2644291zbMath1314.65068arXiv1203.1227MaRDI QIDQ5255832
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
68W30: Symbolic computation and algebraic computation
65H04: Numerical computation of roots of polynomial equations
Related Items
Unnamed Item, Exact symbolic-numeric computation of planar algebraic curves, Computing real roots of real polynomials, A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics, Nearly optimal refinement of real roots of a univariate polynomial, On the asymptotic and practical complexity of solving bivariate systems over the reals, A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration, A new trigonometrical algorithm for computing real root of non-linear transcendental equations, Near optimal subdivision algorithms for real root isolation, Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image, Koszul Algebras and Computations