On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 503-519 |
| Journal / Publication | Numerical Linear Algebra with Applications |
| Volume | 14 |
| Issue number | 6 |
| Publication status | Published - Aug 2007 |
Link(s)
Abstract
In this paper, a successive supersymmetric rank-1 decomposition of a real higher-order supersymmetric tensor is considered. To obtain such a decomposition, we design a greedy method based on iteratively computing the best supersymmetric rank-1 approximation of the residual tensors. We further show that a supersymmetric canonical decomposition could be obtained when the method is applied to an orthogonally diagonalizable supersymmetric tensor, and in particular, when the order is 2, this method generates the eigenvalue decomposition for symmetric matrices. Details of the algorithm designed and the numerical results are reported in this paper. Copyright © 2007 John Wiley & Sons, Ltd.
Research Area(s)
- Decomposition, Higher-order tensors, Rank-1 tensors, Supersymmetry
Citation Format(s)
On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors. / Wang, Yiju; Qi, Liqun.
In: Numerical Linear Algebra with Applications, Vol. 14, No. 6, 08.2007, p. 503-519.
In: Numerical Linear Algebra with Applications, Vol. 14, No. 6, 08.2007, p. 503-519.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
