We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitrary order admit a unique decomposition as a linear combination of rank-1 tensors. A practical algorithm is proposed for verifying this condition, with which it was established that in all spaces of dimension less than 15,000, with a few known exceptions.
Chiantini, L., Ottaviani, G., Vannieuwenhoven, N. (2014). An algorithm for generic and low-rank specific identifiability of complex tensors. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 35(4), 1265-1287 [10.1137/140961389].
An algorithm for generic and low-rank specific identifiability of complex tensors
CHIANTINI, LUCA;
2014-01-01
Abstract
We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitrary order admit a unique decomposition as a linear combination of rank-1 tensors. A practical algorithm is proposed for verifying this condition, with which it was established that in all spaces of dimension less than 15,000, with a few known exceptions.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
2014.IDFT.pdf
non disponiibile
Descrizione: IDFT
Tipologia:
PDF editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
398.69 kB
Formato
Adobe PDF
|
398.69 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
Utilizza questo identificativo per citare o creare un link a questo documento:
https://hdl.handle.net/11365/974563