Finding a low-rank basis in a matrix subspace

For a given matrix subspace, how can we find a basis that consists of low-rank matrices? This is a generalization of the sparse vector problem. It turns out that when the subspace is spanned by rank-1 matrices, the matrices can be obtained by the tensor CP decomposition. For the higher rank case, th...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: Nakatsukasa, Y, Soma, T, Uschmajew, A
Μορφή: Journal article
Γλώσσα:English
Έκδοση: Springer Verlag 2016

Παρόμοια τεκμήρια