|Preprint-No.:||< 367 >||Published in:||June 2013||PDF-File:||IGPM367_k.pdf|
|Title:||Tree Adaptive Approximation in the Hierarchical Tensor Format|
|Authors:||Jonas Ballani, Lars Grasedyck|
The hierarchical tensor format allows for the low-parametric representation of tensors even in high dimensions d. The efficiency of this representation strongly relies on an appropriate hierarchical splitting of the different directions 1,...,d such that the associated ranks remain sufficiently small. This splitting can be represented by a binary tree which is usually assumed to be given. In this paper, we address the question of finding an appropriate tree from a subset of tensor entries without any a priori knowledge on the tree structure. We propose an agglomerative strategy that can be combined with rank-adaptive cross approximation techniques such that tensors can be approximated in the hierarchical format in an entirely black box way. Numerical examples illustrate the potential and the limitations of our approach.
|Keywords:||hierarchical tensor format, hierarchical Tucker format, tensor train, matrix product states, black box approximation, tree adaptivity|
|Publication:||SIAM journal on scientific computing 36(4), |
|Corresponding author:||Jonas Ballani|