Efficiently Computing Real Roots of Sparse Polynomials

DOI10.1145/3087604.3087652zbMath1462.65053arXiv1704.06979OpenAlexW2607865598MaRDI QIDQ5119944

Michael Sagraloff, Gorav Jindal

Publication date: 9 September 2020

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

Full work available at URL: https://arxiv.org/abs/1704.06979

zbMATH Keywords

numerical algorithmsreal rootsbit complexityroot isolationsparse polynomialsroot approximationroot refinement

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Related Items (2)

Condition numbers for the cube. I: Univariate polynomials and hypersurfaces ⋮ Root separation for trinomials

This page was built for publication: Efficiently Computing Real Roots of Sparse Polynomials