A general topology Godunov method

  • Authors:

  • John K. Dukowicz;Michael C. Cline;Frank L. Addessio

  • Affiliations:

  • Theoretical Division, Group T-3, Los Alamos National Laboratory, Los Alamos, New Mexico 87545;Theoretical Division, Group T-3, Los Alamos National Laboratory, Los Alamos, New Mexico 87545;Theoretical Division, Group T-3, Los Alamos National Laboratory, Los Alamos, New Mexico 87545

  • Venue:
  • Journal of Computational Physics
  • Year:
  • 1989

Quantified Score

Hi-index 31.47

Visualization

Abstract

We describe a numerical technique for solving 2-dimensional compressible multimaterial problems using a general topology mesh. Multimaterial problems are characterized by the presence of interfaces whose shapes may become arbitrarily complex in the course of dynamic evolution. Computational methods based on more conventional fixed-connectivity quadrilateral meshes do not have adequate flexibility to follow convoluted interface shapes and frequently fail due to excessive mesh distortion. The present method is based on a mesh of arbitrary polygonal cells. Because this mesh is dual to a triangulation, its topology is unrestricted and it is able to accommodate arbitrary boundary shapes. Additionally, this mesh is able to quickly and smoothly change local mesh resolution, thus economizing on the number of mesh cells, and it is able to improve mesh isotropy because in a region of uniform mesh the cells tend to become regular hexagons. The underlying algorithms are based on those of the CAVEAT code. These consist of an explicit, finite-volume, cell-centered, arbitrary Lagrangian-Eulerian (ALE) technique, coupled with the Godunov method, which together are readily adaptable to a general topology mesh. Several special techniques have been developed for this extension to a more general mesh. They include an interface propagation scheme based on Huygens' construction, a ''near-Lagrangian'' mesh rezoning algorithm that minimizes advection while enhancing mesh regularity, an efficient global remapping algorithm that is capable of conservatively transferring quantities from one general mesh to another and various mesh restructering algorithms, such as mesh reconnection, smoothing, and point addition and deletion.