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

類似資料