Symmetric tensor decomposition

DOI10.1016/J.LAA.2010.06.046zbMath1206.65141OpenAlexW2570391697MaRDI QIDQ603116

Pierre Comon, Jérôme Brachat, Mourrain, Bernard, Elias P. Tsigaridas

Publication date: 5 November 2010

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

Full work available at URL: https://doi.org/10.1016/j.laa.2010.06.046

zbMATH Keywords

algorithmglobal convergencesystems of polynomial equationsnormal formsymmetric tensorWaring's problemHankel matricestensor decompositionVeronese varietyalternate least squaresgradient descents

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69)

Related Items (91)

Nonsingular \(H\)-tensor and its criteria ⋮ Derandomization and absolute reconstruction for sums of powers of linear forms ⋮ Polynomial-exponential decomposition from moments ⋮ Tensors in computations ⋮ On the construction of general cubature formula by flat extensions ⋮ Nonnegative forms with sublevel sets of minimal volume ⋮ Tensor decomposition for learning Gaussian mixtures from moments ⋮ Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences ⋮ A very brief introduction to nonnegative tensors from the geometric viewpoint ⋮ SVD-Based Algorithms for the Best Rank-1 Approximation of a Symmetric Tensor ⋮ On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors ⋮ A Counterexample to Comon's Conjecture ⋮ Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation ⋮ On the real rank of monomials ⋮ Generating polynomials and symmetric tensor decompositions ⋮ An upper bound for the real tensor rank and the real symmetric tensor rank in terms of the complex ranks ⋮ The stratification by rank for homogeneous polynomials with border rank 5 which essentially depend on five variables ⋮ A bound for the Waring rank of the determinant via syzygies ⋮ Independent multistructures, flag structures, and sets of linearly independent polar elements ⋮ Computing symmetric rank for symmetric tensors ⋮ Partial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorization ⋮ Symmetric tensor rank over an infinite field ⋮ Eigenvectors of tensors and algorithms for Waring decomposition ⋮ Learning algebraic decompositions using Prony structures ⋮ Decomposition Algorithms for Tensors and Polynomials ⋮ The symmetric rank and decomposition of \(m\)-order \(n\)-dimensional \((n = 2,3,4)\) symmetric tensors over the binary field ⋮ Complete decomposition of symmetric tensors in linear time and polylogarithmic precision ⋮ Ranks and symmetric ranks of cubic surfaces ⋮ The average number of critical rank-one approximations to a tensor ⋮ Finding inverse systems from coordinates ⋮ A comparison of different notions of ranks of symmetric tensors ⋮ Monte Carlo approximate tensor moment simulations ⋮ Partially symmetric tensor structure preserving rank-\(R\) approximation via BFGS algorithm ⋮ Completely Positive Binary Tensors ⋮ Approximate real symmetric tensor rank ⋮ Border basis relaxation for polynomial optimization ⋮ Low Rank Symmetric Tensor Approximations ⋮ Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity ⋮ Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond ⋮ TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization ⋮ Dimensionality reduction and topographic mapping of binary tensors ⋮ Symmetric Hermitian decomposability criterion, decomposition, and its applications ⋮ Tensor decompositions on simplicial complexes with invariance ⋮ Sets computing the symmetric tensor rank ⋮ Waring, tangential and cactus decompositions ⋮ Decomposition of homogeneous polynomials with low rank ⋮ Waring problems and the Lefschetz properties ⋮ Probabilistic inference with noisy-threshold models based on a CP tensor decomposition ⋮ On generic and maximal \(k\)-ranks of binary forms ⋮ A uniqueness result on the decompositions of a bi-homogeneous polynomial ⋮ Hankel Tensor Decompositions and Ranks ⋮ On the typical rank of real bivariate polynomials ⋮ On minimal decompositions of low rank symmetric tensors ⋮ Hermitian Tensor Decompositions ⋮ On the typical rank of real polynomials (or symmetric tensors) with a fixed border rank ⋮ The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices ⋮ On the equivalence between low-rank matrix completion and tensor rank ⋮ Approximate tensor decompositions: Disappearance of many separations ⋮ On decompositions and approximations of conjugate partial-symmetric tensors ⋮ Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation ⋮ A nearly optimal algorithm to decompose binary forms ⋮ On the structure of positive semi-definite finite rank general domain Hankel and Toeplitz operators in several variables ⋮ Criteria for strong \(H\)-tensors ⋮ Improved Approximation of the Sum of Random Vectors by the Skew Normal Distribution ⋮ Structured low rank decomposition of multivariate Hankel matrices ⋮ Symmetric tensor rank and scheme rank: an upper bound in terms of secant varieties ⋮ Crossing fibers detection with an analytical high order tensor decomposition ⋮ Rank-\(r\) decomposition of symmetric tensors ⋮ Semialgebraic sets and real binary forms decompositions ⋮ ESPRIT for Multidimensional General Grids ⋮ Reconstruction algorithms for sums of affine powers ⋮ Partially Symmetric Variants of Comon's Problem Via Simultaneous Rank ⋮ Partially symmetric tensor rank: the description of the non-uniqueness case for low rank ⋮ On maximum, typical and generic ranks ⋮ Fiber Orientation Distribution Functions and Orientation Tensors for Different Material Symmetries ⋮ Symmetric tensor decomposition by an iterative eigendecomposition algorithm ⋮ How to integrate a polynomial over a simplex ⋮ Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction ⋮ A TT-Based Hierarchical Framework for Decomposing High-Order Tensors ⋮ Guessing Gröbner bases of structured ideals of relations of sequences ⋮ Homotopy techniques for tensor decomposition and perfect identifiability ⋮ Comon's Conjecture, Rank Decomposition, and Symmetric Rank Decomposition of Symmetric Tensors ⋮ Tensor ranks on tangent developable of Segre varieties ⋮ Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation ⋮ The Hitchhiker guide to: secant varieties and tensor decomposition ⋮ Decoupling Multivariate Polynomials Using First-Order Information and Tensor Decompositions ⋮ Numerical optimization for symmetric tensor decomposition ⋮ A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition ⋮ Multidimensional scaling in dually flat spaces ⋮ Rank-1 approximation for entangled multipartite real systems ⋮ Tensor factorisation for narrowband single channel source decomposition

