DMRG approach to fast linear algebra in the TT-format

Computational Methods in Applied Mathematics

Volumn 11, Issue 3, 2011, Pages 382-393

  Oseledets, Ivan ^a  

^a INSTITUTE OF NUMERICAL MATHEMATICS   (Russian Federation)

Author keywords

High dimensional problem; SVD; Tensors; TT format

Indexed keywords

EID: 80053929473     PISSN: 16094840     EISSN: 16099389     Source Type: Journal    
DOI: 10.2478/cmam-2011-0021     Document Type: Article

References (34)

1. H.-D. Meyer, F. Gatti, and G. A. Worth, Multidimensional Quantum Dynamics: MCTDH Theory and Applications, Weinheim: Wiley-VCH, 2009.
2. C. Lubich, From quantum to classical molecular dynamics: reduced models and numerical analysis, Zurich: EMS, 2008.
3. I. Sloan and H.Wozniakowski, When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals, J. of Complexity, 14 (1998), no. 1, pp. 1-33. (Pubitemid 128421301)
4. X. Wang and I. Sloan, Why are high-dimensional finance problems often of low effective dimension?, SIAM J. Sci. Comp., 27 (2006), no. 1, pp. 159-183.
5. T. G. Kolda and B. W. Bader, Tensor Decompositions and Applications, SIAM Review, 51 (2009), no. 3, pp. 455-500.
6. G. Beylkin and M. J. Mohlenkamp, Numerical operator calculus in higher dimensions, Proc. Nat. Acad. Sci. USA, 99 (2002), no. 16, pp. 10246-10251.
7. G. Beylkin and M. J. Mohlenkamp, Algorithms for numerical analysis in high dimensions, SIAM J. Sci. Comput., 26 (2005), no.6, pp. 2133-2159. (Pubitemid 41641365)
8. J. D. Caroll and J. J. Chang, Analysis of individual differences in multidimensional scaling via n-way generalization of Eckart-Young decomposition, Psychometrika, 35 (1970), pp. 283-319.
9. R. A. Harshman, Foundations of the Parafac procedure: models and conditions for an explanatory multimodal factor analysis, UCLA Working Papers in Phonetics, 16 1970, pp. 1-84.
10. M. Espig and M. Hackbusch, A regularized Newton method for the efficient approximation of tensors represented in the canonical format: Preprint 78,-Leipzig: MPI MIS, 2010, www.mis.mpg.de/preprints/2010/preprint2009-78.pdf.
11. I. V. Oseledets and E. E. Tyrtyshnikov, TT-cross algorithm for the approximation of multidimensional arrays, Linear Algebra Appl., 432 (2010), no. 1., pp. 70-88.
12. I. V. Oseledets, Compact matrix form of the d-dimensional tensor decomposition: Preprint 2009-01,-Moscow: INM RAS, 2009, http://pub.inm.ras.ru.
13. I. V. Oseledets, Tensor train decomposition, SIAM J. Sci. Comp, 33 (2011), no. 5, pp. 2295-2317.
14. S. Östlund and S. Rommer, Thermodynamic Limit of Density Matrix Renormalization, Phys. Rev. Lett., 75 (1995), no. 19, pp. 3537-3540, http://link.aps.org/doi/10.1103/PhysRevLett.75.3537.
15. S. R. White, Density-matrix algorithms for quantum renormalization groups, Phys. Rev. B, 48 (1993), no. 14, pp. 10345-10356.
16. B. N. Khoromskij and I. V. Oseledets, Quantics-TT collocation approximation of parameter-dependent and stochastic elliptic PDEs, Comp Meth. Appl. Math., 10 (2010), no 4, pp. 376-394.
17. B. N. Khoromskij and I. V. Oseledets, DMRG + QTT approach to high-dimensional quantum molecular dynamics: Preprint 68,-Leipzig: MPI MIS, 2010, www.mis.mpg.de/preprints/2010/preprint2010-68.pdf.
18. I. V. Oseledets, D. V. Savostyanov, and E. E. Tyrtyshnikov, Linear algebra for tensor problems, Computing, 85 (2009), no. 3, pp. 169-188.
19. D. V. Savostyanov and E. E. Tyrtyshnikov, Approximate multiplication of tensor matrices based on the individual filtering of factors, J. Comp. Math. Math. Phys., 49 (2009), no. 10, pp. 1662-1677.
20. D. V. Savostyanov, Fast revealing of mode ranks of tensor in canonical format, Numer. Math. Theor. Meth. Appl., 2 (2009), no 4., pp. 439-444.
21. S. A. Goreinov, I. V. Oseledets, and D. V. Savostyanov, Wedderburn rank reduction and Krylov subspace method for tensor approximation. Part 1: Tucker case: Preprint 2010-01,-Moscow: INM RAS, 2010-arXiv:1004.1986, http://pub.inm.ras.ru.
22. D. V. Savostyanov, E. E. Tyrtyshnikov, and N. L. Zamarashkin, Fast truncation of mode ranks for bilinear tensor operations, Numer. Lin. Alg. Appl., 2011.
23. V. Khoromskaia, Computation of the Hartree-Fock exchange by tensor-structured methods, Comp. Methd. Appl. Math., 10 (2008), no. 2.
24. B. N. Khoromskij and V. Khoromskaia, Multigrid accelerated tensor approximation of function related multidimensional arrays, SIAM J. Sci. Comp., 31 2009, no. 4., pp. 3002-3026.
25. S. R. Chinnamsetty, H. J. Flad, V. Khoromskaia, and B. N. Khoromskij, Tensor decomposition in electronic structure calculations on 3D Cartesian grids, J. Comp. Phys., 228 (2009), no. 16, pp. 5749-5762.
26. V. Khoromskaia, Numerical Solution of the Hartree-Fock Equation by Multilevel Tensor-structured methods: Ph.D. thesis / TU Berlin,-2010. http://opus.kobv.de/tuberlin/volltexte/2011/2948/.
27. B. N. Khoromskij, V. Khoromskaia, and H.-J. Flad, Numerical solution of the Hartree-Fock equation in multilevel tensor-structured format, SIAM J. Sci. Comp., 33 (2011), no. 1, pp. 45-65.
28. T. Rohwedder, S. Holtz, and R. Schneider R, The alternation least squares scheme for tensor optimisation in the TT-format: Preprint DFG- Schwerpunktprogramm 1234 71: 2010.
29. S. V. Dolgov and I. V. Oseledets, Solution of linear systems and matrix inversion in the TTformat: Preprint 19 (Submitted to SIAM J. of Sci. Comp.),-Leipzig: MIS MPI, 2011, http://www.mis.mpg.de/preprints/2011/ preprint2011-19.pdf.
30. B. N. Khoromskij, O(d logN)-Quantics approximation of N-d tensors in high-dimensional numerical modeling, Constr. Appr., 2011.
31. B. N. Khoromskij and I. V. Oseledets, QTT-approximation of elliptic solution operators in high dimensions, Russian J. Numer. Anal. Math. Modelling, (2011), To appear.
32. I. V. Oseledets, Approximation of 2d × 2d matrices using tensor decomposition, SIAM J. Matrix Anal. Appl., 31 (2010), no. 4, pp. 2130-2145.
33. V. Kazeev and B. N. Khoromskij, Explicit low-rank QTT representation of Laplace operator and its inverse: Preprint 75,-Leipzig: MPI MIS, 2010, www.mis.mpg.de/preprints/2010/preprint2010-75.pdf.
34. V. Kazeev, B. N. Khoromskij, and E. E. Tyrtyshnikov, Multilevel Toeplitz matrices generated by QTT tensor-structured vectors and convolution with logarithmic complexity: Preprint 36,-Leipzig: MPI MIS, 2011 http://www.mis.mpg. de/publications/preprints/2011/prepr2011-36.html.