Search for Publication

All Publications

A stable, polynomial-time algorithm for the eigenpair problem
Zitatschlüssel	BC-A-Stable-Polynomial-Time-Algorithm-For-The-Eigenpair-Problem
Autor	Peter Bürgisser and Felipe Cucker
Jahr	2014
Monat	10
Notiz	This preprint was merged in 2015 with arXiv:1410.2179 into arXiv:1505.03290.
Zusammenfassung	We describe algorithms for computing eigenpairs (eigenvalue-eigenvector) of a complex $n× n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not believe they outperform in practice the algorithms currently used for this computational problem. The merit of our paper is to give a positive answer to a long-standing open problem in numerical linear algebra.