On the accuracy of cross and column low-rank maxvol approximations in average

DOI10.1134/S0965542521050171zbMath1469.65084WikidataQ114075117 ScholiaQ114075117MaRDI QIDQ2038491

A. I. Osinsky, Nikolai L. Zamarashkin

Publication date: 7 July 2021

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

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

zbMATH Keywords

low-rank matrix approximation; maximum volume; cross/skeleton decomposition

Mathematics Subject Classification ID

65F55: Numerical methods for low-rank matrix approximation; matrix compression

Related Items

Polynomial time \(\rho\)-locally maximum volume search, Lower bounds for column matrix approximations, New applications of matrix methods

Cites Work

• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Quasioptimality of skeleton approximation of a matrix in the Chebyshev norm
• On the existence of a nearly optimal skeleton approximation of a matrix in the Frobenius norm
• Column subset selection via sparse approximation of SVD
• A theory of pseudoskeleton approximations
• On the existence and computation of rank-revealing LU factorizations
• Pseudo-skeleton approximations with better accuracy estimates
• Rectangular maximum-volume submatrices and their applications
• Optimal CUR Matrix Decompositions
• Adaptive Sampling and Fast Low-Rank Matrix Approximation
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Optimal Column-Based Low-Rank Matrix Reconstruction