A stable, polynomial-time algorithm for the eigenpair problem
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 1375-1437 |
| Journal / Publication | Journal of the European Mathematical Society |
| Volume | 20 |
| Issue number | 6 |
| Online published | 17 Apr 2018 |
| Publication status | Published - 2018 |
Link(s)
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.
Research Area(s)
- Eigenvalue computations, Homotopy methods
Bibliographic 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).
Citation Format(s)
A stable, polynomial-time algorithm for the eigenpair problem. / Armentano, Diego; Beltrán, Carlos; Bürgisser, Peter et al.
In: Journal of the European Mathematical Society, Vol. 20, No. 6, 2018, p. 1375-1437.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
