On partial and generic uniqueness of block term tensor decompositions
From MaRDI portal
Publication:2256944
DOI10.1007/s11565-013-0190-zzbMath1315.15026arXiv1301.0920OpenAlexW2592390729MaRDI QIDQ2256944
Publication date: 23 February 2015
Published in: Annali dell'Università di Ferrara. Sezione VII. Scienze Matematiche (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.0920
multilinear algebratensor decompositionclassical algebraic geometrymultilinear rankblock term decompositionjoin and secant varietysubspace variety
Related Items (4)
Nonlinear algebra and applications ⋮ On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms ⋮ Perturbation analysis for matrix joint block diagonalization ⋮ Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank-$(L_r,n,L_r,n,1)$ Terms---Part I: Uniqueness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ranks derived from multilinear maps
- Weakly defective varieties
- Secant varieties of ℙ¹×⋯×ℙ¹ (𝕟-times) are NOT defective for 𝕟≥5
- Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ Terms
- On the ideals and singularities of secant varieties of Segre varieties
- Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
- On Generic Identifiability of 3-Tensors of Small Rank
- Decompositions of a Higher-Order Tensor in Block Terms—Part I: Lemmas for Partitioned Matrices
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms
This page was built for publication: On partial and generic uniqueness of block term tensor decompositions