arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.01295cs.DCcs.NAmath.NAphysics.comp-ph
收藏

多级 hp 自适应有限元方法的并行化

Parallelization of the multi-level hp-adaptive finite cell method

Technische Universität München(慕尼黑工业大学);Institute for Advanced Study, Technische Universität München(慕尼黑工业大学高等研究院)

John N. Jomo, Nils Zander, Mohamed Elhaddad, Ali Özcan, Stefan Kollmannsberger, Ralf-Peter Mundani, Ernst Rank

AI总结:

本文提出了一种适用于多级 hp 方案的并行策略,通过将计算域划分到进程上,并利用共享的网格数据结构,实现了良好的并行性能,避免了冗余的 ghost 元素计算。

摘要:

多级 hp 细化方案是有限元方法的一种强大扩展,允许在不约束悬挂节点的情况下实现局部网格自适应。这通过层次化的高阶叠加网格实现,是一种基于叠加的空间细化 hp 方案。使用标准域分解方法结合 ghost 元素对这种方案进行高效并行化面临挑战,因为叠加结构导致的大量基函数支持区域在许多情况下不可行。在本贡献中,提出了一种适用于该方案简单层次结构的并行策略。通过在 active leaf 元素粒度上将计算域分配给进程,并利用共享的网格数据结构,实现了良好的并行性能,避免了 ghost 元素上的冗余计算。我们展示了该方案在每个进程有数百个元素的问题上的并行可扩展性。此外,该方案与有限元方法结合,用于在复杂形状域上进行数值模拟。

英文摘要:

The multi-level hp-refinement scheme is a powerful extension of the finite element method that allows local mesh adaptation without the trouble of constraining hanging nodes. This is achieved through hierarchical high-order overlay meshes, a hp-scheme based on spatial refinement by superposition. An efficient parallelization of this method using standard domain decomposition approaches in combination with ghost elements faces the challenge of a large basis function support resulting from the overlay structure and is in many cases not feasible. In this contribution, a parallelization strategy for the multi-level hp-scheme is presented that is adapted to the scheme's simple hierarchical structure. By distributing the computational domain among processes on the granularity of the active leaf elements and utilizing shared mesh data structures, good parallel performance is achieved, as redundant computations on ghost elements are avoided. We show the scheme's parallel scalability for problems with a few hundred elements per process. Furthermore, the scheme is used in conjunction with the finite cell method to perform numerical simulations on domains of complex shape.

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

↑