|
General numerical methods
Lower bounds for column matrix approximations
A. I. Osinsky Institute of Numerical Mathematics, RAS, 119991 Moscow, RAS, Gubkina Street, 8, Russia
Abstract:
We show a connection between lower and upper bounds on the column matrix approximation accuracy and the bounds on the norms of the pseudoinverses of the submatrices of orthogonal matrices. This connection is exploited to derive lower bounds for column approximations accuracy in spectral and Frobenius norms.
Key words:
low-rank approximation, column subset selection, well-conditioned submatrices.
Received: 20.06.2023 Revised: 20.06.2023 Accepted: 25.07.2023
Citation:
A. I. Osinsky, “Lower bounds for column matrix approximations”, Zh. Vychisl. Mat. Mat. Fiz., 63:11 (2023), 1816; Comput. Math. Math. Phys., 63:11 (2023), 2024–2037
Linking options:
https://www.mathnet.ru/eng/zvmmf11645 https://www.mathnet.ru/eng/zvmmf/v63/i11/p1816
|
Statistics & downloads: |
Abstract page: | 62 |
|