z-logo
Premium
Mesh regularization for an ALE code based on the limitation of the Lagrangian mesh velocity
Author(s) -
Costes J.,
Ghidaglia J.M.,
Breil J.
Publication year - 2017
Publication title -
international journal for numerical methods in fluids
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.938
H-Index - 112
eISSN - 1097-0363
pISSN - 0271-2091
DOI - 10.1002/fld.4394
Subject(s) - regularization (linguistics) , finite element method , finite volume method , eulerian path , lagrangian , mathematics , mesh generation , large eddy simulation , vorticity , polygon mesh , augmented lagrangian method , flow (mathematics) , computer science , mathematical optimization , algorithm , vortex , geometry , mechanics , physics , turbulence , artificial intelligence , thermodynamics
Summary The Lagrangian approach is usually used for the simulation of flow with strong shock waves. Moreover, this approach is particularly well suited to treatment of material interfaces in the case of multimaterial flows.Unfortunately, this formulation leads to very large deformations in the mesh. The arbitrary Lagrangian‐Eulerian method overcomes this drawback by using a mesh regularization that is based on an analysis of cell geometry. The regularization step may be considered as a method used to correct the nonconvex and potentially tangled cells that constitute the mesh. In this paper, we present a new approach to mesh regularization. Instead of using a purely geometric criterion, we propose that the mesh evolution is computed on the basis of the flow vorticity. This approach is called the large Eddy limitation method, and it is aimed here to be used in finite volume direct arbitrary Lagrangian‐Eulerian methods. The large Eddy limitation method is general, which means that it is not restricted to applications in the finite volume framework dedicated to fluid flow simulation; for instance, it could also be naturally applied to the finite element framework.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here