Pages that link to "Item:Q1824354"
From MaRDI portal
The following pages link to Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros (Q1824354):
Displaying 6 items.
- Inverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systems (Q639990) (← links)
- New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set (Q1129510) (← links)
- Parametrization of Newton's iteration for computations with structured matrices and applications (Q1205895) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- Efficient parallel factorization and solution of structured and unstructured linear systems (Q2486566) (← links)
