Tensor decomposition and homotopy continuation

2015/12/14 by Bernardi, Alessandra, Daleo, Noah S., Hauenstein, Jonathan D. +1 · 1 citation
#13P05 #14Q99 #65H10 #68W30 #Algebraic Geometry (math.AG) #FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.1512.04312

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 X₁,…,X_k⊂ℙ^N defined over ℂ. After computing ranks over ℂ, we also explore computing real ranks. Various examples are included to demonstrate this numerical algebraic geometric approach.

Cited by

• Generalized Additive Decompositions of Symmetric Tensors

Related

• Decomposition algorithms for tensors and polynomials
• A Generating Polynomial Based Two-Stage Optimization Method for Tensor Rank Decomposition
• Low-Rank Tensor Decomposition over Finite Fields
• Partition Rank and Partition Lattices
• Tensor decompositions in rank +1