Numerical tensor calculus

Acta Numerica

Volumn 23, Issue , 2014, Pages 651-742

  Hackbusch, Wolfgang ^a  

^a MAX PLANCK INSTITUTE FOR MATHEMATICS IN THE SCIENCES   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84900490000     PISSN: 09624929     EISSN: 14740508     Source Type: Journal    
DOI: 10.1017/S0962492914000087     Document Type: Article

References (117)

1. I. Affleck, T. Kennedy, E. H. Lieb and H. Tasaki (1987). Rigorous results on valence-bond ground states in antiferromagnets. Phys. Rev. Lett. 59, 799-802.
2. C. A. Andersson and R. Bro (2000). The N-way toolbox for MATLAB. Chemometrics Intelligent Lab. Syst. 52, 1-4.
3. C. J. Appellof and E. R. Davidson (1981). Strategies for analyzing data from video fluorometric monitoring of liquid-chromatographic effluents. Anal. Chem. 13, 2053-2056.
4. A. Arnold and T. Jahnke (2012), On the approximation of high-dimensional differential equations in the hierarchical Tucker format. Preprint 12/09, KIT, Karlsruhe.
5. B. W. Bader and T. G. Kolda (2007), MATLAB tensor toolbox, version 2.3. Technical report: Http://csmr.ca.sandia.gov/tgkolda/TensorToolbox
6. J. Ballani (2012). Fast evaluation of singular BEM integrals based on tensor approximations. Numer. Math. 121, 433-460.
7. J. Ballani and L. Grasedyck (2013). A projection method to solve linear systems in tensor format. Numer. Linear Algebra Appl. 20, 27-43.
8. J. Ballani, L. Grasedyck and M. Kluge (2013). Black box approximation of tensors in hierarchical Tucker format. Linear Algebra Appl. 438, 639-657.
9. M. Bebendorf (2011). Adaptive cross approximation of multivariate functions. Constr. Approx. 34, 149-179.
10. U. Benedikt, A. A. Auer, M. Espig and W. Hackbusch (2011). Tensor decomposition in post-Hartree-Fock methods I: Two-electron integrals and MP2. J. Chem. Phys. 134, 054118.
11. P. Benner and T. Breiten (2013). Low rank methods for a class of generalized Lyapunov equations and related issues. Numer. Math. 124, 441-470.
12. G. Beylkin and M. J. Mohlenkamp (2005). Algorithms for numerical analysis in high dimensions. SIAM J. Sci. Comput. 26, 2133-2159.
13. G. Beylkin and L. Monzón (2010). Approximation by exponential sums revisited. Appl. Comput. Harmon. Anal. 28, 131-149.
14. G. Beylkin, M. J. Mohlenkamp and F. Pérez (2008). Approximating a wavefunction as an unconstrained sum of Slater determinants. J. Math. Phys. 49, 032107.
15. D. Bini, G. Lotti and F. Romani (1980). Approximate solutions for the bilinear form computational problem. SIAM J. Comput. 9, 692-697.
16. D. Braess (1986), Nonlinear Approximation Theory, Springer.
17. D. Braess and W. Hackbusch (2005). Approximation of 1/x by exponential sums in [1). IMA J. Numer. Anal. 25, 685-697.
18. D. Braess and W. Hackbusch (2009), On the efficient computation of highdimensional integrals and the approximation by exponential sums. In Multiscale, Nonlinear and Adaptive Approximation (R. A. DeVore and A. Kunoth, eds), Springer, pp. 39-74.
19. J. Buczyński and J. M. Landsberg (2014). On the third secant variety. J. Algebraic Combin., to appear.
20. H.-J. Bungartz and M. Griebel (2004), Sparse grids. In Acta Numerica, Vol. 13, Cambridge University Press, pp. 147-269.
21. R. B. Cattell (1944). Parallel proportional profiles and other principles for determining the choice of factors by rotation. Psychometrika 9, 267-283.
22. L. Chiantini and G. Ottaviani (2012). On generic identifiability of 3-Tensors of small rank. SIAM J. Matrix Anal. Appl. 33, 1018-1037.
23. S. R. Chinnamsetty, M. Espig, H.-J. Flad and W. Hackbusch (2010). Canonical tensor products as a generalization of Gaussian-Type orbitals. Z. Phys. Chem. 224, 681-694.
24. P. Comon (2002), Tensor decomposition: State of the art and applications. In Mathematics in Signal Processing V (J. G. McWhirter and I. K. Proudler, eds), Oxford University Press, pp. 1-24.
25. L. De Lathauwer (2008). Decompositions of a higher-order tensor in block terms II: Definitions and uniqueness. SIAM J. Matrix Anal. Appl. 30, 1033-1066.
26. L. De Lathauwer, B. De Moor and J. Vandewalle (2000). A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21, 1253-1278.
27. L. De Lathauwer, B. De Moor and J. Vandewalle (2000). An introduction to independent component analysis. J. Chemometrics 14, 123-149.
28. L. De Lathauwer, B. De Moor and J. Vandewalle (2000). On the best rank-1 and rank-(R1,R2, . . . , Rn) approximation of higher order tensors. SIAM J. Matrix Anal. Appl. 21, 1324-1342.
29. V. De Silva and L.-H. Lim (2008). Tensor rank and the ill-posedness of the best low-rank approximation problem. SIAM J. Matrix Anal. Appl. 30, 1084-1127.
30. S. Dolgov, V. A. Kazeev and B. Khoromskij (2012), The tensor-structured solution of one-dimensional elliptic differential equations with high-dimensional parameters. Preprint 51, Max-Planck-Institut für Mathematik in den Naturwissenschaften, Leipzig.
31. S. Dolgov, B. Khoromskij and D. V. Savostyanov (2012). Superfast Fourier transform using QTT approximation. J. Fourier Anal. Appl. 18, 915-953.
32. L. Eldén and B. Savas (2009). A Newton-Grassmann method for computing the best multilinear rank-(r1, r2, r3) approximation of a tensor. SIAM J. Matrix Anal. Appl. 31, 248-271.
33. M. Espig and W. Hackbusch (2012). A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format. Numer. Math. 122, 489-525.
34. M. Espig, L. Grasedyck and W. Hackbusch (2009). Black box low tensor-rank approximation using fiber-crosses. Constr. Approx. 30, 557-597.
35. M. Espig, W. Hackbusch, S. Handschuh and R. Schneider (2012). Optimization problems in contracted tensor networks. Comput. Vis. Sci. 14, 271-285.
36. M. Espig, W. Hackbusch, A. Litvinenko, H. G. Matthies and P. Wähnert (2014). Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats. Comput. Math. Appl. 67, 818-829.
37. M. Espig, W. Hackbusch, A. Litvinenko, H. G. Matthies and E. Zander (2013), Efficient analysis of high dimensional data in tensor formats. In Garcke and Griebel (2013), pp. 31-56.
38. M. Espig, W. Hackbusch, T. Rohwedder and R. Schneider (2012). Variational calculus with sums of elementary tensors of fixed rank. Numer. Math. 122, 469-488.
39. A. Falcó and A. Nouy (2012). Proper generalized decomposition for nonlinear convex problems in tensor Banach spaces. Numer. Math. 121, 503-530.
40. A. Falcó, W. Hackbusch and A. Nouy (2013), Geometric structures in tensor representations. Preprint 9, Max-Planck-Institut für Mathematik in den Naturwissenschaften, Leipzig.
41. H.-J. Flad, W. Hackbusch and R. Schneider (2006). Best N-Term approximation in electronic structure calculations I: One-electron reduced density matrix. M2AN 40, 49-61.
42. H.-J. Flad, W. Hackbusch and R. Schneider (2007). Best N-Term approximation in electronic structure calculations II: Jastrow factors. M2AN 41, 261-279.
43. H.-J. Flad, W. Hackbusch, B. Khoromskij and R. Schneider (2010), Concept of data-sparse tensor-product approximation in many-particle modelling. In Matrix Methods: Theory, Algorithms, Applications (V. Olshevsky and E. E. Tyrtyshnikov, eds), World Scientific, pp. 313-343.
44. J. Garcke (2013), Sparse grids in a nutshell. In Garcke and Griebel (2013), pp. 57-80.
45. J. Garcke and M. Griebel, eds (2013), Sparse Grids and Applications, Vol. 88 of Lecture Notes in Computational Science and Engineering, Springer.
46. I. P. Gavrilyuk, W. Hackbusch and B. Khoromskij (2002). H-matrix approximation for the operator exponential with applications. Numer. Math. 92, 83-111.
47. L. Grasedyck (2004). Existence and computation of a low Kronecker-rank approximant to the solution of a tensor system with tensor right-hand side. Computing 72, 247-266.
48. L. Grasedyck (2010). Hierarchical singular value decomposition of tensors. SIAM J. Matrix Anal. Appl. 31, 2029-2054.
49. L. Grasedyck (2010), Polynomial approximation in hierarchical Tucker format by vector-Tensorization. DFG-SPP 1324. Preprint 43, Philipps- Universität Marburg.
50. L. Grasedyck and W. Hackbusch (2011). An introduction to hierarchical (H-) rank and TT-rank of tensors with examples. Comput. Methods Appl. Math. 11, 291-304.
51. L. Grasedyck, D. Kressner and C. Tobler (2013). A literature survey of low-rank tensor approximation techniques. GAMM-Mitteilungen 36.
52. W. H. Greub (1975), Linear Algebra, Springer.
53. W. Hackbusch (1994), Iterative Solution of Large Sparse System of Equations, Cambridge University Press.
54. W. Hackbusch (2005), Entwicklungen nach Exponentialsummen. Techn. Bericht 25, Max-Planck-Institut für Mathematik in den Naturwissenschaften, Leipzig.
55. W. Hackbusch (2009),Hierarchische Matrizen: Algorithmen und Analysis, Springer.
56. W. Hackbusch (2011). Tensorisation of vectors and their efficient convolution. Numer. Math. 119, 465-488.
57. W. Hackbusch (2012), Tensor Spaces and Numerical Tensor Calculus, Vol. 42 of Springer Series in Computational Mathematics, Springer.
58. W. Hackbusch (2013). L8 estimation of tensor truncations. Numer. Math. 125, 419-440.
59. W. Hackbusch and B. Khoromskij (2007). Tensor-product approximation to operators and functions in high dimensions. J. Complexity 23, 697-714.
60. W. Hackbusch and S. Kühn (2009). A new scheme for the tensor representation. J. Fourier Anal. Appl. 15, 706-722.
61. W. Hackbusch, B. Khoromskij and E. E. Tyrtyshnikov (2005). Hierarchical Kronecker tensor-product approximations. J. Numer. Math. 13, 119-156.
62. W. Hackbusch, B. Khoromskij and E. E. Tyrtyshnikov (2008). Approximate iterations for structured matrices. Numer. Math. 109, 365-383.
63. S. Handschuh (2012), Changing the topology of tensor networks. Preprint 15, Max-Planck-Institut für Mathematik in den Naturwissenschaften, Leipzig.
64. R. Harshman (1970). Foundations of PARAFAC procedure: Models and conditions for an "exploratory" multi-mode analysis. UCLA Working Papers in Phonetics 16, 1-84.
65. J. Håstad (1990). Tensor rank is NP-complete. J. Algorithms 11, 644-654.
66. R Henrion (1994). N-way principal component analysis: Theory, algorithm and applications. Chemometrics Intelligent Lab. Syst. 25, 1-23.
67. N. J. Higham (2008), Functions of Matrices: Theory and Computation, SIAM.
68. F. L. Hitchcock (1927). The expression of a tensor or a polyadic as a sum of products. J. Math. Phys. 6, 164-189.
69. S. Holtz, T. Rohwedder and R. Schneider (2012). On manifolds of tensors of fixed TT-rank. Numer. Math. 120, 701-731.
70. S. Holtz, T. Rohwedder and R. Schneider (2012). The alternating linear scheme for tensor optimization in the tensor train format. SIAM J. Sci. Comput. 34, A683-A713.
71. T. D. Howell (1978). Global properties of tensor rank. Linear Algebra Appl. 22, 9-23.
72. R. Hübener, V. Nebendahl and W. Dür (2010). Concatenated tensor network states. New J. Phys. 12, 025004.
73. T. Huckle, K.Waldherr and T. Schulte-Herbrüggen (2013). Computations in quantum tensor networks. Linear Algebra Appl. 438, 750-781.
74. M. Ishteva, L. De Lathauwer, P.-A. Absil and S. Van Huffel (2009). Differentialgeometric Newton method for the best rank-(r1, r2, r3) approximation of tensors. Numer. Algorithms 51, 179-194.
75. B. Khoromskij (2009). Tensor-structured preconditioners and approximate inverse of elliptic operators in Rd. Constr. Approx. 30, 599-620.
76. B. Khoromskij (2011). O(d logN)-quantics approximation of N-d tensors in high-dimensional numerical modeling. Constr. Approx. 34, 257-280.
77. B. Khoromskij and C. Schwab (2011). Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs. SIAM J. Sci. Comput. 33, 364-385.
78. B. Khoromskij, V. Khoromskaia and H.-J. Flad (2011). Numerical solution of the Hartree-Fock equation in multilevel tensor-structured format. SIAM J. Sci. Comput. 33, 45-65.
79. O. Koch and C. Lubich (2010). Dynamical tensor approximation. SIAM J. Matrix Anal. Appl. 31, 2360-2375.
80. T. G. Kolda and B. W. Bader (2009). Tensor decompositions and applications. SIAM Rev. 51, 455-500.
81. D. Kressner and C. Tobler (2010). Krylov subspace methods for linear systems with tensor product structure. SIAM J. Matrix Anal. Appl. 31, 1688-1714.
82. D. Kressner and C. Tobler (2011). Low-rank tensor Krylov subspace methods for parametrized linear systems. SIAM J. Matrix Anal. Appl. 32, 1288-1316.
83. D. Kressner and C. Tobler (2011). Preconditioned low-rank methods for highdimensional elliptic PDE eigenvalue problems. Comput. Methods Appl. Math. 11, 363-381.
84. D. Kressner and C. Tobler (2012), htucker: A Matlab toolbox for tensors in hierarchical Tucker format. Technical report, MATHICSE, EPF Lausanne.
85. P. M. Kroonenberg (2008), Applied Multiway Data Analysis, Wiley.
86. J. B. Kruskal (1977). Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics. Linear Algebra Appl. 18, 95-138.
87. J. M. Landsberg (2012), Tensors: Geometry and Applications, AMS.
88. C. Lubich (2005). On variational approximations in quantum molecular dynamics. Math. Comp. 74, 765-779.
89. C. Lubich (2008), From Quantum to Classical Molecular Dynamics: Reduced Models and Numerical Analysis, EMS, Zürich.
90. C. Lubich and I. V. Oseledets (2013), A projector-splitting integrator for dynamical low-rank approximation. arXiv 1301.1058
91. C. Lubich, T. Rohwedder, R. Schneider and B. Vandereycken (2013). Dynamical approximation of hierarchical Tucker and tensor-Train tensors. SIAM J. Matrix Anal. Appl. 34, 470-494.
92. M. J. Mohlenkamp (2010). A center-of-mass principle for the multiparticle Schrödinger equation. J. Math. Phys. 51, 022112.
93. M. J. Mohlenkamp (2013). Musing on multilinear fitting. Linear Algebra Appl. 438, 834-852.
94. I. V. Oseledets (2010). Approximation of matrices using tensor decomposition. SIAM J. Matrix Anal. Appl. 31, 2130-2145.
95. I. V. Oseledets (2011). DMRG approach to fast linear algebra in the TT-format. Comput. Methods Appl. Math. 11, 382-393.
96. I. V. Oseledets (2011). Tensor-Train decomposition. SIAM J. Sci. Comput. 33, 2295-2317.
97. I. V. Oseledets and E. E. Tyrtyshnikov (2005). Approximate inversion of matrices in the process of solving a hypersingular integral equation. Comput. Math. Math. Phys. 45, 302-313.
98. I. V. Oseledets and E. E. Tyrtyshnikov (2009). Breaking the curse of dimensionality, or how to use SVD in many dimensions. SIAM J. Sci. Comput. 31, 3744-3759.
99. I. V. Oseledets and E. E. Tyrtyshnikov (2009), Tensor tree decomposition does not need a tree. Preprint 2009-08, RAS, Moscow.
100. I. V. Oseledets, D. V. Savostyanov and E. E. Tyrtyshnikov (2009). Linear algebra for tensor problems. Computing 85, 169-188.
101. I. V. Oseledets, D. V. Savostyanov and E. E. Tyrtyshnikov (2010). Cross approximation in tensor electron density computations. Numer. Linear Algebra Appl. 17, 935-952.
102. I. V. Oseledets, E. E. Tyrtyshnikov and N. L. Zamarashkin (2011). Tensor-Train ranks for matrices and their inverses. Comput. Methods Appl. Math. 11, 394-403.
103. B. Savas and L. Eldén (2013). Krylov-Type methods for tensor computations I. Linear Algebra Appl. 438, 891-918.
104. D. V. Savostyanov, E. E. Tyrtyshnikov and N. L. Zamarashkin (2012). Fast truncation of mode ranks for bilinear tensor operations. Numer. Linear Algebra Appl. 19, 103-111.
105. C. Schwab and C. J. Gittelson (2011), Sparse tensor discretizations of highdimensional parametric and stochastic PDEs. In Acta Numerica, Vol. 20, Cambridge University Press, pp. 291-467.
106. Y. Shi, L. Duan and G. Vidal (2006). Classical simulation of quantum many-body systems with a tree tensor network. Phys. Rev. A 74, 022320.
107. A. Smilde, R. Bro and P. Geladi (2004), Multi-way Analysis: Applications in the Chemical Sciences, Wiley.
108. M. Sorensen, L. De Lathauwer, P. Comon, S. Icart and L. Deneire (2012). Canonical polyadic decomposition with a columnwise orthonormal factor matrix. SIAM J. Matrix Anal. Appl. 33, 1190-1213.
109. A. Stegeman (2010). On the uniqueness of the nth order tensor decomposition into rank-1 terms with linear independence in one mode. SIAM J. Matrix Anal. Appl. 31, 2498-2516.
110. F. Stenger (1993), Numerical Methods Based on Sinc and Analytic Functions, Springer.
111. V. Strassen (1969). Gaussian elimination is not optimal. Numer. Math. 13, 354-356.
112. L. R. Tucker (1966). Some mathematical notes on three-mode factor analysis. Psychometrika 31, 279-311.
113. A. Uschmajew (2010). Convex maximization problems on non-compact Stiefel manifolds with application to orthogonal tensor approximations. Numer. Math. 115, 309-331.
114. A. Uschmajew (2012). Local convergence of the alternating least squares algorithm for canonical tensor approximation. SIAM J. Matrix Anal. Appl. 33, 639-652.
115. F. Verstraete and J. I. Cirac (2006). Matrix product states represent ground states faithfully. Phys. Rev. B 73, 094423.
116. S. Winograd (1971). On multiplication of 2 2 matrices. Linear Algebra Appl. 4, 381-388.
117. H. Yserentant (2010), Regularity and Approximability of Electronic Wave Functions, Vol. 2000 of Lecture Notes in Mathematics, Springer.