Lower bounds for column matrix approximations

DOI10.1134/s0965542523110167zbMath1530.15018OpenAlexW4390196369MaRDI QIDQ6148034

No author found.

Publication date: 11 January 2024

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542523110167

zbMATH Keywords

low-rank approximationcolumn subset selectionwell-conditioned submatrices

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Conditioning of matrices (15A12) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• Unnamed Item
• Unnamed Item
• On cross approximation of multi-index arrays
• A theory of pseudoskeleton approximations
• Pseudo-skeleton approximations with better accuracy estimates
• Rectangular maximum-volume submatrices and their applications
• On the accuracy of cross and column low-rank maxvol approximations in average
• Optimal CUR Matrix Decompositions
• Adaptive Sampling and Fast Low-Rank Matrix Approximation
• Some Applications of the Rank Revealing QR Factorization
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Faster Subset Selection for Matrices and Applications
• Near-Optimal Column-Based Matrix Reconstruction
• Optimal Column-Based Low-Rank Matrix Reconstruction
• Perturbations of CUR Decompositions

This page was built for publication: Lower bounds for column matrix approximations