Best Low-rank Approximations and Kolmogorov $n$-widths

DOI10.1137/20M1355720WikidataQ114074174 ScholiaQ114074174MaRDI QIDQ5857847

Espen Sande, Hendrik Speleers, Carla Manni, Michael S. Floater

Publication date: 8 April 2021

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.13196

zbMATH Keywords

optimal spacesbest approximationlow-rank approximation\(n\)-widths

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Uniqueness of best approximation (41A52) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Uses Software

• Algorithm 971

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On best rank \(n\) matrix approximations
• On best uniform approximation by low-rank matrices
• Optimal spline spaces of higher degree for \(L^2\) \(n\)-widths
• Matrices and n-widths
• Remarks on variational characterizations of eigenvalues and \(n\)-width problems
• Spline spaces are optimal for \(L^2\) n-width
• Structured low rank approximation
• Explicit error estimates for spline approximation of arbitrary smoothness in isogeometric analysis
• Optimal spline spaces for \(L^2\ n\)-width problems with boundary conditions
• Structured low-rank approximation and its applications
• Factorization Approach to Structured Low-Rank Approximation with Applications
• A Singular Value Thresholding Algorithm for Matrix Completion
• Algorithm 971
• Low-Rank Optimization With Convex Constraints
• Literature survey on low rank approximation of matrices
• Sharp error estimates for spline approximation: Explicit constants, n-widths, and eigenfunction convergence
• Foundations of Data Science
• Exact Solutions in Structured Low-Rank Approximation
• An Introduction to Matrix Concentration Inequalities

This page was built for publication: Best Low-rank Approximations and Kolmogorov $n$-widths