Krylov-type methods for tensor computations i

Linear Algebra and Its Applications

Volumn 438, Issue 2, 2013, Pages 891-918

  Savas, Berkant ^a,b   Eldén, Lars ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Information science; Krylov type method; Multilinear algebra; Multilinear rank; Sparse tensor; Tensor; Tensor approximation; Tucker model

Indexed keywords

HIGHER ORDER SINGULAR VALUE DECOMPOSITION; KRYLOV METHOD; KRYLOV-TYPE METHOD; MULTILINEAR ALGEBRA; MULTILINEAR RANK; NUMERICAL EXPERIMENTS; RECURSIONS; STRUCTURED TENSORS; SYNTHETIC DATASETS; TENSOR APPROXIMATION; TENSOR PRODUCTS;

ALGEBRA; INFORMATION SCIENCE; MATRIX ALGEBRA; NUMERICAL METHODS;

TENSORS;

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

References (33)

1. C. Andersson, and R. Bro Improving the speed of multi-way algorithms: part I. Tucker 3 Chemomet. Intell. Lab. Syst. 42 1998 93 103 (Pubitemid 28440364)
2. B.W. Bader, and T.G. Kolda Algorithm 862: MATLAB tensor classes for fast algorithm prototyping ACM Trans. Math. Softw. 32 4 2006 635 653 (Pubitemid 44927149)
3. B.W. Bader, and T.G. Kolda Efficient MATLAB computations with sparse and factored tensors SIAM J. Sci. Comput. 30 1 2007 205 231 URL:
4. J.D. Carroll, and J.J. Chang Analysis of individual differences in multidimensional scaling via an n-way generalization of Eckart-Young decomposition Psychometrika 35 1970 283 319
5. P. Comon Tensor decompositions J.G. McWhirter, I.K. Proudler, Mathematics in Signal Processing V 2002 Clarendon Press Oxford, UK 1 24
6. L. De Lathauwer, B. De Moor, and J. Vandewalle A multilinear singular value decomposition SIAM J. Matrix Anal. Appl. 21 4 2000 1253 1278 URL: (Pubitemid 33217068)
7. RN) approximation of higher-order tensors SIAM J. Matrix Anal. Appl. 21 4 2000 1324 1342 URL: (Pubitemid 33217072)
8. 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 3 2008 1084 1127 URL:
9. r3) approximation of a tensor SIAM J. Matrix Anal. Appl. 31 2009 248 271
10. L. Eldén Matrix Methods in Data Mining and Pattern Recognition 2007 SIAM
11. G.H. Golub, and W. Kahan Calculating the singular values and pseudo-inverse of a matrix SIAM J. Numer. Anal. Ser. B 2 1965 205 224
12. S. Goreinov, I. Oseledets, D. Savostyanov, Wedderburn rank reduction and Krylov subspace method for tensor approximation, Part 1: Tucker case, Tech. Rep. Preprint 2010-01, Inst. Numer. Math., Russian Academy of Sciences, 2010.
13. R.A. Harshman Foundations of the PARAFAC procedure: models and conditions for an explanatory multi-modal factor analysis UCLA Working Papers Phonet. 16 1970 1 84
14. F.L. Hitchcock Multiple invariants and generalized rank of a p-way matrix or tensor J. Math. Phys. Camb. 7 1927 39 70
15. M. Ishteva, L. De Lathauwer, P.-A. Absil, S. Van Huffel, Best low multilinear rank approximation of higher-order tensors, based on the riemannian trust-region scheme, Tech. Rep. 09-142, ESAT-SISTA, K.U. Leuven (Leuven, Belgium), 2009.
16. E.R. Jessup, and J.H. Martin Taking a new look at the latent semantic analysis approach to information retrieval M.W. Berry, Computational Information Retrieval 2001 SIAM Philadelphia, PA 121 144
17. B.N. Khoromskij, and V. Khoromskaia Multigrid accelerated tensor approximation of function related multidimensional arrays SIAM J. Sci. Comput. 31 4 2009 3002 3026 URL:
18. S. Kobayashi, and K. Nomizu Foundations of Differential Geometry 1963 Interscience Publisher
19. T.G. Kolda, W. Bader, J.P. Kenny, Higher-order web link analysis using multilinear algebra, in: ICDM 2005: Proceedings of the 5th IEEE International Conference on Data Mining, 2005, pp. 242-249.
20. T.G. Kolda, and B.W. Bader Tensor decompositions and applications SIAM Rev. 51 3 2009 455 500 URL:
21. P.M. Kroonenbeg Principal component analysis of three-mode data by means of alternating least squares algorithms Psychometrika 45 1980 69 97
22. J.B. Kruskal Rank, Decomposition, and Uniqueness for 3-Way and n-Way Arrays 1989 North-Holland Publishing Co. Amsterdam, The Netherlands pp. 7-18. URL:
23. R. Lehoucq, D. Sorensen, and C. Yang Arpack Users' Guide: Solution of Large Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods 1998 SIAM Philadelphia
24. S. Lohr, A $1 million research bargain for netflix, and maybe a model for others, The New York Times, September 21, 2009. URL: .
25. I.V. Oseledets, D.V. Savostianov, and E.E. Tyrtyshnikov Tucker dimensionality reduction of three-dimensional arrays in linear time SIAM J. Matrix Anal. Appl. 30 3 2008 939 956 URL:
26. B. Savas, Analyses and tests of handwritten digit recognition algorithms, Master's thesis, Linköping University, 2003. URL: .
27. B. Savas, and L. Eldén Handwritten digit classification using higher order singular value decomposition Pattern Recognit. 40 2007 993 1003 (Pubitemid 44667764)
28. B. Savas, and L.H. Lim Quasi-Newton methods on Grassmannians and multilinear approximations of tensors SIAM J. Sci. Comput. 32 6 2010 3352 3393 URL:
29. G.W. Stewart Matrix Algorithms II: Eigensystems 2001 SIAM Philadelphia
30. G.W. Stewart A Krylov-Schur algorithm for large eigenproblems SIAM J. Matrix Anal. Appl. 23 3 2002 601 614 URL:
31. A.L. Traud, E.D. Kelsic, P.J. Mucha, M.A. Porter, Community structure in online collegiate social networks, Tech. Rep., 2008. arXiv:0809.0690v1 [physics.soc-ph].
32. L.R. Tucker The extension of factor analysis to three-dimensional matrices Contrib. Math. Psych. 1964 109 127
33. T. Zhang, and G.H. Golub Rank-one approximation to high order tensors SIAM J. Matrix Anal. Appl. 23 2 2001 534 550 URL: