Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition

DOI10.1137/130916084zbMath1306.15022arXiv1312.2848OpenAlexW1974785908WikidataQ60307027 ScholiaQ60307027MaRDI QIDQ2923363

Lieven De Lathauwer, I. Yu. Domanov

Publication date: 15 October 2014

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

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

zbMATH Keywords

tensoralgorithmcomputational complexitymatrix pencilcanonical polyadic decompositioneigenvalue decompositionmatrix permanentcompound matrixmixed discriminantKhatri-Rao productCandecomp/Parafac decomposition

Mathematics Subject Classification ID

Related Items (28)

Estimating multivariate latent-structure models ⋮ Tensor decomposition for learning Gaussian mixtures from moments ⋮ On the spectral problem for trivariate functions ⋮ Overcomplete Order-3 Tensor Decomposition, Blind Deconvolution, and Gaussian Mixture Models ⋮ SOTT: Greedy Approximation of a Tensor as a Sum of Tensor Trains ⋮ Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm ⋮ $(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials ⋮ Condition numbers for the tensor rank decomposition ⋮ Effective Criteria for Specific Identifiability of Tensors and Forms ⋮ A generalization of Kruskal’s theorem on tensor decomposition ⋮ Low Rank Symmetric Tensor Approximations ⋮ Generic identifiability of pairs of ternary forms ⋮ An algorithm for the non-identifiability of rank-3 tensors ⋮ On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms ⋮ Hankel Tensor Decompositions and Ranks ⋮ Finding a low-rank basis in a matrix subspace ⋮ Bilinear factorizations subject to monomial equality constraints via tensor decompositions ⋮ A note on nonclosed tensor formats ⋮ Coherent signal parameter estimation by exploiting decomposition of tensors ⋮ Identifiability of rank-3 tensors ⋮ Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable ⋮ Fiber Sampling Approach to Canonical Polyadic Decomposition and Application to Tensor Completion ⋮ Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank- $(L_{r,n},L_{r,n},1)$ Terms---Part II: Algorithms ⋮ A fast alternating least squares method for third-order tensors based on a compression procedure ⋮ Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank-$(L_r,n,L_r,n,1)$ Terms---Part I: Uniqueness ⋮ A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition ⋮ Guarantees for Existence of a Best Canonical Polyadic Approximation of a Noisy Low-Rank Tensor ⋮ Decoupling Multivariate Polynomials Using First-Order Information and Tensor Decompositions

Uses Software

• PARAFAC

This page was built for publication: Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition