Tensor decomposition and homotopy continuation
From MaRDI portal
Abstract: A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness sets via numerical elimination theory, we develop computational methods for computing ranks and border ranks of tensors along with decompositions. More generally, we present our approach using joins of any collection of irreducible and nondegenerate projective varieties defined over . After computing ranks over , we also explore computing real ranks. Various examples are included to demonstrate this numerical algebraic geometric approach.
Recommendations
- Publication:4943807
- Homotopy techniques for tensor decomposition and perfect identifiability
- Tensor topology
- scientific article; zbMATH DE number 1569139
- Computing tensor eigenvalues via homotopy methods
- Trace decompositions of tensor spaces
- scientific article; zbMATH DE number 1779182
- scientific article; zbMATH DE number 4067640
- Tensor products of representations up to homotopy
- Deformation theory with homotopy algebra structures on tensor products
Cites work
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 1820149 (Why is no real title available?)
- scientific article; zbMATH DE number 45789 (Why is no real title available?)
- scientific article; zbMATH DE number 1736023 (Why is no real title available?)
- scientific article; zbMATH DE number 1961539 (Why is no real title available?)
- scientific article; zbMATH DE number 773851 (Why is no real title available?)
- scientific article; zbMATH DE number 3209180 (Why is no real title available?)
- scientific article; zbMATH DE number 5217538 (Why is no real title available?)
- A comparison of different notions of ranks of symmetric tensors
- A degree formula for secant varieties of curves
- A new decision method for elementary algebra
- Algebraic boundaries of Hilbert's SOS cones
- An implicitization challenge for binary factor analysis
- Bott’s formula and enumerative geometry
- Certified predictor-corrector tracking for Newton homotopies
- Computations and equations for Segre-Grassmann hypersurfaces
- Computing symmetric rank for symmetric tensors
- Critical points via monodromy and local methods
- Eigenvectors of tensors and algorithms for Waring decomposition
- Equations for lower bounds on border rank
- Errata: Coefficient-parameter polynomial continuation
- Exact solutions in structured low-rank approximation
- Finding at least one point in each connected component of a real algebraic set defined by a single equation
- Finding points on real solution components and applications to differential polynomial systems
- Homotopy techniques for tensor decomposition and perfect identifiability
- Induction for secant varieties of Segre varieties
- Isosingular sets and deflation
- Kruskal's Permutation Lemma and the Identification of CANDECOMP/PARAFAC and Bilinear Models with Constant Modulus Constraints
- Matrix multiplication via arithmetic progressions
- Membership tests for images of algebraic sets by linear projections
- Monomials as sums of powers: the real binary case
- Non-defectivity of Grassmannians of planes
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Numerically computing real points on algebraic sets
- Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme
- Numerically solving polynomial systems with Bertini
- Numerically testing generically reduced projective schemes for the arithmetic Gorenstein property
- On deflation and multiplicity structure
- On differences between the border rank and the smoothable rank of a polynomial
- On maximum, typical and generic ranks
- On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication
- On the cactus rank of cubic forms
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
- On the maximum rank of a real binary form
- On the rank of a binary form
- On the ranks and border ranks of symmetric tensors
- On the typical rank of real binary forms
- On the typical rank of real polynomials (or symmetric tensors) with a fixed border rank
- On the virtual array concept for higher order array processing
- Phylogenetic ideals and varieties for the general Markov model
- Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
- Quantum computers that can be simulated classically in polynomial time
- Rank and border rank of real ternary cubics
- Rank and optimal computation of generic tensors
- Real solutions to systems of polynomial equations and parameter continuation
- Real solving for positive dimensional systems.
- Recovering exact results from inexact numerical data in algebraic geometry
- Regenerative cascade homotopies for solving polynomial systems
- Secant Dimensions of Minimal Orbits: Computations and Conjectures
- Secant varieties of Grassmann varieties
- Secant varieties of toric varieties
- Software for numerical algebraic geometry: a paradigm and progress towards its implementation
- Tensor Decompositions and Applications
- Tensor-based techniques for the blind separation of DS-CDMA signals
- The Euclidean distance degree of an algebraic variety
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- The bilinear complexity and practical algorithms for matrix multiplication
- The degree of the secant variety and the join of monomial curves
- Toward a salmon conjecture
- Tying up loose strands: defining equations of the strand symmetric model
- Typical real ranks of binary forms
- Unification and extension of intersection algorithms in numerical algebraic geometry
- Witness sets of projections
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
Cited in
(15)- Waring, tangential and cactus decompositions
- On schemes evinced by generalized additive decompositions and their regularity
- A new class of non-identifiable skew-symmetric tensors
- Identifying the number of components in Gaussian mixture models using numerical algebraic geometry
- A note on the maximal rank
- Tensor decomposition for learning Gaussian mixtures from moments
- The condition number of join decompositions
- Skew-symmetric tensor decomposition
- scientific article; zbMATH DE number 4067640 (Why is no real title available?)
- A nearly optimal algorithm to decompose binary forms
- Evaluating and differentiating a polynomial using a pseudo-witness set
- On the ranks of the third secant variety of Segre-Veronese embeddings
- Identifiability of rank-3 tensors
- Hilbert functions of chopped ideals
- High order singular value decomposition for plant diversity estimation
This page was built for publication: Tensor decomposition and homotopy continuation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679672)