Exact Solutions in Structured Low-Rank Approximation
Ottaviani, Giorgio · Spaenlehauer, Pierre-Jean · Sturmfels, Bernd
Optimization and Control
Symbolic Computation
Algebraic Geometry
Computation
14Q15, 65K10, 68W30, 93B11
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.