Pages that link to "Item:Q5326390"
From MaRDI portal
The following pages link to Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests (Q5326390):
Displaying 11 items.
- Finding the number of roots of a polynomial in a plane region using the winding number (Q316523) (← links)
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- Clustering complex zeros of triangular systems of polynomials (Q2035625) (← links)
- The complexity of subdivision for diameter-distance tests (Q2188972) (← links)
- Positive root isolation for poly-powers by exclusion and differentiation (Q2409014) (← links)
- Near optimal subdivision algorithms for real root isolation (Q2628307) (← links)
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions (Q2656085) (← links)
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision (Q4995607) (← links)
- Complexity of a root clustering algorithm for holomorphic functions (Q6496875) (← links)
- Novel range functions via Taylor expansions and recursive Lagrange interpolation with application to real root isolation (Q6666537) (← links)
