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