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):
Displayed 4 items.
- Complexity of path-following methods for the eigenvalue problem (Q404275) (← 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)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)