Faster algorithms for computing Hong's bound on absolute positiveness

DOI10.1016/j.jsc.2010.02.002zbMath1206.11151OpenAlexW1968804058MaRDI QIDQ972846

Saurabh Ray, Kurt Mehlhorn

Publication date: 21 May 2010

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2010.02.002

zbMATH Keywords

geometric computingabsolute positivenessHong's bound

Mathematics Subject Classification ID

Related Items (13)

Improving root separation bounds ⋮ A deterministic algorithm for isolating real roots of a real polynomial ⋮ Improved bounds for the CF algorithm ⋮ Improved bounds on absolute positiveness of multivariate polynomials ⋮ Corrigendum to: ``Faster algorithms for computing Hong's bound on absolute positiveness ⋮ Quality of positive root bounds ⋮ On the complexity of the Descartes method when using approximate arithmetic ⋮ A general approach to isolating roots of a bitstream polynomial ⋮ Improvements of Lagrange's bound for polynomial roots ⋮ On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers ⋮ Bounds on absolute positiveness of multivariate polynomials ⋮ Unnamed Item ⋮ A Lower Bound for Computing Lagrange’s Real Root Bound

Cites Work

• Bounds for absolute positiveness of multivariate polynomials
• Complexity of real root isolation using continued fractions
• Unnamed Item
• Unnamed Item

This page was built for publication: Faster algorithms for computing Hong's bound on absolute positiveness