Efficient mesh deformation based on Cartesian background mesh
TL;DR: A new Mesh Deformation method based on Cartesian Background Mesh (MDCBM), where the Cartesian background mesh is deformed with radial basis functions (RBF) and the displacement of Cartesianbackground mesh is algebraically interpolated onto all meshes in the computing domain.
Abstract: Moving mesh is widely used in the simulation of aerodynamic shape optimization, multibody relative motion, aircraft icing and aeroelasticity. The efficient and high quality mesh deformation is the key technology of moving mesh. This paper presented a new Mesh Deformation method based on Cartesian Background Mesh (MDCBM). First, the Cartesian background mesh is deformed with radial basis functions (RBF). Second, the displacement of Cartesian background mesh is algebraically interpolated onto all meshes in the computing domain. Since the background mesh is coarse, the background mesh deformation can be finished fast. Because the background mesh of MDCBM is regular, the mapping relationship between background mesh and the computing mesh is simple. So the time spent on mapping search is substantially reduced. The examples including NACA0012 airfoil, multi-element airfoil with structured, unstructured mesh and DLR-F4 wing–body show the good performance of MDCBM. We highlight the advantages of MDCBM with respect to its computational efficiency and high quality of deformed mesh.
Citations
More filters
TL;DR: A novel and fast radial basis functions (RBF) mesh morphing technique to efficiently and accurately perform ice accretion simulations on industrial models in the aviation sector and this is the first time in scientific literature that RBF are proposed to handle icing simulations.
Abstract: Numerical simulation of icing has become a standard. Once the iced shape is known, however, the analyst needs to update the computational fluid dynamics (CFD) grid. This paper aims to propose a method to update the numerical mesh with ice profiles.,The present paper concerns a novel and fast radial basis functions (RBF) mesh morphing technique to efficiently and accurately perform ice accretion simulations on industrial models in the aviation sector. This method can be linked to CFD analyses to dynamically reproduce the ice growth.,To verify the consistency of the proposed approach, one of the most challenging ice profile selected in the LEWICE manual was replicated and simulated through CFD. To showcase the effectiveness of this technique, predefined ice profiles were automatically applied on two-dimensional (2D) and three-dimensional (3D) cases using both commercial and open-source CFD solvers.,If ice accreted shapes are available, the meshless characteristic of the proposed approach enables its coupling with the CFD solvers currently supported by the RBF4AERO platform including OpenFOAM, SU2 and ANSYS Fluent. The advantages provided by the use of RBF are the high performance and reliability, due to the fast application of mesh smoothing and the accuracy in controlling surface mesh nodes.,As far as authors’ knowledge is concerned, this is the first time in scientific literature that RBF are proposed to handle icing simulations. Due to the meshless characteristic of the RBF mesh morphing, the proposed approach is cross solver and can be used for both 2D and 3D geometries.
17 citations
TL;DR: A parallel mesh deformation method based on parallel data reduction and displacement interpolation is proposed and the proposed recurrence Choleskey decomposition method (RCDM) can decrease the computational cost of solving interpolation weight coefficients from O ( N c 4 ) to N c 3 , where N c denotes the number of support nodes.
11 citations
TL;DR: The computational results show that the GCB greedy algorithm is able to remarkably promote the efficiency of computing the interpolation errors in the data reducing procedure by dozens of times and tends to generate a more significant efficiency improvement for mesh deformation when a larger-scale mesh is applied.
8 citations
Cites methods from "Efficient mesh deformation based on..."
...[28] proposed an algorithm to allow the interpolation is conducted on the Cartesian background mesh rather than on the computational mesh....
[...]
TL;DR: A linear elasticity mesh movement algorithm is presented for unstructured computational aerodynamic meshes consisting of multiple element types and an adaptive method for incrementally stiffening mesh is presented.
Abstract: A linear elasticity mesh movement algorithm is presented for unstructured computational aerodynamic meshes consisting of multiple element types. An adaptive method for incrementally stiffening mesh...
3 citations
TL;DR: This work presents an efficient algorithm to realize the high-quality computational mesh in the situation involving nonstationary motions using a convolutional neural network.
Abstract: It is a challenging task to simulate the situation involving nonstationary motions, one crucial requirement of which is an efficient algorithm to realize the high-quality computational mesh...
1 citations
References
More filters
TL;DR: A new mesh movement algorithm for unstructured grids is developed which is based on interpolating displacements of the boundary nodes to the whole mesh with radial basis functions (RBF's), which can handle large mesh deformations caused by translations, rotations and deformations.
648 citations
TL;DR: In this paper, the authors proposed a method to control the arbitrary motion of two-dimensional dynamic unstructured fluid grids with additional torsional springs, which can be designed to prevent the interpenetration of neighboring triangles.
476 citations
TL;DR: Steady and unsteady results are presented for a supersonic fighter configuration to demonstrate applications of the Euler solver and dynamic mesh algorithm.
Abstract: An Euler solution algorithm is presented for unsteady aerodynamic analysis of complex-aircr aft configurations. The flow solver involves a multistage Runge-Kutta time-stepping scheme that uses a finite-volume spatial discretization on an unstructured grid made up of tetrahedra. A significant contribution of the research is the development and implementation of a moving mesh algorithm that is employed for problems involving static or dynamic deformation of the aircraft. The mesh algorithm is a general procedure that can treat realistic motions and deformations of complex-aircraft configurations. Steady and unsteady results are presented for a supersonic fighter configuration to demonstrate applications of the Euler solver and dynamic mesh algorithm. The unsteady flow results were obtained for the aircraft oscillating harmonically in a complete-vehicle bending mode. Effects of angle of attack and reduced frequency on instantaneous pressures and force responses were investigated. The paper presents descriptions of the Euler solver and dynamic mesh algorithm along with results that assess the capability.
312 citations
TL;DR: In this paper, a multivariate interpolation scheme, using radial basis functions, is presented, which results in a completely unified formulation for the fluid-structure interpolation and mesh motion problems.
Abstract: A multivariate interpolation scheme, using radial basis functions, is presented, which results in a completely unified formulation for the fluid–structure interpolation and mesh motion problems. The method has several significant advantages. Primarily, all volume mesh, structural mesh, and flow-solver type dependence is removed, and all operations are performed on totally arbitrary point clouds of any form. Hence, all connectivity and user-input requirements are removed from the computational fluid dynamics–computational structural dynamics (CFD–CSD) coupling problem, as only point clouds are required to determine the coupling. Also, it may equally well be applied to structured and unstructured grids, or structural and aerodynamic grids that intersect, again because no connectivity information is required. Furthermore, no expensive computations are required during an unsteady simulation, just matrix–vector multiplications, since the required dependence relations are computed only once prior to any simulation and then remain constant. This property means that the method is both perfectly parallel, since only the data relevant to each structured block or unstructured partition are required to move those points, and totally independent from the flow solver. Hence, a completely generic ‘black box’ tool can be developed, which is ideal for use in an optimization approach. Aeroelastic behaviour of the Brite–Euram MDO wing is analysed in terms of both static deflection and dynamic responses, and it is demonstrated that responses are strongly dependent on the exact CFD–CSD interpolation used. Mesh quality is also examined during the motion resulting from a large surface deformation. Global grid quality is shown to be preserved well, with local grid orthogonality also being maintained well, particularly at and near the moving surface, where the original orthogonality is retained. Copyright © 2007 John Wiley & Sons, Ltd.
308 citations
TL;DR: In this article, two different kinds of springs are discussed: the vertex spring and the segment spring, which are used for smoothing a mesh after mesh generation or refinement, and the difference between the two methods lies in the equilibrium length of the springs.
Abstract: We present an investigation on the spring analogy. The spring analogy serves for deformation in a moving boundary problem. First, two different kinds of springs are discussed: the vertex springs and the segment springs. The vertex spring analogy is originally used for smoothing a mesh after mesh generation or refinement. The segment spring analogy is used for deformation of the mesh in a moving boundary problem. The difference between the two methods lies in the equilibrium length of the springs. By means of an analogy to molecular theory, the two theories are generalized into a single theory that covers both. The usual choice of the stiffness of the spring is clarified by the mathematical analysis of a representative one-dimensional configuration. The analysis shows that node collision is prevented when the stiffness is chosen as the inverse of the segment length. The observed similarity between elliptic grid generation and the spring analogy is also investigated. This investigation shows that both methods update the grid point position by a weighted average of the surrounding points in an iterative manner. The weighting functions enforce regularity of the mesh
288 citations