Tensor decomposition and homotopy continuation

Abstract : A computationally challenging classical elimination theory problem is to compute polyno-mials 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 X1,. .. , Xk ⊂ P N defined over C. After computing ranks over C, we also explore computing real ranks. Various examples are included to demonstrate this numerical algebraic geometric approach.
Document type :
Journal articles
Complete list of metadatas

Cited literature [83 references]  Display  Hide  Download

https://hal.inria.fr/hal-01250398
Contributor : Bernard Mourrain <>
Submitted on : Monday, January 4, 2016 - 5:03:13 PM
Last modification on : Thursday, February 7, 2019 - 2:52:33 PM
Long-term archiving on : Friday, April 15, 2016 - 4:20:35 PM

Files

TensorDecomp_151215.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Alessandra Bernardi, Noah S. Daleo, Jonathan D. Hauenstein, Bernard Mourrain. Tensor decomposition and homotopy continuation. Differential Geometry and its Applications, Elsevier, 2017, 55, pp.78-105. ⟨10.1016/j.difgeo.2017.07.009⟩. ⟨hal-01250398⟩

Share

Metrics

Record views

466

Files downloads

245