Pages that link to "Item:Q1903781"
From MaRDI portal
The following pages link to Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant (Q1903781):
Displaying 6 items.
- A fast and stable algorithm for splitting polynomials (Q679271) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Heuristics to sift extraneous factors in Dixon resultants (Q2117431) (← links)
- (Q3476865) (← links)
- On the geometry of Graeffe iteration (Q5949383) (← links)