DYNAMICAL APPROXIMATION BY HIERARCHICAL TUCKER AND TENSOR-TRAIN TENSORS

被引:108
作者
Lubich, Christian [1 ]
Rohwedder, Thorsten [2 ]
Schneider, Reinhold [2 ]
Vandereycken, Bart [3 ]
机构
[1] Univ Tubingen, Math Inst, D-72076 Tubingen, Germany
[2] Tech Univ Berlin, Inst Math, D-10623 Berlin, Germany
[3] Ecole Polytech Fed Lausanne, MATHICSE, ANCHP, CH-1015 Lausanne, Switzerland
关键词
low-rank approximation; time-varying tensors; hierarchical Tucker format; tensor train format; tensor differential equations; tensor updates; LOW-RANK APPROXIMATION; OPTIMIZATION;
D O I
10.1137/120885723
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We extend results on the dynamical low-rank approximation for the treatment of time-dependent matrices and tensors (Koch and Lubich; see [SIAM J. Matrix Anal. Appl., 29 (2007), pp. 434-454], [SIAM J. Matrix Anal. Appl., 31 (2010), pp. 2360-2375]) to the recently proposed hierarchical Tucker (HT) tensor format (Hackbusch and Kuhn; see [J. Fourier Anal. Appl., 15 (2009), pp. 706-722]) and the tensor train (TT) format (Oseledets; see [SIAM J. Sci. Comput., 33 (2011), pp. 2295-2317]), which are closely related to tensor decomposition methods used in quantum physics and chemistry. In this dynamical approximation approach, the time derivative of the tensor to be approximated is projected onto the time-dependent tangent space of the approximation manifold along the solution trajectory. This approach can be used to approximate the solutions to tensor differential equations in the HT or TT format and to compute updates in optimization algorithms within these reduced tensor formats. By deriving and analyzing the tangent space projector for the manifold of HT/TT tensors of fixed rank, we obtain curvature estimates, which allow us to obtain quasi-best approximation properties for the dynamical approximation, showing that the prospects and limitations of the ansatz are similar to those of the dynamical low rank approximation for matrices. Our results are exemplified by numerical experiments.
引用
收藏
页码:470 / 494
页数:25
相关论文
共 29 条
[1]  
Absil PA, 2008, OPTIMIZATION ALGORITHMS ON MATRIX MANIFOLDS, P1
[2]  
[Anonymous], 1998, Matrix algorithms: volume 1: basic decompositions
[3]  
Bader B.W., 2012, Matlab tensor toolbox version 2.5
[4]   A projection method to solve linear systems in tensor format [J].
Ballani, Jonas ;
Grasedyck, Lars .
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2013, 20 (01) :27-43
[5]   The multiconfiguration time-dependent Hartree (MCTDH) method:: a highly efficient algorithm for propagating wavepackets [J].
Beck, MH ;
Jäckle, A ;
Worth, GA ;
Meyer, HD .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2000, 324 (01) :1-105
[6]   AN ERROR ANALYSIS OF THE MULTI-CONFIGURATION TIME-DEPENDENT HARTREE METHOD OF QUANTUM DYNAMICS [J].
Conte, Dajana ;
Lubich, Christian .
ESAIM-MATHEMATICAL MODELLING AND NUMERICAL ANALYSIS-MODELISATION MATHEMATIQUE ET ANALYSE NUMERIQUE, 2010, 44 (04) :759-780
[7]  
Dolgov S., 2012, FAST SOLUTION MULTID
[8]   HIERARCHICAL SINGULAR VALUE DECOMPOSITION OF TENSORS [J].
Grasedyck, Lars .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2010, 31 (04) :2029-2054
[9]   A New Scheme for the Tensor Representation [J].
Hackbusch, W. ;
Kuehn, S. .
JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS, 2009, 15 (05) :706-722
[10]  
Hackbusch W., 2012, TENSOR SPACES NUMERI, V42