A normal form algorithm for tensor rank decomposition

DOI10.1145/3555369MaRDI QIDQ6599980zbMATH OpenFDO

Authors Simon Telen, Nick Vannieuwenhoven

Publication date 6 September 2024

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3555369

zbMATH Keywords

canonical polyadic decompositionnormal form algorithmspolynomial systemstensor rank decomposition

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• A Decomposition for Three-Way Arrays
• A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
• A Multilinear Singular Value Decomposition
• A new truncation strategy for the higher-order singular value decomposition
• An algorithm for generic and low-rank specific identifiability of complex tensors
• Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition
• Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
• Computing the unique CANDECOMP/PARAFAC decomposition of unbalanced tensors by homotopy method
• Effective criteria for specific identifiability of tensors and forms
• General tensor decomposition, moment matrices and applications
• Generating polynomials and symmetric tensor decompositions
• scientific article; zbMATH DE number 5968745 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 2190625 (Why is no real title available?)
• Most tensor problems are NP-hard
• Multigraded Castelnuovo-Mumford regularity
• Multihomogeneous polynomial decomposition using moment matrices
• Multilinear algebra. 2nd ed
• Numerical root finding via Cox rings
• On Generic Identifiability of 3-Tensors of Small Rank
• ON THE CONCEPT OF k-SECANT ORDER OF A VARIETY
• On the geometry of some special projective varieties
• On the uniqueness of the canonical polyadic decomposition of third-order tensors. II: Uniqueness of the overall decomposition
• Pencil-based algorithms for tensor rank decomposition are not stable
• Polynomial-exponential decomposition from moments
• Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
• Ranks derived from multilinear maps
• Refined methods for the identifiability of tensors
• Solving polynomial systems via truncated normal forms
• Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
• Symmetric tensor decomposition
• Tensor Decomposition for Signal Processing and Machine Learning
• Tensor Decompositions and Applications
• The algebraic theory of modular systems.
• The expression of a tensor or a polyadic as a sum of products.
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
• Toric varieties
• Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
• Waring, tangential and cactus decompositions

Cited in

(5)

• Hilbert functions of chopped ideals
• Yet another eigenvalue algorithm for solving polynomial systems
• The rank-1 completion problem for cubic tensors
• A chiseling algorithm for low-rank Grassmann decomposition of skew-symmetric tensors
• Hadamard-Hitchcock decompositions: identifiability and computation

This page was built for publication: A normal form algorithm for tensor rank decomposition

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