Global properties of tensor rank

DOI10.1016/0024-3795(78)90052-6zbMath0389.15009OpenAlexW2051126420WikidataQ127179037 ScholiaQ127179037MaRDI QIDQ1250855

Thomas D. Howell

Publication date: 1978

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(78)90052-6

Mathematics Subject Classification ID

Vector and tensor algebra, theory of invariants (15A72) Multilinear algebra, tensor calculus (15A69)

Related Items (13)

On bilinear algorithms over fields of different characteristics ⋮ Maximal bilinear complexity and codes ⋮ A randomized algorithm for a tensor-based generalization of the singular value decomposition ⋮ Maximal Rank of ${m}\times{n}\times 2$ Tensors over Arbitrary Fields ⋮ Monotonically convergent algorithms for symmetric tensor approximation ⋮ Typical ranks for \(m\times n\times (m-1)n\) tensors with \(m \leq n\) ⋮ Bounds on the ranks of some 3-tensors ⋮ Numerical tensor calculus ⋮ The complexity of tensor rank ⋮ Generic and typical ranks of multi-way arrays ⋮ Rank and optimal computation of generic tensors ⋮ Typical tensorial rank ⋮ On general domain truncated correlation and convolution operators with finite rank

Cites Work

• Optimum computation of p bilinear forms
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
• Sur le calcul des produits de matrices. (Calculation of the product of matrices.)
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
• Algebras Having Linear Multiplicative Complexities
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Global properties of tensor rank