The following pages link to (Q4234125):
Displaying 19 items.
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- Matrix computations and polynomial root-finding with preprocessing (Q624343) (← links)
- Root-finding by expansion with independent constraints (Q662237) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Coefficient-free adaptations of polynomial root-finders (Q814095) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Polynomial factorization through Toeplitz matrix computations (Q1874656) (← 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)
- Lifting/descending processes for polynomial zeros. (Q1977147) (← links)
- Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
- Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367) (← links)
- The amended DSeSC power method for polynomial root-finding (Q2387379) (← links)
- Advice Coins for Classical and Quantum Computation (Q3012792) (← links)
- Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation (Q4610020) (← links)
- A new fast root-finder for black box polynomials (Q6658315) (← links)
