稀疏近似多线性问题及其在不确定性量化中基于核的方法的应用
Sparse approximation of multilinear problems with applications to kernel-based methods in UQ
AI总结:
本文提出稀疏近似多线性问题的框架,展示其在不确定性量化中的应用,通过改进的Smolyak算法减少高维问题的维度诅咒,并通过数值实验验证。
摘要:
我们提供了一个用于多线性问题稀疏近似的框架,并展示了几种不确定性量化中的问题可以纳入此框架。在这些问题中,需要使用不同精度和计算工作量的参数近似来近似多线性映射的值。我们提出并分析了Smolyak算法的推广版本,该算法提供了具有收敛率的稀疏近似公式,以减轻多线性近似问题中大量参数带来的维度诅咒。我们应用该通用框架,使用基于核的近似方法对参数偏微分方程的响应面近似和优化进行不确定性分析。理论结果通过数值实验加以补充。
英文摘要:
We provide a framework for the sparse approximation of multilinear problems and show that several problems in uncertainty quantification fit within this framework. In these problems, the value of a multilinear map has to be approximated using approximations of different accuracy and computational work of the arguments of this map. We propose and analyze a generalized version of Smolyak's algorithm, which provides sparse approximation formulas with convergence rates that mitigate the curse of dimension that appears in multilinear approximation problems with a large number of arguments. We apply the general framework to response surface approximation and optimization under uncertainty for parametric partial differential equations using kernel-based approximation. The theoretical results are supplemented by numerical experiments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。