{"title":"基于MPI/OpenMP混合并行插值的高效多域RBF网格变形方法","authors":"Zhenyu Hu, Yu Yuan, Dapeng Xiong, Chenglong Wang, Mingbo Sun, Yongchao Sun","doi":"10.1016/j.jcp.2025.114113","DOIUrl":null,"url":null,"abstract":"<div><div>Radial basis function (RBF) interpolation has been prevalent in mesh deformation schemes due to its great quality-preserving ability and generality. However, the cost time scales as <span><math><mrow><mi>O</mi><mo>(</mo><msup><mrow><msub><mi>N</mi><mi>s</mi></msub></mrow><mn>3</mn></msup><mo>)</mo></mrow></math></span>, where <span><math><msub><mi>N</mi><mi>s</mi></msub></math></span> is the number of surface nodes, which makes full RBF interpolation prohibitively expensive to implement for large mesh. The key improvement is the application of efficient reduced-data methods. But the greedy-type reduced-data method remains expensive when applied to large-scale meshes, requiring iterative linear system solutions and interpolation error calculations to generate the reduced dataset. Furthermore, a supplementary surface correction procedure must be implemented to ensure exact surface shape. In this paper, a novel multidomain method is proposed that stochastically splits the surface nodes into <span><math><mi>n</mi></math></span> small subsets and a small sub-RBF interpolant is constructed on each subset. The mesh deformation is computed by the weight of sub-RBF interpolations. Since the above processes are independent, this method is perfectly parallel. The computational complexity analysis reveals that this method reduces the solution cost to <span><math><mrow><mi>O</mi><mo>(</mo><msup><mrow><msub><mi>N</mi><mi>s</mi></msub></mrow><mn>3</mn></msup><mo>/</mo><msup><mi>n</mi><mn>2</mn></msup><mo>)</mo></mrow></math></span> for a serial algorithm, and this method can be faster than the multiscale method Kedward et al.(2017) in all stages. By appropriately selecting the weighting coefficients, the exact surface shape is naturally preserved and the surface correction issue is eliminated. Further enhancements are achieved by dividing the volume into near-surface, intermediate, far-surface and stationary domains based on their distances from the surface. These domains can adopt distinct weighting schemes and utilize varying numbers of radial centers. The efficiency and accuracy of this method are analyzed in detail using two-dimensional (2D) airfoils, a three-dimensional (3D) scramjet combustor and a 3D hypersonic vehicle examples. In comparison with the conventional greedy method and the contemporary multiscale method, this method gains higher efficiency and comparable mesh quality.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"537 ","pages":"Article 114113"},"PeriodicalIF":3.8000,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient multidomain RBF mesh deformation method based on MPI/OpenMP hybrid parallel interpolation\",\"authors\":\"Zhenyu Hu, Yu Yuan, Dapeng Xiong, Chenglong Wang, Mingbo Sun, Yongchao Sun\",\"doi\":\"10.1016/j.jcp.2025.114113\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Radial basis function (RBF) interpolation has been prevalent in mesh deformation schemes due to its great quality-preserving ability and generality. However, the cost time scales as <span><math><mrow><mi>O</mi><mo>(</mo><msup><mrow><msub><mi>N</mi><mi>s</mi></msub></mrow><mn>3</mn></msup><mo>)</mo></mrow></math></span>, where <span><math><msub><mi>N</mi><mi>s</mi></msub></math></span> is the number of surface nodes, which makes full RBF interpolation prohibitively expensive to implement for large mesh. The key improvement is the application of efficient reduced-data methods. But the greedy-type reduced-data method remains expensive when applied to large-scale meshes, requiring iterative linear system solutions and interpolation error calculations to generate the reduced dataset. Furthermore, a supplementary surface correction procedure must be implemented to ensure exact surface shape. In this paper, a novel multidomain method is proposed that stochastically splits the surface nodes into <span><math><mi>n</mi></math></span> small subsets and a small sub-RBF interpolant is constructed on each subset. The mesh deformation is computed by the weight of sub-RBF interpolations. Since the above processes are independent, this method is perfectly parallel. The computational complexity analysis reveals that this method reduces the solution cost to <span><math><mrow><mi>O</mi><mo>(</mo><msup><mrow><msub><mi>N</mi><mi>s</mi></msub></mrow><mn>3</mn></msup><mo>/</mo><msup><mi>n</mi><mn>2</mn></msup><mo>)</mo></mrow></math></span> for a serial algorithm, and this method can be faster than the multiscale method Kedward et al.(2017) in all stages. By appropriately selecting the weighting coefficients, the exact surface shape is naturally preserved and the surface correction issue is eliminated. Further enhancements are achieved by dividing the volume into near-surface, intermediate, far-surface and stationary domains based on their distances from the surface. These domains can adopt distinct weighting schemes and utilize varying numbers of radial centers. The efficiency and accuracy of this method are analyzed in detail using two-dimensional (2D) airfoils, a three-dimensional (3D) scramjet combustor and a 3D hypersonic vehicle examples. In comparison with the conventional greedy method and the contemporary multiscale method, this method gains higher efficiency and comparable mesh quality.</div></div>\",\"PeriodicalId\":352,\"journal\":{\"name\":\"Journal of Computational Physics\",\"volume\":\"537 \",\"pages\":\"Article 114113\"},\"PeriodicalIF\":3.8000,\"publicationDate\":\"2025-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Physics\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021999125003961\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Physics","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021999125003961","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
摘要
径向基函数(RBF)插值由于其良好的保质能力和通用性,在网格变形格式中得到了广泛的应用。然而,成本时间尺度为O(Ns3),其中Ns为表面节点数,这使得对于大型网格来说,完全RBF插值的实现成本过高。关键的改进是应用了高效的约简数据方法。但是,当应用于大规模网格时,贪婪型约简数据方法仍然是昂贵的,需要迭代线性系统解和插值误差计算来生成约简数据集。此外,必须实施补充表面校正程序以确保精确的表面形状。本文提出了一种新的多域方法,该方法将表面节点随机划分为n个小子集,并在每个子集上构造一个小的子rbf插值。网格变形由子rbf插值权值计算。由于上述过程是独立的,因此这种方法是完全并行的。计算复杂度分析表明,该方法将串行算法的求解成本降至O(Ns3/n2),且在各个阶段都比多尺度方法edward et al.(2017)快。通过适当地选择加权系数,自然地保留了准确的表面形状,并消除了表面校正问题。通过将体积根据其与表面的距离划分为近表面、中间、远表面和静止区域,可以实现进一步的增强。这些区域可以采用不同的加权方案,并利用不同数量的径向中心。通过二维(2D)翼型、三维(3D)超燃冲压发动机燃烧室和三维高超声速飞行器实例,详细分析了该方法的效率和精度。与传统的贪心方法和现代的多尺度方法相比,该方法具有更高的效率和相当的网格质量。
An efficient multidomain RBF mesh deformation method based on MPI/OpenMP hybrid parallel interpolation
Radial basis function (RBF) interpolation has been prevalent in mesh deformation schemes due to its great quality-preserving ability and generality. However, the cost time scales as , where is the number of surface nodes, which makes full RBF interpolation prohibitively expensive to implement for large mesh. The key improvement is the application of efficient reduced-data methods. But the greedy-type reduced-data method remains expensive when applied to large-scale meshes, requiring iterative linear system solutions and interpolation error calculations to generate the reduced dataset. Furthermore, a supplementary surface correction procedure must be implemented to ensure exact surface shape. In this paper, a novel multidomain method is proposed that stochastically splits the surface nodes into small subsets and a small sub-RBF interpolant is constructed on each subset. The mesh deformation is computed by the weight of sub-RBF interpolations. Since the above processes are independent, this method is perfectly parallel. The computational complexity analysis reveals that this method reduces the solution cost to for a serial algorithm, and this method can be faster than the multiscale method Kedward et al.(2017) in all stages. By appropriately selecting the weighting coefficients, the exact surface shape is naturally preserved and the surface correction issue is eliminated. Further enhancements are achieved by dividing the volume into near-surface, intermediate, far-surface and stationary domains based on their distances from the surface. These domains can adopt distinct weighting schemes and utilize varying numbers of radial centers. The efficiency and accuracy of this method are analyzed in detail using two-dimensional (2D) airfoils, a three-dimensional (3D) scramjet combustor and a 3D hypersonic vehicle examples. In comparison with the conventional greedy method and the contemporary multiscale method, this method gains higher efficiency and comparable mesh quality.
期刊介绍:
Journal of Computational Physics thoroughly treats the computational aspects of physical problems, presenting techniques for the numerical solution of mathematical equations arising in all areas of physics. The journal seeks to emphasize methods that cross disciplinary boundaries.
The Journal of Computational Physics also publishes short notes of 4 pages or less (including figures, tables, and references but excluding title pages). Letters to the Editor commenting on articles already published in this Journal will also be considered. Neither notes nor letters should have an abstract.