Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 18, 2005 | Accepted Version
Report Open

A Level Set Approach to Eulerian-Lagrangian Coupling

Abstract

We present a numerical method for coupling an Eulerian compressible flow solver with a Lagrangian solver for fast transient problems involving fluid–solid interactions. Such coupling needs arise when either specific solution methods or accuracy considerations necessitate that different and disjoint subdomains be treated with different (Eulerian or Lagrangian) schemes. The algorithm we propose employs standard integration of the Eulerian solution over a Cartesian mesh. To treat the irregular boundary cells that are generated by an arbitrary boundary on a structured grid, the Eulerian computational domain is augmented by a thin layer of Cartesian ghost cells. Boundary conditions at these cells are established by enforcing conservation of mass and continuity of the stress tensor in the direction normal to the boundary. The description and the kinematic constraints of the Eulerian boundary rely on the unstructured Lagrangian mesh. The Lagrangian mesh evolves concurrently, driven by the traction boundary conditions imposed by the Eulerian counterpart. Several numerical tests designed to measure the rate of convergence and accuracy of the coupling algorithm are presented as well. General problems in one and two dimensions are considered, including a test consisting of an isotropic elastic solid and a compressible fluid in a fully coupled setting where the exact solution is available.

Additional Information

Also available in the Caltech Center for Simulation of Dynamic Response in Materials publication series, cit-asci-tr136, at http://csdrm.caltech.edu/publications/index.html

Attached Files

Accepted Version - vtf_jcp.pdf

Files

vtf_jcp.pdf
Files (2.6 MB)
Name Size Download all
md5:954f6c08f0cb9f1ff1f471cfdaadea0f
2.6 MB Preview Download

Additional details

Created:
August 21, 2023
Modified:
January 13, 2024