Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1375-1437 |
| Journal | Journal of the European Mathematical Society |
| Volume | 20 |
| Issue number | 6 |
| Online published | 17 Apr 2018 |
| DOIs | |
| Publication status | Published - 2018 |
Bibliographical note
Full text of this publication does not contain sufficient affiliation information. With consent from the author(s) concerned, the Research Unit(s) information for this record is based on the existing academic department affiliation of the author(s).Research Keywords
- Eigenvalue computations
- Homotopy methods
Fingerprint
Dive into the research topics of 'A stable, polynomial-time algorithm for the eigenpair problem'. Together they form a unique fingerprint.Projects
- 1 Finished
-
GRF: A Theory of Complexity, Condition, and Round-off
CUCKER, F. (Principal Investigator / Project Coordinator)
1/01/15 → 20/07/18
Project: Research
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver