Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods

DOI10.1007/11830924_30zbMath1155.68569OpenAlexW2147927736MaRDI QIDQ3595410

No author found.

Publication date: 28 August 2007

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11830924_30

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items

Randomized numerical linear algebra: Foundations and algorithms ⋮ Column subset selection problem is UG-hard ⋮ Far-field compression for fast kernel summation methods in high dimensions ⋮ Exact matrix completion via convex optimization ⋮ Literature survey on low rank approximation of matrices ⋮ Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition ⋮ An improved quantum principal component analysis algorithm based on the quantum singular threshold method ⋮ Geometric component analysis and its applications to data analysis ⋮ Column subset selection via sparse approximation of SVD ⋮ Conditioning of Leverage Scores and Computation by QR Decomposition ⋮ Subspace Iteration Randomization and Singular Value Problems

This page was built for publication: Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods