On approximating functions of the singular values in a stream

DOI10.1145/2897518.2897581zbMath1377.68095arXiv1604.08679OpenAlexW2344844563MaRDI QIDQ5361874

David P. Woodruff, Yi Li

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.08679

zbMATH Keywords

complexityalgorithmsmatrix normsSchatten normsdata streams

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness ⋮ Smoothness of Schatten norms and sliding-window matrix streams ⋮ Unnamed Item ⋮ Structural results on matching estimation with applications to streaming ⋮ (Noisy) gap cycle counting strikes back: random order streaming lower bounds for connected components and beyond ⋮ Querying a Matrix Through Matrix-Vector Products. ⋮ Unnamed Item

This page was built for publication: On approximating functions of the singular values in a stream