Fast truncation of mode ranks for bilinear tensor operations

Numerical Linear Algebra with Applications

Volumn 19, Issue 1, 2012, Pages 103-111

  Savostyanov, D V ^a   Tyrtyshnikov, E E ^a   Zamarashkin, N L ^a  

^a INSTITUTE OF NUMERICAL MATHEMATICS   (Russian Federation)

Author keywords

Cross approximation; Fast compression; Multidimensional arrays; Structured tensors; Tucker approximation

Indexed keywords

EID: 84855214058     PISSN: 10705325     EISSN: 10991506     Source Type: Journal    
DOI: 10.1002/nla.765     Document Type: Article

References (29)

1. Hitchcock FL. The expression of a tensor or a polyadic as a sum of products. Journal of Mathematical Physics 1927; 6(1):164-189.
2. Caroll JD, Chang JJ. Analysis of individual differences in multidimensional scaling via n-way generalization of Eckart-Young decomposition. Psychometrika 1970; 35:283-319.
3. Harshman RA. Foundations of the Parafac procedure: models and conditions for an explanatory multimodal factor analysis. UCLA Working Papers in Phonetics 1970; 16:1-84.
4. de Silva V, Lim L. Tensor rank and the Ill-posedness of the best low-rank approximation problem. SIAM Journal on Matrix Analysis and Applications 2008; 30(3):1084-1127. DOI: 10.1137/06066518x.
5. Comon P. Tensor decomposition: state of the art and applications. IMA Conference on Mathematics in Signal Processing, Warwick, U.K., 2000.
6. de Lathauwer L, de Moor B, Vandewalle J. Computing of canonical decomposition by means of a simultaneous generalized Schur decomposition. SIAM Journal on Matrix Analysis and Applications 2004; 26:295-327.
7. Espig M, Grasedick L, Hackbusch W. Black box low tensor rank approximation using fibre-crosses. Constructive Approximation 2009; 30(3):557-597. DOI: 10.1007/s00365-009-9076-9.
8. Oseledets IV, Savostyanov DV, Tyrtyshnikov EE. Fast simultaneous orthogonal reduction to triangular matrices. SIAM Journal on Matrix Analysis and Applications 2009; 31(2):316-330. DOI: 10.1137/060650738.
9. Tucker LR. Some mathematical notes on three-mode factor analysis. Psychometrika 1966; 31:279-311.
10. Oseledets IV, Savostyanov DV, Tyrtyshnikov EE. Linear algebra for tensor problems. Computing 2009; 85(3):169-188. DOI: 10.1007/s00607-009-0047-6.
11. de Lathauwer L, de Moor B, Vandewalle J. A multilinear singular value decomposition. SIAM Journal on Matrix Analysis and Applications 2000; 21:1253-1278. DOI: 10.1137/s0895479896305696.
12. Kroonenberg P, de Leeuw J. Principal component analysis of three-mode data by means of alternating least squares algorithms. Psychometrika 1980; 45(1):69-97.
13. N) approximation of high-order tensors. SIAM Journal on Matrix Analysis and Applications 2000; 21:1324-1342.
14. Defant A, Floret K. Tensor Norms and Operator Ideals. North-Holland: Amsterdam, 1993.
15. Oseledets IV, Savostianov DV, Tyrtyshnikov EE. Tucker dimensionality reduction of three-dimensional arrays in linear time. SIAM Journal on Matrix Analysis and Applications 2008; 30(3):939-956. DOI: 10.1137/060655894.
16. Savostyanov DV. Fast revealing of mode ranks of tensor in canonical format. Numerical Mathematics: Theory, Methods and Applications 2009; 2(4):439-444. DOI: 10.4208/nmtma.2009.m9006s.
17. Goreinov SA, Tyrtyshnikov EE, Zamarashkin NL. Pseudo-skeleton approximations of matrices. Reports of Russian Academy of Sciences 1995; 342(2):151-152.
18. Goreinov SA, Tyrtyshnikov EE, Zamarashkin NL. A theory of pseudo-skeleton approximations. Linear Algebra and its Applications 1997; 261:1-21.
19. Goreinov SA, Tyrtyshnikov EE. The maximal-volume concept in approximation by low-rank matrices. Contemporary Mathematics 2001; 208:47-51.
20. Bartholdi JJ. A good submatrix is hard to find, School of industrial and systems engineering, Georgia Institute of Technology, 1982.
21. Tyrtyshnikov EE. Incomplete cross approximation in the mosaic-skeleton method. Computing 2000; 64(4):367-380. DOI: 10.1007/s006070070031.
22. Goreinov S, Oseledets I, Savostyanov D, Tyrtyshnikov E, Zamarashkin N. How to find a good submatrix. In Matrix Methods: Theory, Algorithms, Applications, Olshevsky V, Tyrtyshnikov E (eds). World Scientific Publishing: Singapore, 2010; 247-256.
23. Demmel J. Applied Numerical Linear Algebra. Society for Industrial Mathematics: Philadelphia, 1997.
24. Goreinov SA. On cross approximation of multi-index array. Doklady: Mathematics 2008; 420(4):404-406. DOI: 10.1134/s106456240803023x.
25. Chinnamsetty SR, Flad HJ, Khoromskaia V, Khoromskij BN. Tensor decomposition in electronic structure calculations on 3D Cartesian grids. Journal of Computational Physics 2009; 228(16):5749-5762. DOI: 10.1016/j.jcp.2009.04.043.
26. Khoromskij BN, Khoromskaia V. Multigrid accelerated tensor approximation of function related multidimensional arrays. SIAM Journal on Scientific Computing 2009; 31(4):3002-3026. DOI: 10.1137/080730408.
27. Flad HJ, Khoromskij BN, Savostyanov DV, Tyrtyshnikov EE. Verification of the cross 3D algorithm on quantum chemistry data. Russian Journal of Numerical Analysis and Mathematical Modelling 2008; 23(4):329-344. DOI: 10.1515/RJNAMM.2008.020.
28. Oseledets IV, Savostyanov DV, Tyrtyshnikov EE. Cross approximation in tensor electron density computations. Numerical Linear Algebra with Applications 2010; 17(6):935-952.
29. Goreinov SA, Oseledets IV, Savostyanov DV. Wedderburn rank reduction and Krylov subspace method for tensor approximation. Part 1: Tucker case. Preprint 2010-01, INM RAS, Moscow, 2010. Available from: