On spectral and numerical properties of random butterfly matrices
From MaRDI portal
Publication:2274705
Recommendations
Cites work
- scientific article; zbMATH DE number 3143963 (Why is no real title available?)
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- scientific article; zbMATH DE number 3517684 (Why is no real title available?)
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Fast, robust and non-convex subspace recovery
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- How to generate random matrices from the classical compact groups
- Improved analysis of the subsampled randomized Hadamard transform
- Improved matrix algorithms via the subsampled randomized Hadamard transform
- Log-gases and random matrices.
- On the Eigenvalues of Random Matrices
- Randomized algorithms for the low-rank approximation of matrices
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- The effect of coherence on sampling from matrices with orthonormal columns, and preconditioned least squares problems
Cited in
(7)- Randomized numerical linear algebra: Foundations and algorithms
- Distribution of the number of pivots needed using Gaussian elimination with partial pivoting on random matrices
- Complete pivoting growth of butterfly matrices and butterfly Hadamard matrices
- Generalizing random butterfly transforms to arbitrary matrix sizes
- Heights of butterfly trees
- On spectral and numerical properties of random butterfly matrices
- Growth Factors of Random Butterfly Matrices and the Stability of Avoiding Pivoting
This page was built for publication: On spectral and numerical properties of random butterfly matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274705)