Abstract
The condition number for eigenvalue computations is a well--studied quantity. But how small can we expect it to be? Namely, which is a perfectly conditioned matrix w.r.t. eigenvalue computations? In this note we answer this question with exact first order asymptotic.
Original language | English |
---|---|
Journal | Mathematics of Computation |
Volume | 2022 |
DOIs | |
Publication status | E-pub ahead of print - 17 May 2021 |
Keywords
- math.NA
- cs.NA
- math.CA
- 65F15 (Primary), 31C20 (Secondary)