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...
Main Authors: | Nakatsukasa, Y, Soma, T, Uschmajew, A |
---|---|
פורמט: | Journal article |
שפה: | English |
יצא לאור: |
Springer Verlag
2016
|
פריטים דומים
-
On orthogonal tensors and best rank-one approximation ratio
מאת: Li, Z, et al.
יצא לאור: (2018) -
Low-rank matrix approximations over canonical subspaces
מאת: Achiya Dax
יצא לאור: (2020-09-01) -
Low-rank matrix approximations over canonical subspaces
מאת: Achiya Dax
יצא לאור: (2020-09-01) -
Low-rank matrix approximations over canonical subspaces
מאת: Achiya Dax
יצא לאור: (2020-09-01) -
Low-rank matrix approximations over canonical subspaces
מאת: Achiya Dax
יצא לאור: (2020-09-01)