Lower bounds for column matrix approximations
From MaRDI portal
Publication:6148034
DOI10.1134/S0965542523110167zbMATH Open1530.15018OpenAlexW4390196369MaRDI QIDQ6148034FDOQ6148034
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
Recommendations
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)
Cites Work
- A theory of pseudoskeleton approximations
- On cross approximation of multi-index arrays
- Some Applications of the Rank Revealing QR Factorization
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Title not available (Why is that?)
- Faster subset selection for matrices and applications
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Pseudo-skeleton approximations with better accuracy estimates
- Matrix approximation and projective clustering via volume sampling
- Near-optimal column-based matrix reconstruction
- Rectangular maximum-volume submatrices and their applications
- Optimal column-based low-rank matrix reconstruction
- On the accuracy of cross and column low-rank maxvol approximations in average
- Perturbations of CUR Decompositions
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)