Simplicity of core arrays in three-way principal component analysis and the typical rank of \(p\times q\times 2\) arrays

Related Items (23)

Matrices with special reference to applications in psychometrics ⋮ Typical rank and indscal dimensionality for symmetric three-way arrays of order \(I\times 2\times 2\) or \(I\times 3\times 3\) ⋮ Symmetry transformations for square sliced three-way arrays, with applications to their typical rank ⋮ Typical ranks for 3-tensors, nonsingular bilinear maps and determinantal ideals ⋮ Exact probabilities for typical ranks of \(2 \times 2 \times 2\) and \(3 \times 3 \times 2\) tensors ⋮ Typical ranks for \(m\times n\times (m-1)n\) tensors with \(m \leq n\) ⋮ Simplicity and typical rank results for three-way arrays ⋮ Unnamed Item ⋮ On the generic and typical ranks of 3-tensors ⋮ Transforming three-way arrays to maximal simplicity ⋮ Typical ranks of certain 3-tensors and absolutely full column rank tensors ⋮ On real typical ranks ⋮ The typical rank of tall three-way arrays ⋮ Typical ranks ofm×n× (m− 1)ntensors with 3 ≤m≤nover the real number field ⋮ Degeneracy in Candecomp/Parafac explained for \(p\times p\times 2\) arrays of rank \(p+1\) or higher ⋮ Subtracting a best rank-1 approximation may increase tensor rank ⋮ Simplicity transformations for three-way arrays with symmetric slices, and applications to Tucker-3 models with sparse core arrays ⋮ Degeneracy in Candecomp/Parafac and Indscal explained for several three-sliced arrays with a two-valued typical rank ⋮ Existence and uniqueness of the Kronecker covariance MLE ⋮ Generic and typical ranks of multi-way arrays ⋮ On Koopman mode decomposition and tensor component analysis ⋮ Guarantees for Existence of a Best Canonical Polyadic Approximation of a Noisy Low-Rank Tensor ⋮ Tucker-3 decomposition with sparse core array using a penalty function based on Gini-index

This page was built for publication: Simplicity of core arrays in three-way principal component analysis and the typical rank of \(p\times q\times 2\) arrays