Best low-rank approximations and Kolmogorov n-widths

07/26/2020
by   Michael S. Floater, et al.
0

We relate the problem of best low-rank approximation in the spectral norm for a matrix A to Kolmogorov n-widths and corresponding optimal spaces. We characterize all the optimal spaces for the image of the Euclidean unit ball under A and we show that any orthonormal basis in an n-dimensional optimal space generates a best rank-n approximation to A. We also present a simple and explicit construction to obtain a sequence of optimal n-dimensional spaces once an initial optimal space is known. This results in a variety of solutions to the best low-rank approximation problem and provides alternatives to the truncated singular value decomposition. This variety can be exploited to obtain best low-rank approximations with problem-oriented properties.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/23/2020

Optimal Rank-1 Hankel Approximation of Matrices: Frobenius Norm, Spectral Norm and Cadzow's Algorithm

In this paper we derive optimal rank-1 approximations with Hankel or Toe...
research
12/02/2022

On the optimal rank-1 approximation of matrices in the Chebyshev norm

The problem of low rank approximation is ubiquitous in science. Traditio...
research
11/11/2021

On Recovering the Best Rank-r Approximation from Few Entries

In this note, we investigate how well we can reconstruct the best rank-r...
research
08/22/2023

Lifting Sylvester equations: singular value decay for non-normal coefficients

We aim to find conditions on two Hilbert space operators A and B under w...
research
05/04/2020

The Multi-Symplectic Lanczos Algorithm and Its Applications to Color Image Processing

Low-rank approximations of original samples are playing more and more an...
research
01/04/2017

Optimal Low-Rank Dynamic Mode Decomposition

Dynamic Mode Decomposition (DMD) has emerged as a powerful tool for anal...

Please sign up or login with your details

Forgot password? Click here to reset