arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.2647math.NAcs.NA
收藏

一种用于具有随机输入数据的偏微分方程的多级随机摄动法

A Multilevel Stochastic Collocation Method for Partial Differential Equations with Random Input Data

Florida State University(佛罗里达州立大学);University of Tennessee(田纳西大学);Oak Ridge National Laboratory(橡树岭国家实验室)

Aretha L. Teckentrup, Peter Jantsch, Clayton G. Webster, Max Gunzburger

AI总结:

本文提出并分析了一种多级随机摄动法,通过空间近似层次结构降低计算复杂度,利用多维插值提高解的统计估计和高阶替代模型的收敛速度。

摘要:

随机摄动法用于近似具有随机输入数据(如系数和源项)的偏微分方程解时,会遭受维度诅咒,即随机维度增加会导致计算成本激增。本文提出并分析了一种多级随机摄动法,通过空间近似层次结构降低总体计算复杂度。此外,本文提出的方法利用一系列多维插值器,以提高解的统计估计和高阶替代模型的收敛速度。本文提供了新多级随机摄动法的严谨收敛性和计算成本分析,证明其相较于标准单级随机摄动法和MLMC方法的优势。数值结果展示了理论和新多级方法的有效性。

英文摘要:

Stochastic collocation methods for approximating the solution of partial differential equations with random input data (e.g., coefficients and forcing terms) suffer from the curse of dimensionality whereby increases in the stochastic dimension cause an explosion of the computational effort. We propose and analyze a multilevel version of the stochastic collocation method that, as is the case for multilevel Monte Carlo (MLMC) methods, uses hierarchies of spatial approximations to reduce the overall computational complexity. In addition, our proposed approach utilizes, for approximation in stochastic space, a sequence of multi-dimensional interpolants of increasing fidelity which can then be used for approximating statistics of the solution as well as for building high-order surrogates featuring faster convergence rates. A rigorous convergence and computational cost analysis of the new multilevel stochastic collocation method is provided, demonstrating its advantages compared to standard single-level stochastic collocation approximations as well as MLMC methods. Numerical results are provided that illustrate the theory and the effectiveness of the new multilevel method.

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

↑