Generating polynomials and symmetric tensor decompositions
From MaRDI portal
Publication:2397746
Abstract: This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial. The homogenization of a generating polynomial belongs to the apolar ideal of the tensor. A symmetric tensor decomposition can be determined by a set of generating polynomials, which can be represented by a matrix. We call it a generating matrix. Generally, a symmetric tensor decomposition can be determined by a generating matrix satisfying certain conditions. We characterize the sets of such generating matrices and investigate their properties (e.g., the existence, dimensions, nondefectiveness). Using these properties, we propose methods for computing symmetric tensor decompositions. Extensive examples are shown to demonstrate the efficiency of proposed methods.
Recommendations
Cites work
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 1820149 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- scientific article; zbMATH DE number 3579922 (Why is no real title available?)
- scientific article; zbMATH DE number 1253975 (Why is no real title available?)
- scientific article; zbMATH DE number 621807 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- scientific article; zbMATH DE number 773851 (Why is no real title available?)
- scientific article; zbMATH DE number 781821 (Why is no real title available?)
- Computing symmetric rank for symmetric tensors
- Decomposition of homogeneous polynomials with low rank
- Decomposition of quantics in sums of powers of linear forms
- Eigenvectors of tensors and algorithms for Waring decomposition
- Flat extensions of positive moment matrices: recursively generated relations
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Moment matrices, border bases and real radical computation
- Most tensor problems are NP-hard
- On the rank of a binary form
- Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
- Recent advances in numerical methods for nonlinear equations and nonlinear least squares
- Secant varieties to high degree Veronese reembeddings, catalecticant matrices and smoothable Gorenstein schemes
- Solution of the truncated complex moment problem for flat data
- Symmetric Tensors and Symmetric Tensor Rank
- Symmetric tensor decomposition
- Truncated \(K\)-moment problems in several variables
Cited in
(35)- A superfast randomized algorithm to decompose binary forms
- Symmetric tensor decomposition by an iterative eigendecomposition algorithm
- Generating-function method for tensor products
- Polynomial decompositions with invariance and positivity inspired by tensors
- Estimating Higher-Order Moments Using Symmetric Tensor Decomposition
- A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors
- Completely positive binary tensors
- Low rank symmetric tensor approximations
- Separability of Hermitian tensors and PSD decompositions
- An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
- The saddle point problem of polynomials
- Partially symmetric tensor structure preserving rank-\(R\) approximation via BFGS algorithm
- Symmetric Hermitian decomposability criterion, decomposition, and its applications
- A normal form algorithm for tensor rank decomposition
- Completely positive tensors in the complex field
- Tensors in computations
- Rank-\(r\) decomposition of symmetric tensors
- On the complexity of finding tensor ranks
- A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
- Hankel Tensor Decompositions and Ranks
- Generalization of the Bollobás-Riordan polynomial for tensor graphs
- Orthogonal tensor decomposition and orbit closures from a linear algebraic perspective
- Multihomogeneous polynomial decomposition using moment matrices
- Rank decomposition and symmetric rank decomposition over arbitrary fields
- Loss functions for finite sets
- Learning diagonal Gaussian mixture models and incomplete tensor decompositions
- On decompositions and approximations of conjugate partial-symmetric tensors
- A semidefinite algorithm for completely positive tensor decomposition
- Numerical optimization for symmetric tensor decomposition
- Hermitian tensor decompositions
- Atomic decompositions for tensor products and polynomial spaces
- Symmetric tensor nuclear norms
- An efficient alternating minimization method for fourth degree polynomial optimization
- Real eigenvalues of nonsymmetric tensors
- Convex generalized Nash equilibrium problems and polynomial optimization
This page was built for publication: Generating polynomials and symmetric tensor decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397746)
