Hankel Tensor Decompositions and Ranks
From MaRDI portal
Publication:5380271
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 -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.
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
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?)
- A Decomposition for Three-Way Arrays
- A Multilinear Singular Value Decomposition
- A counterexample to Comon's conjecture
- A literature survey of low-rank tensor approximation techniques
- All real eigenvalues of symmetric tensors
- Almost sure identifiability of constant modulus multidimensional harmonic retrieval
- Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
- Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition
- Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition
- Computing extreme eigenvalues of large scale Hankel tensors
- Computing symmetric rank for symmetric tensors
- Eigenvalues and invariants of tensors
- Eigenvalues of a real supersymmetric tensor
- Eigenvectors of tensors and algorithms for Waring decomposition
- Exponential data fitting using multilinear algebra: the single‐channel and multi‐channel case
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- Further results on Cauchy tensors and Hankel tensors
- General tensor decomposition, moment matrices and applications
- Generating polynomials and symmetric tensor decompositions
- Hankel tensors: associated Hankel matrices and Vandermonde decomposition
- Identifiability of homogeneous polynomials and Cremona transformations
- Inheritance properties and sum-of-squares decomposition of Hankel tensors: theory and algorithms
- Low rank symmetric tensor approximations
- Most tensor problems are NP-hard
- Multiarray signal processing: tensor decomposition meets compressed sensing
- New lower bounds for the border rank of matrix multiplication
- Nuclear norm of higher-order tensors
- On generic identifiability of symmetric tensors of subgeneric rank
- On the ideals and singularities of secant varieties of Segre varieties
- On the ideals of secant varieties of Segre varieties
- On the rank of a binary form
- On the ranks and border ranks of symmetric tensors
- Real eigenvalues of nonsymmetric tensors
- Semidefinite relaxations for best rank-1 tensor approximations
- Symmetric Tensors and Symmetric Tensor Rank
- Symmetric tensor decomposition
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor rank is NP-complete
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
Cited in
(11)- Hankel tensors, Vandermonde tensors and their positivities
- Basic positive semi-definite Hankel tensors
- Separability of Hermitian tensors and PSD decompositions
- Tensor convolutions and Hankel tensors
- Learning diagonal Gaussian mixture models and incomplete tensor decompositions
- A simple method for computing the Vandermonde decomposition of a Hankel tensor
- Hermitian tensor decompositions
- An accelerated proximal gradient algorithm for Hankel tensor completion
- Inheritance properties and sum-of-squares decomposition of Hankel tensors: theory and algorithms
- Hankel tensors: associated Hankel matrices and Vandermonde decomposition
- Structured Rank-(r1, . . . , rd) Decomposition of Function-related Tensors in R_D
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)
