Technische Universität München Benefits of Structured Cartesian Grids for the Simulation of Fluid- Structure Interactions Miriam Mehl Department of Computer.

Slides:



Advertisements
Similar presentations
Technische Universität München KONWIHR II – Computational Steering Miriam Mehl Juni 2009.
Advertisements

Technische Universität München Fakultät für Informatik Scientific Computing in Computer Science Practical Course CFD - Free Boundary Value Problems Tobias.
CSE Seminar Benefits of Hierarchy and Adaptivity Preliminary Discussion Dr. Michael Bader / Dr. Miriam Mehl Institut für Informatik Scientific Computing.
Practical Course SC & V More on Boundaries Dr. Miriam Mehl Institut für Informatik Schwerpunkt Wissenschaftliches Rechnen.
Multidisciplinary Computation and Numerical Simulation V. Selmin.
1 FEM study of the faults activation Technische Universität München Joint Advanced Student School (JASS) St. Petersburg Polytechnical University Author:
An Eulerian Divergence Preserving Approach for Partitioned FSI Simulations on Cartesian Grids M. Mehl, M. Brenk, I. Muntean, T. Neckel, T. Weinzierl TU.
An Efficient Multigrid Solver for (Evolving) Poisson Systems on Meshes Misha Kazhdan Johns Hopkins University.
Parallelizing stencil computations Based on slides from David Culler, Jim Demmel, Bob Lucas, Horst Simon, Kathy Yelick, et al., UCB CS267.
Efficient Storage and Processing of Adaptive Triangular Grids using Sierpinski Curves Csaba Attila Vigh Department of Informatics, TU München JASS 2006,
A Bezier Based Approach to Unstructured Moving Meshes ALADDIN and Sangria Gary Miller David Cardoze Todd Phillips Noel Walkington Mark Olah Miklos Bergou.
A Bezier Based Approach to Unstructured Moving Meshes ALADDIN and Sangria Gary Miller David Cardoze Todd Phillips Noel Walkington Mark Olah Miklos Bergou.
1 Internal Seminar, November 14 th Effects of non conformal mesh on LES S. Rolfo The University of Manchester, M60 1QD, UK School of Mechanical,
Particle-based fluid simulation for interactive applications
Improved Mesh Partitioning For Parallel Substructure Finite Element Computations Shang-Hsien Hsieh, Yuan-Sen Yang and Po-Liang Tsai Department of Civil.
Cache-Optimal Parallel Solution of PDEs Ch. Zenger Informatik V, TU München Finite Element Solution of PDEs Christoph Zenger Nadine Dieminger, Frank Günther,
1/36 Gridless Method for Solving Moving Boundary Problems Wang Hong Department of Mathematical Information Technology University of Jyväskyklä
Module on Computational Astrophysics Jim Stone Department of Astrophysical Sciences 125 Peyton Hall : ph :
Numerical methods for PDEs PDEs are mathematical models for –Physical Phenomena Heat transfer Wave motion.
Introduction Multigrid finite-element solvers using the corotational formulation of finite elements provide an attractive means for the simulation of deformable.
Technische Universität München 1 Traffic Simulation with Queues Ferienakademie, Sarntal Neven Popov.
Parallel Adaptive Mesh Refinement Combined With Multigrid for a Poisson Equation CRTI RD Project Review Meeting Canadian Meteorological Centre August.
Grid Generation.
A Parallelisation Approach for Multi-Resolution Grids Based Upon the Peano Space-Filling Curve Student: Adriana Bocoi Advisor: Dipl.-Inf.Tobias Weinzierl.
Hybrid WENO-FD and RKDG Method for Hyperbolic Conservation Laws
A. Spentzos 1, G. Barakos 1, K. Badcock 1 P. Wernert 2, S. Schreck 3 & M. Raffel 4 1 CFD Laboratory, University of Glasgow, UK 2 Institute de Recherche.
1 Data Structures for Scientific Computing Orion Sky Lawlor charm.cs.uiuc.edu 2003/12/17.
Matthew Fischels Aerospace Engineering Department Major Professor : Dr. R. Ganesh Rajagopalan REDUCING RUNTIME OF WIND TURBINE SIMULATION Los Alamos National.
A Hybrid Particle-Mesh Method for Viscous, Incompressible, Multiphase Flows Jie LIU, Seiichi KOSHIZUKA Yoshiaki OKA The University of Tokyo,
A Fast Simulation Method Using Overlapping Grids for Interactions between Smoke and Rigid Objects Yoshinori Dobashi (Hokkaido University) Tsuyoshi Yamamoto.
Page 1 JASS 2004 Tobias Weinzierl Sophisticated construction ideas of ansatz- spaces How to construct Ritz-Galerkin ansatz-spaces for the Navier-Stokes.
Numerical simulation of the Fluid-Structure Interaction in stented aneurysms M.-A. FERNÁNDEZ, J.-F. GERBEAU, J. MURA INRIA / REO Team Paris-Rocquencourt.
Mesh Generation 58:110 Computer-Aided Engineering Reference: Lecture Notes on Delaunay Mesh Generation, J. Shewchuk (1999)
JASS 2005 Saint Petersburg Space-Filling Curves An Introduction Presented by Levi Valgaerts.
MA5251: Spectral Methods & Applications
GPU-Accelerated Surface Denoising and Morphing with LBM Scheme Ye Zhao Kent State University, Ohio.
Ferienakademie 2007 Partitioned approach for Fluid-Structure-Interaction (FSI) Atanas Gegov TU München.
Resource Addressable Network (RAN) An Adaptive Peer-to-Peer Substrate for Internet-Scale Service Platforms RAN Concept & Design  Adaptive, self-organizing,
RPI Master’s Project Proposal Noel A. Modesto-Madera September 28, 2010 Numerical Investigation of Supersonic Flow Over a Blunt Body.
Computer Science and Engineering Parallelizing Defect Detection and Categorization Using FREERIDE Leonid Glimcher P. 1 ipdps’05 Scaling and Parallelizing.
Introduction to Scientific Computing II Multigrid Dr. Miriam Mehl Institut für Informatik Scientific Computing In Computer Science.
Introduction to Scientific Computing II Multigrid Dr. Miriam Mehl.
Introduction to Scientific Computing II
3D Object Representations 2011, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
1 Data Structures for Scientific Computing Orion Sky Lawlor /04/14.
Scientific Computing Lab Outlook / State of Research Dr. Miriam Mehl Institut für Informatik Scientific Computing in Computer Science.
Dynamic Geometry Displacement Jens Krüger Technische Universität München.
Multigrid Methods The Implementation Wei E Universität München. Ferien Akademie 19 th Sep
Lab Course CFD Introduction Dr. Miriam Mehl Institut für Informatik Schwerpunkt Wissenschaftliches Rechnen.
Lab Course CFD Introduction Dr. Miriam Mehl. CFD – Applications stirrers.
Universität Dortmund Fakultät für Mathematik IAM technische universität dortmund A numerical set-up for benchmarking and optimization of fluid-structure.
Multipole-Based Preconditioners for Sparse Linear Systems. Ananth Grama Purdue University. Supported by the National Science Foundation.
Tony Arts Carlo Benocci Patrick Rambaud
SIGGRAPH 2005 신 승 호 신 승 호. Water Drops on Surfaces Huamin Wang Peter J. Mucha Greg Turk Georgia Institute of Technology.
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
Computational Fluid Dynamics P AVEL P ETRUNEAC B ACHELOR OF S CIENCE D ISSERTATION R ENEWABLE E NERGY OF TURBULENCE EFFECTS ON THE SEABED Supervisor(s):
Smoothed Particle Hydrodynamics For Deformable Vessel Dynamics Progress Report Van Jones 2008/01/30.
Technische Universität München Peano 2. Technische Universität München Peano 2, Jun Features of Peano Adaptive Cartesian Grids –Arbitrary.
Unstructured Meshing Tools for Fusion Plasma Simulations
Department of Computer Science, TU München
Xing Cai University of Oslo
3D Object Representations
cache efficiency and parallelization of numerical simulations
Introduction to Scientific Computing II
Pressure Poisson Equation
Efficient Parallel Simulation of Fluid Dynamics on Cartesian Grids
Scientific Computing Lab
Introduction to Scientific Computing II
Particle-in-Cell Methods
Introduction to Scientific Computing II
Presentation transcript:

