A parallel dynamic-mesh Lagrangian method for simulation of flows with dynamic interfaces

  • Authors:
  • Noel J. Walkington;James F. Antaki;Guy E. Blelloch;Omar Ghattas;Iran Melcevic;Gary L. Miller

  • Affiliations:
  • Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA;McGowan Center for Artificial Organ Development, University of Pittsburgh Medical Center, Pittsburgh, PA;Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA;Laboratory for Mechanics, Algorithms and Computing, Carnegie Mellon University, Pittsburgh, Pennsylvania;Laboratory for Mechanics, Algorithms, and Computing, Carnegie Mellon University, Pittsburgh, Pennsylvania;Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA

  • Venue:
  • Proceedings of the 2000 ACM/IEEE conference on Supercomputing
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many important phenomena in science and engineering, including our motivating problem of microstructural blood flow, can be modeled as flows with dynamic interfaces. The major challenge faced in simulating such flows is resolving the interfacial motion. Lagrangian methods are ideally suited for such problems, since interfaces are naturally represented and propagated. However, the material description of motion results in dynamic meshes, which become hopelessly distorted unless they are regularly regenerated. Lagrangian methods are particularly challenging on parallel computers, because scalable dynamic mesh methods remain elusive. Here, we present a parallel dynamic mesh Lagrangian method for flows with dynamic interfaces. We take an aggressive approach to dynamic meshing by triangulating the propagating grid points at every timestep using a scalable parallel Delaunay algorithm. Contrary to conventional wisdom, we show that the costs of the dynamic mesh components (triangulation,coarsening, refinement, and partitioning) can be made small relative to the flow solver.