On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms

DOI10.1137/18M1206849zbMath1442.15042arXiv1808.02423OpenAlexW3022422766MaRDI QIDQ5113366

Lieven De Lathauwer, I. Yu. Domanov

Publication date: 4 June 2020

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

uniquenessfactor analysismultilinear algebrasignal separationeigenvalue decompositionmultilinear rankblock term decompositionthird-order tensor

Mathematics Subject Classification ID

Factorization of matrices (15A23) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69)

Related Items

SOTT: Greedy Approximation of a Tensor as a Sum of Tensor Trains ⋮ $(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials ⋮ Nonlinear algebra and applications ⋮ Lower bounds on the rank and symmetric rank of real tensors ⋮ From Computation to Comparison of Tensor Decompositions

Uses Software

• Tensorlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Refined methods for the identifiability of tensors
• Finding a low-rank basis in a matrix subspace
• Preconditioned optimization algorithms solving the problem of the non unitary joint block diagonalization: application to blind separation of convolutive mixtures
• Algebraic geometry. An introduction. Transl. from the French by Catriona Maclean
• Rank and optimal computation of generic tensors
• On partial and generic uniqueness of block term tensor decompositions
• On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part I: Basic Results and Uniqueness of One Factor Matrix
• On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part II: Uniqueness of the Overall Decomposition
• Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
• An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization
• Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ Terms
• Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL
• Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
• Löwner-Based Blind Signal Separation of Rational Functions With Applications
• Tensor Decomposition for Signal Processing and Machine Learning
• Real identifiability vs. complex identifiability
• Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable
• An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors
• A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
• Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
• Effective Criteria for Specific Identifiability of Tensors and Forms
• Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank- $(L_{r,n},L_{r,n},1)$ Terms---Part II: Algorithms

This page was built for publication: On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms