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
Items 101–164 of 164
Time dependent variational principle for tree Tensor Networks
Bauernfeind, D., & Aichhorn, M. (n.d.) · TUGraz OPEN Library (Graz University of Technology) · Cited by 10
A low-rank complexity reduction algorithm for the high-dimensional kinetic chemical master equation
Einkemmer, L. D., Mangott, J., & Prugger, M. (2024) · Journal of Computational Physics · doi:10.1016/j.jcp.2024.112827 · Cited by 14
Dynamical low-rank approximation to the solution of parabolic differential equations
Conte, D. (2020) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2020.05.011 · Cited by 12
Solution of high dimensional transient Fokker-Planck equations by tensor decomposition
Sun, Y., & Kumar, M. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170941 · Cited by 8
“The dynamic low rank approximation methods [14], [15] were also developed to solve FPE where the approximation manifold is held fixed for all time.”
Dynamical low‐rank approximations of solutions to the Hamilton–Jacobi–Bellman equation
Eigel, M., Schneider, R., & Sommer, D. (2022) · Numerical Linear Algebra with Applications · doi:10.1002/nla.2463 · Cited by 18
“It is important to note that even for fixed rank r, a decomposition of the form (10) is not unique.”
BackgroundSelf-citationGelin, M. F., & Borrelli, R. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00590 · Cited by 10
Thanh, L. T., Abed‐Meraim, K., Trung, N. L., & Hafiane, A. (2023) · Signal Processing · doi:10.1016/j.sigpro.2023.109297 · Cited by 8
“In [9, 10, 11], Lubich et al. introduced some dynamical tensor approximation methods under TT format for factorizing time-varying tensors, thanks to the Dirac–Frenkel-McLachlan variational principle.”
Thermal Radiation Transport with Tensor Trains
Gorodetsky, A., Mullen, P. D., Deshpande, A., Dolence, J. C., Meyer, C., Miller, J. M., & Roberts, L. F. (2025) · The Astrophysical Journal · doi:10.3847/1538-4357/adda3f · Cited by 15
“We contrast these types of approaches with those that propagate the tensor factors directly through equations separately via specifically tailored numerical methods (Koch & Lubich 2007; Lubich et al. 2013; Ceruti et al. 2022; Dektor & Venturi 2021) to combine them.”
Encoding a Many-Body Potential Energy Surface into a Grid-Based Matrix Product Operator
Hino, K., & Kurashige, Y. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00046 · Cited by 7
Liu, S., Peng, J., Bao, P., Shi, Q., & Lan, Z. (2024) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.4c00322 · Cited by 9
Khoromskaia, V., & Khoromskij, B. N. (2021) · Computational Mathematics and Mathematical Physics · doi:10.1134/s0965542521050110 · Cited by 5
Yang, C., & Wang, H. (2020) · Entropy · doi:10.3390/e22101099 · Cited by 7
“There is also a special skewed tree structure called the tensor train format in mathematics and the matrix-product states in physics [54].”
BackgroundWahyutama, I. S., & Larsson, H. R. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c01185 · Cited by 8
Low-Rank Representation of Tensor Network Operators with Long-Range Pairwise Interactions
Lin, L., & Tong, Y. (2021) · SIAM Journal on Scientific Computing · doi:10.1137/19m1287067 · Cited by 8
Resource Optimization for Quantum Dynamics with Tensor Networks: Quantum and Classical Algorithms
Dwivedi, A., Lopez-Ruiz, M. A., & Iyengar, S. S. (2024) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.4c03407 · Cited by 6
Schrader, S. E., Pedersen, T. B., & Kvaal, S. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0247732 · Cited by 9
Aramthottil, A. S., Das, D., Das, S., & Dey, B. (2023) · SciPost Physics Core · doi:10.21468/scipostphyscore.6.1.021 · Cited by 8
“And the time-evolution in the OTOC was done using the recently developed time-dependent variational principle (TDVP)[44–46].”
Ding, Z., Einkemmer, L. D., & Li, Q. (2019) · arXiv (Cornell University) · Cited by 7
Li, T., Precup, D., & Rabusseau, G. (2022) · Machine Learning · doi:10.1007/s10994-022-06164-1 · Cited by 22
“…to model many-body systems (Orús 2014; Biamonte and Bergholm 2017) and have also been used in numerical analysis as a mean to solve high-dimensional differential equations (Oseledets 2011; Lubich et al., 2013) and to design efficient algorithms for big data analytics (Cichocki et al., 2016).”
Nonlinear model reduction for transport-dominated problems
Hesthaven, J. S., Peherstorfer, B., & Unger, B. (2026) · Acta Numerica · doi:10.1017/s0962492926100294 · Cited by 26
Zheng, J., Xie, Y. Y., Peng, J., Han, Z., & Lan, Z. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0240580 · Cited by 4
Gavrilyuk, I. P., & Khoromskij, B. N. (2018) · Computational Methods in Applied Mathematics · doi:10.1515/cmam-2018-0021 · Cited by 5
Kazashi, Y., Nobile, F., & Vidličková, E. (2021) · Numerische Mathematik · doi:10.1007/s00211-021-01241-4 · Cited by 21
“An extension to tensor differential equations was proposed in [25, 31].”
BackgroundThree Lagrangians for the complete-active space coupled-cluster method
Kvaal, S. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0148988 · Cited by 4
“Many manifolds M of interest are also parameterized locally with coordinates having redundancies, a statement true for both the Hartree–Fock and MPS examples [28, 32].”
BackgroundRandomized methods for dynamical low-rank approximation
Carrel, B. (2025) · Journal of Computational Physics · doi:10.1016/j.jcp.2025.114421 · Cited by 2
“Many of these methods have natural extensions to higher-dimensional problems with imposed tensor structures such as Tucker, tensor trains (or matrix product states) and tree tensor networks, see for example [KL10, LRSV13, LVW18, CL20, CL22, CLS23, GB24, EMP24, CKLS24].”
Introduction to modeling radical pair quantum spin dynamics with tensor networks
Hino, K., Frantzov, D., Kurashige, Y., & Antill, L. M. (2026) · The Journal of Chemical Physics · doi:10.1063/5.0314129 · Cited by 3
A space-time adaptive low-rank method for high-dimensional parabolic partial differential equations
Bachmayr, M., & Faldum, M. (2024) · Journal of Complexity · doi:10.1016/j.jco.2024.101839 · Cited by 2
Reducing uncertainty of dynamic heterogeneous information networks: a fusing reconstructing approach
Yang, N., He, L., Li, Z., & Yu, P. S. (2017) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-017-0492-3 · Cited by 2
Ubiquitous Nature of the Reduced Higher Order SVD in Tensor-Based Scientific Computing
Khoromskaia, V., & Khoromskij, B. N. (2022) · Frontiers in Applied Mathematics and Statistics · doi:10.3389/fams.2022.826988 · Cited by 5
Lubich, C. (2014) · Lecture notes in computational science and engineering · doi:10.1007/978-3-319-08159-5_19 · Cited by 3
“The set of HT tensors for which all the transfer 3-tensors are of full Tucker rank, forms a manifold that has been studied by Uschmajew and Vandereycken [35].”
MethodSelf-citationA projector-splitting integrator for dynamical low-rank approximationPreprint
Lubich, C., & Oseledets, I. V. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.1058 · Cited by 2
“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-citationStreaming Tensor-Train Decomposition with Missing DataPreprint
Thanh, L. T., Abed‐Meraim, K., Trung, N. L., & Hafiane, A. (2022) · doi:10.36227/techrxiv.20141156.v1 · Cited by 2
An optimization approach for dynamical Tucker tensor approximation
Exl, L. (2019) · Results in Applied Mathematics · doi:10.1016/j.rinam.2019.100002 · Cited by 1
“gher order methods can be composed, where a second order example is given. In forthcoming work the approach can be extended to the hierarchical Tucker format and tensor trains (matrix product states) [20]. Acknowledgments Financial support by the Austrian Science Fund (FWF) via the SFB "ViCoM" (grant F41) an…”
BackgroundBachmayr, M., Eisenmann, H., & Uschmajew, A. (2025) · Numerische Mathematik · doi:10.1007/s00211-025-01465-8 · Cited by 6
“In this case, various low-rank models are possible, notably those based on tree tensor networks [1, 21, 26].”
A hierarchical wavepacket propagation framework via ML-MCTDH for molecular reaction dynamics
Zhang, X., & Meng, Q. (2025) · Physical Chemistry Chemical Physics · doi:10.1039/d5cp02270c · Cited by 4
A Tensor Decomposition Algorithm for Large ODEs with Conservation Laws
Dolgov, S. (2018) · Computational Methods in Applied Mathematics · doi:10.1515/cmam-2018-0023 · Cited by 42
“operty: though there are other time integration methods in tensor formats maintaining the second norm (see e.g. the KSL technique below), linear functions of the solution typically face an error O(εt)[26, 35]. In particular, we compare the new approach with the traditional Crank-Nicolson scheme. One step reads (I−δt 2…”
BackgroundMethodTensor-Based Data-Driven Identification of Partial Differential Equations
Lin, W., Lu, X., & Zhang, L. (2024) · Journal of Computational and Nonlinear Dynamics · doi:10.1115/1.4065691 · Cited by 2
One-Dimensional Tensor Network Recovery
Chen, Z., Lu, J., & Zhang, A. R. (2024) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/23m159888x · Cited by 5
A Parallel Basis Update and Galerkin Integrator for Tree Tensor Networks
Ceruti, G., Kusch, J., Lubich, C., & Sulz, D. (2026) · SIAM Journal on Scientific Computing · doi:10.1137/24m1714502 · Cited by 12
Self-citationMolecular Movie of Ultrafast Singlet Exciton Fission
Alvertis, A. M. (2021) · Springer theses · doi:10.1007/978-3-030-85454-6_8 · Cited by 1
Finite-temperature dynamics of low-dimensional quantum systems with DMRG methods
Tiegel, A. C. (2016) · eDiss (Georg-August-Universität Göttingen) · doi:10.53846/goediss-5809 · Cited by 1
Tensor-generated fractals: Using tensor decompositions for creating self-similar patternsPreprint
Gelß, P., & Schütte, C. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.00814 · Cited by 4
Dunnett, A. (2021) · theses.fr (ABES) · doi:10.70675/3927c2f9z4cf1z4b37z820czca146f250d56 · Cited by 1
Alternating minimal energy approach to ODEs and conservation laws in tensor product formatsPreprint
Dolgov, S. (2014) · arXiv (Cornell University)
Low-rank tensor learning for human action recognition
Jia, C. (2016) · Digital Repository Service (Northeastern University) · doi:10.17760/d20211575
Li, W., Ren, J., & Shuai, Z. (2019) · arXiv (Cornell University)
Nonlinear Evolution Equations: Analysis and Numerics
Hochbruck, M., Koch, H., Oh, S., & Ostermann, A. (2020) · Oberwolfach Reports · doi:10.4171/owr/2019/5
Liu, Y., Liu, J., Long, Z., & Zhu, C. (2021) · Springer eBooks · doi:10.1007/978-3-030-74386-4_2
Thanh, L. T., Abed‐Meraim, K., Trung, N. L., & Hafiane, A. (2022) · doi:10.36227/techrxiv.20141156
Hierarchical Tucker Tensor Regression: A Case Study on Classification
Tran, N. Q. (2022) · Lecture notes in networks and systems · doi:10.1007/978-3-031-18344-7_11
Report on scipost_202206_00022v1
(2022) · SciPost Physics Core · doi:10.21468/scipost.report.5587
Report on scipost_202206_00022v1
(2022) · SciPost Physics Core · doi:10.21468/scipost.report.5401
Report on scipost_202206_00022v1
(2022) · SciPost Physics Core · doi:10.21468/scipost.report.5369
Thanh, L. T., Abed‐Meraim, K., Trung, N. L., & Hafiane, A. (2023) · doi:10.36227/techrxiv.20141156.v2
Tindall, J., & Fishman, M. (2023) · SciPost Physics · doi:10.21468/scipost.report.7931
Tindall, J., & Fishman, M. (2023) · SciPost Physics · doi:10.21468/scipost.report.7878
Encording a Many-body Potential Energy Surface into a Grid-Based Matrix Product OperatorPreprint
Hino, K., & Kurashige, Y. (2024) · ChemRxiv · doi:10.26434/chemrxiv-2024-mrsk2
Chen, C. (2024) · Synthesis lectures on mathematics and statistics · doi:10.1007/978-3-031-54505-4_1
Riemannian optimization on tree tensor networks with application in machine learning
Willner, M., Trenti, M., & Lebiedz, D. (2026) · Linear Algebra and its Applications · doi:10.1016/j.laa.2026.09.019 · Cited by 4
Spectral homogenization of the radiative transfer equation via low-rank tensor train decomposition
Ju, Y. S. (2026) · Journal of Quantitative Spectroscopy and Radiative Transfer · doi:10.1016/j.jqsrt.2026.109926 · Cited by 1
“The mathematical foundations were laid by Koch and Lubich [7], who introduced dynamical low-rank approximation (DLRA) for matrix differential equations, later extended to tensor-train and hierarchical Tucker formats by Lubich et al. [8].”
Signal and image data stream analytics : from subspace to tensor tracking
Le, T. T. (2022) · theses.fr (ABES) · doi:10.70675/76d32e2bzcafcz4c95zb726z3ad907172989
梁茂林, Dai, L. F., Zhao, R., & Li, Q. (2026) · Journal of Scientific Computing · doi:10.1007/s10915-026-03441-2
“Furthermore, it is worth investigating other tensor decomposition techniques, such as hierarchical Tucker (HT) [66, 67] or quantized tensor-train (QTT) [68, 69], to improve the efficiency of the proposed method.”
Grid-based Estimation with Dynamic Rank-Preserving Hierarchical Tucker Decomposition
Gehlen, J., Govaers, F., Duník, J., & Koch, W. (2026) · International Conference on Information Fusion (FUSION) · doi:10.23919/fusion67272.2026.11726541
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.