Nearly Optimal Black Box Polynomial Root-finders
VY Pan - Proceedings of the 2024 Annual ACM-SIAM …, 2024 - SIAM
Univariate polynomial root-finding has been studied for four millennia and very intensively in
the last decades. Our novel nearly optimal Las Vegas randomized root-finders approximate …
the last decades. Our novel nearly optimal Las Vegas randomized root-finders approximate …
A new fast root-finder for black box polynomials
Univariate polynomial root-finding has been studied for four millennia and very intensively in
the last decades. Our black box root-finder involves no coefficients and works for a black box …
the last decades. Our black box root-finder involves no coefficients and works for a black box …
Good News for Polynomial Root-finding
VY Pan - arXiv preprint arXiv:1805.12042, 2018 - arxiv.org
Univariate polynomial root-finding has been studied for four millennia and very intensively in
the last decades. We approximate all complex roots as well as the roots in a fixed domain of …
the last decades. We approximate all complex roots as well as the roots in a fixed domain of …