Hankel Tensor Decompositions and Ranks

DOI10.1137/18M1168285zbMATH Open1411.15018arXiv1706.03631OpenAlexW2963365333WikidataQ127931350 ScholiaQ127931350MaRDI QIDQ5380271FDOQ5380271

Author name not available (Why is that?)

Publication date: 4 June 2019

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Abstract: Hankel tensors are generalizations of Hankel matrices. This article studies the relations among various ranks of Hankel tensors. We give an algorithm that can compute the Vandermonde ranks and decompositions for all Hankel tensors. For a generic $n$-dimensional Hankel tensor of even order or order three, we prove that the the cp rank, symmetric rank, border rank, symmetric border rank, and Vandermonde rank all coincide with each other. In particular, this implies that the Comon's conjecture is true for generic Hankel tensors when the order is even or three. Some open questions are also posed.

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

Recommendations

• Tensor decompositions in rank \(+1\)
• Rank properties and computational methods for orthogonal tensor decompositions
• Tensor decompositions and rank increment conjecture
• Rank-\(r\) decomposition of symmetric tensors
• Structured low rank decomposition of multivariate Hankel matrices
• Hankel tensors: associated Hankel matrices and Vandermonde decomposition
• Chapter 2:rank and tensor rank
• The complexity of tensor rank
• Bounds on the tensor rank
• An introduction to hierarchical (\(\mathcal H\)-) rank and TT-rank of tensors with examples

zbMATH Keywords

rankHankel tensorWaring decompositionVandermonde decomposition

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Vector spaces, linear dependence, rank, lineability (15A03)

Cites Work

• General tensor decomposition, moment matrices and applications
• Title not available (Why is that?)
• Tensor Decompositions and Applications
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
• A Multilinear Singular Value Decomposition
• Nuclear norm of higher-order tensors
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Eigenvalues of a real supersymmetric tensor
• Most Tensor Problems Are NP-Hard
• Eigenvalues and invariants of tensors
• Hankel tensors: associated Hankel matrices and Vandermonde decomposition
• Title not available (Why is that?)
• Exponential data fitting using multilinear algebra: the single‐channel and multi‐channel case
• On the rank of a binary form
• A literature survey of low-rank tensor approximation techniques
• Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition
• On generic identifiability of symmetric tensors of subgeneric rank
• Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition
• Symmetric tensor decomposition
• On the ranks and border ranks of symmetric tensors
• Tensor rank is NP-complete
• Symmetric Tensors and Symmetric Tensor Rank
• Multiarray signal processing: tensor decomposition meets compressed sensing
• Semidefinite Relaxations for Best Rank-1 Tensor Approximations
• On the ideals of secant varieties of Segre varieties
• A Decomposition for Three-Way Arrays
• Eigenvectors of tensors and algorithms for Waring decomposition
• New lower bounds for the border rank of matrix multiplication
• On the ideals and singularities of secant varieties of Segre varieties
• Computing symmetric rank for symmetric tensors
• Computing extreme eigenvalues of large scale Hankel tensors
• Inheritance properties and sum-of-squares decomposition of Hankel tensors: theory and algorithms
• Generating polynomials and symmetric tensor decompositions
• All Real Eigenvalues of Symmetric Tensors
• Further results on Cauchy tensors and Hankel tensors
• Fast structured matrix computations: tensor rank and Cohn-Umans method
• Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
• A Counterexample to Comon's Conjecture
• Identifiability of homogeneous polynomials and Cremona transformations
• Real eigenvalues of nonsymmetric tensors
• Low Rank Symmetric Tensor Approximations
• Almost sure identifiability of constant modulus multidimensional harmonic retrieval

Cited In (6)

• Separability of Hermitian tensors and PSD decompositions
• An accelerated proximal gradient algorithm for Hankel tensor completion
• Learning diagonal Gaussian mixture models and incomplete tensor decompositions
• Title not available (Why is that?)
• Structured Rank-(r1, . . . , rd) Decomposition of Function-related Tensors in R_D
• Hermitian Tensor Decompositions

Uses Software

• Macaulay2

This page was built for publication: Hankel Tensor Decompositions and Ranks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380271)