Pages that link to "Item:Q2959032"
From MaRDI portal
The following pages link to Computing clustered close-roots of univariate polynomials (Q2959032):
Displaying 8 items.
- Rational cubic clipping with linear complexity for computing roots of polynomials (Q668578) (← links)
- Zero-clusters of polynomials: best approach in supercomputing era (Q961599) (← links)
- Closed formula for univariate subresultants in multiple roots (Q1736211) (← links)
- Tighter bounds of errors of numerical roots (Q2467047) (← links)
- Near optimal subdivision algorithms for real root isolation (Q2628307) (← links)
- Complexity Analysis of Root Clustering for a Complex Polynomial (Q2985810) (← links)
- (Q4648391) (← links)
- New Practical Advances in Polynomial Root Clustering (Q5014669) (← links)