On the best approximation algorithm by low-rank matrices in Chebyshev's norm
From MaRDI portal
Publication:2149032
DOI10.1134/S0965542522050141zbMath1496.65058WikidataQ114075110 ScholiaQ114075110MaRDI QIDQ2149032
Sergey Morozov, Nikolai L. Zamarashkin, Evgenij E. Tyrtyshnikov
Publication date: 27 June 2022
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
65F55: Numerical methods for low-rank matrix approximation; matrix compression
Related Items
A note on error bounds for pseudo skeleton approximations of matrices, On the optimal rank-1 approximation of matrices in the Chebyshev norm, On the distance to low-rank matrices in the maximum norm
Uses Software
Cites Work
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- A theory of pseudoskeleton approximations
- Pseudo-skeleton approximations with better accuracy estimates
- Why Are Big Data Matrices Approximately Low Rank?
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item