Spectral Tensor-Train Decomposition
Name
Spectral tensor-train.pdf
Size
1009 KB
Format
Adobe PDF
Checksum (MD5)
73205b2fae8ed28f80b351c84dccca4e
Author(s)
Engsig-Karup, Allan P.
Bigoni, Daniele
Marzouk, Youssef M
Date Issued
August 2016
Journal
SIAM Journal on Scientific Computing
Publisher
Society for Industrial and Applied Mathematics
Citation
Bigoni, Daniele, Allan P. Engsig-Karup, and Youssef M. Marzouk. “Spectral Tensor-Train Decomposition.” SIAM Journal on Scientific Computing 38.4 (2016): A2405–A2439. © by SIAM
Version
Final published version
Abstract
The accurate approximation of high-dimensional functions is an essential task in uncertainty quantification and many other fields. We propose a new function approximation scheme based on a spectral extension of the tensor-train (TT) decomposition. We first define a functional version of the TT decomposition and analyze its properties. We obtain results on the convergence of the decomposition, revealing links between the regularity of the function, the dimension of the input space, and the TT ranks. We also show that the regularity of the target function is preserved by the univariate functions (i.e., the “cores'') comprising the functional TT decomposition. This result motivates an approximation scheme employing polynomial approximations of the cores. For functions with appropriate regularity, the resulting spectral tensor-train decomposition combines the favorable dimension-scaling of the TT decomposition with the spectral convergence rate of polynomial approximations, yielding efficient and accurate surrogates for high-dimensional functions. To construct these decompositions, we use the sampling algorithm \tt TT-DMRG-cross to obtain the TT decomposition of tensors resulting from suitable discretizations of the target function. We assess the performance of the method on a range of numerical examples: a modified set of Genz functions with dimension up to 100, and functions with mixed Fourier modes or with local features. We observe significant improvements in performance over an anisotropic adaptive Smolyak approach. The method is also used to approximate the solution of an elliptic PDE with random input data. The open source software and examples presented in this work are available online (http://pypi.python.org/pypi/TensorToolbox/).
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/15M1036919
