Improved approximation algorithms for large matrices via random projections

DOI10.1109/FOCS.2006.37MaRDI QIDQ7255348zbMATH OpenFDO

Authors Tamás Sarlos

Publication date 29 May 2026

Full work available at URL https://doi.org/10.1109/FOCS.2006.37

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(8)

• Quasi-optimal hierarchically semi-separable matrix approximation
• Subspace embedding with random Khatri-Rao products and its application to eigensolvers
• RCLUPPr: a new randomized CholeskyQR with LU preconditioning
• librla: Randomized Linear Algebra Library
• Comparison theorems for the minimum eigenvalue of a random positive-semidefinite matrix
• Randomized structured total-least-squares-based higher-order extended dynamic mode decomposition
• A general framework for Krylov ODE residuals with applications to randomized Krylov methods
• Optimal oblivious subspace embeddings with near-optimal sparsity

This page was built for publication: Improved approximation algorithms for large matrices via random projections

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