arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1405.5713math.NAcs.NA
收藏

谱张量-列车分解

Spectral tensor-train decomposition

Technical University of Denmark(丹麦技术大学);Massachusetts Institute of Technology(麻省理工学院)

Daniele Bigoni, Allan P. Engsig-Karup, Youssef M. Marzouk

AI总结:

本文提出基于张量-列车分解的谱扩展方法,用于高维函数的近似,结合TT分解的维度扩展性和多项式逼近的谱收敛性,提升高维函数的逼近效率与精度。

摘要:

高维函数的准确近似是不确定性量化及其他许多领域中的关键任务。本文提出了一种基于张量-列车(TT)分解的谱扩展方法,用于高维函数的近似。我们首先定义了函数版本的TT分解并分析其性质。我们获得了分解收敛性的结果,揭示了函数的正则性、输入空间的维度以及TT秩之间的联系。我们还证明了目标函数的正则性由构成函数TT分解的单变量函数(即“核心”)保持。这一结果促使了一种利用核心函数的多项式近似来构建近似方案的方法。对于具有适当正则性的函数,所得到的谱张量-列车分解结合了TT分解有利的维度扩展性与多项式近似的谱收敛性,从而为高维函数提供了高效且精确的替代模型。为了构建这些分解,我们使用采样算法TT-DMRG-cross来获得由合适离散化目标函数得到的张量的TT分解。我们在一系列数值示例中评估了该方法的性能:具有高达100维的修改后的Genz函数,以及具有混合傅里叶模式或局部特征的函数。我们观察到该方法在各向异性自适应Smolyak方法上的显著改进。该方法还被用于近似具有随机输入数据的椭圆偏微分方程的解。本文中展示的开源软件和示例可在网络上获得。

英文摘要:

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 \textit{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 \texttt{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 modifed 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