Universality in numerical computations with random data
From MaRDI portal
Publication:2962255
DOI10.1073/pnas.1413446111zbMath1355.65019arXiv1407.3829OpenAlexW2022920163WikidataQ30855099 ScholiaQ30855099MaRDI QIDQ2962255
Thomas Trogdon, Sheehan Olver, Govind K. Menon, Percy A. Deift
Publication date: 16 February 2017
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.3829
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
Gaussian determinantal processes: A new model for directionality in data ⋮ On the Condition Number of the Shifted Real Ginibre Ensemble ⋮ Universal statistics of incubation periods and other detection times via diffusion models ⋮ Universality for Eigenvalue Algorithms on Sample Covariance Matrices ⋮ 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 ⋮ Mini-workshop: Reflectionless operators: the Deift and Simon conjectures. Abstracts from the mini-workshop held October 22--28, 2017 ⋮ The conjugate gradient algorithm on well-conditioned Wishart matrices is almost deterministic ⋮ Some open problems in random matrix theory and the theory of integrable systems. II ⋮ Universality in numerical computation with random data: Case studies and analytical results ⋮ Smoothed analysis for the conjugate gradient algorithm ⋮ Sampling unitary ensembles ⋮ The conjugate gradient algorithm on a general class of spiked covariance matrices ⋮ On the condition number of the critically-scaled Laguerre unitary ensemble
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decision making times in mean-field dynamic Ising model
- A limit theorem for the norm of random matrices
- A neural computation model for decision-making times
- Ordinary Differential Equations and the Symmetric Eigenvalue Problem
- How long does it take to compute the eigenvalues of a random symmetric matrix?
- Theoretical Numerical Analysis
- On the efficiency of algorithms of analysis
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Eigenvalues and Condition Numbers of Random Matrices
- Jacobi’s Method is More Accurate than QR
- Universality of local spectral statistics of random matrices
- Sampling unitary ensembles
- Numerical Inverting of Matrices of High Order. II
This page was built for publication: Universality in numerical computations with random data
