Pages that link to "Item:Q2110240"

The following pages link to Faster numerical univariate polynomial root-finding by means of subdivision iterations (Q2110240):

Displayed 2 items.

• Accelerated subdivision for clustering roots of polynomials given by evaluation oracles (Q2109981) ‎ (← links)
• Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues (Q6057349) ‎ (← links)