The real polynomial eigenvalue problem is well conditioned on the average
classification
🧮 math.NA
cs.NAmath.PR
keywords
averagepolynomialeigenvaluematricescollectionsconditionconditioneddefined
read the original abstract
We study the average condition number for polynomial eigenvalues of collections of matrices drawn from various random matrix ensembles. In particular, we prove that polynomial eigenvalue problems defined by matrices with Gaussian entries are very well-conditioned on the average.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.