Pages that link to "Item:Q1680157"
From MaRDI portal
The following pages link to A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157):
Displaying 11 items.
- Affine equivalences of trigonometric curves (Q829601) (← links)
- Root radii and subdivision for polynomial root-finding (Q831975) (← links)
- Clustering complex zeros of triangular systems of polynomials (Q2035625) (← links)
- Accelerated subdivision for clustering roots of polynomials given by evaluation oracles (Q2109981) (← links)
- Bounds for polynomials on algebraic numbers and application to curve topology (Q2118214) (← links)
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions (Q2656085) (← links)
- Certified Hermite Matrices from Approximate Roots - Univariate Case (Q5014656) (← links)
- New Practical Advances in Polynomial Root Clustering (Q5014669) (← links)
- On μ-symmetric polynomials (Q5046095) (← links)
- Polynomials Whose Zeros Are Powers of a Given Polynomial’s Zeros (Q5067483) (← links)
- Complexity of a root clustering algorithm for holomorphic functions (Q6496875) (← links)
