A stable, polynomial-time algorithm for the eigenpair problem

DOI10.4171/JEMS/789zbMath1401.65034arXiv1505.03290OpenAlexW2964076147MaRDI QIDQ1644000

Peter Bürgisser, Felipe Cucker, Michael Shub, Diego Armentano, Carlos Beltran

Publication date: 21 June 2018

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.03290

zbMATH Keywords

homotopy methodsmatrix eigenvalueseigenvalue computationsoperations count

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

How well-conditioned can the eigenvector problem be? ⋮ A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time ⋮ On the Condition Number of the Shifted Real Ginibre Ensemble ⋮ The Complexity of Diagonalization ⋮ The foundations of spectral computations via the solvability complexity index hierarchy ⋮ Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time ⋮ Condition length and complexity for the solution of polynomial systems ⋮ Smale 17th Problem: Advances and Open Directions ⋮ Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems ⋮ The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs

This page was built for publication: A stable, polynomial-time algorithm for the eigenpair problem