Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Best low-rank approximations and Kolmogorov n-widths (2007.13196v3)

Published 26 Jul 2020 in math.NA and cs.NA

Abstract: 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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Michael S. Floater (8 papers)
  2. Carla Manni (15 papers)
  3. Espen Sande (14 papers)
  4. Hendrik Speleers (21 papers)
Citations (3)

Summary

We haven't generated a summary for this paper yet.