Optimal CUR matrix decompositions

DOI10.1145/2591796.2591819MaRDI QIDQ6829107zbMATH OpenFDO

Authors Christos Boutsidis, David P. Woodruff

Publication date 26 June 2015

Published in Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2591796.2591819

zbMATH Keywords

adaptive samplingcolumn subset selectionCURinput-sparsity-timeleverage scoreslow rank matrix decompositionspectral sparsificationSVD

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20)

Cited in

(5)

• On the existence of a close to optimal cross approximation in the Frobenius norm
• Efficient quaternion CUR decomposition based on discrete empirical interpolation method
• A Geometric View of Adaptive Cross Approximation via Exterior Algebra
• Subset selection for matrices by volume sampling
• Deterministic complexity analysis of Hermitian eigenproblems

This page was built for publication: Optimal CUR matrix decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829107)