arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2211.08426cs.CE
收藏

虚拟几何上平行预处理网格曲面的自动惩罚和度延拓

Automatic penalty and degree continuation for parallel pre-conditioned mesh curving on virtual geometry

Eloi Ruiz-Gironés, Xevi Roca

摘要:

提出了一种虚拟几何的分布式并行网格曲面生成方法。其主要应用是在复杂的几何形状上生成适合于非结构化高阶方法分析的大规模曲面网格。因此,我们设计的技术,以产生几何精确的网格组成的高品质的元素。为此,我们主张在基于惩罚的二阶优化器上进行度延续,该优化器使用全局紧公差来收敛失真残差。为了减少方法的内存占用、等待时间和能量消耗,我们结合了三个主要成分。首先,我们提出了一个无矩阵的GMRES求解器预处理连续的超松弛块,以减少内存占用三倍。我们还提出了一种自适应惩罚技术,以减少非线性迭代的次数。第三,我们提出了一个指标所需的线性求解器的公差,以减少线性迭代的次数。在数千个核心上,该方法使由数百万个四次元素组成的网格弯曲,这些四次元素具有高度拉伸的元素,同时匹配虚拟拓扑。

英文摘要:

We present a distributed parallel mesh curving method for virtual geometry. The main application is to generate large-scale curved meshes on complex geometry suitable for analysis with unstructured high-order methods. Accordingly, we devise the technique to generate geometrically accurate meshes composed of high-quality elements. To this end, we advocate for degree continuation on a penalty-based second-order optimizer that uses global tight tolerances to converge the distortion residuals. To reduce the method memory footprint, waiting time, and energy consumption, we combine three main ingredients. First, we propose a matrix-free GMRES solver pre-conditioned with successive over-relaxation by blocks to reduce the memory footprint three times. We also propose an adaptive penalty technique, to reduce the number of non-linear iterations. Third, we propose an indicator of the required linear solver tolerance to reduce the number of linear iterations. On thousands of cores, the method curves meshes composed of millions of quartic elements featuring highly stretched elements while matching a virtual topology.

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

↑