Uses Software

• Multilinear Engine
• PARAFAC
• ICALAB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• PARAFAC: Parallel factor analysis
• On the rank of a binary form
• Introduction to the solution of polynomial systems
• Tensor-based techniques for the blind separation of DS-CDMA signals
• Blind identification of under-determined mixtures based on the characteristic function
• A generalized flat extension theorem for moment matrices
• Rank and optimal computation of generic tensors
• The blowing up Horace method: Application to interpolation in degree four
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• A new computational method to fit the weighted Euclidean distance model
• Computing the isolated roots by matrix methods
• Optimal separation of independent narrow-band sources: Concept and performance
• Decomposition of quantics in sums of powers of linear forms
• Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
• Typical rank and indscal dimensionality for symmetric three-way arrays of order \(I\times 2\times 2\) or \(I\times 3\times 3\)
• Blind Identification of Overcomplete MixturEs of sources (BIOME)
• Multivariate polynomials, duality, and structured matrices
• How to integrate a polynomial over a simplex
• Geometry and the complexity of matrix multiplication
• The invariant theory of binary forms
• Uncertainty principles and ideal atomic decomposition
• Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
• Contrasts, independent component analysis, and blind deconvolution
• Using Algebraic Geometry
• Symmetric Tensors and Symmetric Tensor Rank
• Blind separation of instantaneous mixtures of nonstationary sources
• Non-orthogonal joint diagonalization in the least-squares sense with application in blind source separation
• Kruskal's Permutation Lemma and the Identification of CANDECOMP/PARAFAC and Bilinear Models with Constant Modulus Constraints
• On the virtual array concept for higher order array processing
• Revisiting two theorems of Curto and Fialkow on moment matrices

This page was built for publication: Symmetric tensor decomposition