Tensors-structured numerical methods in scientific computing: Survey on recent advances

Chemometrics and Intelligent Laboratory Systems

Volumn 110, Issue 1, 2012, Pages 1-19

  Khoromskij, Boris N ^a  

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

Author keywords

Computational quantum chemistry; FEM BEM; High dimensional problems; Matrix valued functions; Quantics folding of vectors; Rank structured tensor approximation; Stochastic PDEs

Indexed keywords

ANALYTIC METHOD; ANALYTICAL ERROR; CANONICAL ANALYSIS; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MATHEMATICAL MODEL; MATHEMATICAL PARAMETERS; MULTIVARIATE ANALYSIS; PRIORITY JOURNAL; PROCESS OPTIMIZATION; QUANTITATIVE ANALYSIS; QUANTUM CHEMISTRY; REVIEW; TENSOR STRUCTURED NUMERICAL METHOD;

EID: 83655192088     PISSN: 01697439     EISSN: 18733239     Source Type: Journal    
DOI: 10.1016/j.chemolab.2011.09.001     Document Type: Review

References (101)

1. Absil P.-A., Mahony R., Sepulchre R. Optimization Algorithms on Matrix Manifolds 2008, Princeton University Press, Princeton, NJ.
2. Beck M.H., Jäckle A., Worth G.A., Meyer H.-D. The multiconfiguration time-dependent Hartree (MCTDH) method: a highly efficient algorithm for propagating wavepackets. Physics Reports 2000, 324:1-105.
3. Bebebndorf M. Adaptive cross approximation of multivariate functions. J. Constructive Approximation 2010, to appear.
4. C. Bertoglio, B.N. Khoromskij, Low rank tensor-product approximation of projected Green kernels via sinc-quadratures. Preprint 79/2008, MPI MiS (submitted for publication).
5. Beylkin G., Mohlenkamp M.J. Numerical operator calculus in higher dimensions. Proceedings of the National Academy of Sciences of the United States of America 2002, 10246-10251.
6. Beylkin G., Garcke J., Mohlenkamp M.J. Multivariate regression and machine learning with sums of separable functions. SIAM Journal on Scientific Computing 2009, 3:1840-1857.
7. Beylkin G., Mohlenkamp M.J. Algorithms for numerical analysis in high dimension. SIAM Journal on Scientific Computing 2005, 6:2133-2159.
8. Bungartz H.J., Griebel M. Sparse grids. Acta Numerica 2004, 1-123.
9. Cancés E., Le Bris On the convergence of SCF algorithms for the Hartree-Fock equations. ESAIM: M2AN 2000, vol. 34/4:749-774.
10. Cohen A., DeVore R., Schwab Ch. Convergence rates of best N-term Galerkin approximations for a class of elliptic sPDEs. Foundations of Computational Mathematics 2010, 10(6):615-646. 10.1007/s10208-010-9072-2.
11. Comon P., Mourrain B. Decomposition of quantics in sums of powers of linear forms. Signal Processing 1996, 2:96-107.
12. Dahmen W., Proessdorf S., Schneider R. Multiscale methods for pseudo-differential equations on manifolds. Wavelet Analysis and Its Applications 1995, 5. Academic Press.
13. De Lathauwer L. Decomposition of higher-order tensor in blockterms - Part I: lemmas for partitioned matrices. SIAM Journal on Matrix Analysis and Applications 2008, 30(3):1022-1032.
14. N) approximation of higher-order tensors. SIAM Journal on Matrix Analysis and Applications 2000, 21:1324-1342.
15. De Lathauwer L., De Moor B., Vandewalle J. A multilinear singular value decomposition. SIAM Journal on Matrix Analysis and Applications 2000, 21:1253-1278.
16. de Lathauwer L. A survey of tensor methods. IEEE International Symposium on Circuits and Systems May 2009, 2773-2776. 10.1109/iscas.2009.5118377.
17. De Silva V., Lim L.-H. 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.
18. S.V. Dolgov, B.N. Khoromskij, I. Oseledets, E.E. Tyrtyshnikov. Tensor Structured Solution of Elliptic Problems with Jumping Coefficients in Rd. Preprint 55/2010, MPI MiS, Leipzig (submitted for publication).
19. S.V. Dolgov, B.N. Khoromskij, I. Oseledets, On fast solution of multi-dimensional parabolic equations in the TT/QTT format. MPI Leipzig. In preparation.
20. S.V. Dolgov, B.N. Khoromskij, D. Savostianov. Fourier transform of d-tensors in log-volume complexity using QTT approximation. Preprint 18/2011, MPI MiS, Leipzig (submitted for publication).
21. Edelman A., Arias T.A., Steven S.T. The geometry of algorithms with orthogonality constraints. SIAM Journal on Matrix Analysis and Applications 1999, 20(2):303-353.
22. Flad H.-J., Hackbusch W., Khoromskij B.N., Schneider R. Concept of data-sparse tensor-product approximation in many-particle modeling. Matrix Methods: Theory, Algorithms, Applications 2010, 313-347. World Scientific Publishing, Singapoure. E. Tyrtyshnikov (Ed.).
23. Flad H.-J., Khoromskij B.N., Savostyanov D.V., Tyrtyshnikov E.E. Verification of the cross 3D algorithm on quantum chemistry data. Journal of Numerical Analysis and Mathematical Modelling 2008, 4:1-16.
24. Gavrilyuk I.P., Hackbusch W., Khoromskij B.N. Data-sparse approximation to a class of operator-valued functions. Mathermatics of Computation 2005, 74:681-708.
25. Gavrilyuk I.P., Hackbusch W., Khoromskij B.N. Tensor-product approximation to elliptic and parabolic solution operators in higher dimensions. Computing 2005, 74:131-157.
26. Grasedyck L. Hierarchical Singular Value Decomposition of Tensors 2009, Preprint 27/2009, MPI MIS, Leipzig.
27. Grasedyck L. Polynomial Approximation in Hierarchical Tucker Format by Vector Tensorization 2010, Preprint 43, DFG/SPP1324, RWTH Aachen.
28. Griebel M., Hamaekers J. Sparse grids for the Schroedinger equation. M2AN 2007, 41:215-247.
29. Griebel M., Oeltz D., Vassilevski P. Space-time approximation with sparse grids. SIAM Journal on Scientific Computing 2005, 28(2):701-727.
30. Griebel M., Oeltz D. A sparse grid space-time discretization scheme for parabolic problems. Computing 2007, 81(1):1-34.
31. Hackbusch W. Tensorization of Vectors and Their Efficient Convolution 2011, DFG-SPP1324 Preprint 65, University Marburg.
32. Hackbusch W., Khoromskij B.N. Tensor-product approximation to operators and functions in high dimension. Journal of Complexity 2007, 697-714.
33. Hackbusch W., Khoromskij B.N. Low-rank Kronecker product approximation to multi-dimensional nonlocal operators. Part I. Separable approximation of multi-variate functions. Computing 2006, 76:177-202.
34. Hackbusch W., Khoromskij B.N., Tyrtyshnikov E.E. Hierarchical Kronecker tensor-product approximations. Journal of Numerical Mathematics 2005, 13:119-156.
35. Hackbusch W., Khoromskij B.N., Tyrtyshnikov E. Approximate iteration for structured matrices. Numerische Mathematik 2008, 365-383.
36. Hackbusch W., Khoromskij B.N., Sauter S., Tyrtyshnikov E. Use of tensor formats in elliptic eigenvalue problems. Numerical Linear Algebra with Applications 2011, (Preprint 78/2008, MPI MiS Leipzig). 10.1002/nla.793.
37. Hackbusch W., Kühn S. A new scheme for the tensor representation. Journal of Fourier Analysis and Applications 2009, 15:706-722.
38. Harrison R.J., Fann G.I., Yanai T., Gan Z., Beylkin G. Multiresolution quantum chemistry: basic theory and initial applications. Journal of Chemical Physics 2004, 121(23):11587-11598.
39. Hitchcock F.L. The expression of a tensor or a polyadic as a sum of products. Journal of Mathematics and Physics 1927, 6:164-189.
40. Huckle T., Waldherr K., Schulte-Herbrüggen T. Computations in quantum tensor networks 2010, Preprint TU Müunchen, München.
41. Ishteva M., De Lathauwer L., Absil P.-A., Van Huffel S. Differential-geometric Newton algorithm for the best rank-(r-1, r-2, r-3) approximation of tensors. Numerical Algorithms 2009, 2:179-194.
42. Jaravine A., Ibraghimov I., Orekhov V. Removal of time barrier for high-resolution multidimensional NMR spectroscopy. Nature Methods 2006, 8:605-607.
43. Jiang T., Sidiropoulos N.D. Almost-sure identifiability of multidimensional harmonic retrieval. IEEE Transactions on Signal Proceedings 2001, 9:1849-1859.
44. V. Kazeev, B.N. Khoromskij. Explicit low-rank QTT representation of Laplace operator and its inverse. Preprint 75/2010, MPI MiS, Leipzig 2010 (SIMAX, submitted for publication).
45. V. Kazeev, B.N. Khoromskij, E.E. Tyrtyshnikov. Multilevel Toeplitz matrices generated by tensor-structured vectors and convolution with logarithmic complexity. Preprint 36/2011, MPI MiS, Leipzig 2011, SISC submitted for publication.
46. Khoromskaia V. Computation of the Hartree-Fock exchange in the tensor-structured format. Computational Methods in Applied Mathematics 2010, Vol. 10(2):204-218.
47. V. Khoromskaia, Numerical Solution of the Hartree-Fock Equation by Multilevel Tensor-structured Methods. PhD thesis, TU Berlin, 2010. http://opus.kobv.de/tuberlin/volltexte/2011/2948/.
48. Khoromskij B.N. Structured data-sparse approximation to high order tensors arising from the deterministic Boltzmann equation. Mathermatics of Computation 2007, 1292-1315.
49. d. Computational Methods in Applied Mathematics 2006, 2:194-220.
50. Khoromskij B.N. Fast and accurate tensor approximation of a multivariate convolution with linear scaling in dimension. Journal of Computational and Applied Mathematics 2010, 3122-3139.
51. Khoromskij B.N. On tensor approximation of green iterations for Kohn-Sham equations. Computing and Visualization in Science 2008, 259-271.
52. d. Journal of Constructive Approximation 2009, 599-620.
53. Khoromskij B.N. O (d log N)-quantics approximation of N-d tensors in high-dimensional numerical modeling. Journal of Constructive Approximation 2011, vol. 34(2):257-289. (Preprint 55/2009 MPI MiS, Leipzig 2009). 10.1007/s00365-011-9131-1.
54. Khoromskij B.N. Introduction to tensor numerical methods in scientific computing. Lecture Notes 2011, 1-238. University of Zuerich, Institute of Mathematics, (Preprint 06-2011). http://www.math.uzh.ch/fileadmin/math/preprints/06_11.pdf.
55. Khoromskij B.N., Khoromskaia V. Multigrid tensor approximation of function related arrays. SIAM Journal on Scientific Computing 2009, 4:3002-3026.
56. Khoromskij B.N., Khoromskaia V., Flad H.-J. Numerical solution of the Hartree-Fock equation in multilevel tensor-structured format. SIAM Journal on Scientific Computing 2011, 1:45-65.
57. Khoromskij B.N., Khoromskaia V., Chinnamsetty S.R., Flad H.-J. Tensor decomposition in electronic structure calculations on 3D Cartesian grids. Journal of Computational Physics 2009, 5749-5762.
58. Khoromskij B.N., Khoromskaia V. Low rank tucker tensor approximation to the classical potentials. Central European Journal of Mathematics 2007, 3:1-28.
59. Khoromskij B.N., Melenk J.M. Boundary concentrated finite element methods. SIAM Journal on Numerical Analysis 2003, 1:1-36.
60. Khoromskij B.N., Wittum G. Numerical solution of elliptic differential equations by reduction to the interface. Research monograph, LNCSE, No. 36 2004, Springer-Verlag.
61. Khoromskij B.N., Oseledets I. Quantics-TT approximation of elliptic solution operators in higher dimensions. Russian Journal of Numerical Analysis and Mathematical Modelling 2011, vol. 26(3):303-322.
62. Khoromskij B.N., Oseledets I. Quantics-TT collocation approximation of parameter-dependent and stochastic elliptic PDEs. Computational Methods in Applied Mathematics 2010, 10(4):34-365.
63. B.N. Khoromskij, and I. Oseledets. DMRG+QTT approach to high-dimensional quantum molecular dynamics. Preprint 68/2010, MPI MiS, Leipzig 2010 (Numer. Math., submitted for publication).
64. Khoromskij B.N., Schwab Ch. Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs. SIAM Journal on Scientific Computing 2011, 1:1-25.
65. Kolda T.G., Bader B.W. Tensor decompositions and applications. SIAM Review 2009, 3:455-500.
66. Kressner D., Tobler C. Iterative Solution of Parameter-Dependent Linear Systems 2010, Preprint SAM, ETH, Zuerich.
67. Le Bris C. Computational chemistry from the perspective of numerical analysis. Acta Numerica 2005, 363-444.
68. Lubich Ch. From quantum to classical molecular dynamics: reduced models and numerical analysis. Zurich Lectures in Advanced Mathematics 2008, EMS.
69. Mazyja V., Schmidt G. Approximate approximations. Math. Surveys and Monographs 2007, vol. 141. AMS.
70. Meyer H.-D., Gatti F., Worth G.A. Multidimensional Quantum Dynamics: MCTDH Theory and Applications 2009, Willey-VCH, Wienheim.
71. Oseledets I.V. Compact matrix form of the d-dimensional tensor decomposition 2009, Preprint 2009-01, INM RAS, Moscow.
72. Oseledets I.V. Approximation of 2d×2d matrices using tensor decomposition. SIAM Journal on Matrix Analysis and Applications 2010, 31(4):2130-2145.
73. Oseledets I.V. Constructive Representation of Functions in Tensor Formats 2010, Preprint 2010-04, INM, Moscow.
74. Oseledets I.V. DMRG Approach to Fast Linear Algebra in the TT-Format 2011, Preprint, INM, Moscow.
75. Oseledets I.V., Savostyanov D.V., Tyrtyshnikov E.E. Tucker dimensionality reduction of three-dimensional arrays in linear time. SIMAX 2008, 30(3):939-956.
76. Oseledets I., Savostyanov D., Tyrtyshnikov E. Linear algebra for tensor problems. Computing 2009, 85:169-188.
77. Oseledets I., Tyrtyshnikov E. Recursive decomposition of multidimensional tensors. Doklady Mathematics 2009, 80(1):460-462.
78. Oseledets I.V., Tyrtyshnikov E.E. Breaking the curse of dimensionality, or how to use SVD in many dimensions. SIAM Journal on Scientific Computing 2009, vol. 31(5):3744-3759.
79. Oseledets I.V., Tyrtyshnikov E.E. TT-cross approximation for multidimensional arrays. Linear Algebra and its Applications 2010, 432:70-88.
80. Papy J.-M., De Lathauwer L., Van Huffel S. Exponential data fitting using multilinear algebra: the decimative case. Chemometrics http://www.interscience.willey.com, 10.1002/cem.1212.
81. Pulay P. Improved SCF convergence acceleration. Journal of Computational Chemistry 1982, 556-560.
82. Reed M., Simon B. Methods of Modern Mathematical Physics, I. Functional Analysis 1972, AP, NY.
83. Rohwedder Th., Holtz S., Schneider R. The Alternation Least Square Scheme for Tensor Optimisation in the TT-Format. Preprint DGF-Schwerpunktprogramm 1234 71 2010.
84. Savas B., Lim L.-H. Quisi-Newton methods on Grassmanians and multilinear approximation of tensors. SIAM Journal on Scientific Computing 2010, 32(6):3352-3393.
85. Schneider R., Rohwedder Th., Blauert J., Neelov A. Direct minimization for calculating invariant subspaces in density functional computations of the electronic structure. Journal of Computational Mathematics 2009, 27(2-3):360-387.
86. Schwab C., Todor R. Sparse finite elements for elliptic problems with stochastic loading. Numerische Mathematik 2003, 95(4):707-713.
87. Sidiropoulos N.D. Generalized Carathéodory's uniqueness of harmonic parametrization to N dimensions. IEEE Transactions on Information Theory 2001, 1687-1690.
88. Smilde A., Bro R., Geladi P. Multiway Analysis 2004, Wiley.
89. Stenger F. Numerical Methods Based on Sinc and Analytic Functions 1993, Springer-Verlag.
90. Temlyakov V.N. Nonlinear methods of approximation. Foundation of Comp. Math 2008, Springer.
91. Tyrtyshnikov E.E. Kronecker-product approximations for some function-related matrices. Linear Algebra and its Applications 2004, 379:423-437.
92. Tyrtyshnikov E.E. Tensor approximations of matrices generated by asymptotically smooth functions. Sbornik: Mathematics 2003, 194(5-6):941-954.
93. Todor R.-A., Schwab Ch. Convergence rate for sparse approximation of elliptic problems with stochastic coefficients. IMA Journal of Numerical Analysis 2007, 27:232-261.
94. Tucker L.R. Some mathematical notes on three-mode factor analysis. Psychometrika 1966, 31:279-311.
95. Sloan I., Wozniakowski H. When Are quasi-Monte Carlo algorithms efficient for high dimensional integrals. Journal of Complexity 1998, vol. 14(1):1-33.
96. Verstraete F., Porras D., Cirac J.I. DMRG and periodic boundary conditions: a quantum information perspective. Physical Review Letters Nov. 2004, 93(22):227205.
97. Vidal G. Efficient classical simulation of slightly entangled quantum computations. Physical Review Letters 2003, 14. 147902-1 147902-4.
98. Wang H., Thoss M. Multilayer formulation of the multiconfiguration time-dependent Hartree theory. Journal of Chemical Physics 2003, 119:1289-1299.
99. White S.R. Density-matrix algorithms for quantum renormalization groups. Physical Review B 1993, vol. 48(14):10345-10356.
100. Yserentant H. The hyperbolic cross space approximation of electronic wavefunctions. Numerische Mathematik 2007, 105:659-690.
101. Zhang T., Golub G.H. Rank-one approximation to high order tensors. SIAM Journal on Matrix Analysis and Applications 2001, 534-550.