pith. sign in

arxiv: 1409.4926 · v3 · pith:LO2QMTBTnew · submitted 2014-09-17 · 🧮 math.NA · cs.NA

Symmetric Tensor Decomposition by an Iterative Eigendecomposition Algorithm

classification 🧮 math.NA cs.NA
keywords symmetrictensoriterativesteroidalgorithmdecompositionidentificationnonlinear
0
0 comments X
read the original abstract

We present an iterative algorithm, called the symmetric tensor eigen-rank-one iterative decomposition (STEROID), for decomposing a symmetric tensor into a real linear combination of symmetric rank-1 unit-norm outer factors using only eigendecompositions and least-squares fitting. Originally designed for a symmetric tensor with an order being a power of two, STEROID is shown to be applicable to any order through an innovative tensor embedding technique. Numerical examples demonstrate the high efficiency and accuracy of the proposed scheme even for large scale problems. Furthermore, we show how STEROID readily solves a problem in nonlinear block-structured system identification and nonlinear state-space identification.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.