Faster algorithms for computing Hong's bound on absolute positiveness

DOI10.1016/J.JSC.2010.02.002zbMATH Open1206.11151OpenAlexW1968804058MaRDI QIDQ972846FDOQ972846

Authors: K. Mehlhorn, Saurabh Ray 

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

Recommendations

• Corrigendum to: ``Faster algorithms for computing Hong's bound on absolute positiveness
• Faster algorithms via approximation theory
• An efficient algorithm for positive realizations
• scientific article
• Integer Programming and Combinatorial Optimization
• Positive versions of polynomial time
• Algorithms for positive polynomial approximation
• On recursive bounds for the exceptional values in speed-up
• Bounds on Herman's algorithm
• An algorithmic approach to Schmüdgen's Positivstellensatz

zbMATH Keywords

geometric computingabsolute positivenessHong's bound

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05) Real and complex fields (12D99)

Cites Work

• Bounds for absolute positiveness of multivariate polynomials
• Complexity of real root isolation using continued fractions
• Title not available (Why is that?)
• A comparative study of two real root isolation methods

Cited In (13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972846)