The following pages link to (Q5590393):
Displaying 12 items.
- Root radii and subdivision for polynomial root-finding (Q831975) (← links)
- On the worst-case arithmetic complexity of approximating zeros of polynomials (Q1101184) (← links)
- Computational complexity of real functions (Q1171056) (← links)
- Computing the real roots of a polynomial by the exclusion algorithm (Q1208054) (← links)
- Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain (Q1905198) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Fehlerschranken zu Näherungswerten von Polynomwurzeln (Q2544512) (← links)
- Circular arithmetic and the determination of polynomial zeros (Q2549925) (← links)
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions (Q2576275) (← links)
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial (Q4069691) (← links)
- Some higher-order methods for the simultaneous approximation of multiple polynomial zeros (Q4728106) (← links)
- New Practical Advances in Polynomial Root Clustering (Q5014669) (← links)
