A literature survey of low-rank tensor approximation techniques

GAMM Mitteilungen

Volumn 36, Issue 1, 2013, Pages 53-78

  Grasedyck, Lars ^a   Kressner, Daniel ^b   Tobler, Christine ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b EPFL   (Switzerland)

Author keywords

eigenvalue problems; linear systems; low rank; multivariate functions; tensor

Indexed keywords

ALGEBRA; EIGENVALUES AND EIGENFUNCTIONS; LINEAR SYSTEMS; SURVEYS;

CLASSICAL TECHNIQUES; EIGENVALUE PROBLEM; LITERATURE OVERVIEW; LITERATURE SURVEY; LOW RANK; LOW-RANK TENSOR APPROXIMATIONS; MULTI-LINEAR ALGEBRAS; MULTIVARIATE FUNCTION;

TENSORS;

EID: 84892949294     PISSN: 09367195     EISSN: None     Source Type: Journal    
DOI: 10.1002/gamm.201310004     Document Type: Article

References (272)

1. P. A. Absil, R. Mahony, and, R. Sepulchre, Optimization algorithms on matrix manifolds (Princeton University Press, Princeton, NJ, 2008).
2. E. Acar, D. M. Dunlavy, and, T. G. Kolda, A scalable optimization approach for fitting canonical tensor decompositions, J. Chemometrics 25 (2), 67-86 (2011).
3. A. Ammar, F. Chinesta, and, A. Falco, On the convergence of a greedy rank-one update algorithm for a class of linear systems, Arch. Comput. Methods Eng. 17 (4), 473-486 (2010).
4. A. Ammar, B. Mokdad, F. Chinesta, and, R. Keunings, A new family of solvers for some classes of multidimensional partial differential equations encountered in kinetic theory modeling of complex fluids, J. Non-Newton. Fluid Mech. 139 (3), 153-176 (2006).
5. A. Ammar, B. Mokdad, F. Chinesta, and, R. Keunings, A new family of solvers for some classes of multidimensional partial differential equations encountered in kinetic theory modelling of complex fluids: Part II: Transient simulation using space-time separated representations, J. NonNewton. Fluid Mech. 144 (2-3), 98-121 (2007).
6. A. Ammar, M. Normandin, F. Daim, D. González, E. Cueto, and, F. Chinesta, Non incremental strategies based on separated representations: applications in computational rheology, Commun. Math. Sci. 8 (3), 671-695 (2010).
7. C. A. Andersson, and, R. Bro, The N-way toolbox for MATLAB, Chemometrics and Intelligent Laboratory Systems 52 (1), 1 -4 (2000), Available at http://www.models.life.ku.dk/nwaytoolbox.
8. R. Andreev, and, C. Tobler, Multilevel preconditioning and low rank tensor iteration for spacetime simultaneous discretizations of parabolic PDEs, Tech. Rep. 2012-16, Seminar for Applied Mathematics, ETH Zürich, 2012, Available at http://www.sam.math.ethz.ch/reports/2012/16.
9. A. Arnold, and, T. Jahnke, On the approximation of high-dimensional differential equations in the hierarchical Tucker format, Tech. rep., KIT, Karlsruhe, Germany, 2012.
10. A. A. Auer, et al., Automatic code generation for many-body electronic structure methods: the tensor contraction engine, Molecular Physics 104 (2), 211-228 (2006).
11. M. Bachmayr, Adaptive low-rank wavelet methods and applications to two-electron Schrödinger equations, PhD thesis, RWTH Aachen, Germany, 2012.
12. B. W. Bader, and, T. G. Kolda, Algorithm 862: MATLAB tensor classes for fast algorithm prototyping, ACM Trans. Math. Software 32 (4), 635-653 (2006), Available at http://csmr.ca.sandia.gov/tgkolda/TensorToolbox/.
13. B. W. Bader, and, T. G. Kolda, MATLAB Tensor Toolbox Version 2.4, March 2010, Available at http://csmr.ca.sandia.gov/̃tgkolda/TensorToolbox/.
14. J. Ballani, Fast evaluation of near-field boundary integrals using tensor approximations, Dissertation, Universität Leipzig, 2012.
15. J. Ballani, Fast evaluation of singular BEM integrals based on tensor approximations, Numer. Math. 121 (3), 433-460 (2012).
16. J. Ballani, and, L. Grasedyck, A projection method to solve linear systems in tensor format, Numer. Linear Algebra Appl. 20 (1), 27-43 (2013).
17. J. Ballani, L. Grasedyck, and, M. Kluge, Black box approximation of tensors in hierarchical Tucker format, Linear Algebra Appl. 438 (2), 639-657 (2013).
18. B. Bauer, et al., The ALPS project release 2.0: open source software for strongly correlated systems, J. Stat. Mech. 5 (2011), Available at http://alps.comp-phys.org.
19. M. Bebendorf, Approximation of boundary element matrices, Numer. Math. 86 (4), 565-589 (2000).
20. M. Bebendorf, Adaptive cross approximation of multivariate functions, Constr. Approx. 34, 149-179 (2011).
21. M. Bebendorf, and, S. Rjasanow, Adaptive low-rank approximation of collocation matrices, Computing 70 (1), 1-24 (2003).
22. B. Beckermann, D. Kressner, and, C. Tobler, An error analysis of Galerkin projection methods for linear systems with tensor product structure, Tech. rep., MATHICSE, EPF Lausanne, Switzerland, 2012.
23. U. Benedikt, A. A. Auer, M. Espig, and, W. Hackbusch, Tensor decomposition in post-HartreeFock methods. I. two-electron integrals and MP2, J. Chem. Phys 134 (5), 054118-1-054118-12 (2011).
24. P. Benner, and, J. Saak, Numerical solution of large and sparse continuous time algebraic matrix Riccati and Lyapunov equations: A state of the art survey, Tech. rep., 2013.
25. C. Bertoglio, and, B. N. Khoromskij, Low-rank quadrature-based tensor approximation of the Galerkin projected Newton/Yukawa kernels, Computer Physics Communications 183 (4), 904-912 (2012).
26. G. Beylkin, J. Garcke, and, M. J. Mohlenkamp, Multivariate regression and machine learning with sums of separable functions, SIAM J. Sci. Comput. 31 (3), 1840-1857 (2009).
27. G. Beylkin, and, M. J. Mohlenkamp, Numerical operator calculus in higher dimensions, Proc. Natl. Acad. Sci. USA 99 (16), 10246-10251 (2002).
28. G. Beylkin, and, M. J. Mohlenkamp, Algorithms for numerical analysis in high dimensions, SIAM J. Sci. Comput. 26 (6), 2133-2159 (2005).
29. G. Beylkin, and, L. Monzõn, On approximation of functions by exponential sums, Appl. Comput. Harmon. Anal. 19 (1), 17-48 (2005).
30. G. Beylkin, and, L. Monzõn, Approximation by exponential sums revisited, Appl. Comput. Harmon. Anal. 28 (2), 131-149 (2010).
31. D. J. Biagioni, Numerical construction of Green's functions in high dimensional elliptic problems with variable coefficients and analysis of renewable energy data via sparse and separable approximations, PhD thesis, University of Colorado, 2012.
32. T. Blesgen, V. Gavini, and, V. Khoromskaia, Approximation of the electron density of aluminium clusters in tensor-product format, J. Comput. Phys. 231 (6), 2551-2564 (2012).
33. M. Bollhöfer, and, A. K. Eppler, A structure preserving FGMRES method for solving large Lyapunov equations, in: Progress in Industrial Mathematics at ECMI 2010, edited by M. Günther, A. Bartel, M. Brunk, S. Schöps, and M. Striebel (Springer, 2012), pp. 131-136.
34. 2-matrices-an efficient tool for the treatment of dense matrices, Habilitationsschrift, Christian-Albrechts-Universität zu Kiel, 200 6.
35. S. Börm, and, L. Grasedyck, Hybrid cross approximation of integral operators, Numer. Math. 101 (2), 221-249 (2005).
36. N. Boumal, and, P. A. Absil, RTRMC: A Riemannian trust-region method for low-rank matrix completion, in: Proceedings of the Neural Information Processing Systems Conference (NIPS), (2011).
37. D. Braess, and, W. Hackbusch, Approximation of 1/x by exponential sums in [1, â̂?), IMA J. Numer. Anal. 25 (4), 685-697 (2005).
38. D. Braess, and, W. Hackbusch, On the efficient computation of high-dimensional integrals and the approximation by exponential sums, in: Multiscale, Nonlinear and Adaptive Approximation, (Springer, 2009), pp. 39-74.
39. P. Buchholz, Product form approximations for communicating Markov processes, Performance Evaluation 67 (9), 797-815 (2010).
40. E. Cancès, V. Ehrlacher, and, T. Lelièvre, Convergence of a greedy algorithm for high-dimensional convex nonlinear problems, Mathematical Models and Methods in Applied Sciences 21 (12), 2433-2467 (2011).
41. E. Cancès, V. Ehrlacher, and, T. Lelièvre, Greedy algorithms for high-dimensional nonsymmetric linear problems, arxiv:1210.6688, 2012.
42. Y. Chen, D. Han, and, L. Qi, New ALS methods with extrapolating search directions and optimal step size for complex-valued tensor decompositions, Signal Processing, IEEE Transactions on 59 (12), 5888-5898 (2011).
43. F. Chinesta, A. Ammar, F. Lemarchand, P. Beauchene, and, F. Boust, Alleviating mesh constraints: Model reduction, parallel time integration and high resolution homogenization, Comput. Meth. Appl. Mech. Engrg. 197 (5), 400-413 (2008).
44. F. Chinesta, P. Ladeveze, and, E. Cueto, A short review on model order reduction based on proper generalized decomposition, Arch. Comput. Methods Eng. 18, 395-404 (2011).
45. S. R. Chinnamsetty, M. Espig, H. J. Flad, and, W. Hackbusch, Canonical tensor products as a generalization of Gaussian-type orbitals, Z. Phys. Chem. 224 (3-4), 681-694 (2010).
46. S. R. Chinnamsetty, M. Espig, B. N. Khoromskij, W. Hackbusch, and, H. J. Flad, Tensor product approximation with optimal rank in quantum chemistry, J. Chem. Phys 127 (8), 084110 (2007).
47. S. R. Chinnamsetty, W. Hackbusch, and, H. J. Flad, The tensor product approximation to singleelectron systems, Tech. Rep. 23, MPI MIS Leipzig, 2009.
48. S. R. Chinnamsetty, W. Hackbusch, and, H. J. Flad, Efficient multi-scale computation of products of orbitals in electronic structure calculations, Comput. Vis. Sci. 13 (8), 397-408 (2010).
49. S. R. Chinnamsetty, H. Luo, W. Hackbusch, H. J. Flad, and, A. Uschmajew, Bridging the gap between quantum Monte Carlo and F12-methods, J. Chem. Phys 401, 36-44 (2012).
50. A. Cohen, R. DeVore, and, C. Schwab, Convergence rates of best N-term Galerkin approximations for a class of elliptic sPDEs, Found. Comput. Math. 10 (6), 615-646 (2010).
51. A. Cohen, R. DeVore, and, C. Schwab, Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's, Anal. Appl. (Singap.) 9 (1), 11-47 (2011).
52. P. Comon, X. Luciani, and, A. L.F. de Almeida, Tensor decompositions, alternating least squares and other tales, J. Chemometrics 23 (7-8), 393-405 (2009).
53. O. Curtef, G. Dirr, and, U. Helmke, Conjugate gradient algorithms for best rank-1 approximation of tensors, PAMM 7 (1), 1062201-1062202 (2007).
54. O. Curtef, G. Dirr, and, U. Helmke, Riemannian optimization on tensor products of Grassmann manifolds: Applications to generalized Rayleigh-quotients, SIAM J. Matrix Anal. Appl. 33 (1), 210-234 (2012).
55. L. De Lathauwer, Signal Processing Based on Multilinear Algebra, PhD thesis, Katholike Universiteit Leuven, 1997.
56. L. De Lathauwer, B. De Moor, and, J. Vandewalle, A multilinear singular value decomposition, SIAM J. Matrix Anal. Appl. 21 (4), 1253-1278 (2000).
57. 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. 20 (3), 1084-1127 (2008).
58. H. de Sterck, A nonlinear GMRES optimization algorithm for canonical tensor decomposition, SIAM J. Sci. Comput. 34 (3), A1351-A1379 (2012).
59. H. De Sterck, and, K. Miller, An adaptive algebraic multigrid algorithm for low-rank canonical tensor decomposition, Tech. Rep. arXiv:1111.6091, Nov 2011.
60. S. V. Dolgov, TT-GMRES: on solution to a linear system in the structured tensor format, arXiv preprint 1206.5512 (To appear in: Rus. J. of Num. An. and Math. Model.), 2012.
61. S. V. Dolgov, V. A. Kazeev, and, B. N. Khoromskij, The tensor-structured solution of onedimensional elliptic differential equations with high-dimensional parameters, Tech. Rep. 51, MPI MIS Leipzig, 2012.
62. S. V. Dolgov, and, B. N. Khoromskij, Tensor-product approach to global time-space-parametric discretization of chemical master equation, Tech. Rep. 68, MPI MIS Leipzig, 2012.
63. S. V. Dolgov, and, B. N. Khoromskij, Two-level Tucker-TT-QTT format for optimized tensor calculus, Tech. Rep. 19, MPI MIS Leipzig, 2012.
64. S. V. Dolgov, B. N. Khoromskij, and, D. V. Savostyanov, Superfast Fourier transform using QTT approximation, J. Fourier Anal. Appl. 18 (5), 915-953 (2012).
65. S. V. Dolgov, B. N. Khoromskij, and, I. V. Oseledets, Fast solution of parabolic problems in the tensor train/quantized tensor train format with initial application to the Fokker-Planck equation, SIAM J. Sci. Comput. 34 (6), A3016-A3038 (2012).
66. S. V. Dolgov, and, I. V. Oseledets, Solution of linear systems and matrix inversion in the TTformat, SIAM J. Sci. Comput. 34 (5), A2718-A2739 (2012).
67. S. V. Dolgov, and, D. V. Savostyanov, Alternating minimal energy methods for linear systems in higher dimensions. Part I: SPD systems, arXiv preprint 1301.6068, 2013.
68. S. V. Dolgov, and, D. V. Savostyanov, Alternating minimal energy methods for linear systems in higher dimensions. Part II: Faster algorithm and application to nonsymmetric systems, arXiv preprint 1304.1222, 2013.
69. A. Doostan, and, G. Iaccarino, A least-squares approximation of partial differential equations with high-dimensional random inputs, J. Comput. Phys. 228 (12), 4332-4345 (2009).
70. A. Doostan, A. Validi, and, G. Iaccarino, Non-intrusive low-rank separated approximation of high-dimensional stochastic models, arXiv preprint 1210.1532, 2012.
71. P. Drineas, and, M. W. Mahoney, A randomized algorithm for a tensor-based generalization of the singular value decomposition, Linear Algebra Appl. 420 (2-3), 553-571 (2007).
72. 3) approximation of a tensor, SIAM J. Matrix Anal. Appl. 31 (2), 248-271 (2009).
73. M. Espig, Effiziente Bestapproximation mittels Summen von Elementartensoren in hohen Dimensionen, PhD thesis, Fakultät für Mathematik und Informatik, Universität Leipzig, 2008.
74. M. Espig, L. Grasedyck, and, W. Hackbusch, Black box low tensor-rank approximation using fiber-crosses, Constr. Appr. 30 (3), 557-597 (2009).
75. M. Espig, and, W. Hackbusch, A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format, Numer. Math. 122 (3), 489-525 (2012).
76. M. Espig, W. Hackbusch, S. Handschuh, and, R. Schneider, Optimization problems in contracted tensor networks, Comput. Vis. Sci. 14, 271-285 (2011).
77. M. Espig, W. Hackbusch, A. Litvinenko, H. Matthies, and, E. Zander, Efficient analysis of high dimensional data in tensor formats, in: Sparse Grids and Applications, edited by J. Garcke and M. Griebel, Lecture Notes in Computational Science and Engineering Vol. 88 (Springer, 2013), pp. 31-56.
78. M. Espig, W. Hackbusch, A. Litvinenko, H. G. Matthies, and, P. Wähnert, Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats, Comput. Math. Appl. (2013), To appear. Available at http://dx.doi.org/10.1016/j.camwa.2012.10.008.
79. M. Espig, W. Hackbusch, T. Rohwedder, and, R. Schneider, Variational calculus with sums of elementary tensors of fixed rank, Numer. Math. 122 (52), 469-488 (2012).
80. M. Espig, M. Schuster, A. Killaitis, N. Waldren, P. Wähnert, S. Handschuh, and, H. Auer, TensorCalculus library, 2012, Available at http://gitorious.org/tensorcalculus.
81. L. Exl, C. Abert, N. J. Mauser, T. Schrefl, H.P. Stimming, and, D. Suess, FFT-based Kronecker product approximation to micromagnetic long-range interactions, Tech. Rep. arXiv:1212.3509, 2012.
82. L. Exl, W. Auzinger, S. Bance, M. Gusenbauer, F. Reichel, and, T. Schrefl, Fast stray field computation on tensor grids, J. Comput. Phys. 231 (7), 2840-2850 (2012).
83. A. Falcõ, and, W. Hackbusch, On minimal subspaces in tensor representations, Found. Comput. Math. 12, 765-803 (2012).
84. A. Falcõ, W. Hackbusch, and, A. Nouy, Geometric structures in tensor representations, Tech. Rep. 9, MPI MIS Leipzig, 2013.
85. A. Falcõ, and, A. Nouy, A proper generalized decomposition for the solution of elliptic problems in abstract form by using a functional Eckart-Young approach, J. Math. Anal. Appl. 376 (2), 469-480 (2011).
86. A. Falcõ, and, A. Nouy, Proper generalized decomposition for nonlinear convex problems in tensor Banach spaces, Numer. Math. 121, 503-530 (2012).
87. L. E. Figueroa, and, E. Süli, Greedy approximation of high-dimensional Ornstein-Uhlenbeck operators, Found. Comput. Math. 12 (5), 573-623 (2012).
88. H. J. Flad, W. Hackbusch, B. N. Khoromskij, and, R. Schneider, Concepts of data-sparse tensorproduct approximation in many-particle modelling, in: Matrix methods: theory, algorithms and applications, (World Sci. Publ., Hackensack, NJ, 2010), pp. 313-347.
89. H. J. Flad, B. N. Khoromskij, D. V. Savostyanov, and, E. E. Tyrtyshnikov, Verification of the cross 3D algorithm on quantum chemistry data, Rus. J. Numer. Anal. Math. Model. 23 (4), 329-344 (2008).
90. S. Friedland, V. Mehrmann, A. Miedlar, and, M. Nkengla, Fast low rank approximations of matrices and tensors, Electron. J. Linear Algebra 22, 1031-1048 (2011).
91. S. Friedland, V. Mehrmann, R. Pajarola, and, S. K. Suter, On best rank one approximation of tensors, arXiv preprint 1112.5914, 2012.
92. F. Fröwis, V. Nebendahl, and, W. Dür, Tensor operators: Constructions and applications for long-range interaction systems, Phys. Rev. A 81 (Jun), 062337 (2010).
93. S. Gandy, B. Recht, and, I. Yamada, Tensor completion and low-n-rank tensor recovery via convex optimization, Inverse Problems 27 (2), 025010 (2011).
94. I. P. Gavrilyuk, W. Hackbusch, and, B. N. Khoromskij, Hierarchical tensor-product approximation to the inverse and related operators for high-dimensional elliptic problems, Computing 74, 131-157 (2005).
95. I.P. Gavrilyuk, and, B.N. Khoromskij, Quantized-TT-Cayley transform to compute dynamics and spectrum of high-dimensional Hamiltonians, Comput. Meth. Appl. Math. 1 (3), 273-290 (2011).
96. L. Giraldi, Contributions aux Méthodes de Calcul Basées sur l'Approximation de Tenseurs et Applications en Mécanique Numérique, PhD thesis, École Centrale de Nantes, 2012, Prelimary version.
97. L. Giraldi, A. Nouy, G. Legrain, and, P. Cartraud, Tensor-based methods for numerical homogenization from high-resolution images, Comput. Meth. Appl. Mech. Engrg. 254, 154-169 (2013).
98. G. H. Golub, and, C. F. Van Loan, Matrix Computations, third edition (Johns Hopkins University Press, Baltimore, MD, 1996).
99. S. A. Goreinov, I. V. Oseledets, and, D. V. Savostyanov, Wedderburn rank reduction and Krylov subspace method for tensor approximation. Part 1: Tucker case, SIAM J. Sci. Comput. 34 (1), A1-A27 (2012).
100. S. A. Goreinov, I. V. Oseledets, D. V. Savostyanov, E. E. Tyrtyshnikov, and, N. L. Zamarashkin, How to find a good submatrix, in: Matrix Methods: Theory, Algorithms, Applications, (World Scientific, Hackensack, NY, 2010), pp. 247-256.
101. S. A. Goreinov, E. E. Tyrtyshnikov, and, N. L. Zamarashkin, A theory of pseudoskeleton approximations, Linear Algebra Appl. 261, 1-21 (1997).
102. L. Grasedyck, Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure, Computing 72 (3-4), 247-265 (2004).
103. L. Grasedyck, Hierarchical low rank approximation of tensors and multivariate functions, 2010, Lecture notes of Zurich summer school on Sparse Tensor Discretizations of High-Dimensional Problems
104. L. Grasedyck, Hierarchical singular value decomposition of tensors, SIAM J. Matrix Anal. Appl. 31 (4), 2029-2054 (2010).
105. L. Grasedyck, Polynomial approximation in hierarchical Tucker format by vector-tensorization, Tech. rep., RWTH Aachen, Germany, 2010.
106. L. Grasedyck, and, W. Hackbusch, An introduction to hierarchical (H-) rank and TT-rank of tensors with examples, Comput. Meth. Appl. Math. 11 (3), 291-304 (2011).
107. M. Griebel, and, H. Harbrecht, Approximation of two-variate functions: singular value decomposition versus regular sparse grids, Preprint 1109, INS, Universität Bonn, 2011.
108. W. Hackbusch, Tensorisation of vectors and their efficient convolution, Numer. Math. 119, 465-488 (2011).
109. W. Hackbusch, Tensor Spaces and Numerical Tensor Calculus (Springer, 2012).
110. â̂? estimation of tensor truncations, Numer. Math. (2013), To appear. Available at http://www.mis.mpg.de/ publications/preprints/2012/prepr2012-17.html.
111. W. Hackbusch, and, B. N. Khoromskij, Low-rank Kronecker-product approximation to multidimensional nonlocal operators. I. Separable approximation of multi-variate functions, Computing 76 (3-4), 177-202 (2006).
112. W. Hackbusch, and, B. N. Khoromskij, Low-rank Kronecker-product approximation to multidimensional nonlocal operators. II. HKT representation of certain operators, Computing 76 (3-4), 203-225 (2006).
113. W. Hackbusch, and, B. N. Khoromskij, Tensor-product approximation to operators and functions in high dimensions, J. Complexity 23 (4-6), 697-714 (2007).
114. W. Hackbusch, and, B. N. Khoromskij, Tensor-product approximation to multidimensional integral operators and Green's functions, SIAM J. Matrix Anal. Appl. 30 (3), 1233-1253 (2008).
115. W. Hackbusch, B. N. Khoromskij, S. A. Sauter, and, E. E. Tyrtyshnikov, Use of tensor formats in elliptic eigenvalue problems, Numer. Linear Algebra Appl. 19 (1), 133-151 (2012).
116. W. Hackbusch, B. N. Khoromskij, and, E. E. Tyrtyshnikov, Hierarchical Kronecker tensorproduct approximations, J. Numer. Math. 13 (2), 119-156 (2005).
117. W. Hackbusch, B. N. Khoromskij, and, E. E. Tyrtyshnikov, Approximate iterations for structured matrices, Numer. Math. 109 (3), 365-383 (2008).
118. W. Hackbusch, and, S. Kühn, A new scheme for the tensor representation, J. Fourier Anal. Appl. 15 (5), 706-722 (2009).
119. J. Haegeman, I. Cirac, T. Osborne, I. Piźorn, H. Verschelde, and, F. Verstraete, Time-dependent variational principle for quantum lattices, Phys. Rev. Lett. 107 (7), 070601 (2011).
120. J. Haegeman, M. Mariën, T. J. Osborne, and, F. Verstraete, Geometry of matrix product states: metric, parallel transport and curvature, arXiv preprint 1210.7710, 2012.
121. N. Halko, P. G. Martinsson, and, J. A. Tropp, Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions, SIAM Rev. 53 (2), 217-288 (2011).
122. S. Handschuh, Changing the topology of tensor networks, Tech. Rep. 15, MPI MIS Leipzig, 2012.
123. M. Hegland, and, J. Garcke, On the numerical solution of the chemical master equation with sums of rank one tensors, in: Proceedings of the 15th Biennial Computational Techniques and Applications Conference, CTAC-2010, edited by W. McLean and A. J. Roberts, ANZIAM J. Vol. 52 (August 2011), pp. C628-C643.
124. S. Holtz, T. Rohwedder, and, R. Schneider, On manifolds of tensors of fixed TT-rank, Numer. Math. 120 (4), 701-731 (2010).
125. S. Holtz, T. Rohwedder, and, R. Schneider, The alternating linear scheme for tensor optimization in the tensor train format, SIAM J. Sci. Comput. 34 (2), A683-A713 (2012).
126. R. A. Horn, and, C. R. Johnson, Matrix analysis, second edition (Cambridge University Press, 2013).
127. T. Huckle, and, K. Waldherr, Subspace iteration methods in terms of matrix product states, PAMM 12 (1), 641-642 (2012).
128. T. Huckle, K. Waldherr, and, T. Schulte-Herbrüggen, Computations in quantum tensor networks, Linear Algebra Appl. 438 (2), 750-781 (2013).
129. T. Huckle, K. Waldherr, and, T. Schulte-Herbrüggen, Exploiting matrix symmetries and physical symmetries in matrix product states and tensor trains, Linear and Multilinear Algebra 61 (1), 91-122 (2013).
130. I. Ibragimov, and, S. Rjasanow, Three way decomposition for the Boltzmann equation, J. Comput. Math. 27 (2-3), 184-195 (2009).
131. M. Ishteva, P. A. Absil, and, P. Van Dooren, Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors, Tech. rep. UCL-INMA-2011.011, UC Louvain, Belgium, 2011.
132. M. Ishteva, P. A. Absil, S. Van Huffel, and, L. De Lathauwer, Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme, SIAM J. Matrix Anal. Appl. 32 (1), 115-135 (2011).
133. M. Ishteva, L. De Lathauwer, P. A. Absil, and, S. Van Huffel, Differential-geometric Newton method for the best rank-(R1, R2, R3) approximation of tensors, Numer. Algorithms 51 (2), 179-194 (2009).
134. T. Jahnke, and, W. Huisinga, A dynamical low-rank approach to the chemical master equation, Bulletin of Mathematical Biology 70, 2283-2302 (2008).
135. E. Jondeau, E. Jurczenko, and, M. Rockinger, Moment component analysis: An illustration with international stock markets, Swiss Finance Institute Research Paper No. 10-43, 2010, Available at http://dx.doi.org/10.2139/ssrn. 1694643.
136. V. Kazeev, M. Khammash, M. Nip, and, C. Schwab, Direct solution of the chemical master equation using quantized tensor trains, Tech. Rep. 2013-04, Seminar for Applied Mathematics, ETH Zürich, 2013.
137. V. Kazeev, B. N. Khoromskij, and, E. E. Tyrtyshnikov, Multilevel Toeplitz matrices generated by QTT tensor-structured vectors and convolution with logarithmic complexity, Tech. Rep. 36, MPI MIS Leipzig, 2011.
138. V. Kazeev, O. Reichmann, and, C. Schwab, hp-DG-QTT solution of high-dimensional degenerate diffusion equations, Tech. Rep. 2012-11, Seminar for Applied Mathematics, ETH Zurich, 2012.
139. V. Kazeev, O. Reichmann, and, C. Schwab, Low-rank tensor structure of linear diffusion operators in the TT and QTT formats, Tech. Rep. 2012-13, Seminar for Applied Mathematics, ETH Zurich, 2012.
140. V. A. Kazeev, and, B. N. Khoromskij, Low-rank explicit QTT representation of Laplace operator and its inverse, SIAM J. Matrix Anal. Appl. 33 (3), 742-758 (2012).
141. V. A. Kazeev, and, E. E. Tyrtyshnikov, Structure of the Hessian matrix and an economical implementation of Newton's method in the problem of canonical approximation of tensors, Comput. Math. Math. Phys. 50 (6), 927-945 (2010).
142. V. Khoromskaia, Computation of the Hartree-Fock exchange in the tensor-structured format., Comput. Meth. Appl. Math. 10 (2), 204-218 (2010).
143. V. Khoromskaia, Numerical solution of the Hartree-Fock equation by multilevel tensorstructured methods, PhD thesis, Technische Universität Berlin, 2010.
144. V. Khoromskaia, D. Andrae, and, B. N. Khoromskij, Fast and accurate 3D tensor calculation of the Fock operator in a general basis, Comput. Phys. Commun. 183 (11), 2392-2404 (2012).
145. V. Khoromskaia, B. N. Khoromskij, and, R. Schneider, QTT representation of the Hartree and exchange operators in electronic structure calculations, Comput. Meth. Appl. Math. 11 (3), 327-341 (2011).
146. V. Khoromskaia, and, B. Khoromskij, Møller-Plesset (MP2) energy correction using tensor factorizations of the grid-based two-electron integrals, Tech. Rep. 26, MPI MIS Leipzig, 2013.
147. V. Khoromskaia, B. Khoromskij, and, R. Schneider, Tensor-structured factorized calculation of two-electron integrals in a general basis, Tech. Rep. 29, MPI MIS Leipzig, 2012.
148. B. N. Khoromskij, An introduction to structured tensor-product approximation of discrete nonlocal operators, 2005, Lecture notes No. 27, Leipzig.
149. d, Comput. Meth. Appl. Math. 6 (2), 194-220 (2006).
150. B. N. Khoromskij, Structured data-sparse approximation to high order tensors arising from the deterministic Boltzmann equation, Math. Comp. 76 (259), 1291-1315 (2007).
151. B. N. Khoromskij, On tensor approximation of Green iterations for Kohn-Sham equations, Comput. Vis. Sci. 11, 259-271 (2008).
152. d, Constr. Approx. 30, 599-620 (2009).
153. B. N. Khoromskij, Fast and accurate tensor approximation of a multivariate convolution with linear scaling in dimension, J. Comput. Appl. Math. 234 (11), 3122-3139 (2010).
154. B. N. Khoromskij, Introduction to tensor numerical methods in scientific computing, 2011, Lecture notes, available at http://www.math.uzh.ch/fileadmin/ math/preprints/06-11.pdf.
155. B. N. Khoromskij, O (d log N)-quantics approximation of N-d tensors in high-dimensional numerical modeling, Constr. Approx. 34, 257-280 (2011).
156. B. N. Khoromskij, Tensors-structured numerical methods in scientific computing: Survey on recent advances, Chemometrics and Intelligent Laboratory Systems 110 (1), 1-19 (2012).
157. B. N. Khoromskij, and, V. Khoromskaia, Low rank Tucker-type tensor approximation to classical potentials, Central European Journal of Mathematics 5, 523-550 (2007).
158. B. N. Khoromskij, and, V. Khoromskaia, Multigrid accelerated tensor approximation of function related multidimensional arrays, SIAM J. Sci. Comput. 31 (4), 3002-3026 (2009).
159. B. N. Khoromskij, V. Khoromskaia, S. R. Chinnamsetty, and, H. J. Flad, Tensor decomposition in electronic structure calculations on 3D cartesian grids, J. Comput. Phys. 228 (16), 5749-5762 (2009).
160. B. N. Khoromskij, V. Khoromskaia, and, H. J. Flad, Numerical solution of the Hartree-Fock equation in multilevel tensor-structured format, SIAM J. Sci. Comput. 33 (1), 45-65 (2011).
161. B. N. Khoromskij, and, I. V. Oseledets, DMRG+QTT approach to computation of the ground state for the molecular Schrödinger operator, Tech. Rep. 69, MPI MIS Leipzig, 2010.
162. B. N. Khoromskij, and, I. V. Oseledets, Quantics-TT collocation approximation of parameterdependent and stochastic elliptic PDEs, Comput. Meth. Appl. Math. 10 (4), 376-394 (2010).
163. B. N. Khoromskij, and, I. V. Oseledets, QTT approximation of elliptic solution operators in higher dimensions, Rus. J. Numer. Anal. Math. Model. 26 (3), 303-322 (2011).
164. B. N. Khoromskij, I. V. Oseledets, and, R. Schneider, Efficient time-stepping scheme for dynamics on TT-manifolds, Tech. Rep. 24, MPI MIS Leipzig, 2012.
165. B. N. Khoromskij, S. A. Sauter, and, A. Veit, Fast quadrature techniques for retarded potentials based on TT/QTT tensor approximation, Comput. Meth. Appl. Math. 11 (3), 342-362 (2011).
166. B. N. Khoromskij, and, C. Schwab, Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs, SIAM J. Sci. Comput. 33 (1), 364-385 (2011).
167. O. Koch, and, C. Lubich, Dynamical low-rank approximation, SIAM J. Matrix Anal. Appl. 29 (2), 434-454 (2007).
168. O. Koch, and, C. Lubich, Dynamical tensor approximation, SIAM J. Matrix Anal. Appl. 31 (5), 2360-2375 (2010).
169. T. G. Kolda, and, B. W. Bader, Tensor decompositions and applications, SIAM Review 51 (3), 455-500 (2009).
170. D. Kressner, M. Plešsinger, and, C. Tobler, A preconditioned low-rank CG method for parameterdependent Lyapunov matrix equations, Tech. rep., MATHICSE, EPF Lausanne, Switzerland, 2012, Available at http://anchp.epfl.ch.
171. D. Kressner, and, C. Tobler, Krylov subspace methods for linear systems with tensor product structure, SIAM J. Matrix Anal. Appl. 31 (4), 1688-1714 (2010).
172. D. Kressner, and, C. Tobler, Low-rank tensor Krylov subspace methods for parametrized linear systems, SIAM J. Matrix Anal. Appl. 32 (4), 1288-1316 (2011).
173. D. Kressner, and, C. Tobler, Preconditioned low-rank methods for high-dimensional elliptic PDE eigenvalue problems, Comput. Meth. Appl. Math. 11 (3), 363-381 (2011).
174. D. Kressner, and, C. Tobler, htucker-a MATLAB toolbox for tensors in hierarchical Tucker format, Tech. rep., MATHICSE, EPF Lausanne, Switzerland, 2012, Available at http://anchp.epfl.ch/htucker.
175. P. M. Kroonenberg, Applied Multiway Data Analysis (Wiley, 2008).
176. S. Kühn, Hierarchische Tensordarstellung, Dissertation, Universität Leipzig, 2012.
177. H. Lamari, A. Ammar, P. Cartraud, G. Legrain, F. Chinesta, and, F. Jacquemin, Routes for efficient computational homogenization of nonlinear materials using the proper generalized decompositions, Arch. Comput. Methods Eng. 17, 373-391 (2010).
178. J. M. Landsberg, Tensors: geometry and applications, Graduate Studies in Mathematics, Vol. 128 (American Mathematical Society, Providence, RI, 2012).
179. J. M. Landsberg, Y. Qi, and, K. Ye, On the geometry of tensor network states, Quantum Inf. Comput. 12 (3-4), 346-354 (2012).
180. C. Le Bris, T. Lelièvre, and, Y. Maday, Results and questions on a nonlinear approximation approach for solving high-dimensional partial differential equations, Constr. Approx. 30 (3), 621-651 (2009).
181. O.S. Lebedeva, Block tensor conjugate gradient-type method for Rayleigh quotient minimization in two-dimensional case, Comput. Math. Math. Phys. 50 (5), 749-765 (2010).
182. O.S. Lebedeva, Tensor conjugate-gradient-type method for Rayleigh quotient minimization in block QTT-format, Russian J. Numer. Anal. Math. Modelling 26 (5), 465-489 (2011).
183. J. Liu, P. Musialski, P. Wonka, and, J. Ye, Tensor completion for estimating missing values in visual data, in: Computer Vision, 2009 IEEE 12th International Conference on, (29 2009-oct. 2 2009), pp. 2114-2121.
184. C. Lubich, On variational approximations in quantum molecular dynamics, Math. Comp. 74 (250), 765-779 (2005).
185. C. Lubich, From quantum to classical molecular dynamics: reduced models and numerical analysis, Zurich Lectures in Advanced Mathematics (European Mathematical Society (EMS), Zürich, 2008).
186. C. Lubich, and, I. V. Oseledets, A projector-splitting integrator for dynamical low-rank approximation, arXiv preprint 1301.5512, 2013.
187. C. Lubich, T. Rohwedder, R. Schneider, and, B. Vandereycken, Dynamical approximation of hierarchical Tucker and tensor-train tensors, Tech. rep., July 2012.
188. T. Mach, Computing inner eigenvalues of matrices in tensor train matrix format, in: Proceedings of ENUMATH 2011, edited by A. Cangiani, R. L. Davidchack, E. Georgoulis, A. N. Gorban, J. Levesley, and M. V. Tretyakov (Springer, 2013), pp. 781-788.
189. T. Mach, and, J. Saak, Towards an ADI iteration for tensor structured equations, Tech. rep., MPI Magdeburg, 2012, Available at www.mpi-magdeburg.mpg. de/preprints/2011/ 12/.
190. H. G. Matthies, and, E. Zander, Solving stochastic systems with low-rank tensor compression, Linear Algebra Appl. 436 (10), 3819-3838 (2012).
191. P. Meszmer, and, J. Ballani, Tensor structured evaluation of singular volume integrals, Tech. Rep. 70, MPI MIS Leipzig, 2012.
192. G. Meyer, S. Bonnabel, and, R. Sepulchre, Regression on fixed-rank positive semidefinite matrices: a Riemannian approach, J. Mach. Learn. Res. 12, 593-625 (2011).
193. H. D. Meyer, F. Gatti, and, G. A. Worth, (eds.), Multidimensional Quantum Dynamics: MCTDH Theory and Applications (Wiley-VCH Verlag GmbH &; Co. KGaA, 2009).
194. H. D. Meyer, U. Manthe, and, L. Cederbaum, The multi-configurational time-dependent hartree approach, Chemical Physics Letters 165 (1), 73-78 (1990).
195. M. J. Mohlenkamp, Musings on multilinear fitting, Linear Algebra Appl. 438 (2), 834-852 (2013).
196. M. J. Mohlenkamp, and, L. Monzõn, Trigonometric identities and sums of separable functions, Math. Intelligencer 27 (2), 65-69 (2005).
197. B. Mokdad, A. Ammar, M. Normandin, F. Chinesta, and, J. R. Clermont, A fully deterministic micro-macro simulation of complex flows involving reversible network fluid models, Math. Comput. Simulation 80 (9), 1936-1961 (2010).
198. K. K. Naraparaju, and, J. Schneider, Generalized cross approximation for 3d-tensors, Comput. Vis. Sci. 14 (3), 105-115 (2011).
199. T. Ngo, and, Y. Saad, Scaled gradients on Grassmann manifolds for matrix completion, Preprint ys-2012-5, Dept. Computer Science and Engineering, University of Minnesota, Minneapolis, MN, 2012.
200. A. Nonnenmacher, and, C. Lubich, Dynamical low-rank approximation: applications and numerical experiments, Mathematics and Computers in Simulation 79 (4), 1346-1357 (2008).
201. A. Nouy, A generalized spectral decomposition technique to solve a class of linear stochastic partial differential equations, Comput. Meth. Appl. Mech. Engrg. 196 (45-48), 4521-4537 (2007).
202. A. Nouy, Generalized spectral decomposition method for solving stochastic finite element equations: invariant subspace problem and dedicated algorithms, Comput. Meth. Appl. Mech. Engrg. 197 (51-52), 4718-4736 (2008).
203. A. Nouy, Proper generalized decompositions and separated representations for the numerical solution of high dimensional stochastic problems, Arch. Comput. Methods Eng. 17, 403-434 (2010).
204. V. Olshevsky, I. V. Oseledets, and, E. E. Tyrtyshnikov, Tensor properties of multilevel Toeplitz and related matrices, Linear Algebra Appl. 412 (1), 1-21 (2006).
205. I. Oseledets, S. Dolgov, and, D. Savostyanov, ttpy, 2013, Available at https://github.com/oseledets/ttpy/.
206. d matrices using tensor decomposition, SIAM J. Matrix Anal. Appl. 31 (4), 2130-2145 (2010).
207. I. V. Oseledets, DMRG approach to fast linear algebra in the TT-format, Comput. Meth. Appl. Math 11 (3), 382-393 (2011).
208. I.V. Oseledets, MATLAB TT-Toolbox Version 2.2, May 2011, Available at http://spring.inm.ras.ru/osel/?page-id=24.
209. I. V. Oseledets, Constructive representation of functions in low-rank tensor formats, Constr. Appr. 37 (1), 1-18 (2013).
210. 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), 939-956 (2008).
211. I. V. Oseledets, D. V. Savostyanov, and, E. E. Tyrtyshnikov, Linear algebra for tensor problems, Computing 85 (3), 169-188 (2009).
212. I. V. Oseledets, D. V. Savostyanov, and, E. E. Tyrtyshnikov, Cross approximation in tensor electron density computations, Numer. Linear Algebra Appl. 17 (6), 935-952 (2010).
213. I. V. Oseledets, and, E. E. Tyrtyshnikov, Breaking the curse of dimensionality, or how to use SVD in many dimensions, SIAM J. Sci. Comput. 31 (5), 3744-3759 (2009).
214. I. V. Oseledets, and, E. E. Tyrtyshnikov, Tensor tree decomposition does not need a tree, Preprint (Submitted to Linear Algebra Appl) 2009-04, INM RAS, Moscow, 2009.
215. I. V. Oseledets, and, E. E. Tyrtyshnikov, TT-cross approximation for multidimensional arrays, Linear Algebra Appl. 432 (1), 70-88 (2010).
216. I. V. Oseledets, and, E. E. Tyrtyshnikov, Algebraic wavelet transform via quantics tensor train decomposition, SIAM J. Sci. Comput. 33 (3), 1315-1328 (2011).
217. I. V. Oseledets, E. E. Tyrtyshnikov, and, N. L. Zamarashkin, Tensor-train ranks of matrices and their inverses, Comput. Meth. Appl. Math 11 (3), 394-403 (2011).
218. I. Oseledets, Tensor-train decomposition, SIAM J. Sci. Comput. 33 (5), 2295-2317 (2011).
219. S. Östlund, and, S. Rommer, Thermodynamic limit of density matrix renormalization, Phys. Rev. Lett. 75 (Nov), 3537-3540 (1995).
220. V. Y. Pan, G. Qian, and, A. L. Zheng, Randomized matrix computations, arXiv preprint 1210.7476, 2012.
221. R. Penrose, Applications of negative dimensional tensors, in: Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969), (Academic Press, London, 1971), pp. 221-244.
222. D. Perez-Garcia, F. Verstraete, M. M. Wolf, and, J. I. Cirac, Matrix product state representations, Quantum Info. Comput. 7 (5), 401-430 (2007).
223. A. H. Phan, P. Tichavský, and, A. Cichocki, CANDECOMP/PARAFAC decomposition of highorder tensors through tensor reshaping, arXiv preprint 1211.3796, 2012.
224. A. H. Phan, P. Tichavský, and, A. Cichocki, On fast computation of gradients for CANDECOMP/PARAFAC algorithms, arXiv preprint 1204.1586, 2012.
225. A. H. Phan, P. Tichavský, and, A. Cichocki, Low complexity damped gauss-newton algorithms for CANDECOMP/PARAFAC, SIAM Journal on Matrix Analysis and Applications 34 (1), 126-147 (2013).
226. M. Rajih, P. Comon, and, R. A. Harshman, Enhanced line search: a novel method to accelerate PARAFAC, SIAM J. Matrix Anal. Appl. 30 (3), 1128-1147 (2008).
227. T. Rohwedder, and, A. Uschmajew, On local convergence of alternating schemes for optimization of convex problems in the tensor train format, SIAM J. Numer. Anal. 51 (2), 1134-1162 (2013).
228. M. Sanz, M. M. Wolf, D. Pérez-García, and, J. I. Cirac, Matrix product states: Symmetries and two-body Hamiltonians, Phys. Rev. A 79 (Apr), 042308 (2009).
229. B. Savas, and, L. Eldén, Krylov-type methods for tensor computations I, Linear Algebra Appl. 438 (2), 891-918 (2013).
230. B. Savas, and, L. H. Lim, Quasi-Newton methods on Grassmannians and multilinear approximations of tensors, SIAM J. Sci. Comput. 32 (6), 3352-3393 (2010).
231. D. V. Savostyanov, QTT-rank-one vectors with QTT-rank-one and full-rank Fourier images, Linear Algebra Appl. 436 (9), 3215-3224 (2012).
232. D. V. Savostyanov, and, I. V. Oseledets, Fast adaptive interpolation of multi-dimensional arrays in tensor train format, in: Proceedings of 7th International Workshop on Multidimensional Systems (nDS), (IEEE, 2011).
233. D. V. Savostyanov, E. E. Tyrtyshnikov, and, N. L. Zamarashkin, Fast truncation of mode ranks for bilinear tensor operations, Numer. Linear Algebra Appl. 19 (1), 103-111 (2012).
234. R. Schneider, Tensor product approximation and numerical solution of the electronic Schrödinger equation, 2012, John von Neumann Gastvorlesung, available at http://www-m2.ma.tum.de/bin/view/Allgemeines/ JohnVonNeumannLectureSS12.
235. R. Schneider, and, A. Uschmajew, Approximation rates for the hierarchical tensor format in certain periodic Sobolev spaces, Tech. rep., MATHICSE, EPFL, 2013.
236. U. Schollwöck, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326 (2011).
237. S. Sharma, and, G. K. L. Chan, Spin-adapted density matrix renormalization group algorithms for quantum chemistry, J. Chem. Phys. 136 (12), 124121 (2012).
238. S. Sharma, and, G. K. L. Chan, Block v 0.9.6, 2013, Available at http://www.princeton.edu/chemistry/chan/software/dmrg/.
239. Y. Y. Shi, L. M. Duan, and, G. Vidal, Classical simulation of quantum many-body systems with a tree tensor network, Physical Review A 74 (2), 022320 (2006).
240. V. Simoncini, Computational methods for linear matrix equations, Tech. rep., 2013.
241. A. Smilde, R. Bro, and, P. Geladi, Multi-way Analysis: Applications in the Chemical Sciences (Wiley, 2004).
242. L. Sorber, M. Van Barel, and, L. De Lathauwer, Tensorlab v1.0, 2013, Available online, http://esat.kuleuven.be/sista/tensorlab/.
243. A. Stegeman, and, P. Comon, Subtracting a best rank-1 approximation may increase tensor rank, Linear Algebra Appl. 433 (7), 1276-1300 (2010).
244. N. Takaaki, Algebraic reconstruction of the general-order poles of a meromorphic function, Inverse Problems 28 (2), 025008 (2012).
245. V. N. Temlyakov, Approximations of functions with bounded mixed derivative, Trudy Mat. Inst. Steklov. 178, 113 (1986), In Russian; English translation in Proc. Steklov Inst. Math. 1989, no. 1 (178).
246. V. N. Temlyakov, Bilinear approximation and related questions, Trudy Mat. Inst. Steklov pp. 229-248 (1992), In Russian; English translation: Proc. Steklov Inst. Math. 1993, no. 4 (194), 245-265.
247. V. N. Temlyakov, Estimates for the best bilinear approximations of functions and approximation numbers of integral operators, Mat. Zametki 51 (5), 125-134, 159 (1992), In Russian; English translation in Math. Notes 1992, 51(5), 510-517.
248. C. Tobler, Low-rank Tensor Methods for Linear Systems and Eigenvalue Problems, PhD thesis, ETH Zurich, Switzerland, 2012.
249. C. E. Tsourakakis, MACH: fast randomized tensor decompositions, in: SIAM International Conference on Data Mining, (2010).
250. E. E. Tyrtyshnikov, Incomplete cross approximation in the mosaic-skeleton method, Computing 64 (4), 367-380 (2000), International GAMM-Workshop on Multigrid Methods (Bonn, 1998).
251. E. E. Tyrtyshnikov, Tensor approximations of matrices generated by asymptotically smooth functions, Mat. Sb. 194 (6), 147-160 (2003).
252. E. E. Tyrtyshnikov, Kronecker-product approximations for some function-related matrices, Linear Algebra Appl. 379, 423-437 (2004), Tenth Conference of the International Linear Algebra Society.
253. E. Ullmann, A Kronecker product preconditioner for stochastic Galerkin finite element discretizations, SIAM J. Sci. Comput. 32 (2), 923-946 (2010).
254. A. Uschmajew, Regularity of tensor product approximations tosquare integrable functions, Constr. Approx. 34, 371-391 (2011).
255. A. Uschmajew, Local convergence of the alternating least squares algorithm for canonical tensor approximation, SIAM J. Matrix Anal. Appl. 33 (2), 639-652 (2012).
256. A. Uschmajew, Zur Theorie der Niedrigrangapproximation in Tensorprodukten von Hilberträumen, PhD thesis, Technische Universität Berlin, 2013.
257. A. Uschmajew, and, B. Vandereycken, The geometry of algorithms using hierarchical tensors, Tech. rep., January 2012.
258. C. F. Van Loan, and, N. Pitsianis, Approximation with Kronecker products, in: Linear algebra for large scale and real-time applications (Leuven, 1992), NATO Adv. Sci. Inst. Ser. E Appl. Sci., Vol. 232 (Kluwer Acad. Publ., Dordrecht, 1993), pp. 293-314.
259. B. Vandereycken, Low-rank matrix completion by Riemannian optimization, Tech. rep., MATHICSE, EPF Lausanne, Switzerland, 2012.
260. B. Vandereycken, and, S. Vandewalle, A Riemannian optimization approach for computing lowrank solutions of Lyapunov equations, SIAM J. Matrix Anal. Appl. 31 (5), 2553-2579 (2010).
261. N. Vannieuwenhoven, R. Vandebril, and, K. Meerbergen, A new truncation strategy for the higher-order singular value decomposition, SIAM J. Sci. Comput. 34 (2), A1027-A1052 (2012).
262. F. Verstraete, and, J. I. Cirac, Renormalization algorithms for quantum-many body systems in two and higher dimensions, Tech. Rep. arXiv:cond-mat/0407066, 2004.
263. F. Verstraete, and, J. I. Cirac, Valence-bond states for quantum computation, Phys. Rev. A 70 (Dec), 060302 (2004).
264. F. Verstraete, J. J. García-Ripoll, and, J. I. Cirac, Matrix product density operators: Simulation of finite-temperature and dissipative systems, Phys. Rev. Lett. 93 (Nov), 207204 (2004).
265. G. Vidal, Efficient Classical Simulation of Slightly Entangled Quantum Computations, Phys. Rev. Lett. 91, 147902 (2003).
266. G. Vidal, Entanglement renormalization, Phys. Rev. Lett. 99 (Nov), 220405 (2007).
267. H. Wang, and, M. Thoss, Multilayer formulation of the multiconfiguration time-dependent Hartree theory, J. Chem. Phys 119 (3), 1289-1299 (2003).
268. S. R. White, Density matrix formulation for quantum renormalization groups, Phys. Rev. Lett. 69, 2863-2866 (1992).
269. B. M. Wise, and, N. B. Gallagher, PLS Toolbox 7.0.3, 2013, Available at http://www.eigenvector.com.
270. G. A. Worth, M. H. Beck, A. Jäckle, and, H. D. Meyer, The MCTDH package, version 8.3 (2003), See http://www.pci.uni-heidelberg.de/tc/usr/mctdh/.
271. G. Zhou, A. Cichocki, and, S. Xie, Accelerated canonical polyadic decomposition by using mode reduction, arXiv preprint 1211.3500, 2012.
272. M. Zwolak, and, G. Vidal, Mixed-state dynamics in one-dimensional quantum lattice systems: A time-dependent superoperator renormalization algorithm, Phys. Rev. Lett. 93 (Nov), 207205 (2004).