Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
From MaRDI portal
Recommendations
Cited in
(14)- Regression-aware decompositions
- Functional principal subspace sampling for large scale functional data analysis
- Far-field compression for fast kernel summation methods in high dimensions
- Exact matrix completion via convex optimization
- Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
- Relative-Error CUR Matrix Decompositions
- CUR LRA at Sublinear Cost Based on Volume Maximization
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Column-coherent matrix decomposition
- Randomized estimation of functional covariance operator via subsampling
- Imbalanced data sampling design based on grid boundary domain for big data
- A general framework for Krylov ODE residuals with applications to randomized Krylov methods
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
This page was built for publication: Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449537)