Inhalt des Dokuments
All Publications
| Zitatschlüssel | ABBCS-A-Stable-Polynomial-Time-Algorithm-For-The-Eigenpair-Problem |
|---|---|
| Autor | Diego Armentano and Carlos Beltrán and Peter Bürgisser and Felipe Cucker and Michael Shub |
| Seiten | 1375–1437 |
| Jahr | 2018 |
| DOI | 10.4171/JEMS/789 |
| Journal | Journal of the European Mathematical Society (JEMS) |
| Jahrgang | 20 |
| Nummer | 6 |
| Monat | 04 |
| Notiz | To appear in Journal of the European Mathematical Society. |
| Zusammenfassung | 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. |
Zusatzinformationen / Extras
Direktzugang
Schnellnavigation zur Seite über Nummerneingabe
Hilfsfunktionen
Diese Seite verwendet Matomo für anonymisierte Webanalysen. Mehr Informationen und Opt-Out-Möglichkeiten unter Datenschutz.