检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:宣传伟 韩景龙[1] XUAN Chuanwei;HAN Jinglong(State Key Laboratory of Mechanics and Control of Mechanieal Structures,College of Aerospace Engineering,Nanjing University of Aeronauties and Astronautics,Nanjing 210016,China)
机构地区:[1]南京航空航天大学航空学院机械结构力学及控制国家重点实验室
出 处:《北京航空航天大学学报》2019年第10期2026-2034,共9页Journal of Beijing University of Aeronautics and Astronautics
基 金:国家自然科学基金(11472133);江苏高校优势学科建设工程基金~~
摘 要:针对重叠网格中洞映射法占用过多物理内存的问题,发展了一种改进型洞映射法;基于相邻单元搜索法,发展了一种基于相邻阵面的贡献单元搜索法;通过将割补法与隐式切割技术相结合提出了一种非结构重叠网格显式装配算法。该算法首先生成一套包围物面的笛卡儿网格,其次存储所有与物面边界相交的笛卡儿网格信息,最后根据所存储笛卡儿网格与所需判断的网格单元的相对位置来判断其是否为洞内单元。在成功判断出所有洞内单元后,以当前洞边界为初始阵面推进,同时以各个网格单元的物面距离为判别标准对重叠区域进行优化,生成最终插值边界。所提算法优化了传统非结构重叠网格装配过程,具有物理内存占用低,贡献单元搜索次数少以及计算效率高等特点。通过2个典型复杂流动算例验证了所提算法的准确性与适用性。To solve the problem that the hole mapping method occupies too much physical memory,an improved hole mapping method was developed. Based on the neighbor-to-neighbor search algorithm,a donor search method based on adjacent front was developed. An explicit assembly algorithm of unstructured overset grid was presented by combining the cut-paste method with the implicit cutting technique. First,the algorithm generated a set of Cartesian grids surrounding the wall surface. Second,those Cartesian cells intersecting the wall surface were stored. Finally,relative positions of the stored Cartesian cells were used to determine whether a grid point was inside the wall. After successfully determining all the grid points inside the wall,the current fringe grid points were used as the initial front,and the overlapping area was optimized by the wall distance of each grid point to generate the final interpolation boundary. The proposed explicit algorithm optimizes the traditional implicit assembly process of unstructured overset grid. It features in low physical memory occupation,low cost of donor searching and high computational efficiency. The accuracy and applicability of the proposed explicit method were verified by two typical complex flow examples.
分 类 号:V211.3[航空宇航科学与技术—航空宇航推进理论与工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.145.115.135