How well-conditioned can the eigenvector problem be?

DOI10.1090/MCOM/3706MaRDI QIDQ5070539zbMATH OpenOpenAlexFDO

Authors Laurent Bétermin, Stefan Steinerberger, Carlos Beltran, Peter J. Grabner

Publication date 13 April 2022

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/mcom/3706

zbMATH Keywords

condition numbereigenvector computationtriangular lattice

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• On estimating the condition of eigenvalues and eigenvectors
• On eigenvector bounds
• Publication:4205561
• scientific article; zbMATH DE number 269557
• The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs

Cites work

• A stable, polynomial-time algorithm for the eigenpair problem
• Condition. The geometry of numerical algorithms
• Note on matrices with a very ill-conditioned eigenproblem
• Numerical inverting of matrices of high order
• On condition numbers and the distance to the nearest ill-posed problem
• On estimating the condition of eigenvalues and eigenvectors
• On sensitivity of eigenvalues and eigendecompositions of matrices
• ROUNDING-OFF ERRORS IN MATRIX PROCESSES
• The asymptotic distribution of lattice points in Euclidean and non-Euclidean spaces
• The Probability That a Numerical Analysis Problem is Difficult
• Über die dichteste Kugellagerung
• Über einen geometrischen Satz

Cited in

(2)

• On estimating the condition of eigenvalues and eigenvectors
• Random growth via gradient flow aggregation

This page was built for publication: How well-conditioned can the eigenvector problem be?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5070539)