z-logo
Premium
Generation, optimization and adaptation of multiblock grids around complex configurations in computational fluid dynamics
Author(s) -
Jacquotte OlivierPierre
Publication year - 1992
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620340204
Subject(s) - mesh generation , domain decomposition methods , grid , computer science , metric (unit) , computational fluid dynamics , polygon mesh , mathematical optimization , domain (mathematical analysis) , conjugate gradient method , topology (electrical circuits) , position (finance) , algorithm , mathematics , finite element method , geometry , mathematical analysis , operations management , physics , computer graphics (images) , finance , combinatorics , mechanics , economics , thermodynamics
We present a method that has been developed for the construction of grids suitable for a large class of Computational Fluid Dynamics (CFD) solvers. Three independent steps are considered: a multidomain generation, an optimization and an adaptation. The first step handles the complexity of the three‐dimensional domain to be meshed and is able to perform an algebraic construction of the grid points within a multidomain topology; any decomposition can be considered and analysed by the algorithm. The second step is able to optimize a mesh with respect to a quality measure defined in terms of cell deformation; a conjugate gradient algorithm drives the nodes up to an equilibrium position that realizes the minimum of a mesh energy quantity. The final step handles the physics of the problem and moves the nodes in order to refine the mesh where anything of interest takes place, while preserving its good metric quality. The three steps have been implemented independently and successfully, as shown by the examples presented.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here