arrow
返回

Adaptive radial basis function mesh deformation using data reduction

delete2016-09-01
delete17
PRE
AI
T
T. Gillebaart *
D
David Blom
A
A.H. van Zuijlen
H
H. Bijl
DOI:10.1016/j.jcp.2016.05.036delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Radial Basis Function (RBF) mesh deformation is one of the most robust mesh deformation methods available. Using the greedy (data reduction) method in combination with an explicit boundary correction, results in an efficient method as shown in literature. However, to ensure the method remains robust, two issues are addressed: 1) how to ensure that the set of control points remains an accurate representation of the geometry in time and 2) how to use/automate the explicit boundary correction, while ensuring a high mesh quality. In this paper, we propose an adaptive RBF mesh deformation method, which ensures the set of control points always represents the geometry/displacement up to a certain (user-specified) criteria, by keeping track of the boundary error throughout the simulation and re-selecting when needed. Opposed to the unit displacement and prescribed displacement selection methods, the adaptive method is more robust, user-independent and efficient, for the cases considered. Secondly, the analysis of a single high aspect ratio cell is used to formulate an equation for the correction radius needed, depending on the characteristics of the correction function used, maximum aspect ratio, minimum first cell height and boundary error. Based on the analysis two new radial basis correction functions are derived and proposed. This proposed automated procedure is verified while varying the correction function, Reynolds number (and thus first cell height and aspect ratio) and boundary error. Finally, the parallel efficiency is studied for the two adaptive methods, unit displacement and prescribed displacement for both the CPU as well as the memory formulation with a 2D oscillating and translating airfoil with oscillating flap, a 3D flexible locally deforming tube and deforming wind turbine blade. Generally, the memory formulation requires less work (due to the large amount of work required for evaluating RBF's), but the parallel efficiency reduces due to the limited bandwidth available between CPU and memory. In terms of parallel efficiency/scaling the different studied methods perform similarly, with the greedy algorithm being the bottleneck. In terms of absolute computational work the adaptive methods are better for the cases studied due to their more efficient selection of the control points. By automating most of the RBF mesh deformation, a robust, efficient and almost user-independent mesh deformation method is presented. (C) 2016 Elsevier Inc. All rights reserved.
Keyword:
Radial basis function mesh deformation
Fluid-structure interaction
Greedy selection
Boundary correction
Adaptive selection
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Journal of Computational Physics 封面图
Journal of Computational Physics
IF:
3.8
论文数:
1.6W
被引数:
7.4W

机构

D
Delft University of Technology
学者数:
2.6W
论文数: 2.5W
被引数: 3.8W
引用论文

引用论文

Improvements in Craniofacial Reconstruction
err1980-05-01
err0
PREAI
errLinton A. Whitaker; A. Michael Broennle; Lawrence P. Kerr; Andrew Herlich
err分享
err收藏
Quality Metrics for High Order Meshes: Analysis of the Mechanical Simulation of the Heart Beat
err2013-01-01
err23
PREAI
errLamata, Pablo; Roy, Ishani; Blazevic, Bojan; Crozier, Andrew; Land, Sander; Niederer, Steven A.; Hose, D. Rod; Smith, Nicolas P.
err分享
err收藏
Intestinal Glucose Uptake Protects Liver from Lipopolysaccharide and d-Galactosamine, Acetaminophen, and Alpha-Amanitin in Mice
err2009-09-01
err0
errOAAI
errLaura Zanobbio; Marco Palazzo; Silvia Gariboldi; Giuseppina F. Dusio; Diego Cardani; Valentina Mauro; Fabrizio Marcucci; Andrea Balsari; Cristiano Rumio
err分享
err收藏
Autologous Breast Reconstruction with SIEA Flaps: Patient Selection and Limitation
err2020-01-29
err0
PREAI
errYiye Ouyang; Chengcheng Li; Xingyi Du; Xiaomu Ma; Chunjun Liu
err分享
err收藏
学者 查看更多内容