How well-conditioned can the eigenvalue problem be?

05/17/2021
by   Carlos Beltrán, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/11/2020

Well-conditioned eigenvalue problems that overflow

In this note we present a parameterized class of lower triangular matric...
04/26/2021

Generalized heterogeneous hypergeometric functions and the distribution of the largest eigenvalue of an elliptical Wishart matrix

In this study, we derive the exact distributions of eigenvalues of a sin...
01/04/2022

On an eigenvalue property of Summation-By-Parts operators

Summation-By-Parts (SBP) methods provide a systematic way of constructin...
05/11/2021

Distribution of the Scaled Condition Number of Single-spiked Complex Wishart Matrices

Let 𝐗∈ℂ^m× n (m≥ n) be a random matrix with independent rows each distri...
07/12/2019

Eigenvalues of the non-backtracking operator detached from the bulk

We describe the non-backtracking spectrum of a stochastic block model wi...
12/02/2020

The relation between eigenvalue/eigenvector and matrix game

Matrix game, which is also known as two person zero sum game, is a famou...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.