Efficient real root approximation
From MaRDI portal
Publication:5254174
DOI10.1145/1993886.1993920zbMath1323.65049OpenAlexW2073601981MaRDI QIDQ5254174
Michael Kerber, Michael Sagraloff
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.1993920
Related Items
Exact symbolic-numeric computation of planar algebraic curves, Nearly optimal refinement of real roots of a univariate polynomial, On the complexity of the Descartes method when using approximate arithmetic, Root refinement for real polynomials using quadratic interval refinement, From approximate factorization to root isolation with application to cylindrical algebraic decomposition, A worst-case bound for topology computation of algebraic curves, Theorem of three circles in Coq