Rank-adaptive time integration of tree tensor networks
From MaRDI portal
Numerical methods for initial value problems involving ordinary differential equations (65L05) Stability and convergence of numerical methods for ordinary differential equations (65L20) Error bounds for numerical methods for ordinary differential equations (65L70) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05)
Abstract: A rank-adaptive integrator for the approximate solution of high-order tensor differential equations by tree tensor networks is proposed and analyzed. In a recursion from the leaves to the root, the integrator updates bases and then evolves connection tensors by a Galerkin method in the augmented subspace spanned by the new and old bases. This is followed by rank truncation within a specified error tolerance. The memory requirements are linear in the order of the tensor and linear in the maximal mode dimension. The integrator is robust to small singular values of matricizations of the connection tensors. Up to the rank truncation error, which is controlled by the given error tolerance, the integrator preserves norm and energy for Schrodinger equations, and it dissipates the energy in gradient systems. Numerical experiments with a basic quantum spin system illustrate the behavior of the proposed algorithm.
Cited in
(2)
This page was built for publication: Rank-adaptive time integration of tree tensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6389129)
