Symmetric tensor decomposition by an iterative eigendecomposition algorithm
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables
- A constructive algorithm for decomposing a tensor into a finite sum of orthonormal rank-1 terms
- An adaptive shifted power method for computing generalized tensor eigenpairs
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Blind identification of under-determined mixtures based on the characteristic function
- Block-oriented nonlinear system identification
- Decoupling Multivariate Polynomials Using First-Order Information and Tensor Decompositions
- Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
- Fourth-order blind identification of underdetermined mixtures of sources (FOBIUM)
- Identification of nonlinear systems using polynomial nonlinear state space models
- Identification of systems with localised nonlinearity: from state-space to block-structured models
- Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
- Monotonically convergent algorithms for symmetric tensor approximation
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Orthogonal tensor decompositions
- Quasi-Newton methods on Grassmannians and multilinear approximations of tensors
- Shifted power method for computing tensor eigenpairs
- Symmetric Tensors and Symmetric Tensor Rank
- Symmetric tensor decomposition
- Tensor Decompositions and Applications
- Tensor-train decomposition
Cited in
(12)- Estimating Higher-Order Moments Using Symmetric Tensor Decomposition
- ITERATIVE ALGORITHMS FOR THE SYMMETRIC AND LEAST-SQUARES SYMMETRIC SOLUTION OF A TENSOR EQUATION
- Rank-\(r\) decomposition of symmetric tensors
- Partial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorization
- Decomposition of Low Rank Multi-symmetric Tensor
- A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
- Symmetric tensor decomposition
- Eigenvectors of tensors and algorithms for Waring decomposition
- Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems
- Symmetric orthogonal approximation to symmetric tensors with applications to image reconstruction
- Iterative methods for symmetric outer product tensor decomposition
- Decoupling multivariate polynomials: interconnections between tensorizations
This page was built for publication: Symmetric tensor decomposition by an iterative eigendecomposition algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q738956)
