Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
From MaRDI portal
Publication:5449537
DOI10.1007/11841036_29zbMath1131.68589OpenAlexW4244219114MaRDI QIDQ5449537
No author found.
Publication date: 11 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11841036_29
Sampling theory, sample surveys (62D05) Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items
Functional principal subspace sampling for large scale functional data analysis ⋮ A randomized algorithm for a tensor-based generalization of the singular value decomposition ⋮ Far-field compression for fast kernel summation methods in high dimensions ⋮ Exact matrix completion via convex optimization ⋮ Optimal CUR Matrix Decompositions
Uses Software
This page was built for publication: Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods