On Kruskal's theorem that every 3 × 3 × 3 array has rank at most 5

Linear Algebra and Its Applications

Volumn 439, Issue 2, 2013, Pages 401-421

  Bremner, Murray R ^a   Hu, Jiaxiong ^b  

^a UNIVERSITY OF SASKATCHEWAN   (Canada)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

3 Dimensional arrays; Canonical forms; Kruskal's theorem; Tensor decompositions

Indexed keywords

3-DIMENSIONAL; CANONICAL FORM; COMPLETE CLASSIFICATION; KRUSKAL; MAXIMUM RANK; TENSOR DECOMPOSITION;

LINEAR ALGEBRA; MATHEMATICAL TECHNIQUES;

THEOREM PROVING;

EID: 84879879475     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2013.03.021     Document Type: Article

References (9)

1. 2. arXiv:1206.5179v1.
2. 3. Linear Multilinear Algebra 61 2013 986 997
3. V. de Silva, and L.-H. Lim Tensor rank and the ill-posedness of the best low-rank approximation problem SIAM J. Matrix Anal. Appl. 30 2008 1084 1127
4. J. Ja'Ja' Optimal evaluation of pairs of bilinear forms SIAM J. Comput. 8 1979 443 462
5. T.G. Kolda, and B.W. Bader Tensor decompositions and applications SIAM Rev. 51 2009 455 500
6. J.B. Kruskal Rank, decomposition, and uniqueness for 3-way and N-way arrays R. Coppi, S. Bolasco, Multiway Data Analysis 1989 North-Holland Amsterdam 7 18
7. R. Rocci, A 3 × 3 × 3 array has maximum rank 5, Microsoft Word document, no date.
8. J.M.F. ten Berge Kruskal's polynomial for 2 × 2 × 2 arrays, and a generalization to 2 × n × n arrays Psychometrika 56 1991 631 636
9. J. von zur Gathen Maximal bilinear complexity and codes Linear Algebra Appl. 144 1991 49 61