首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Combined swept region and intersection‐based single‐material remapping method
Authors:Matej Klima  Milan Kucharik  Mikhail Shashkov
Institution:1. Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University in Prague, 115 19, Czech Republic;2. XCP‐4 Group, MS‐F644, Los Alamos National Laboratory, Los Alamos, USA
Abstract:A typical arbitrary Lagrangian–Eulerian algorithm consists of a Lagrangian step, where the computational mesh moves with the fluid flow; a rezoning step, where the computational mesh is smoothed and repaired in case it gets too distorted; and a remapping step, where all fluid quantities are conservatively interpolated on this new mesh. In single‐material simulations, the remapping process can be represented in a flux form, with fluxes approximated by integrating a reconstructed function over intersections of neighboring computational cells on the original and rezoned computational mesh. This algorithm is complex and computationally demanding – Therefore, a simpler approach that utilizes regions swept by the cell edges during rezoning is often used in practice. However, it has been observed that such simplification can lead to distortion of the solution symmetry, especially when the mesh movement is not bound by such symmetry. For this reason, we propose an algorithm combining both approaches in a similar way that was proposed for multi‐material remapping (two‐step hybrid remap). Intersections and exact integration are employed only in certain parts of the computational mesh, marked by a switching function – Various different criteria are presented in this paper. The swept‐based method is used elsewhere in areas that are not marked. This way, our algorithm can retain the beneficial symmetry‐preserving capabilities of intersection‐based remapping while keeping the overall computational cost moderate.
Keywords:ALE        arbitrary Lagrangian–  Eulerian  compressible flow  error estimation  polygon intersections  remapping  swept regions
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号