Pages that link to "Item:Q757494"
From MaRDI portal
The following pages link to Simple algorithms for approximating all roots of a polynomial with real roots (Q757494):
Displaying 10 items.
- Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- Practical improvement of the divide-and-conquer eigenvalue algorithms (Q1192014) (← links)
- Specified precision polynomial root isolation is in NC (Q1329153) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Generalized updating problems and computation of the eigenvalues of rational Toeplitz matrices (Q1373318) (← 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)
- Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
- Efficient parallel factorization and solution of structured and unstructured linear systems (Q2486566) (← links)
