Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/11979
Title: On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors
Authors: Wang, Y
Qi, L 
Issue Date: 2007
Source: Numerical linear algebra with applications, 2007, v. 14, no. 6, p. 503-519
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.
Keywords: Decomposition
Higher-order tensors
Rank-1 tensors
Supersymmetry
Publisher: John Wiley & Sons
Journal: Numerical linear algebra with applications 
ISSN: 1070-5325
EISSN: 1099-1506
DOI: 10.1002/nla.537
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

27
Last Week
0
Last month
0
Citations as of Sep 4, 2020

WEB OF SCIENCETM
Citations

27
Last Week
1
Last month
1
Citations as of Sep 14, 2020

Page view(s)

141
Last Week
0
Last month
Citations as of Sep 15, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.