1. An Eulerian Divergence Preserving Approach for Partitioned FSI Simulations on Cartesian Grids M. Mehl, M. Brenk, I. Muntean, T. Neckel, T. Weinzierl TU München

2. Povoking Questions Should we reinvent the wheel each time we change the construction of the car?

3. Povoking Questions Can we reduce complexity without loosing accuracy, efficiency, and generality?

4. Computer Science View  not application driven  synergies  numerics  hardware  modularity, reusability  frameworks

5. The Partitioned Approach server fluid + interpolation server structure + interpolation job data job data Client surface coupling

6. Cartesian Fluid Grids

7. spatially recursive structure  memory efficiency  efficient parallelisation  embedding arbitrary local adaptivity  complex geometries  dynamical adaptivity

8. Fluid Solver – Eulerian Approach marker-and-cell

9. Fluid Solver – Eulerian Approach octree depth time (sec) nodes 70.8203,905 94.93,288,225 1148.252,662,337 13662.8842,687,105 grid generation

10. Eulerian Fluid Grid – Example

11. Coupling – Surface Triangulation

12. Structure Solver – Any Grid

13. Time Stepping – Algorithm fluid: Navier-Stokes  explicit  Chorin‘s projection coupling  weak  recover divergence-free flow field

14. Time Stepping – Algorithm

15. FLOWCOUPLINGSTRUCTURE send geometry initialisation update surface update grid Chorin‘s proj. time step send forces update surface update grid time step send velocities

16. Example Application

17. Conclusions modularity recursive structure physical correctness  simple, but efficient and applicable