A Node-Pair Finite Element / Finite Volume Mesh Adaptation Technique for Compressible Flows
A Node-Pair Finite Element / Finite Volume Mesh Adaptation Technique for Compressible Flows
复制标题
可压缩流的节点对有限元/有限体积网格自适应技术
DOI：
10.2514/6.2010-4438
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
L. Vigevano
中科院分区：
文献类型：
--
作者：
M. Fossati;A. Guardone;L. Vigevano
提出了一种适用于二维三角形和四边形非结构网格的网格自适应技术。误差估计过程，以及细化/粗化算法，制定在一个节点对为基础的数据结构，允许有限元和有限体积离散化的统一描述。自适应算法是基于一个战略的连续校正，其中一个合适的中间适应网格的数量产生和连续校正采用只有一个节点插入技术。粗化的网格是在一个隐式的方式，避免在校正阶段插入新的节点。自适应历史，从初始网格通过中间网格，并通过整个过程中存储和更新的最终网格。因此，不需要显式存储中间网格。由于这里没有采用显式粗化或节点移动技术，因此该算法非常快速且鲁棒。定常可压缩流的数值实验，以支持自适应技术的描述。
A grid adaptation technique for two-dimensional unstructured grids of triangles and quadrilaters is presented. The error estimation procedure, as well as the refinement / coarsening algorithms, are formulated in terms of a node-pair based data structure, that allows for a unified description of the finite element and finite volumes discretizations. The adaptation algorithm is based on a strategy of successive corrections, where a suitable number of intermediate adapted grids are generated and successively corrected employing only a nodes insertion technique. Coarsening of the grid is obtained in an implicit fashion avoiding the insertion of new nodes during the correction phase. The adaptation history, from the initial grid through the intermediate grids, and up to the final mesh is stored and updated through the whole process. No intermediate grid is therefore required to be stored explicitly. Since no explicit coarsening or nodes movement technique is employed here, the algorithm is very fast and robust. Numerical experiments of steady compressible flows are presented to support the description of the adaptation technique.