CHINESE JOURNAL OF COMPUTATIONAL PHYSICS ›› 2006, Vol. 23 ›› Issue (5): 511-517.

Previous Articles     Next Articles

A Conservative Remapping Algorithm for Polygonal Staggered Meshes

WEN Wan-zhi, LIN Zhong, WANG Rui-li, FU Shang-wu   

  1. Laboratory of Computational Physics, Institute of Applied Physics and Computational Mathematics, Beijing 100088, China
  • Received:2005-04-15 Revised:2005-08-25 Online:2006-09-25 Published:2006-09-25
  • Supported by:
    Supported by the NSFC (No.10271019,10225105) and the CAEP (No.2003Z0603,the Shuangbai grant)

Abstract: A discrete conservative remapping algorithm based upon refinement and numerical integrals,named particle remapping algorithm,is presented.The mass density distribution is chosen as either a piecewise constant with first-order accuracy or a piecewise linear distribution with second-order accuracy.It results in a first-order and a second-order algorithm.The density gradient is evaluated by an area average method with a piecewise linear distribution.On a staggered mesh,in which velocity is vertex-centered,an auxiliary mesh is introduced,and the velocity is remapped.The particle remapping algorithm can be applied to a structured or an unstructured mesh.It does not require a one-to-one mapping between the old and the new meshes.Numerical results show that the first-order algorithm is robust but has an excessive diffusion.The second-order one is better in shape-preservation but violates the monotonicity sometimes.To improve the monotonicity,a conservative mass repair algorithm for structured grids is extended to unstructured grids preserving upper and lower bounds of the density.Several remapping results are presented and the errors are analyzed.

Key words: conservative remapping, particle, staggered mesh, auxiliary grid

CLC Number: