Pages that link to "Item:Q972846"

The following pages link to Faster algorithms for computing Hong's bound on absolute positiveness (Q972846):

Displaying 13 items.

• Improved bounds for the CF algorithm (Q385006) (← links)
• Improvements of Lagrange's bound for polynomial roots (Q512362) (← links)
• On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers (Q533873) (← links)
• A deterministic algorithm for isolating real roots of a real polynomial (Q607163) (← links)
• A general approach to isolating roots of a bitstream polynomial (Q655157) (← links)
• Quality of positive root bounds (Q898284) (← links)
• Bounds on absolute positiveness of multivariate polynomials (Q972843) (← links)
• Corrigendum to: ``Faster algorithms for computing Hong's bound on absolute positiveness'' (Q1690791) (← links)
• Improved bounds on absolute positiveness of multivariate polynomials (Q2188981) (← links)
• Improving root separation bounds (Q2399862) (← links)
• On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
• A Lower Bound for Computing Lagrange’s Real Root Bound (Q2830020) (← links)
• (Q5128541) (← links)