On spectral and numerical properties of random butterfly matrices
From MaRDI portal
Publication:2274705
DOI10.1016/J.AML.2019.03.024OpenAlexW2761594828WikidataQ128186479 ScholiaQ128186479MaRDI QIDQ2274705
Publication date: 1 October 2019
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.00087
Random matrices (probabilistic aspects) (60B20) Random matrices (algebraic aspects) (15B52) Orthogonal matrices (15B10)
Related Items (2)
Randomized numerical linear algebra: Foundations and algorithms ⋮ Growth Factors of Random Butterfly Matrices and the Stability of Avoiding Pivoting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- How to generate random matrices from the classical compact groups
- Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform
- Randomized algorithms for the low-rank approximation of matrices
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- On the Eigenvalues of Random Matrices
- Fast, robust and non-convex subspace recovery
- The Effect of Coherence on Sampling from Matrices with Orthonormal Columns, and Preconditioned Least Squares Problems
This page was built for publication: On spectral and numerical properties of random butterfly matrices