Emergent Mind
Exact Solutions in Structured Low-Rank Approximation
(1311.2376)
Published Nov 11, 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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.