A note about "Faster algorithms for computing Hong's bound on absolute positiveness" by K. Mehlhorn and S. Ray
classification
💻 cs.SC
keywords
boundcomputinghongabsolutealgorithmsfastermehlhornpositiveness
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.