Publications
Article · Foundations of Computational Mathematics · May 6, 2019
The Real Polynomial Eigenvalue Problem is Well Conditioned on the Average
Carlos Beltrán, Khazhgali Kozhasov
Abstract
We study the average condition number for polynomial eigenvalues of collections of matrices drawn from some random matrix ensembles. In particular, we prove that polynomial eigenvalue problems defined by matrices with random Gaussian entries are very well conditioned on the average.
Matrix Theory and AlgorithmsPolynomial and algebraic computationNumerical Methods and Algorithmspolynomial eigenvalue problemscondition numberaverage-case analysis
More by Khazhgali Kozhasov
- ON THE DISTANCE TO DISCRIMINANTS AND OSCULATING VARIETIESarXiv · 2026
- Stubborn PolynomialsarXiv · 2026
- On odd powers of nonnegative polynomials that are not sums of squaresForum of Mathematics Sigma · 2026 · Citations: 1
- On the minimal algebraic complexity of the rank-one approximation problem for general inner productsMathematics of Computation · 2025 · Citations: 1