Tensor Networks and Hierarchical Tensors for the Solution of High-Dimensional Partial Differential Equations

Hierarchical tensors can be regarded as a generalisation, preserving many crucial features, of the singular value decomposition to higher-order tensors. for a given tensor product space, a recursive decomposition of the set of coordinates into a dimension tree gives a hierarchy of nested subspaces and corresponding nested bases. the dimensions of these subspaces yield a notion of multilinear rank. this rank tuple, as well as quasi-optimal low-rank approximations by rank truncation, can be obtained by a hierarchical singular value decomposition. for fixed multilinear ranks, the storage and operation complexity of these hierarchical representations scale only linearly in the order of the tensor. as in the matrix case, the set of hierarchical tensors of a given multilinear rank is not a convex set, but forms an open smooth manifold. a number of techniques for the computation of hierarchical low-rank approximations have been developed, including local optimisation techniques on riemannian manifolds as well as truncated iteration methods, which can be applied for solving high-dimensional partial differential equations. this article gives a survey of these developments. we also discuss applications to problems in uncertainty quantification, to the solution of the electronic schrödinger equation in the strongly correlated regime, and to the computation of metastable states in molecular dynamics.