In this paper, we investigate the complexity of the numerical construction of the so-called Hankel structured low-rank approximation (HSLRA). Briefly, HSLRA is the problem of finding the closest (in some pre-defined norm) rank r approximation of a given Hankel matrix, which is also of Hankel structure.
Optimization problems in structured low rank approximation
KVASOV, Dmitry;
2016-01-01
Abstract
In this paper, we investigate the complexity of the numerical construction of the so-called Hankel structured low-rank approximation (HSLRA). Briefly, HSLRA is the problem of finding the closest (in some pre-defined norm) rank r approximation of a given Hankel matrix, which is also of Hankel structure.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
