2000 character limit reached
Exact Solutions in Structured Low-Rank Approximation (1311.2376v3)
Published 11 Nov 2013 in math.OC, cs.SC, math.AG, and stat.CO
Abstract: Structured low-rank approximation is the problem of minimizing a weighted Frobenius distance to a given matrix among all matrices of fixed rank in a linear space of matrices. We study exact solutions to this problem by way of computational algebraic geometry. A particular focus lies on Hankel matrices, Sylvester matrices and generic linear spaces.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.