Pages that link to "Item:Q2110242"
From MaRDI portal
The following pages link to Acceleration of subdivision root-finding for sparse polynomials (Q2110242):
Displaying 5 items.
- 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)
- Near optimal subdivision algorithms for real root isolation (Q2628307) (← links)
- (Q4226968) (← links)
- Efficiently Computing Real Roots of Sparse Polynomials (Q5119944) (← links)