The real polynomial eigenvalue problem is well conditioned on the average
DOI10.1007/s10208-019-09414-2zbMath1472.14068arXiv1802.07493OpenAlexW2964182060WikidataQ127925576 ScholiaQ127925576MaRDI QIDQ2309519
Khazhgali Kozhasov, Carlos Beltran
Publication date: 1 April 2020
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.07493
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Matrix pencils (15A22)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gap probabilities and Betti numbers of a random intersection of quadrics
- Perturbation theory for homogeneous polynomial eigenvalue problems
- Random fields and the enumerative geometry of lines on real and complex hypersurfaces
- The asymptotic expansion of a ratio of gamma functions
- The Quadratic Eigenvalue Problem
- Condition
- The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs
- On Fully Real Eigenconfigurations of Tensors
- An algorithm for the complete solution of quadratic eigenvalue problems
- Complexity of Bezout's Theorem I: Geometric Aspects
- How Many Eigenvalues of a Random Matrix are Real?
- The kinematic formula in Riemannian homogeneous spaces
- Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
- The Expected Number of Eigenvalues of a Real Gaussian Tensor
This page was built for publication: The real polynomial eigenvalue problem is well conditioned on the average