Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors
Open accessThe DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Abstract
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 Kühn; 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.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“For the purpose of this paper, the TDVP can most easily be understood in a geometric fashion, namely as an orthogonal projection of the evolution vector of the Schrödinger equation (-iH | ) onto the tangent space of the MPS manifold M MPS at the current state”
From Unifying time evolution and optimization with matrix product states (2016) · cites this paper as [19]
In the citing paper
“The key ingredient is to project the right-hand side of the Schrödinger equation, Ĥ | , onto the tangent space, so that the evolution never leaves the manifold.”
From Unifying time evolution and optimization with matrix product states (2016) · cites this paper as [19]
In the citing paper
“An alternative idea for time evolution, the Dirac-Frenkel time-dependent variational principle (TDVP), was formulated only recently for the variational class of MPS [18,19].”
From Unifying time evolution and optimization with matrix product states (2016) · cites this paper as [19]
In the citing paper
“The TDVP equations define a simultaneous update for all MPS tensors and, as a consequence thereof, its original implementation depends on inverses of matrices conditioned by the Schmidt coefficients, similar to the original TEBD implementation.”
From Unifying time evolution and optimization with matrix product states (2016) · cites this paper as [19]
Citations
Cites
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301 · cited 4×
“, [17]) C((1)) = A1B ((1))(A3 ⊗A2) , C((2)) = A2B((2))(A3 ⊗A1) .”
BackgroundInfluentialThe density-matrix renormalization group in the age of matrix product states
Schollwöck, U. (2011) · Annals of Physics · doi:10.1016/j.aop.2010.09.012 · Cited by 4,818 · cited 2×
“Formats of this type have been used successfully in the quantum physics and chemistry communities in the last decade [21, 23, 27, 32].”
MethodOseledets, I. V. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090752286 · Cited by 2,636 · cited 5×
“Typical choices for such dimension trees are those obtained by a balanced splitting of the index set, as used, e.g., by Grasedyck [7], or a front-to-back splitting which (with minor adaptations; see Remark 1) leads to the TT format due to Oseledets and Tyrtyshnikov [25, 26].”
BackgroundMethodInfluentialBeck, M. (2000) · Physics Reports · doi:10.1016/s0370-1573(99)00047-2 · Cited by 2,462 · cited 1×
“(ii) Although the HT/TT formats were only recently introduced in the numerical analysis community, they have—similar to the parallels between the Tucker format and the formulation of the multi-configuration time-dependent Hartree (MCTDH) method in quantum chemistry [5, 4, 22]—a considerable significance in various fie…”
Method(1991) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(91)90038-5 · Cited by 2,437
The multi-configurational time-dependent Hartree approach
Meyer, H.-D., Manthe, U., & Cederbaum, L. S. (1990) · Chemical Physics Letters · doi:10.1016/0009-2614(90)87014-i · Cited by 2,013 · cited 1×
“(ii) Although the HT/TT formats were only recently introduced into the numerical analysis community, they have—similar to the parallels between the Tucker format and the formulation of the multiconfiguration time-dependent Hartree (MCTDH) method in quantum chemistry [5, 4, 22]—a considerable significance in various fi…”
MethodOptimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
Multilayer formulation of the multiconfiguration time-dependent Hartree theory
Wang, H., & Thoss, M. (2003) · The Journal of Chemical Physics · doi:10.1063/1.1580111 · Cited by 932 · cited 3×
“5) were already used in the quantum chemists community [32]; see also [20, p.”
BackgroundMethodTime-Dependent Variational Principle for Quantum Lattices
Haegeman, J., Cirac, J. I., Osborne, T. J., Pižorn, I., Verschelde, H., & Verstraete, F. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.070601 · Cited by 865 · cited 1×
“In particular, the geometric approach underlying this work has lately been used for the simulation of realand imaginary-time dynamics for infinite one-dimensional quantum lattices by MPS [10].”
MethodTensor Spaces and Numerical Tensor Calculus
Hackbusch, W. (2012) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-28027-6 · Cited by 607
Research works printed but not linked: 1
- G. W. Stewart, Matrix Algorithms: Vol. $1$, Basic Decompositions , SIAM, Philadelphia, 1998. · DOI
Cited by
Unifying time evolution and optimization with matrix product states
Haegeman, J., Lubich, C., Oseledets, I., Vandereycken, B., & Verstraete, F. (2016) · Physical Review B · doi:10.1103/physrevb.94.165116 · Cited by 804
Self-citationA literature survey of low‐rank tensor approximation techniques
Grasedyck, L., Kressner, D., & Tobler, C. (2013) · GAMM-Mitteilungen · doi:10.1002/gamm.201310004 · Cited by 577
“Initially proposed for low-rank matrix manifolds in [166], dynamical low-rank methods have been extended to low-rank tensors in Tucker [167, 199], TT/MPS [118, 123, 163, 186], and HT [9, 186, 255] decomposition.”
Tensor product methods and entanglement optimization for ab initio quantum chemistry
Szalay, S., Pfeffer, M., Murg, V., Barcza, G., Verstraete, F., Schneider, R., & Legeza, Ö. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24898 · Cited by 314
Self-citationAlternating Minimal Energy Methods for Linear Systems in Higher Dimensions
Dolgov, S. V., & Savostyanov, D. V. (2014) · SIAM Journal on Scientific Computing · doi:10.1137/140953289 · Cited by 253
“Several theoretical issues were addressed in [43], and the numerical splitting w.”
Cichocki, A., Lee, N., Oseledets, I., Phan, A.-H., Zhao, Q., Sugiyama, M., & Mandic, D. P. (2017) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000067 · Cited by 224
Time Integration of Tensor Trains
Lubich, C., Oseledets, I. V., & Vandereycken, B. (2015) · SIAM Journal on Numerical Analysis · doi:10.1137/140976546 · Cited by 183
“The timedependent approximation approach on fixed-rank tensor train manifolds is studied in [18], where the differential equations are derived and their approximation properties are analyzed.”
Self-citationA projector-splitting integrator for dynamical low-rank approximation
Lubich, C., & Oseledets, I. V. (2014) · BIT Numerical Mathematics · doi:10.1007/s10543-013-0454-0 · Cited by 175
“roach was proposed and analyzed in [5], and first numerical applications were given in [12]. The approach and its error analysis were extended to tensors in the Tucker format in [6]. Very recently, in [1, 8, 14] the dynamical low-rank approximation approach was extended to tensors in the tensor train (TT) format studie…”
MethodSelf-citationA Theoretical Analysis of Deep Neural Networks and Parametric PDEs
Kutyniok, G., Petersen, P., Raslan, M., & Schneider, R. (2022) · Constructive Approximation · doi:10.1007/s00365-021-09551-4 · Cited by 163
Self-citationTime integration of tensor trainsPreprint
Lubich, C., Oseledets, I. V., & Vandereycken, B. (2016) · Cited by 171
Self-citationSchröder, F. A. Y. N., Turban, D. H. P., Musser, A. J., Hine, N. D. M., & Chin, A. W. (2019) · Nature Communications · doi:10.1038/s41467-019-09039-7 · Cited by 153
“…– 20 , but, here, we draw upon the deep insights into many-body wave functions and the theory of low-rank tensor approximations that underlie the highly ef fi cient matrix-product state (MPS) and tensor network state (TNS) ansatz used for strongly correlated problems in condensed matter 21 – 26 .”
BackgroundMethodSchneider, R., & Uschmajew, A. (2015) · SIAM Journal on Optimization · doi:10.1137/140957822 · Cited by 122
Self-citationBachmayr, M., Schneider, R., & Uschmajew, A. (2016) · Foundations of Computational Mathematics · doi:10.1007/s10208-016-9317-9 · Cited by 173
“Another class of local optimisation algorithms can be designed using the fact that, at least for fixed rank parameters, the model class is a smooth embedded manifold in tensor space, and explicit descriptions of its tangent space are available [4,35,71,79,86,89,104,105,138,139].”
BackgroundResultInfluentialSelf-citationThe geometry of algorithms using hierarchical tensors
Uschmajew, A., & Vandereycken, B. (2013) · Linear Algebra and its Applications · doi:10.1016/j.laa.2013.03.016 · Cited by 111
“For a theoretical and numerical investigation of such an approximation, we refer to [48, 70].”
BackgroundSelf-citationRohwedder, T., & Uschmajew, A. (2013) · SIAM Journal on Numerical Analysis · doi:10.1137/110857520 · Cited by 115
“differential equations [19, 31, 21, 43], and although ALS might be refined by using locally quadratically convergent methods near the sought optimum, the ALS approach is in fact at the moment our basic method of choice for the treatment of optimization problems in the sense that even with its striking simplicity, it c…”
BackgroundSelf-citationMurg, V., Verstraete, F., Schneider, R., Nagy, P. R., & Legeza, O. (2015) · Journal of Chemical Theory and Computation · doi:10.1021/ct501187j · Cited by 97
Self-citationA Low-Rank Projector-Splitting Integrator for the Vlasov--Poisson Equation
Einkemmer, L. D., & Lubich, C. (2018) · SIAM Journal on Scientific Computing · doi:10.1137/18m116383x · Cited by 115
“In a general mathematical setting, dynamical low-rank approximation has been studied in [31, 32, 40, 1].”
BackgroundSelf-citationDiscretized Dynamical Low-Rank Approximation in the Presence of Small Singular Values
Kieri, E., Lubich, C., & Walach, H. (2016) · SIAM Journal on Numerical Analysis · doi:10.1137/15m1026791 · Cited by 132
“Extensions to time-dependent tensors in various tensor formats were given in [2, 12, 18, 19]; see also [15] for a review of dynamical low-rank approximation.”
BackgroundSelf-citationQuantum electron-vibrational dynamics at finite temperature: Thermo field dynamics approach
Borrelli, R., & Gelin, M. F. (2016) · The Journal of Chemical Physics · doi:10.1063/1.4971211 · Cited by 99
Borrelli, R., & Gelin, M. F. (2017) · Scientific Reports · doi:10.1038/s41598-017-08901-2 · Cited by 86
“We refer the reader to refs 59 and 66, where the explicit differential equations are derived and their approximation properties are analyzed, and to ref.”
BackgroundOptimization on the Hierarchical Tucker manifold – Applications to tensor completion
Silva, C. D., & Herrmann, F. J. (2015) · Linear Algebra and its Applications · doi:10.1016/j.laa.2015.04.015 · Cited by 94
“A HT approach for solving dynamical systems is outlined in [33], which considers similar manifold structure as in this article applied in a different context.”
A molecular movie of ultrafast singlet fission
Schnedermann, C., Alvertis, A. M., Wende, T., Lukman, S., Feng, J., Schröder, F. A. Y. N., Turban, D. H. P., Wu, J., Hine, N. D. M., Greenham, N. C., et al. (2019) · Nature Communications · doi:10.1038/s41467-019-12220-7 · Cited by 91
Borrelli, R. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5099416 · Cited by 85
Algorithm 941: htucker---A Matlab Toolbox for Tensors in Hierarchical Tucker Format
Kreßner, D., & Tobler, C. (2014) · ACM Transactions on Mathematical Software · doi:10.1145/2538688 · Cited by 81
“Candidates include dynamical low-rank methods for HTD [Arnold and Jahnke 2012; Lubich et al. 2013] and low-rank tensor cross-approximation for HTD [Ballani 2012; Ballani et al. 2012].”
MethodError Analysis of the Dynamically Orthogonal Approximation of Time Dependent Random PDEs
Musharbash, E., Nobile, F., & Zhou, T. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/140967787 · Cited by 73
“The discrete analogue of the MCTDH method consists in looking for a dynamical low rank approximation of a deterministic evolution matrix or tensor equation [9, 10, 16].”
MethodTensor Networks for Big Data Analytics and Large-Scale Optimization ProblemsPreprint
Cichocki, A. S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.3124 · Cited by 136
“omposition of the tensor illustrated in Fig. 13 (a). The HT decompositions in the numerical analysis community have been introduced by Hackbusch and Kuhn [32] and Grasedyck [33]¨ (see also [30], [34]–[37] and references therein). I A A 1 A 2 A 3 A 4 I K J = C c tr( )A A 1 A 2 A 3 A 4 ) A I J ij i k ca c tr( aii i = IJ…”
Simultaneous state‐time approximation of the chemical master equation using tensor product formats
Dolgov, S., & Khoromskij, B. N. (2014) · Numerical Linear Algebra with Applications · doi:10.1002/nla.1942 · Cited by 78
“For a detailed description we refer to [51, 57, 64].”
An optimal statistical and computational framework for generalized tensor estimation
Han, R., Willett, R. M., & Zhang, A. R. (2022) · The Annals of Statistics · doi:10.1214/21-aos2061 · Cited by 80
Hackbusch, W. (2014) · Acta Numerica · doi:10.1017/s0962492914000087 · Cited by 74
Tensor neural network models for tensor singular value decompositions
Wang, X., Che, M., & Wei, Y. (2020) · Computational Optimization and Applications · doi:10.1007/s10589-020-00167-1 · Cited by 63
Tensor numerical methods for multidimensional PDES: theoretical analysis and initial applications
Khoromskij, B. N. (2015) · ESAIM Proceedings and Surveys · doi:10.1051/proc/201448001 · Cited by 104
Time dependent variational principle for tree Tensor Networks
Bauernfeind, D., & Aichhorn, M. (2020) · SciPost Physics · doi:10.21468/scipostphys.8.2.024 · Cited by 87
“[47] which introduces TDVP for binary TTNs.”
Toro, E. F., & Clarke, J. F. (1998) · Fluid mechanics and its applications · doi:10.1007/978-94-015-9137-9 · Cited by 49
Ke, Y., Borrelli, R., & Thoss, M. (2022) · The Journal of Chemical Physics · doi:10.1063/5.0088947 · Cited by 64
A literature survey of low-rank tensor approximation techniquesPreprint
Grasedyck, L., Kreßner, D., & Tobler, C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.7121 · Cited by 49
“Initially proposed for low-rank matrix manifolds in [166], dynamical low-rank methods have been extended to low-rank tensors in Tucker [167, 199], TT/MPS [118, 123, 163, 186], and HT [9, 186, 255] decomposition.”
Tree tensor network state approach for solving hierarchical equations of motion
Ke, Y. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0153870 · Cited by 62
Einkemmer, L. D., Ostermann, A., & Piazzola, C. (2019) · Journal of Computational Physics · doi:10.1016/j.jcp.2019.109063 · Cited by 58
“More theoretical insights were given in [20, 18] and extensions for various algorithms and tensor formats can be found in [21, 26, 27, 28].”
BackgroundLow-Rank Tensor Methods for Model Order Reduction
Nouy, A. (2015) · Springer eBooks · doi:10.1007/978-3-319-11259-6_21-1 · Cited by 43
Tensor Completion in Hierarchical Tensor Representations
Rauhut, H., Schneider, R., & Stojanac, Ž. (2015) · Applied and numerical harmonic analysis · doi:10.1007/978-3-319-16042-9_14 · Cited by 62
Self-citationLow-rank tensor methods for partial differential equations
Bachmayr, M. (2023) · Acta Numerica · doi:10.1017/s0962492922000125 · Cited by 113
Andreev, R., & Tobler, C. (2014) · Numerical Linear Algebra with Applications · doi:10.1002/nla.1951 · Cited by 41
“In [28, 29, 30, 31], other low rank tensor approaches for the solution of evolution equations are proposed.”
BackgroundGelß, P., Matera, S., & Schütte, C. (2016) · Journal of Computational Physics · doi:10.1016/j.jcp.2016.03.025 · Cited by 49
Parallel time-dependent variational principle algorithm for matrix product states
Secular, P., Gourianov, N., Lubasch, M., Dolgov, S., Clark, S. R., & Jaksch, D. (2020) · Physical Review B · doi:10.1103/physrevb.101.235123 · Cited by 40
“One of the most promising approaches is the time-dependent variational principle (TDVP) [31, 33–35], which has found widespread use in condensed matter physics, and which is beginning to find applications in quantum chemistry [38].”
BackgroundA tensor network view of multilayer multiconfiguration time-dependent Hartree methods
Larsson, H. R. (2024) · Molecular Physics · doi:10.1080/00268976.2024.2306881 · Cited by 53
“…, j 1 , j 2 , ... m , n SPF composite index J ≡ j 1 , j 2 , ... , j d κ 1, κ 2, ...κ l SHF composite index J κ λ ≡ j 1 , j 2 , ... , j κ λ − 1 , j κ λ + 1 , ... , j d κ 1, κ 2, ...κ l SPF tensor/site A l ; κ 1 , κ 2 , ...κ l − 1 ≡ A z (cid:6) A [ l ; κ ] , B κ , j κ , C κ , q , i q , χ [ l ;…”
Musharbash, E., & Nobile, F. (2017) · Journal of Computational Physics · doi:10.1016/j.jcp.2017.09.061 · Cited by 40
Projection Methods for Dynamical Low-Rank Approximation of High-Dimensional Problems
Kieri, E., & Vandereycken, B. (2018) · Computational Methods in Applied Mathematics · doi:10.1515/cmam-2018-0029 · Cited by 58
“One then gets ODEswhich determine the evolution of the parametrisation [20, 31].”
BackgroundSelf-citationMatrix product state formulation of the multiconfiguration time-dependent Hartree theory
Kurashige, Y. (2018) · The Journal of Chemical Physics · doi:10.1063/1.5051498 · Cited by 41
htucker – a matlab toolbox for tensors in hierarchical Tucker format
Kreßner, D., & Tobler, C. (2012) · Cited by 37
A Quasi-Conservative Dynamical Low-Rank Algorithm for the Vlasov Equation
Einkemmer, L. D., & Lubich, C. (2019) · SIAM Journal on Scientific Computing · doi:10.1137/18m1218686 · Cited by 43
“In a general mathematical setting, dynamical low-rank approximation has been studied in [21, 22, 29].”
BackgroundSelf-citationOn the approximation of high-dimensional differential equations in the hierarchical Tucker format
Arnold, A., & Jahnke, T. (2013) · BIT Numerical Mathematics · doi:10.1007/s10543-013-0444-2 · Cited by 36
“The same result has also been obtained with other techniques in [12] and [14].”
MethodResultInfluentialLow-Rank Tensor Learning with Discriminant Analysis for Action Classification and Image Recovery
Jia, C., Zhong, G., & Fu, Y. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8901 · Cited by 39
“…representation learning approaches have been proposed (Chen and Saad 2009; Koch and Lubich 2010; Haegeman et al. 2011; Holtz, Rohwedder, and Schneider 2012; Khoromskij, Oseledets, and Schneider 2012; Arnold and Jahnke 2012; Lubich et al. 2013; Uschmajew and Vandereycken 2013; Mu et al. 2013).”
BackgroundStudying dynamics in two-dimensional quantum lattices using tree tensor network states
Kloss, B., Reichman, D. R., & Lev, Y. B. (2020) · SciPost Physics · doi:10.21468/scipostphys.9.5.070 · Cited by 47
Einkemmer, L. D., Hu, J., & Ying, L. (2021) · SIAM Journal on Scientific Computing · doi:10.1137/21m1392772 · Cited by 57
A Low-Rank Algorithm for Weakly Compressible Flow
Einkemmer, L. D. (2019) · SIAM Journal on Scientific Computing · doi:10.1137/18m1185417 · Cited by 33
“In a general mathematical setting, dynamical low-rank approximation has been studied in [14, 15, 24].”
BackgroundGeometric Methods on Low-Rank Matrix and Tensor Manifolds
Uschmajew, A., & Vandereycken, B. (2020) · Springer eBooks · doi:10.1007/978-3-030-31351-7_9 · Cited by 64
“Most of the analysis was also extended to manifolds of fixed TT rank (as well as to Tucker and hierarchical) tensors in [60, 73] and to Hilbert spaces [83].”
MethodSelf-citationGauging tensor networks with belief propagation
Tindall, J., & Fishman, M. (2023) · SciPost Physics · doi:10.21468/scipostphys.15.6.222 · Cited by 95
Estimating a Few Extreme Singular Values and Vectors for Large-Scale Matrices in Tensor Train Format
Lee, N., & Cichocki, A. S. (2015) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/140983410 · Cited by 43
Ding, Z., Einkemmer, L. D., & Li, Q. (2021) · SIAM Journal on Numerical Analysis · doi:10.1137/20m1380788 · Cited by 32
“The application of the method in a general setting is studied in [26, 27, 40, 1], where both the matrix and the general tensor formats are investigated.”
A Randomized Tensor Train Singular Value Decomposition
Huber, B., Schneider, R., & Wolf, S. (2017) · Applied and numerical harmonic analysis · doi:10.1007/978-3-319-69802-1_9 · Cited by 28
“[26] the set of tensor with exact rank r forms a smooth manifold, allowing the application of Riemannian optimization techniques [27, 28] and dynamical low rank approximation [29, 30], see also the review article [12].”
MethodSelf-citationFunctional Tensor-Train Chebyshev Method for Multidimensional Quantum Dynamics Simulations
Soley, M. B., Bergold, P., Gorodetsky, A., & Batista, V. S. (2021) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c00941 · Cited by 41
Time-Dependent Variational Principle with Controlled Bond Expansion for Matrix Product States
Li, J.-W., Gleis, A., & von Delft, J. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.026401 · Cited by 62
Convergence of a Low-Rank Lie--Trotter Splitting for Stiff Matrix Differential Equations
Ostermann, A., Piazzola, C., & Walach, H. (2019) · SIAM Journal on Numerical Analysis · doi:10.1137/18m1177901 · Cited by 23
“There, the dynamical low-rank approximation to tensors of different formats, such as tensor trains [24], Tucker tensors [26] or hierarchical Tucker tensors [25] can be applied.”
BackgroundSuperfluid-to-Mott transition in a Bose-Hubbard ring: Persistent currents and defect formation
Kohn, L., Silvi, P., Gerster, M., Keck, M., Fazio, R., Santoro, G. E., & Montangero, S. (2020) · Physical Review A · doi:10.1103/physreva.101.023617 · Cited by 30
Approximation of High-Dimensional Rank One Tensors
Bachmayr, M., Dahmen, W., DeVore, R., & Grasedyck, L. (2013) · Constructive Approximation · doi:10.1007/s00365-013-9219-x · Cited by 23
Tensor Spaces and Hierarchical Tensor Representations
Hackbusch, W., & Schneider, R. (2014) · Lecture notes in computational science and engineering · doi:10.1007/978-3-319-08159-5_12 · Cited by 26
Self-citationA Hierarchical Tensor-Based Approach to Compressing, Updating and Querying Geospatial Data
Yuan, L., Yu, Z., Luo, W., Hu, Y. S., Feng, L., & Zhu, A. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2330829 · Cited by 22
“Hierarchical tensor representation has the property of coordinates-inde-pendence, and it has the inherited linkage between tensor algebra, calculus and partial differential equations [26].”
BackgroundCao, X., Lu, Y., Hansmann, P., & Haverkort, M. W. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.104.115119 · Cited by 35
Mendive‐Tapia, D., Meyer, H., & Vendrell, O. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c01089 · Cited by 23
Tensor Product Approximation (DMRG) and Coupled Cluster Method in Quantum Chemistry
Legeza, Ö., Rohwedder, T., Schneider, R., & Szalay, S. (2014) · Mathematical physics studies · doi:10.1007/978-3-319-06379-9_3 · Cited by 24
Self-citationA low-rank Lie-Trotter splitting approach for nonlinear fractional complex Ginzburg-Landau equations
Zhao, Y.-L., Ostermann, A., & Gu, X. (2021) · Journal of Computational Physics · doi:10.1016/j.jcp.2021.110652 · Cited by 22
“1), we suggest considering the dynamical tensor approximation proposed in [38, 39]; (iii) Design some fast implementations (e.”
BackgroundMissing Data Recovery Based on Tensor-CUR Decomposition
Wang, L., Xie, K., Semong, T., & Zhou, H. (2017) · IEEE Access · doi:10.1109/access.2017.2770146 · Cited by 21
“Tucker decomposition [31] is an unsupervised multiway data analysis method, and it can be considered as a high order principle component analysis.”
MethodBorrelli, R. (2018) · Chemical Physics · doi:10.1016/j.chemphys.2018.06.005 · Cited by 24
Dynamic tensor approximation of high-dimensional nonlinear PDEs
Dektor, A., & Venturi, D. (2021) · Journal of Computational Physics · doi:10.1016/j.jcp.2021.110295 · Cited by 32
Optimal High-Order Tensor SVD via Tensor-Train Orthogonal Iteration
Zhou, Y., Zhang, A. R., Zheng, L., & Wang, Y. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3152733 · Cited by 24
Adaptive Algorithms for Tracking Tensor-Train Decomposition of Streaming Tensors
Thanh, L. T., Abed‐Meraim, K., Trung, N. L., & Boyer, R. (2020) · European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco47968.2020.9287780 · Cited by 19
Adaptive Integration of Nonlinear Evolution Equations on Tensor Manifolds
Rodgers, A., Dektor, A., & Venturi, D. (2022) · Journal of Scientific Computing · doi:10.1007/s10915-022-01868-x · Cited by 18
“One method for the temporal integration of (2) on a smooth tensor manifold with constant rank [29,15] is dynamic tensor approximation [24,18,11,10].”
BackgroundMethodInfluentialJohnson, T. H., Elliott, T. J., Clark, S. R., & Jaksch, D. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.090602 · Cited by 21
Bonfanti, M., & Burghardt, I. (2018) · Chemical Physics · doi:10.1016/j.chemphys.2018.05.029 · Cited by 24
DYNAMICAL LOW-RANK APPROXIMATION FOR BURGERS' EQUATION WITH UNCERTAINTY
Kusch, J., Ceruti, G., Einkemmer, L. D., & Frank, M. (2022) · International Journal for Uncertainty Quantification · doi:10.1615/int.j.uncertaintyquantification.2022039345 · Cited by 18
Peng, J., Hu, D., Liu, H. S., Shi, Q., Bao, P., & Lan, Z. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0174416 · Cited by 17
Nearest-neighbor interaction systems in the tensor-train format
Gelß, P., Klus, S., Matera, S., & Schütte, C. (2017) · Journal of Computational Physics · doi:10.1016/j.jcp.2017.04.007 · Cited by 23
“One of the most promising tensor formats for these problems is the so-called tensor-train format (TT format) [14, 15, 16], a special case of the hierarchical Tucker Format [17, 18, 19, 20].”
BackgroundImportance of Appropriately Regularizing the ML-MCTDH Equations of Motion
Wang, H., & Meyer, H. (2021) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.0c11221 · Cited by 17
Accelerating the simulation of kinetic shear Alfvén waves with a dynamical low-rank approximation
Einkemmer, L. D. (2024) · Journal of Computational Physics · doi:10.1016/j.jcp.2024.112757 · Cited by 21
On the interconnection between the higher-order singular values of real tensors
Hackbusch, W., & Uschmajew, A. (2016) · Numerische Mathematik · doi:10.1007/s00211-016-0819-9 · Cited by 18
“This concerns stability of low-rankODE integrators [12,14], local convergence of optimization algorithms [20], or approximability by low-rank tensor formats [1], to name a few.”
BackgroundExistence of dynamical low-rank approximations to parabolic problems
Bachmayr, M., Eisenmann, H., Kieri, E., & Uschmajew, A. (2020) · Mathematics of Computation · doi:10.1090/mcom/3626 · Cited by 26
Nouy, A. (2019) · Numerische Mathematik · doi:10.1007/s00211-018-1017-8 · Cited by 19
DYNAMICS, NUMERICAL ANALYSIS, AND SOME GEOMETRY
Gauckler, L. J., Hairer, E., & Lubich, C. (2019) · International Congress of Mathematicians (ICM) · doi:10.1142/9789813272880_0020 · Cited by 24
Self-citationTensor Numerical Methods for High-dimensional PDEs: Basic Theory and Initial ApplicationsPreprint
Khoromskij, B. N. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.4053 · Cited by 14
“on. Further details can found in [69, 25, 36, 26]. Exposition of tensor methods based on the Dirack-Frenkel variational principle implemented on the Tucker and MPS/TT tensor manifolds can be found in [91, 92, 101] and references therein. Recently, the TNM were shown to be efficient for solving parameter dependent PDEs i…”
Kazashi, Y., Nobile, F., & Vidličková, E. (2020) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-mathicse-278402 · Cited by 15
Takahashi, H., & Borrelli, R. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00711 · Cited by 13
Sampling-free Bayesian inversion with adaptive hierarchical tensor representations
Eigel, M., Marschall, M., & Schneider, R. (2018) · Inverse Problems · doi:10.1088/1361-6420/aaa998 · Cited by 14
“In [43], the problem of quasi-optimal approximation on larger time-scales is explained.”
BackgroundSelf-citationBonfanti, M., Worth, G. A., & Burghardt, I. (2020) · Wiley eBooks · doi:10.1002/9781119417774.ch12 · Cited by 15
Ghahremani, B., & Babaee, H. (2024) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2024.117385 · Cited by 27
“T M M ∈ T The DLRA evolution equations for the Tucker tensor and tensor train models are presented in [8] and [34], respectively.”
BackgroundTensor-train WENO scheme for compressible flows
Danis, M. E., Truong, D. P., Boureima, I. D., Oleg Korobkin, A., Rasmussen, K. Ø., & Alexandrov, B. S. (2025) · Journal of Computational Physics · doi:10.1016/j.jcp.2025.113891 · Cited by 11
A dynamical low-rank approach to solve the chemical master equation for biological reaction networks
Prugger, M., Einkemmer, L. D., & Lopez, C. F. (2023) · Journal of Computational Physics · doi:10.1016/j.jcp.2023.112250 · Cited by 20
Incremental Nonnegative Tucker Decomposition with Block-Coordinate Descent and Recursive Approaches
Zdunek, R., & Fonał, K. (2022) · Symmetry · doi:10.3390/sym14010113 · Cited by 11
“Related Works Incremental versions of various tensor decomposition models have been extensively studied in the last decade, including online and incremental CP [52,53], online TT [54], dynamic approximation to HT [55], etc.”
BackgroundDorfner, M. F. X., Brey, D., Burghardt, I., & Ortmann, F. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00751 · Cited by 15
Collocation methods for nonlinear differential equations on low-rank manifolds
Dektor, A. (2024) · Linear Algebra and its Applications · doi:10.1016/j.laa.2024.11.001 · Cited by 27
“The number of degrees of freedom in a network depends on the chosen tensor format, e.g., tensor train (TT) [38], Tucker [34, 13], Hierarchical Tucker [22, 33, 23] or canonical polyadic (CP) [29], and the tensor rank.”
BackgroundStochastic resonance in vibrational polariton chemistry
Ke, Y. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0248419 · Cited by 14
Tensor train completion: Local recovery guarantees via Riemannian optimization
Budzinskiy, S., & Замарашкин, Н. Л. (2023) · Numerical Linear Algebra with Applications · doi:10.1002/nla.2520 · Cited by 10
“Similar bounds were obtained in [16] (Lemma 4.”
BackgroundMethodResultInfluentialTowards a polynomial algorithm for optimal contraction sequence of tensor networks from trees
Xu, J., Liang, L., Deng, L., Wen, C., Xie, Y., & Li, G. (2019) · Physical review. E · doi:10.1103/physreve.100.043309 · Cited by 15
Metadata
- Authors
- Lubich, C., Rohwedder, T., Schneider, R., & Vandereycken, B.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2013-01
- Volume
- 34
- Issue
- 2
- Pages
- 470-494
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2067067855
- Cited by
- 163
- References
- 31
- Citations by year
- 2026: 8 · 2025: 8 · 2024: 17 · 2023: 14 · 2022: 16 · 2021: 14 · 2020: 13 · 2019: 13 · 2018: 9 · 2017: 7 · 2016: 9 · 2015: 12 · 2014: 13 · 2013: 8
- FWCI
- 4.36
- Type
- journal article
- Language
- en
- Open access
- green
- infoscience.epfl.ch
- Locations
- SIAM Journal on Matrix Analysis and Applications (publishedVersion)
- Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion)
- Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
- Topics
- Physical Sciences › Mathematics › Computational Mathematics › Tensor decomposition and applications
- Physical Sciences › Mathematics › Numerical Analysis › Numerical Solvers for Ordinary Differential Equations
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Model Reduction and Neural Networks
- Keywords
- tensor train format, dynamical low-rank approximation, curvature estimates, optimization algorithms
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.