Journal
COMPUTING AND VISUALIZATION IN SCIENCE
Volume 15, Issue 6, Pages 331-344Publisher
SPRINGER
DOI: 10.1007/s00791-014-0218-7
Keywords
Cross approximation; Skeleton decomposition; Tensor chain format; Singular value decomposition
Categories
Ask authors/readers for more resources
This paper deals with the approximation of ddimensional tensors, as discrete representations of arbitrary functions f(x(1),..., x(d)) on [0, 1](d), in the so-called tensor chain format. The main goal of this paper is to show that the construction of a tensor chain approximation is possible using skeleton/ cross approximation type methods. The complete algorithm is described, computational issues are discussed in detail and the complexity of the algorithm is shown to be linear in d. Some numerical examples are given to validate the theoretical results.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available