arrow
Return

SPECTRAL TENSOR-TRAIN DECOMPOSITION

delete2016-01-01
delete87
delete
OA
AI
D
Daniele Bigoni *
A
Allan Peter Engsig‐Karup
Y
Youssef Marzouk
DOI:10.1137/15M1036919delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
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-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.
Keywords:
approximation theory
tensor-train decomposition
orthogonal polynomials
uncertainty quantification
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

SIAM Journal on Scientific Computing cover
SIAM Journal on Scientific Computing
IF:
2.6
Papers:
5.1K
Citations:
1.8W

Organization

T
technical university of denmark
Scholars:
2.6W
Papers: 2.8W
Citations: 37
Cited Papers

Cited Papers

Risk factors for involuntary admission in a Romanian patient sample
err2023-11-01
err0
errOAAI
errRadu-Mihai Păun; Alexandru Neculai Pavel; Valentin Petre Matei; Cătălina Tudose
errShare
errSave
Genetic Counseling and Screening of Consanguineous Couples and Their Offspring: Recommendations of the National Society of Genetic Counselors
err2002-12-29
err0
errOAAI
errRobin L. Bennett; Arno G. Motulsky; Alan Bittles; Louanne Hudgins; Stefanie Uhrich; Debra Lochner Doyle; Kerry Silvey; C. Ronald Scott; Edith Cheng; Barbara McGillivray; Robert D. Steiner; Debra Olson
errShare
errSave
err2000-01-01
err0
PREAI
errEliska Rejmánková; Jaroslava Komárková
errShare
errSave
Tensor Decompositions and Applications
err2009-08-05
err7.5K
PREAI
errKolda, Tamara G.; Bader, Brett W.
errShare
errSave
HALO384: A Halo-Based Potency Prediction Algorithm for High-Throughput Detection of Antimicrobial Agents
err2010-02-01
err0
errOAAI
errMarcos H. Woehrmann; Nadine C. Gassner; Walter M. Bray; Joshua M. Stuart; Scott Lokey
errShare
errSave
Sparse pseudospectral approximation method
err2012-07-01
err156
errOAAI
errConstantine, Paul G.; Eldred, Michael S.; Phipps, Eric T.
errShare
errSave
researcher View more