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

谱子结构两层区域分解方法

Spectral substructured two-level domain decomposition methods

Gabriele Ciaramella, Tommaso Vanzan

摘要:

两层区域分解(DD)方法是数值解偏微分方程(PDE)的有效方法。两级区域分解方法需要两个主要部分:一级预处理器(或其对应的平滑迭代法),其基于区域分解技术;以及粗校正步骤,其依赖于粗空间。粗空间必须适当地表示所选择的一级方法不能处理的误差分量。在文献中,大多数的作品介绍了有效的粗空间,作为所考虑的PDE的整个空间域上定义的函数的跨度。因此,相应的两层预条件和迭代法被定义在体积上。本文介绍了一类新的子结构两层方法,它的区域分解平滑器和粗校正步骤都定义在界面(或骨架)上。这种方法有几个优点。一方面,所需的计算工作量是便宜的,比经典的体积两个层次的方法所需的。另一方面,它允许人们使用一些著名的有效的粗空间在文献中提出。在详细分析新的子结构方法的同时,我们给出了一个新的两层迭代法的收敛性分析,它涵盖了所提出的子结构框架。此外,我们使用深度神经网络从理论和数值上研究了粗糙空间的渐近最优性。数值实验证明了所提出的新的数值框架的有效性。

英文摘要:

Two-level domain decomposition (DD) methods are very powerful techniques for the efficient numerical solution of partial differential equations (PDEs). A two-level domain decomposition method requires two main components: a one-level preconditioner (or its corresponding smoothing iterative method), which is based on domain decomposition techniques, and a coarse correction step, which relies on a coarse space. The coarse space must properly represent the error components that the chosen one-level method is not capable to deal with. In the literature most of the works introduced efficient coarse spaces obtained as the span of functions defined on the entire space domain of the considered PDE. Therefore, the corresponding two-level preconditioners and iterative methods are defined in volume. In this paper, a new class of substructured two-level methods is introduced,for which both domain decomposition smoothers and coarse correction steps are defined on the interfaces (or skeletons). This approach has several advantages. On the one hand, the required computational effort is cheaper than the one required by classical volumetric two-level methods. On the other hand, it allows one to use some of the well-known efficient coarse spaces proposed in the literature. While analyzing in detail the new substructured methods, we present a new convergence analysis for two-level iterative methods, which covers the proposed substructured framework. Further, we study the asymptotic optimality of coarse spaces both theoretically and numerically using deep neural networks. Numerical experiments demonstrate the effectiveness of the proposed new numerical framework.

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

↑