Pages that link to "Item:Q2378508"

The following pages link to Complexity of real root isolation using continued fractions (Q2378508):

Displaying 17 items.

• Improved bounds for the CF algorithm (Q385006) (← links)
• On the computing time of the continued fractions method (Q438690) (← links)
• Computing real roots of real polynomials (Q491245) (← links)
• Continued fraction real root isolation using the Hong root bound (Q492021) (← links)
• On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers (Q533873) (← links)
• Adaptive isotopic approximation of nonsingular curves: The parameterizability and nonlocal isotopy approach (Q540445) (← 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)
• SqFreeEVAL: An (almost) optimal real-root isolation algorithm (Q655566) (← links)
• A quadratic clipping step with superquadratic convergence for bivariate polynomial systems (Q691650) (← links)
• Faster algorithms for computing Hong's bound on absolute positiveness (Q972846) (← links)
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
• Logcf: an efficient tool for real root isolation (Q2287381) (← links)
• On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
• Estimations of positive roots of polynomials (Q2452946) (← links)
• A symbolic-numerical algorithm for isolating real roots of certain radical expressions (Q2656085) (← links)
• A Lower Bound for Computing Lagrange’s Real Root Bound (Q2830020) (← links)