A New Scheme for the Tensor Representation
- First Online:
- Cite this article as:
- Hackbusch, W. & Kühn, S. J Fourier Anal Appl (2009) 15: 706. doi:10.1007/s00041-009-9094-9
- 1.1k Views
The paper presents a new scheme for the representation of tensors which is well-suited for high-order tensors. The construction is based on a hierarchy of tensor product subspaces spanned by orthonormal bases. The underlying binary tree structure makes it possible to apply standard Linear Algebra tools for performing arithmetical operations and for the computation of data-sparse approximations. In particular, a truncation algorithm can be implemented which is based on the standard matrix singular value decomposition (SVD) method.