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

快速变密度参数曲面节点生成及其在无网格方法中的应用

Fast variable density node generation on parametric surfaces with application to mesh-free methods

Urban Duh, Gregor Kosec, Jure Slak

AI总结:

本文提出一种维度无关的快速变密度参数曲面节点生成算法,时间复杂度为O(N log N),补充了域内节点生成算法,推动全自动无网格求解偏微分方程的发展。

摘要:

域离散化被认为是求解偏微分方程求解过程中的主导部分。人们普遍认为,网格生成是有限元分析中最繁琐的环节之一,尤其是在复杂的3D几何体中,通常需要人工辅助。当使用替代性的无网格方法时,网格生成问题被简化为节点定位问题,这是一个简单得多的任务,但仍然并非易事。在本文中,我们提出了一种在任意$d$维曲面上生成节点的算法。该算法补充了最近发表的用于在域内部生成节点的算法,并代表了朝着全自动、维度无关的偏微分方程求解过程迈出的又一步。所提出的算法以维度无关的方式在$O(N\log N)$时间内,在任意参数域上参数化的曲面上生成具有可变密度的节点。该算法还与现有的用于无网格方法的曲面节点生成算法在质量和执行时间方面进行了比较。

英文摘要:

Domain discretization is considered a dominant part of solution procedures for solving partial differential equations. It is widely accepted that mesh generation is among the most cumbersome parts of the FEM analysis and often requires human assistance, especially in complex 3D geometries. When using alternative mesh-free approaches, the problem of mesh generation is simplified to the problem of positioning nodes, a much simpler task, though still not trivial. In this paper we present an algorithm for generation of nodes on arbitrary $d$-dimensional surfaces. This algorithm complements a recently published algorithm for generation of nodes in domain interiors, and represents another step towards a fully automated dimension-independent solution procedure for solving partial differential equations. The proposed algorithm generates nodes with variable density on surfaces parameterized over arbitrary parametric domains in a dimension-independent way in $O(N\log N)$ time. It is also compared with existing algorithms for generation of surface nodes for mesh-free methods in terms of quality and execution time.

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

↑