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

随机椭圆本征值问题II的多层拟蒙特卡罗方法:有效算法和数值结果

Multilevel quasi-Monte Carlo for random elliptic eigenvalue problems II: Efficient algorithms and numerical results

Alexander D. Gilbert, Robert Scheichl

摘要:

随机偏微分方程本征值问题经常出现在不确定性量化领域,人们试图量化本征值或其本征函数中的不确定性。本文提出了一种计算随机系数椭圆本征值问题最小特征值期望的高效多层拟蒙特卡罗方法(MLQMC)。每个样本评估都需要求解PDE本征值问题,因此在实践中解决这个问题在计算上是非常困难的。我们从四个方面加快了这个期望值的逼近速度:我们使用一个多层次的方差缩减方案,将工作分散到一个层次的有限元网格和截断维上;我们使用QMC方法,有效地计算每一层上的期望值;我们利用参数空间的光滑性,并重用附近QMC点的特征向量,以减少特征值求解器的迭代次数;我们利用两个网格离散计划,以获得一个单一的线性求解的细网格上的特征值。一个基本的MLQMC算法的完整误差分析在配套文件[Gilbert and Scheichl,2022]中给出,因此本文中,我们专注于如何进一步提高效率,并提供理论上的理由,使用附近的QMC点和两个网格的方法。数值结果表明,我们的算法的效率,也表明,我们采用的四种策略是互补的。

英文摘要:

Stochastic PDE eigenvalue problems often arise in the field of uncertainty quantification, whereby one seeks to quantify the uncertainty in an eigenvalue, or its eigenfunction. In this paper we present an efficient multilevel quasi-Monte Carlo (MLQMC) algorithm for computing the expectation of the smallest eigenvalue of an elliptic eigenvalue problem with stochastic coefficients. Each sample evaluation requires the solution of a PDE eigenvalue problem, and so tackling this problem in practice is notoriously computationally difficult. We speed up the approximation of this expectation in four ways: we use a multilevel variance reduction scheme to spread the work over a hierarchy of FE meshes and truncation dimensions; we use QMC methods to efficiently compute the expectations on each level; we exploit the smoothness in parameter space and reuse the eigenvector from a nearby QMC point to reduce the number of iterations of the eigensolver; and we utilise a two-grid discretisation scheme to obtain the eigenvalue on the fine mesh with a single linear solve. The full error analysis of a basic MLQMC algorithm is given in the companion paper [Gilbert and Scheichl, 2022], and so in this paper we focus on how to further improve the efficiency and provide theoretical justification for using nearby QMC points and two-grid methods. Numerical results are presented that show the efficiency of our algorithm, and also show that the four strategies we employ are complementary.

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

↑