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

求解含不确定参数的稳态随机 Stokes-Darcy 耦合问题的新型集合域分解方法

New Ensemble Domain Decomposition Method for the Steady-state Random Stokes-Darcy Coupled Problems with Uncertain Parameters

Chunchi Liu, Yao Rong, Yizhong Sun, Jiaping Yu, Haibiao Zheng

AI总结:

针对随机水力传导系数和体积力下的稳态 Stokes-Darcy 耦合问题,提出 MC/MLMC 集合域分解算法,证明其最优收敛阶并通过数值实验验证效率。

摘要:

本文提出两种新颖的集合域分解方法,用于快速求解具有随机水力传导系数和体积力的 Stokes-Darcy 耦合模型。为处理此类随机系统,我们采用 Monte Carlo(MC)方法生成一组独立同分布的确定性模型样本。为便于快速计算这些样本,我们巧妙地将集合思想与域分解方法(DDM)相结合。该方法不仅允许多个线性问题共享一个标准系数矩阵,而且支持易用、便捷的并行计算。通过选择合适的 Robin 参数,我们严格证明所提算法具有依赖网格和不依赖网格的收敛率。对于要求不依赖网格收敛的情形,我们还给出优化的 Robin 参数,以实现最优收敛率。我们进一步采用 multi-level Monte Carlo(MLMC)方法,显著降低概率空间中的计算成本,因为当网格变细时,样本数量会快速下降。基于这些发现,我们提出两种专门面向随机模型的新颖算法:MC ensemble DDM 和 MLMC ensemble DDM。此外,我们严格给出两种算法的最优收敛阶。最后,我们给出若干组数值实验,以展示算法的效率。

英文摘要:

This paper presents two novel ensemble domain decomposition methods for fast-solving the Stokes-Darcy coupled models with random hydraulic conductivity and body force. To address such random systems, we employ the Monte Carlo (MC) method to generate a set of independent and identically distributed deterministic model samples. To facilitate the fast calculation of these samples, we adroitly integrate the ensemble idea with the domain decomposition method (DDM). This approach not only allows multiple linear problems to share a standard coefficient matrix but also enables easy-to-use and convenient parallel computing. By selecting appropriate Robin parameters, we rigorously prove that the proposed algorithm has mesh-dependent and mesh-independent convergence rates. For cases that require mesh-independent convergence, we additionally provide optimized Robin parameters to achieve optimal convergence rates. We further adopt the multi-level Monte Carlo (MLMC) method to significantly lower the computational cost in the probability space, as the number of samples drops quickly when the mesh becomes finer. Building on our findings, we propose two novel algorithms: MC ensemble DDM and MLMC ensemble DDM, specifically for random models. Furthermore, we strictly give the optimal convergence order for both algorithms. Finally, we present several sets of numerical experiments to showcase the efficiency of our algorithm.

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

↑