Decomposition Algorithms for Tensors and Polynomials
From MaRDI portal
Publication:6043380
Abstract: We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the decomposition of a general plane quintic in seven powers, and of a general space cubic in five powers; the two decompositions of a general plane sextic of rank nine, and the five decompositions of a general plane septic. Furthermore, we give Magma implementations of all our algorithms.
Recommendations
Cites work
- scientific article; zbMATH DE number 3911162 (Why is no real title available?)
- scientific article; zbMATH DE number 773851 (Why is no real title available?)
- An effective criterion for the additive decompositions of forms
- Classical algebraic geometry. A modern view
- Decomposition of homogeneous polynomials with low rank
- Decomposition of quantics in sums of powers of linear forms
- Dual homogeneous forms and varieties of power sums
- Effective criteria for specific identifiability of tensors and forms
- Effective identifiability criteria for tensors and polynomials
- Eigenvectors of tensors and algorithms for Waring decomposition
- Equations for secant varieties of Veronese and other varieties
- Finiteness theorems for abelian varieties over number fields.
- Identifiability of homogeneous polynomials and Cremona transformations
- Identifiability of large phylogenetic mixture models
- Identifiability of parameters in latent structure models with many observed variables
- New lower bounds for the border rank of matrix multiplication
- On Generic Identifiability of 3-Tensors of Small Rank
- On generic identifiability of symmetric tensors of subgeneric rank
- On minimal decompositions of low rank symmetric tensors
- On symmetric and skew-symmetric determinantal varieties
- On the identifiability of ternary forms
- Partially symmetric variants of Comon's problem via simultaneous rank
- Phylogenetic algebraic geometry
- Phylogenetic invariants for the general Markov model of sequence mutation
- Plane curves containing a star configuration
- Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
- Real and complex Waring rank of reducible cubic forms
- Real rank geometry of ternary forms
- Star configuration points and generic plane curves
- Star configurations in \(\mathbb{P}^n\)
- Star configurations on generic hypersurfaces
- Symmetric Tensors and Symmetric Tensor Rank
- Symmetric tensor decomposition
- Tensor Decompositions and Applications
- The Magma algebra system. I: The user language
- The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\)
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Topics on phylogenetic algebraic geometry
- Waring, tangential and cactus decompositions
Cited in
(22)- Polynomial decompositions with invariance and positivity inspired by tensors
- The Tensor Product of Polynomials
- Identifiability of an X-rank decomposition of polynomial maps
- A use of ideal decomposition in the computer algebra of tensor expressions
- Algorithms for the Polar Decomposition
- Derandomization and absolute reconstruction for sums of powers of linear forms
- Rank-\(r\) decomposition of symmetric tensors
- Decoupling Multivariate Polynomials Using First-Order Information and Tensor Decompositions
- Equivalent polyadic decompositions of matrix multiplication tensors
- Algorithmic simplification of tensor expressions
- Multihomogeneous polynomial decomposition using moment matrices
- An algorithm to simplify tensor expressions
- Waring, tangential and cactus decompositions
- An algorithm for generic and low-rank specific identifiability of complex tensors
- Diagonalizable higher degree forms and symmetric tensors
- Atomic decompositions for tensor products and polynomial spaces
- Beyond the cactus rank of tensors
- Numerical CP decomposition of some difficult tensors
- Algorithms for the Polar Decomposition in Certain Groups and the Quaternion Tensor Square
- General tensor decomposition, moment matrices and applications
- Hilbert functions of chopped ideals
- Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
This page was built for publication: Decomposition Algorithms for Tensors and Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043380)
