Sciweavers

Share
JSC
2010

Faster algorithms for computing Hong's bound on absolute positiveness

8 years 10 months ago
Faster algorithms for computing Hong's bound on absolute positiveness
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero coefficients. For the univariate case, we give a linear time algorithm. As a consequence, the time bounds for the continued fraction algorithm for real root isolation improve by a factor of δ.
Kurt Mehlhorn, Saurabh Ray
Added 29 Jan 2011
Updated 29 Jan 2011
Type Journal
Year 2010
Where JSC
Authors Kurt Mehlhorn, Saurabh Ray
Comments (0)
books