Loading…
A stable, polynomial-time algorithm for the eigenpair problem
Armentano, Diego; Beltrán, Carlos; Bürgisser, Peter; Cucker, Felipe; Shub, Michael
We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) 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.
Published in: Journal of the European Mathematical Society, 10.4171/JEMS/789, European Mathematical Society
- Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.
- This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.
