Pages that link to "Item:Q2819725"
From MaRDI portal
The following pages link to Accelerated approximation of the complex roots of a univariate polynomial (Q2819725):
Displaying 10 items.
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- A study of accelerated Newton methods for multiple polynomial roots (Q973853) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- Accelerated subdivision for clustering roots of polynomials given by evaluation oracles (Q2109981) (← links)
- Faster numerical univariate polynomial root-finding by means of subdivision iterations (Q2110240) (← links)
- Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367) (← links)
- Efficient parallel rooting of complex polynomials on the unit circle (Q3987283) (← links)
- Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation (Q4610020) (← links)
- Fast and Backward Stable Computation of Roots of Polynomials (Q5265003) (← links)
- Logical Approaches to Computational Barriers (Q5898841) (← links)
