On the best rank-1 approximation of higher-order supersymmetric tensors (Q2784384)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the best rank-1 approximation of higher-order supersymmetric tensors |
scientific article; zbMATH DE number 1732275
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the best rank-1 approximation of higher-order supersymmetric tensors |
scientific article; zbMATH DE number 1732275 |
Statements
23 April 2002
0 references
supersymmetric tensors
0 references
rank-1 approximation
0 references
higher-order power method
0 references
higher-order singular value decomposition
0 references
convergence
0 references
On the best rank-1 approximation of higher-order supersymmetric tensors (English)
0 references
This paper presents an algorithm for least squares approximation of higher-order tensors by rank-1 tensors. The higher-order power method, related to the method of iterating powers of a matrix, is an iteration using weighted Tucker products. This paper gives a symmetric version of this method for supersymmetric tensors and proves it converges when an associated function is convex or concave. It also gives evidence that this method is significantly faster for supersymmetric tensors.
0 references
