TT-cross approximation for multidimensional arrays

Linear Algebra and Its Applications

Volumn 432, Issue 1, 2010, Pages 70-88

  Oseledets, Ivan ^a   Tyrtyshnikov, Eugene ^a  

^a INSTITUTE OF NUMERICAL MATHEMATICS   (Russian Federation)

Author keywords

Cross approximation; Curse of dimensionality; Interpolation; Low rank matrices; Multi way arrays; Multidimensional integration; Singular value decomposition; Tensor decompositions; Tensor trains; TT decomposition

Indexed keywords

CROSS APPROXIMATION; CURSE OF DIMENSIONALITY; LOW-RANK MATRICES; MULTI-WAY ARRAYS; MULTIDIMENSIONAL INTEGRATION; TENSOR DECOMPOSITIONS; TT DECOMPOSITION; TENSOR DECOMPOSITION; TENSOR TRAINS;

DECOMPOSITION; INTERPOLATION; LOCOMOTIVES; RAILROAD CARS; SINGULAR VALUE DECOMPOSITION; MATRIX ALGEBRA;

TENSORS;

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

References (40)

1. Badeau R., and Boyer R. Fast multilinear singular value decomposition for structured tensors. SIAM J. Matrix Anal. Appl. 30 3 (2008) 1008-1021
2. Bader B.W., and Kolda T.G. Efficient MATLAB computations with sparse and factored tensors. SIAM J. Sci. Comput. 30 1 (2007) 205-231
3. Bader B.W., and Kolda T.G. Tensor decompositions and applications. SIAM Rev. 51 3 (2009)
4. Bebendorf M. Approximation of boundary element matrices. Numer. Math. 86 4 (2000) 565-589
5. Beylkin G., and Mohlenkamp M.J. Numerical operator calculus in higher dimensions. Proc. Nat. Acad. Sci. USA 99 16 (2002) 10246-10251
6. Beylkin G., and Mohlenkamp M.J. Algorithms for numerical analysis in high dimensions. SIAM J. Sci. Comput. 26 6 (2005) 2133-2159
7. Braess D., and Hackbusch W. Approximation of 1 / x by exponential sums in [1, ∞). IMA J. Numer. Anal. 25 4 (2005) 685-697
8. D. Braess, W. Hackbusch, On the efficient computation of high-dimensional integrals and the approximation by exponential sums, Preprint 3, MPI MIS, Leipzig, 2009.
9. Carroll J.D., and J Chang J. Analysis of individual differences in multidimensional scaling via n-way generalization of Eckart-Young decomposition. Psychometrika 35 (1970) 283-319
10. Chinnamsetty S.R., Espig M., Hackbusch W., Khoromskij B.N., and Flad H.J. Optimal Kronecker tensor-product approximation in quantum chemistry. J. Chem. Phys. 127 (2007) 84-110
11. de Lathauwer L., de Moor B., and Vandewalle J. A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21 (2000) 1253-1278
12. N) approximation of high-order tensors. SIAM J. Matrix Anal. Appl. 21 (2000) 1324-1342
13. M. Espig, Effiziente Bestapproximation mittels Summen von Elementartensoren in hohen Dimensionen, Ph.D. Thesis, Leipzig, 2007.
14. M. Espig, L. Grasedick, W. Hackbusch, Black box low tensor rank approximation using fibre-crosses, Preprint 60, MPI MIS, Leipzig, 2008.
15. Ford J.M., and Tyrtyshnikov E.E. Combining Kronecker product approximation with discrete wavelet transforms to solve dense function-related systems. SIAM J. Sci. Comput. 25 3 (2003) 961-981
16. Gantmacher F.R. Theory of Matrices (1959), Chelsea, New York
17. Gautschi W. Numerical Analysis: An Introduction (1997), Birkhauser, Boston
18. Gerstner Th., and Griebel M. Numerical integration using sparse grids. Numer. Algor. 18 3-4 (1998) 209-232
19. Golub G.H., and Van Loan C.F. Matrix Computations. third ed. (1996), John Hopkins Univ. Press
20. Goreinov S.A. On cross approximation of multi-index array. Doklady Math. 420 4 (2008) 1-3
21. S.A. Goreinov, I.V. Oseledets, D.V. Savostyanov, E.E. Tyrtyshnikov, N.L. Zamarashkin, How to find a good submatrix, Research Report 08-10, ICM HKBU, Kowloon Tong, Hong Kong, 2008.
22. Goreinov S.A., Tyrtyshikov E.E., and Zamarashkin N.L. Pseudo-skeleton approximations of matrices. Rep. Russian Acad. Sci. 342 2 (1995) 151-152
23. Goreinov S.A., Tyrtyshikov E.E., and Zamarashkin N.L. A theory of pseudo-skeleton approximations. Linear Algebra Appl. 261 (1997) 1-21
24. Goreinov S.A., and Tyrtyshnikov E.E. The maximal-volume concept in approximation by low-rank matrices. Contemporary Math. 208 (2001) 47-51
25. Grasedyck L. Existence and computation of low Kronecker-rank approximations for large systems in tensor product structure. Computing 72 (2004) 247-265
26. Hackbush W., Khoromskij B.N., and Tyrtyshnikov E.E. Hierarchical Kronecker tensor-product approximations. J. Numer. Math. 13 (2005) 119-156
27. Harshman R.A. Foundations of the Parafac procedure: models and conditions for an explanatory multimodal factor analysis. UCLA Working Papers Phonet. 16 (1970) 1-84
28. Khoromskij B.N. On tensor approximation of Green iterations for Kohn-Sham equations. Comput. Visual. Sci. 11 4-6 (2008) 259-271
29. I.V. Oseledets, TT Toolbox 1.0: Fast multidimensional array operations in MATLAB, Preprint 2009-06, INM RAS, August 2009.
30. I.V. Oseledets, Compact matrix form of the d-dimensional tensor decomposition, Preprint 2009-01, INM RAS, March 2009.
31. Oseledets I.V. On a new tensor decomposition. Doklady Math. (2009)
32. Oseledets I.V. On the approximation of matrices with logarithmical number of parameters. Doklady Math. (2009)
33. Oseledets I.V. Tensors inside of matrices give logarithmic complexity. SIAM J. Matrix Anal. Appl. (2009)
34. Oseledets I.V., Savostianov D.V., and Tyrtyshnikov E.E. Tucker dimensionality reduction of three-dimensional arrays in linear time. SIAM J. Matrix Anal. Appl. 30 3 (2008) 939-956
35. Oseledets I.V., and Tyrtyshnikov E.E. Breaking the curse of dimensionality, or how to use SVD in many dimensions. SIAM J. Sci. Comput. (2009)
36. Oseledets I.V., and Tyrtyshnikov E.E. Recursive decomposition of multidimensional tensors. Doklady Math. (2009)
37. Sobol I.M. Quasi-Monte Carlo methods. Prog. Nucl. Energy 24 (1990) 55-61
38. Tucker L.R. Some mathematical notes on three-mode factor analysis. Psychometrika 31 (1966) 279-311
39. Tyrtyshnikov E.E. Incomplete cross approximation in the mosaic-skeleton method. Computing 64 4 (2000) 367-380
40. Tyrtyshnikov E.E. Tensor approximations of matrices generated by asymptotically smooth functions. Sbornik: Math. 194 50-6 (2003) 941-954