Generating polynomials and symmetric tensor decompositions

DOI10.1007/S10208-015-9291-7zbMATH Open1381.15017arXiv1408.5664OpenAlexW2245131330MaRDI QIDQ2397746FDOQ2397746

Authors: Jiawang Nie 

Publication date: 23 May 2017

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1408.5664

Recommendations

• Symmetric tensor decomposition
• Decomposition of quantics in sums of powers of linear forms
• Rank-\(r\) decomposition of symmetric tensors
• Low rank symmetric tensor approximations
• Symmetric Tensors and Symmetric Tensor Rank

zbMATH Keywords

symmetric tensortensor rankgenerating polynomialpolynomial systemgenerating matrixsymmetric tensor decomposition

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Most Tensor Problems Are NP-Hard
• Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the rank of a binary form
• Moment matrices, border bases and real radical computation
• Flat extensions of positive moment matrices: recursively generated relations
• Solution of the truncated complex moment problem for flat data
• Symmetric tensor decomposition
• Decomposition of quantics in sums of powers of linear forms
• Symmetric Tensors and Symmetric Tensor Rank
• Truncated \(K\)-moment problems in several variables
• Recent advances in numerical methods for nonlinear equations and nonlinear least squares
• Decomposition of homogeneous polynomials with low rank
• Eigenvectors of tensors and algorithms for Waring decomposition
• Secant varieties to high degree Veronese reembeddings, catalecticant matrices and smoothable Gorenstein schemes
• Title not available (Why is that?)
• Computing symmetric rank for symmetric tensors

Cited In (31)

• Separability of Hermitian tensors and PSD decompositions
• The saddle point problem of polynomials
• Learning diagonal Gaussian mixture models and incomplete tensor decompositions
• Generalization of the Bollobás-Riordan polynomial for tensor graphs
• Completely Positive Binary Tensors
• Tensors in computations
• Generating-function method for tensor products
• Numerical optimization for symmetric tensor decomposition
• Low Rank Symmetric Tensor Approximations
• On decompositions and approximations of conjugate partial-symmetric tensors
• Real eigenvalues of nonsymmetric tensors
• A normal form algorithm for tensor rank decomposition
• Partially symmetric tensor structure preserving rank-\(R\) approximation via BFGS algorithm
• Symmetric Tensor Nuclear Norms
• Estimating Higher-Order Moments Using Symmetric Tensor Decomposition
• A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors
• Rank-\(r\) decomposition of symmetric tensors
• Atomic decompositions for tensor products and polynomial spaces
• A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
• An efficient alternating minimization method for fourth degree polynomial optimization
• On the complexity of finding tensor ranks
• Symmetric Hermitian decomposability criterion, decomposition, and its applications
• Orthogonal tensor decomposition and orbit closures from a linear algebraic perspective
• Convex generalized Nash equilibrium problems and polynomial optimization
• Completely positive tensors in the complex field
• Loss functions for finite sets
• Hermitian Tensor Decompositions
• A semidefinite algorithm for completely positive tensor decomposition
• Hankel Tensor Decompositions and Ranks
• An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
• Rank decomposition and symmetric rank decomposition over arbitrary fields

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)