Abstract
While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention from theoretical computer science and scientific computing. We complement this existing body of literature with an algebro-geometric analysis of the set of orthogonally decomposable tensors.
More specifically, we prove that they form a real-algebraic variety defined by polynomials of degree at most four. The exact degrees, and the corresponding polynomials, are different in each of three times two scenarios: ordinary, symmetric, or alternating tensors; and real-orthogonal versus complex-unitary. A key feature of our approach is a surprising connection between orthogonally decomposable tensors and semisimple algebras—associative in the ordinary and symmetric settings and of compact Lie type in the alternating setting.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
A. Anandkumar, R. Ge, D. Hsu, S. M. Kakade and M. Telegarski, Tensor decompositions for learning latent variable models, Journal of Machine Learning Research 15 (2014), 2773–2832.
A. Anandkumar, R. Ge and M. Janzamin, Sample complexity analysis for learning overcomplete latent variable models through tensor methods, Preprint, arXiv:1408.0553.
K. Batselier, H. Liu and N. Wong, A constructive algorithm for decomposing a tensor into a finite sum of orthonormal rank-1 terms, SIAM Journal on Matrix Analysis and Applications 36 (2015), 1315–1337.
P. Comon, Independent component analysis, a new concept?, Signal Processing 36 (1994), 287–314.
J. Chen and Y. Saad, On the tensor SVD and the optimal low rank orthogonal approximation of tensors, SIAM Journal on Matrix Analysis and Applications 30 (2009), 1709–1734.
L. De Lathauwer, B. De Moor and J. Vandewalle, A multilinear singular value decomposition, SIAM Journal on Matrix Analysis and Applications 21 (2000), 1253–1278.
C. Hillar and L.-H. Lim, Most tensor problems are NP hard, Journal of the ACM 60 (2013), no. 6, Art. 45.
H. Hopf, Ein topologischer Beitrag zur reellen Algebra, Commentarii Mathematici Helvetici 13 (1941), 219–239.
A. W. Knapp, Lie Groups Bbeyond an Introduction, Progress in Mathematics, Vol. 140, Birkhäuser Boston, Boston, MA, 2002.
T. G. Kolda, Orthogonal tensor decompositions, SIAM Journal on Matrix Analysis and Applications 23 (2001), 243–255.
T. G. Kolda, A counterexample to the possibility of an extension of the eckartyoung low-rank approximation theorem for the orthogonal rank tensor decomposition, SIAM Journal on Matrix Analysis and Applications 24 (2003), 762–767.
T. G. Kolda, Symmetric orthogonal tensor decomposition is trivial, Preprint, arXiv:1503.01375.
E. Robeva, Orthogonal decomposition of symmetric tensors, SIAM Journal on Matrix Analysis and Applications 37 (2016), 86–102.
S. Ragnarsson and C. F. Van Loan, Block tensors and symmetric embeddings, Linear Algebra and its Applications 438 (2013), 853–874.
A. Snowden, Syzygies of Segre embeddings and Δ-modules, Duke Mathematical Journal 162 (2013), 225–277.
J. Salmi, A. Richter and V. Koivunen, Sequential unfolding svd for tensors with applications in array signal processing, IEEE Transactions on Signal Processing 57 (2009), 4719–4733.
S. V. Sam and A. Snowden, Stability patterns in representation theory, Forum of Mathematics. Sigma 3 (2015), e11.
N. Vannieuwenhoven, J. Nicaise, R. Vandebril and K. Meerbergen, On generic nonexistence of the Schmidt–Eckart–Young decomposition for complex tensors, SIAM Journal on Matrix Analysis and Applications 35 (2014), 886–903.
T. Zhang and G. H. Golub, Rank-one approximation to high order tensors, SIAM Journal on Matrix Analysis and Applications 23 (2001), 534–550.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Boralevi, A., Draisma, J., Horobeţ, E. et al. Orthogonal and unitary tensor decomposition from an algebraic perspective. Isr. J. Math. 222, 223–260 (2017). https://doi.org/10.1007/s11856-017-1588-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-017-1588-6