An upper bound for the tensor rank
type: Item
instance of: scholarly article
title: An upper bound for the tensor rank
zbMATH Open document ID: 1268.15026
DOI: 10.1155/2013/241835
author: E. Ballico
published in: ISRN Geometry
publication date: 2013-06-03T00:00:00Z
review text: Summary: Let \(T\) be a tensor of format \((m_1 + 1) \times \cdots \times (m_s + 1)\), \(m_1 \geq \cdots \geq m_s > 0\), over \(\mathbb C\). We prove that \(T\) has tensor rank at most \(\prod_{i \neq 2}(m_i + 1)\).
Mathematics Subject Classification ID: 15A72
Mathematics Subject Classification ID: 15A03
zbMATH DE Number: 6169679
zbMATH Keywords: upper bound
zbMATH Keywords: tensor rank
MaRDI profile type: Publication
Wikidata QID: Q58994342
full work available at URL: https://doi.org/10.1155/2013/241835
OpenAlex ID: W2085688188
cites work: Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
cites work: Q3152895
cites work: Tensor Decompositions and Applications
cites work: Q3096060
cites work: Multiarray signal processing: tensor decomposition meets compressed sensing
cites work: An upper bound for the symmetric tensor rank of a low degree polynomial in a large number of variables
cites work: Rank and optimal computation of generic tensors
cites work: Refined methods for the identifiability of tensors
cites work: Representations of multivariate polynomials by sums of univariate polynomials in linear forms
description: scientific article; zbMATH DE number 6169679