The following pages link to (Q5563347):
Displaying 9 items.
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- A parallel Wilf algorithm for complex zeros of a polynomial (Q1156457) (← links)
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant (Q1903781) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- Root finding of polynomials as an initial value problem (Q2554940) (← links)
- General polynomial roots and their multiplicities in<i>O</i>(<i>N</i>)memory and<i>O</i>(<i>N</i><sup>2</sup>)Time<sup>∗</sup> (Q3836210) (← links)
- A root-finding algorithm based on Newton's method (Q5663315) (← links)
