MiS Preprint Repository

We derive and analyse a scheme for the approximation of order $d$ tensors $A\in {\mathbb{R}}^{n\times \cdots \times n}$ in the hierarchical ($\mathcal{H}$-) Tucker format, a dimension-multilevel variant of the Tucker format and strongly related to the TT format. For a fixed rank parameter $k$, the storage complexity of a tensor in $\mathcal{H}$-Tucker format is $\mathcal{O}(d{k}^3+dnk)$ and we present a (heuristic) algorithm that finds an approximation to a tensor in the $\mathcal{H}$-Tucker format in $\mathcal{O}(d{k}^4+d\log (d)n{k}^2)$ by inspection of only $\mathcal{O}(d{k}^3+d\log (d)n{k}^2)$ entries. Under mild assumptions, tensors in the $\mathcal{H}$-Tucker format are reconstructed.

For general tensors we derive error bounds that are based on the approximability of matrices (matricizations of the tensor) by few outer products of its rows and columns. The construction parallelizes with respect to the order $d$ and we also propose an adaptive approach that aims at finding the rank parameter for a given target accuracy $\epsilon$ automatically.