Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
From MaRDI portal
Publication:6052452
DOI10.1007/S10444-023-10061-ZMaRDI QIDQ6052452FDOQ6052452
Authors: Yijun Dong, P. G. Martinsson 
Publication date: 22 September 2023
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
interpolative decompositionlow-rank approximationrank revealing factorizationCUR decompositionrandomized numerical linear algebracolumn pivoted QR factorization
Cites Work
- CALU: A communication optimal LU factorization algorithm
- Rang revealing QR factorizations
- Improved matrix algorithms via the subsampled randomized Hadamard transform
- Title not available (Why is that?)
- Unitary Triangularization of a Nonsymmetric Matrix
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Local operator theory, random matrices and Banach spaces.
- CUR matrix decompositions for improved data analysis
- A theory of pseudoskeleton approximations
- Incomplete cross approximation in the mosaic-skeleton method
- Approximation of boundary element matrices
- Efficient algorithms for CUR and interpolative matrix decompositions
- Optimal CUR matrix decompositions
- Low-Rank Approximation and Regression in Input Sparsity Time
- Relative-Error $CUR$ Matrix Decompositions
- Title not available (Why is that?)
- Improved analysis of the subsampled randomized Hadamard transform
- Twice-Ramanujan sparsifiers
- On selecting a maximum volume sub-matrix of a matrix and related problems
- Invertibility of random matrices: norm of the inverse
- Randomized algorithms for the low-rank approximation of matrices
- On the existence and computation of rank-revealing LU factorizations
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- Average-Case Stability of Gaussian Elimination
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Numerical Linear Algebra
- Exponential inapproximability of selecting a maximum volume sub-matrix
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- A fast randomized algorithm for overdetermined linear least-squares regression
- Randomized numerical linear algebra: Foundations and algorithms
- A fast randomized algorithm for the approximation of matrices
- $LU$ Factorization Algorithms on Distributed-Memory Multiprocessor Architectures
- Fast approximation of matrix coherence and statistical leverage
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Uniform sampling for matrix approximation
- Streaming low-rank matrix approximation with an application to scientific simulation
- Matrix approximation and projective clustering via volume sampling
- Near-optimal column-based matrix reconstruction
- On the stability of Gauss-Jordan elimination with pivoting
- Sketching as a tool for numerical linear algebra
- Strong rank revealing LU factorizations
- A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions
- Randomized LU decomposition
- A DEIM induced CUR factorization
- Randomized LU decomposition using sparse projections
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Practical sketching algorithms for low-rank matrix approximation
- Numerically safe Gaussian elimination with no pivoting
- Determinantal point processes in randomized numerical linear algebra
Cited In (3)
This page was built for publication: Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6052452)
