Tensor decomposition and homotopy continuation
DOI10.1016/j.difgeo.2017.07.009zbMath1377.65057arXiv1512.04312OpenAlexW2963318118WikidataQ60307039 ScholiaQ60307039MaRDI QIDQ1679672
Alessandra Bernardi, Jonathan D. Hauenstein, Noah S. Daleo, Mourrain, Bernard
Publication date: 21 November 2017
Published in: Differential Geometry and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.04312
homotopy continuationnumerical examplesjoinstensor ranknumerical algebraic geometrysecant varietiesnumerical elimination theory
Numerical computation of solutions to systems of equations (65H10) Computational aspects of higher-dimensional varieties (14Q15) Polynomials, factorization in commutative rings (13P05) Multilinear algebra, tensor calculus (15A69)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Computations and equations for Segre-Grassmann hypersurfaces
- Isosingular sets and deflation
- Eigenvectors of tensors and algorithms for Waring decomposition
- A comparison of different notions of ranks of symmetric tensors
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
- On the typical rank of real polynomials (or symmetric tensors) with a fixed border rank
- Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme
- Rank and border rank of real ternary cubics
- Critical points via monodromy and local methods
- An implicitization challenge for binary factor analysis
- Computing symmetric rank for symmetric tensors
- Witness sets of projections
- On the rank of a binary form
- On the maximum rank of a real binary form
- Regenerative cascade homotopies for solving polynomial systems
- Secant varieties of toric varieties
- Certified predictor-corrector tracking for Newton homotopies
- Matrix multiplication via arithmetic progressions
- Tensor-based techniques for the blind separation of DS-CDMA signals
- On the ranks and border ranks of symmetric tensors
- Rank and optimal computation of generic tensors
- Errata: Coefficient-parameter polynomial continuation
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Unification and extension of intersection algorithms in numerical algebraic geometry
- Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
- Real solving for positive dimensional systems.
- On the cactus rank of cubic forms
- Numerically computing real points on algebraic sets
- Homotopy techniques for tensor decomposition and perfect identifiability
- Real solutions to systems of polynomial equations and parameter continuation
- Typical real ranks of binary forms
- Membership tests for images of algebraic sets by linear projections
- Phylogenetic ideals and varieties for the general Markov model
- The degree of the secant variety and the join of monomial curves
- On maximum, typical and generic ranks
- On deflation and multiplicity structure
- A new decision method for elementary algebra
- Numerically Testing Generically Reduced Projective Schemes for the Arithmetic Gorenstein Property
- Tying Up Loose Strands: Defining Equations of the Strand Symmetric Model
- On the typical rank of real binary forms
- The bilinear complexity and practical algorithms for matrix multiplication
- Finding points on real solution components and applications to differential polynomial systems
- Monomials as sums of powers: The real binary case
- Non-defectivity of Grassmannians of planes
- Secant Dimensions of Minimal Orbits: Computations and Conjectures
- Induction for secant varieties of Segre varieties
- Secant varieties of Grassmann varieties
- Bott’s formula and enumerative geometry
- Algebraic boundaries of Hilbert’s SOS cones
- Toward a Salmon Conjecture
- On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication
- Quantum computers that can be simulated classically in polynomial time
- Exact Solutions in Structured Low-Rank Approximation
- ON DIFFERENCES BETWEEN THE BORDER RANK AND THE SMOOTHABLE RANK OF A POLYNOMIAL
- Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- 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
- Equations for Lower Bounds on Border Rank
- A Degree Formula for Secant Varieties of Curves
- Finding at least one point in each connected component of a real algebraic set defined by a single equation
- The Euclidean distance degree of an algebraic variety