Tensor decomposition beyond uniqueness, with an application to the minrank problem

DOI10.1016/J.LAA.2026.03.008MaRDI QIDQ6839474zbMATH OpenFDO

Authors Pascal Koiran, Rafael Oliveira

Publication date 24 March 2026

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

Full work available at URL https://doi.org/10.1016/J.LAA.2026.03.008

zbMATH Keywords

generalized eigenvectorsJennrich's algorithmminimum rank problemtensor decomposition

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03) Eigenvalues, singular values, and eigenvectors (15A18) Basic linear algebra (15A99) Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30)

Cites work

• A concise proof of Kruskal's theorem on tensor decomposition
• A Decomposition for Three-Way Arrays
• Algorithmic aspects of machine learning
• Complete decomposition of symmetric tensors in linear time and polylogarithmic precision
• Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• Learning sums of powers of low-degree polynomials in the non-degenerate case
• Polynomial-time tensor decompositions with sum-of-squares
• Tensor rank is NP-complete
• The computation of Kronecker's canonical form of a singular pencil
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics

This page was built for publication: Tensor decomposition beyond uniqueness, with an application to the minrank problem

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