Pages that link to "Item:Q2565192"
From MaRDI portal
The following pages link to An efficient algorithm for the complex roots problem (Q2565192):
Displayed 21 items.
- Globally convergent, iterative path-following for algebraic equations (Q655158) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- A refined model of computation for continuous problems (Q1265141) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Why does information-based complexity use the real number model? (Q1292417) (← links)
- Some speed-ups and speed limits for real algebraic geometry (Q1594829) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- An adaptive subdivision method for root finding of univariate polynomials (Q1736361) (← links)
- On solving univariate sparse polynomials in logarithmic time (Q1763426) (← links)
- Algorithms for quaternion polynomial root-finding (Q2434926) (← links)
- Near optimal subdivision algorithms for real root isolation (Q2628307) (← links)
- Advice Coins for Classical and Quantum Computation (Q3012792) (← links)
- Tight space-noise tradeoffs in computing the ergodic measure (Q4610200) (← links)
- Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038) (← links)
- Spectral norm of a symmetric tensor and its computation (Q5113665) (← links)
- Inapproximability of the Independent Set Polynomial in the Complex Plane (Q5129229) (← links)
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy (Q5943088) (← links)
- On the geometry of Graeffe iteration (Q5949383) (← links)
- Validated Root Enclosures for Interval Polynomials with Multiplicities (Q6060355) (← links)
- CCOMP: an efficient algorithm for complex roots computation of determinantal equations (Q6155746) (← links)