A note about "Faster algorithms for computing Hong's bound on absolute positiveness" by K. Mehlhorn and S. Ray
Symbolic Computation
2016-11-22 v1
Abstract
We show that a linear-time algorithm for computing Hong's bound for positive roots of a univariate polynomial, described by K. Mehlhorn and S. Ray in an article "Faster algorithms for computing Hong's bound on absolute positiveness", is incorrect. We present a corrected version.
Keywords
Cite
@article{arxiv.1611.06548,
title = {A note about "Faster algorithms for computing Hong's bound on absolute positiveness" by K. Mehlhorn and S. Ray},
author = {Przemysław Koprowski},
journal= {arXiv preprint arXiv:1611.06548},
year = {2016}
}