Homotopy techniques for tensor decomposition and perfect identifiability

From MaRDI portal
Publication:2317007

DOI10.1515/crelle-2016-0067zbMath1440.15019arXiv1501.00090OpenAlexW2962813731WikidataQ60307024 ScholiaQ60307024MaRDI QIDQ2317007

Luke Oeding, Jonathan D. Hauenstein, Giorgio Ottaviani, Andrew John Sommese

Publication date: 7 August 2019

Published in: Journal für die Reine und Angewandte Mathematik (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.00090




Related Items (26)

Catalecticant intersections and confinement of decompositions of formsTensor decomposition for learning Gaussian mixtures from momentsA note on the maximal rankTopology of tensor ranksOn the number of Waring decompositions for a generic polynomial vectorTensor decomposition and homotopy continuationEffective Criteria for Specific Identifiability of Tensors and FormsComputing Geometric Feature Sizes for Algebraic ManifoldsEffective identifiability criteria for tensors and polynomialsIdentifiability for a class of symmetric tensorsMultiprojective witness sets and a trace testDecomposing tensors into framesA counterexample to a conjecture on simultaneous Waring identifiabilityAn algorithm for the non-identifiability of rank-3 tensorsOn generic identifiability of symmetric tensors of subgeneric rankIdentifying the number of components in Gaussian mixture models using numerical algebraic geometryA note on the cactus rank for Segre-Veronese varietiesTypical and admissible ranks over fieldsA nearly optimal algorithm to decompose binary formsA new class of non-identifiable skew-symmetric tensorsBounds on the tensor rankIdentifiability of homogeneous polynomials and Cremona transformationsComputing Tensor Eigenvalues via Homotopy MethodsReal monodromy actionPencil-Based Algorithms for Tensor Rank Decomposition are not StableUsing monodromy to statistically estimate the number of solutions


Uses Software


Cites Work


This page was built for publication: Homotopy techniques for tensor decomposition and perfect identifiability