Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equivalent to the existence of a linear time-invariant system that fits the data and the rank constraint is related to a bound o...
Main Author: | Markovsky, Ivan (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2008-04.
|
Subjects: | |
Online Access: | Get fulltext Get fulltext |
Similar Items
-
Approximate low-rank factorization with structured factors
by: Markovsky, Ivan, et al.
Published: (2010) -
Software for weighted structured low-rank approximation
by: Markovsky, Ivan, et al.
Published: (2012) -
Structured low-rank approximation with missing data
by: Markovsky, Ivan, et al.
Published: (2012) -
Left vs right representations for solving weighted low-rank approximation problems
by: Markovsky, Ivan, et al.
Published: (2007) -
Learning-based low-rank approximations
by: Indyk, Piotr
Published: (2021)