DOI10.1137/0614071zbMath0788.65145OpenAlexW2033154334WikidataQ60307031 ScholiaQ60307031MaRDI QIDQ3142611
R. B. Abel, Robert T. Ross, Sue E. Leurgans
Publication date: 30 May 1994
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0614071
Tensor decomposition for learning Gaussian mixtures from moments ⋮
Blind PARAFAC signal detection for polarization sensitive array ⋮
4D near-field source localization using cumulant ⋮
On the spectral problem for trivariate functions ⋮
A new method of moments for latent variable models ⋮
Dimensionality reduction in higher-order signal processing and rank-\((R_1,R_2,\ldots,R_N)\) reduction in multilinear algebra ⋮
The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor ⋮
A stabilized normal form algorithm for generic systems of polynomial equations ⋮
Overcomplete Order-3 Tensor Decomposition, Blind Deconvolution, and Gaussian Mixture Models ⋮
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 ⋮
Complete decomposition of symmetric tensors in linear time and polylogarithmic precision ⋮
A contemporary linear representation theory for ordinary differential equations: multilinear algebra in folded arrays (folarrs) perspective and its use in multidimensional case ⋮
A review on octupolar tensors ⋮
Low Rank Symmetric Tensor Approximations ⋮
Generic identifiability of pairs of ternary forms ⋮
An algorithm for the non-identifiability of rank-3 tensors ⋮
A probabilistic foundation for dynamical systems: theoretical background and mathematical formulation ⋮
Hankel Tensor Decompositions and Ranks ⋮
Uniqueness proof for a family of models sharing features of Tucker's three-mode factor analysis and PARAFAC/CANDECOMP ⋮
Finding a low-rank basis in a matrix subspace ⋮
Numerical multilinear algebra and its applications ⋮
Sufficient conditions for uniqueness in Candecomp/Parafac and Indscal with random component matrices ⋮
Bilinear factorizations subject to monomial equality constraints via tensor decompositions ⋮
Imposing Independence Constraints in the CP Model ⋮
Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable ⋮
Fiber Sampling Approach to Canonical Polyadic Decomposition and Application to Tensor Completion ⋮
The Dynamics of Swamps in the Canonical Tensor Approximation Problem ⋮
Systems of Polynomial Equations, Higher-order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part I: The Canonical Polyadic Decomposition ⋮
Multi-Reference Alignment in High Dimensions: Sample Complexity and Phase Transition ⋮
Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank- $(L_{r,n},L_{r,n},1)$ Terms---Part II: Algorithms ⋮
News Algorithms for tensor decomposition based on a reduced functional ⋮
Unnamed Item ⋮
Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank-$(L_r,n,L_r,n,1)$ Terms---Part I: Uniqueness ⋮
Unnamed Item ⋮
A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition ⋮
A spectral algorithm for latent Dirichlet allocation ⋮
The Sample Complexity of Multireference Alignment
This page was built for publication: A Decomposition for Three-Way Arrays
