Lower bounds for column matrix approximations

DOI10.1134/S0965542523110167MaRDI QIDQ6148034zbMATH OpenOpenAlexFDO

Authors

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

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

Recommendations

• A theory of pseudoskeleton approximations
• A matrix lower bound
• Lower bounds for the low-rank matrix approximation
• scientific article; zbMATH DE number 2246263
• New accuracy estimates for pseudoskeleton approximations of matrices

Cites work

• scientific article; zbMATH DE number 6276143 (Why is no real title available?)
• A theory of pseudoskeleton approximations
• Adaptive Sampling and Fast Low-Rank Matrix Approximation
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Faster subset selection for matrices and applications
• Matrix approximation and projective clustering via volume sampling
• Near-optimal column-based matrix reconstruction
• On cross approximation of multi-index arrays
• On the accuracy of cross and column low-rank maxvol approximations in average
• Optimal column-based low-rank matrix reconstruction
• Perturbations of CUR Decompositions
• Pseudo-skeleton approximations with better accuracy estimates
• Rectangular maximum-volume submatrices and their applications
• Some Applications of the Rank Revealing QR Factorization

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

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