Near optimal tree size bounds on a simple real root isolation algorithm

DOI10.1145/2442829.2442875zbMath1323.65052OpenAlexW2033139465MaRDI QIDQ5244551

Vikram Sharma, Chee-Keng Yap

Publication date: 27 March 2015

Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2442829.2442875

zbMATH Keywords

subdivision algorithmcontinuous amortizationreal root isolationintegral analysis

Mathematics Subject Classification ID

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

Related Items (6)

Continuous amortization and extensions: with applications to bisection-based root isolation ⋮ Near optimal subdivision algorithms for real root isolation ⋮ Soft Subdivision Search in Motion Planning, II: Axiomatics ⋮ A symbolic-numerical algorithm for isolating real roots of certain radical expressions ⋮ Computing the intersection between a rational parametric curve and a rational parametric surface ⋮ On soft predicates in subdivision motion planning

This page was built for publication: Near optimal tree size bounds on a simple real root isolation algorithm