Pages that link to "Item:Q1644000"
From MaRDI portal
The following pages link to A stable, polynomial-time algorithm for the eigenpair problem (Q1644000):
Displaying 11 items.
- Condition length and complexity for the solution of polynomial systems (Q506608) (← links)
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (Q1683739) (← links)
- On pole-swapping algorithms for the eigenvalue problem (Q2218921) (← links)
- The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs (Q3119536) (← links)
- Smale 17th Problem: Advances and Open Directions (Q3380357) (← links)
- How well-conditioned can the eigenvector problem be? (Q5070539) (← links)
- On the Condition Number of the Shifted Real Ginibre Ensemble (Q5099419) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- The foundations of spectral computations via the solvability complexity index hierarchy (Q6064883) (← links)
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time (Q6142334) (← links)
- Overlaps, eigenvalue gaps, and pseudospectrum under real Ginibre and absolutely continuous perturbations (Q6663954) (← links)
