How long does it take to compute the eigenvalues of a random symmetric matrix?
From MaRDI portal
Publication:3194886
zbMath1326.65050arXiv1203.4635MaRDI QIDQ3194886
Christian Werner Pfrang, Govind K. Menon, Percy A. Deift
Publication date: 20 October 2015
Full work available at URL: https://arxiv.org/abs/1203.4635
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Random matrices (probabilistic aspects) (60B20) Random matrices (algebraic aspects) (15B52)
Related Items (12)
Universal statistics of incubation periods and other detection times via diffusion models ⋮ Complexity of path-following methods for the eigenvalue problem ⋮ Universality for the Conjugate Gradient and MINRES Algorithms on Sample Covariance Matrices ⋮ Universality for Eigenvalue Algorithms on Sample Covariance Matrices ⋮ Universality in numerical computations with random data ⋮ Three Lectures on “Fifty Years of KdV: An Integrable System” ⋮ Universal halting times in optimization and machine learning ⋮ Halting time is predictable for large models: a universality property and average-case analysis ⋮ Some open problems in random matrix theory and the theory of integrable systems. II ⋮ Smoothed analysis for the conjugate gradient algorithm ⋮ A randomized homotopy for the Hermitian eigenpair problem ⋮ The conjugate gradient algorithm on a general class of spiked covariance matrices
This page was built for publication: How long does it take to compute the eigenvalues of a random symmetric matrix?
