Pages that link to "Item:Q2357367"

The following pages link to Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367):

Displaying 12 items.

• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
• An adaptive subdivision method for root finding of univariate polynomials (Q1736361) (← links)
• A nearly optimal algorithm to decompose binary forms (Q1994885) (← links)
• Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
• Accelerated subdivision for clustering roots of polynomials given by evaluation oracles (Q2109981) (← links)
• Faster numerical univariate polynomial root-finding by means of subdivision iterations (Q2110240) (← links)
• From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
• Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
• \texttt{PTOPO}: computing the geometry and the topology of parametric curves (Q2674019) (← links)
• Accelerated approximation of the complex roots of a univariate polynomial (Q2819725) (← links)
• (Q4232508) (← links)
• Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation (Q4610020) (← links)