Single-pass randomized algorithms for LU decomposition
From MaRDI portal
Recommendations
- Randomized LU decomposition
- Single-pass randomized QLP decomposition for low-rank approximation
- Randomized LU decomposition using sparse projections
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- A randomized algorithm for the decomposition of matrices
Cites work
- Accuracy and Stability of Numerical Algorithms
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- On the existence and computation of rank-revealing LU factorizations
- Pass-efficient randomized algorithms for low-rank matrix approximation using any number of views
- Practical sketching algorithms for low-rank matrix approximation
- Randomized LU decomposition
- Randomized LU decomposition using sparse projections
- Sketching as a tool for numerical linear algebra
- Smallest singular value of random matrices and geometry of random polytopes
- Smallest singular value of sparse random matrices
- Streaming low-rank matrix approximation with an application to scientific simulation
- Strong rank revealing LU factorizations
- Subspace Iteration Randomization and Singular Value Problems
- Subspace-Orbit Randomized Decomposition for Low-Rank Matrix Approximations
Cited in
(6)- Single-pass randomized QLP decomposition for low-rank approximation
- Randomized LU decomposition using sparse projections
- Pass-efficient randomized LU algorithms for computing low-rank matrix approximation
- Randomized block Krylov subspace methods for trace and log-determinant estimators
- Randomized LU decomposition
- Pass-efficient truncated UTV for low-rank approximations
This page was built for publication: Single-pass randomized algorithms for LU decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306297)
