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

学习非线性FETI-DP方法中的自适应约束

Learning Adaptive Constraints in Nonlinear FETI-DP Methods

Axel Klawonn, Martin Lanser, Janine Weber

AI总结:

针对非线性FETI-DP方法,本文利用神经网络预测自适应粗空间约束,数值实验证明其能同时提升非线性和线性收敛速度。

摘要:

线性FETI-DP(有限元撕裂与互联-双原始)方法是求解离散化线性偏微分方程的高效迭代区域分解求解器,而非线性FETI-DP则是其在非线性情形下的自然推广。在这两种方法中,并行效率源于将计算域分解为不重叠的子域,并由此实现计算工作的局部化。为了获得线性FETI-DP方法的快速线性收敛,需要考虑全局粗问题。自适应粗空间被证明对于许多复杂的微非均匀问题(例如扩散系数具有大跳跃的稳态扩散问题)是稳健的变体。不幸的是,自适应粗空间的建立和精确计算在计算上非常昂贵。因此,最近,基于神经网络的替代模型被训练来直接预测自适应粗约束。本文将学习到的约束应用于非线性FETI-DP,并通过数值实验表明,它们能够提高非线性FETI-DP的非线性和线性收敛速度。

英文摘要:

While linear FETI-DP (Finite Element Tearing and Interconnecting - Dual Primal) is an efficient iterative domain decomposition solver for discretized linear PDEs (partial differential equations), nonlinear FETI-DP is its consequent extension to the nonlinear case. In both methods, the parallel efficiency of the method results from a decomposition of the computational domain into nonoverlapping subdomains and a resulting localization of the computational work. For a fast linear convergence of the linear FETI-DP method, a global coarse problem has to be considered. Adaptive coarse spaces are provably robust variants for many complicated micro-heterogeneous problems, as, for example, stationary diffusion problems with large jumps in the diffusion coefficient. Unfortunately, the set-up and exact computation of adaptive coarse spaces is known to be computationally expensive. Therefore, recently, surrogate models based on neural networks have been trained to directly predict the adaptive coarse constraints. Here, these learned constraints are implemented in nonlinear FETI-DP and it is shown numerically that they are able to improve the nonlinear as well as linear convergence speed of nonlinear FETI-DP.

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

↑