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

page 1

page 2

page 3

page 4

research
05/07/2023

Numerical computation of spectral solutions for Sturm-Liouville eigenvalue problems

This paper focuses on the study of Sturm-Liouville eigenvalue problems. ...
research
05/11/2020

Well-conditioned eigenvalue problems that overflow

In this note we present a parameterized class of lower triangular matric...
research
04/15/2022

Singular quadratic eigenvalue problems: Linearization and weak condition numbers

The numerical solution of singular eigenvalue problems is complicated by...
research
12/22/2022

An isospectral transformation between Hessenberg matrix and Hessenberg-bidiagonal matrix pencil without using subtraction

We introduce an eigenvalue-preserving transformation algorithm from the ...
research
09/24/2022

2D Eigenvalue Problem II: Rayleigh Quotient Iteration and Applications

In Part I of this paper, we introduced a 2D eigenvalue problem (2DEVP) a...
research
01/04/2022

On an eigenvalue property of Summation-By-Parts operators

Summation-By-Parts (SBP) methods provide a systematic way of constructin...
research
06/21/2023

Two species k-body embedded Gaussian unitary ensembles: q-normal form of the eigenvalue density

Eigenvalue density generated by embedded Gaussian unitary ensemble with ...

Please sign up or login with your details

Forgot password? Click here to reset