Technische Universität München Benefits of Structured Cartesian Grids for the Simulation of Fluid- Structure Interactions Miriam Mehl Department of Computer Science TU München

Technische Universität München Outline Our Cartesian Grids Requirements Fluid-Structure Interactions Cartesian Grids – CFD Cartesian Grids – Coupling Application Examples Conclusion

Technische Universität München Our Cartesian Grids Cartesian grid cells  squares/cubes recursive refinement  tree structure

Technische Universität München Our Cartesian Grids Cartesian grid cells  squares/cubes recursive refinement  tree structure

Technische Universität München Fluid-Structure Interactions – Requirements complex and changing geometries  flow solver

Technische Universität München Fluid-Structure Interactions – Requirements complex and changing geometries  flow solver partitioned approaches  coupling of codes  modularity Structure Solver Flow Solver Coupling

Technische Universität München Cartesian Grids – CFD fast and flexible geometry treatment Eulerian Approach + Marker-and-Cell

Technische Universität München Cartesian Grids – CFD # grid cellsruntime (sec) 52,662, ,666, , Pentium 4, 2.4 GHz, 512 MB cache fast and flexible geometry treatment

Technische Universität München Cartesian Grids – CFD fast and flexible geometry treatment

Technische Universität München Cartesian Grids – CFD fast and flexible geometry treatment

Technische Universität München Cartesian Grids – CFD recursive cell-tree  local grid changes fast and flexible geometry treatment

Technische Universität München Cartesian Grids – CFD hardware + numerical efficiency

