A simple but exact and efficient algorithm for complex root isolation
From MaRDI portal
Publication:5254193
DOI10.1145/1993886.1993938zbMath1323.65051OpenAlexW2073158267MaRDI QIDQ5254193
Michael Sagraloff, Chee-Keng Yap
Publication date: 9 June 2015
Published in: Proceedings of the 36th international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993886.1993938
subdivision algorithmsBolzano methodscomplexity of complex root isolationevaluation-based root isolationexact root isolation
Related Items (18)
Continuous amortization and extensions: with applications to bisection-based root isolation ⋮ Soft Subdivision Search in Motion Planning, II: Axiomatics ⋮ Finding the number of roots of a polynomial in a plane region using the winding number ⋮ Solving bivariate systems using rational univariate representations ⋮ 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 ⋮ The complexity of subdivision for diameter-distance tests ⋮ Unnamed Item ⋮ On the complexity of the Descartes method when using approximate arithmetic ⋮ A general approach to the analysis of controlled perturbation algorithms ⋮ A general approach to isolating roots of a bitstream polynomial ⋮ SqFreeEVAL: An (almost) optimal real-root isolation algorithm ⋮ An adaptive subdivision method for root finding of univariate polynomials ⋮ Computing real roots of real polynomials ⋮ From approximate factorization to root isolation with application to cylindrical algebraic decomposition ⋮ Evaluating winding numbers and counting complex roots through Cauchy indices in Isabelle/HOL ⋮ On soft predicates in subdivision motion planning ⋮ On mixed polynomials of bidegree \((n,1)\)
This page was built for publication: A simple but exact and efficient algorithm for complex root isolation
