Querying a Matrix through Matrix-Vector Products

DOI10.1145/3470566MaRDI QIDQ5035875zbMATH OpenOpenAlexFDO

Authors Xiaoming Sun, David P. Woodruff, Guang Yang, Jialin Zhang

Publication date 22 February 2022

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.05736, https://drops.dagstuhl.de/opus/volltexte/2019/10670/

zbMATH Keywords

communication complexitylinear algebrasketching

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Querying a Matrix Through Matrix-Vector Products.
• Testing matrix rank, optimally
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• Numerical linear algebra in the streaming model
• Adaptive Matrix Vector Product

Cited in

(5)

• Querying a Matrix Through Matrix-Vector Products.
• Optimal eigenvalue approximation via sketching
• Efficient convex optimization requires superlinear memory
• Fixed-sparsity matrix approximation from matrix-vector products
• Multipass linear sketches for geometric LP-type problems

This page was built for publication: Querying a Matrix through Matrix-Vector Products

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