Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
From MaRDI portal
Recommendations
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
- Sublinear Cost Low Rank Approximation via Subspace Sampling
- Sampling based succinct matrix approximation
- A Subspace Error Estimate for Linear Systems
- On the subspace projected approximate matrix method.
- Consistency and relative efficiency of subspace methods
- Krylov subspace estimation
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Krylov subspace methods in dynamical sampling
Cited in
(29)- An improved quantum principal component analysis algorithm based on the quantum singular threshold method
- Far-field compression for fast kernel summation methods in high dimensions
- Column subset selection problem is UG-hard
- An improved approximation algorithm for the column subset selection problem
- Randomized numerical linear algebra: Foundations and algorithms
- Sublinear Cost Low Rank Approximation via Subspace Sampling
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
- Low rank approximation of binary matrices: column subset selection and generalizations
- Sketched and truncated polynomial Krylov subspace methods: matrix Sylvester equations
- Algorithms for approximate subtropical matrix factorization
- On the optimality of Voronoi-based column selection
- Optimal column-based low-rank matrix reconstruction
- Conditioning of leverage scores and computation by QR decomposition
- Exact matrix completion via convex optimization
- Subspace Iteration Randomization and Singular Value Problems
- Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation
- Geometric component analysis and its applications to data analysis
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Near-optimal column-based matrix reconstruction
- Relative-Error CUR Matrix Decompositions
- Beyond symmetry: best submatrix selection for the sparse truncated SVD
- Column subset selection via sparse approximation of SVD
- Online sequential leveraging sampling method for streaming autoregressive time series with application to seismic data
- Randomized sketched TT-GMRES for linear systems with tensor structure
- Literature survey on low rank approximation of matrices
- Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition
- Matrix approximation and projective clustering via volume sampling
- Efficient algorithms for Tucker decomposition via approximate matrix multiplication
- Sampling from large matrices
This page was built for publication: Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595410)