Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
From MaRDI portal
Publication:4610132
DOI10.1137/16M1074527zbMath1453.65090MaRDI QIDQ4610132
Sebastien Cayrols, Laura Grigori, James W. Demmel
Publication date: 5 April 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items
An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation, Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting, Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra, MPI+OpenMP реализация метода сопряженных градиентов с факторизованными неявными предобусловливателями, Linear-time CUR approximation of BEM matrices, A heterogeneous parallel LU factorization algorithm based on a basic column block uniform allocation strategy, ALORA: affine low-rank approximations, Numerical algorithms for high-performance computational science
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- SuitSparseQR
- Separators and structure prediction in sparse orthogonal factorization
- A theory of pseudoskeleton approximations
- On the existence and computation of rank-revealing LU factorizations
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- Strong rank revealing LU factorizations
- Numerical methods for solving linear least squares problems
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- LU Factorization with Panel Rank Revealing Pivoting and Its Communication Avoiding Version
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- The university of Florida sparse matrix collection
- Algorithm 915, SuiteSparseQR
- Numerical Methods for Large Eigenvalue Problems
- Minimizing Communication in Numerical Linear Algebra
- Randomized Algorithms for Matrices and Data
- Low-Rank Approximation and Regression in Input Sparsity Time
- CALU: A Communication Optimal LU Factorization Algorithm
- Communication Avoiding Rank Revealing QR Factorization with Column Pivoting
- A Data Structure for Sparse $QR$ and $LU$ Factorizations
- LAPACK Users' Guide
- A Separator Theorem for Planar Graphs
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- The QLP Approximation to the Singular Value Decomposition
- On Rank-Revealing Factorisations
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Lanczos Algorithms for Large Symmetric Eigenvalue Computations
- Stability of block LU factorization
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- A column approximate minimum degree ordering algorithm
- Nested Dissection of a Regular Finite Element Mesh
- A Parallel QR Factorization Algorithm with Controlled Local Pivoting
