Pages that link to "Item:Q5401702"
From MaRDI portal
The following pages link to Fast computation of zeros of polynomial systems with bounded degree under finite-precision (Q5401702):
Displaying 11 items.
- Complexity of path-following methods for the eigenvalue problem (Q404275) (← links)
- On Smale's 17th problem: a probabilistic positive solution (Q937276) (← links)
- A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
- Accurate simple zeros of polynomials in floating point arithmetic (Q1004779) (← links)
- Fast algorithms for zero-dimensional polynomial systems using duality (Q1422204) (← links)
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (Q1683739) (← links)
- A randomized homotopy for the Hermitian eigenpair problem (Q2340509) (← links)
- Sorting-based localization and stable computation of zeros of a polynomial. II. (Q2458056) (← links)
- On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials (Q3831940) (← links)
- A Faster Solution to Smale's 17th Problem I (Q5121124) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
