TOPICS
Search

Tensor Decomposition


A tensor decomposition expresses a tensor as a combination of simpler tensors. For a multidimensional array X, the canonical polyadic (CP) decomposition, also called the CANDECOMP/PARAFAC decomposition, has the form

 X=sum_(r=1)^Ra_r^((1)) degreesa_r^((2)) degrees... degreesa_r^((N)),

where  degrees denotes the tensor direct product. Each summand is an N-fold tensor direct product of vectors and has tensor rank one; an exact decomposition uses equality in place of approximation.

The Tucker decomposition represents the tensor by a smaller core tensor G and one factor matrix for each mode,

 X=G×_1A^((1))×_2A^((2))...×_NA^((N)),

where ×_n denotes multiplication along the nth index. CP and Tucker decompositions generalize aspects of the matrix singular value decomposition; the Tucker decomposition is also a higher-dimensional analog of principal component analysis. Tensor decompositions are used for compression, dimensional reduction, and the analysis of multiway data.


See also

Principal Component Analysis, Singular Value Decomposition, Tensor, Tensor Direct Product, Tensor Rank

Explore with Wolfram|Alpha

References

Kolda, T. G. and Bader, B. W. "Tensor Decompositions and Applications." SIAM Rev. 51, 455-500, 2009. https://doi.org/10.1137/07070111X.

Cite this as:

Weisstein, Eric W. "Tensor Decomposition." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/TensorDecomposition.html

Subject classifications