Pages that link to "Item:Q2357367"
From MaRDI portal
The following pages link to Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367):
Displayed 6 items.
- 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)
- 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)
- Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation (Q4610020) (← links)