Zero-one rounding of singular vectors

DOI10.1007/978-3-642-31594-7_24MaRDI QIDQ2843255zbMATH OpenOpenAlexFDO

Authors Amit Deshpande, Nikhil Srivastava, R. Kannan

Publication date 12 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31594-7_24

zbMATH Keywords

cut decompositionmatrix normsroundingsingular value decomposition

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Roundoff error (65G50) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Approximating the Cut-Norm via Grothendieck's Inequality
• Approximating the cut-norm via Grothendieck's inequality
• An efficient sparse regularity concept
• On sketching matrix norms and the top singular vector
• An efficient sparse regularity concept

This page was built for publication: Zero-one rounding of singular vectors

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