论文信息 - Extension of efficient, swept-integration-based conservative remapping method for meshes with changing connectivity

Extension of efficient, swept-integration-based conservative remapping method for meshes with changing connectivity

Remapping is one of the essential parts of most arbitrary Lagrangian-Eulerian methods. Here, we extend the idea of swept integration introduced in (J. Comput. Phys. 2003; 184(1):266-298) to meshes with connectivity changing in Voronoi-like manner. To demonstrate properties of the developed method, we present several numerical examples.

Mikhail Shashkov | M. Kucharik

[1] Len G. Margolin,et al. Second-order sign-preserving conservative interpolation (remapping) on general grids , 2003 .

[2] Rao V. Garimella,et al. Mesh data structure selection for mesh generation and FEA applications , 2002 .

[3] Mikhail Shashkov,et al. The repair paradigm and application to conservation laws , 2004 .

[4] Mikhail Shashkov,et al. An efficient linearity and bound preserving conservative interpolation (remapping) on polyhedral meshes , 2007 .

[5] Franz Aurenhammer,et al. Voronoi Diagrams , 2000, Handbook of Computational Geometry.

[6] C. W. Hirt,et al. An Arbitrary Lagrangian-Eulerian Computing Method for All Flow Speeds , 1997 .