Buscar

Estamos realizando la búsqueda. Por favor, espere...

How well-conditioned can the eigenvector problem be?

Abstract: The condition number for eigenvector computations is a wellstudied quantity. But how small can it possibly be? Specifically, what matrices are perfectly conditioned with respect to eigenvector computations? In this note we answer this question for n×n matrices, giving a solution that is exact to first-order as n ???

 Autoría: BeltrÁn C., Bétermin L., Grabner P., Steinerberger S.,

 Fuente: Mathematics of Computation, 2022, 91(335), 1237-1245

 Editorial: American Mathematical Society

 Año de publicación: 2022

 Nº de páginas: 9

 Tipo de publicación: Artículo de Revista

 DOI: 10.1090/mcom/3706

 ISSN: 0025-5718,1088-6842

 Url de la publicación: https://doi.org/10.1090/mcom/3706

Autoría

BÉTERMIN, LAURENT

GRABNER, PETER

STEINERBERGER, STEFAN