Technische Universität München Cartesian Grids – CFD cell-oriented operator evaluation  constant difference stencils  no neighbour relations

Technische Universität München Cartesian Grids – CFD cell-oriented operator evaluation  constant difference stencils  no neighbour relations i,j i-1,j ½ -1 ½

Technische Universität München Cartesian Grids – CFD cell-oriented operator evaluation  constant difference stencils  no neighbour relations i,j i-1,j i,j i-1,j -1 ½ ½

Technische Universität München Cartesian Grids – CFD cell-oriented operator evaluation  constant difference stencils  no neighbour relations i-1,j ½ -1 ½

Technische Universität München Cartesian Grids – CFD cell-oriented operator evaluation  constant difference stencils  no neighbour relations ½ ½ -1

Technische Universität München Cartesian Grids – CFD Peano curve  linearisation of the cell-tree  processing order

Technische Universität München Cartesian Grids – CFD Peano curve  linearisation of the cell-tree  processing order

Technische Universität München Cartesian Grids – CFD Peano curve + stacks = data access with  locality in space  locality in time

Technische Universität München Cartesian Grids – CFD Peano curve + stacks = data access with  locality in space  locality in time

Technische Universität München Cartesian Grids – CFD low memory requirements bytes/cellbytes/vertex 2D 62only grid 1420flow solver 3D 102only grid 1828flow solver hardware + numerical efficiency

Technische Universität München ==19243== D refs: 7,249,842,728 (4,026,485,237 rd + 3,223,357,491 wr) ==19243== D1 misses: 1,249,032 ( 621,413 rd + 627,619 wr) ==19243== L2d misses: 632,162 ( 301,283 rd + 330,879 wr) ==19243== D1 miss rate: 0.0% ( 0.0% + 0.0% ) ==19243== L2d miss rate: 0.0% ( 0.0% + 0.0% ) ==19243== ==19243== L2 refs: 19,559,185 ( 18,931,566 rd + 627,619 wr) ==19243== L2 misses: 646,343 ( 315,464 rd + 330,879 wr) ==19243== L2 miss rate: 0.0% ( 0.0% + 0.0% ) Cartesian Grids – CFD 2D Poisson equation, 1,000,000 degrees of freedom, Pentium 4, 1MB L2 Cache, Cachegrind simulation hardware + numerical efficiency high cache-efficiency

Technische Universität München Cartesian Grids – CFD multigrid dehierarchisation compute residual smooth restrict residual hardware + numerical efficiency

Technische Universität München Cartesian Grids – CFD # dyn. refinem.k=0k=1k=2k=3 # iterations91099 accuracy5.972e e e e-5 Poisson equation on a cube, F-cycle hardware + numerical efficiency multigrid

Technische Universität München Cartesian Grids – CFD tol. 1.17e-3reg. gridadapt. grid # dofs hardware + numerical efficiency dynamical adaptivity

Technische Universität München Cartesian Grids – CFD dynamically balanced parallelisation

Technische Universität München Cartesian Grids – CFD  connected partitions  quasi-minimal partition surface dynamically balanced parallelisation

Technische Universität München Cartesian Grids – CFD dynamically balanced parallelisation

Technische Universität München Advantages of Cartesian Grids – CFD dynamically balanced parallelisation

Technische Universität München Cartesian Grids – CFD dynamically balanced parallelisation

Technische Universität München Cartesian Grids – Coupling efficient data mapping for non-matching grids fluid solver + interpolation struct. solver + interpolation FSI*ce surface coupling Grid administration Data mapping

Technische Universität München Cartesian Grids – Coupling

Technische Universität München Cartesian Grids – Coupling sphere (8,000 triangles)

Technische Universität München Cartesian Grids – Coupling grid resolution# boundary nodesruntime [s] 6418, , , ,227, sphere (8,000 triangles), Pentium M 1.6 GHz, 2048 kB cache efficient data mapping for non-matching grids

Technische Universität München Cartesian Grids – Coupling trianglesruntime [s] 16, , , , grid resolution 512, Pentium M 1.6 GHz, 2048 kB cache efficient data mapping for non-matching grids

Technische Universität München Application Examples – Cylinder Benchmark

Technische Universität München Application Examples – Beam

Technische Universität München Application Examples – Drift Ratchet silicon wafer pierced with pores oscillating pressure conditions suspended particles (0.1 – 1.2  m) observation: particle drift

Technische Universität München Application Examples – Drift Ratchet

Technische Universität München Application Examples – Drift Ratchet

Technische Universität München Application Examples – Drift Ratchet frequency=10kHzfrequency=14kHz

Technische Universität München Application Examples – Drift Ratchet frequency=7kHz frequency=14kHz

Technische Universität München Conclusion applicability of Cartesian Grids fast grid generation / updates memory efficiency numerical efficiency

Technische Universität München Persons Hans-Joachim Bungartz Markus Brenk Klaus Daubner Ioan Lucian Muntean Tobias Neckel Tobias Weinzierl