威尼斯赌博游戏_威尼斯赌博app-【官网】

图片

威尼斯赌博游戏_威尼斯赌博app-【官网】

图片

New lab member: Valentin Churavy

On August 1st, 2024, Valentin Churavy has joined our team in the HPSC Lab as a postdoctoral researcher and research software engineer. He will primarily work on the DFG project ACTRIX, which aims to support accessible extreme-scale computing with Trixi.jl and the Julia programming language. The project is a collaboration between the HPSC Lab and the team of Hendrik Ranocha at the 威尼斯赌博游戏_威尼斯赌博app-【官网】 of Mainz, where Valentin is also affiliated.

Valentin has a background in cognitive and computer science. During his PhD at MIT's Julia Lab, he worked on the Julia programming language and its application to high-performance computing. Next to being a core contributor to the Julia language itself, he is the lead developer or core contributor to a number of key Julia packages. These include the JuliaGPU and JuliaParallel ecosystems, specifically KernelAbstractions.jl for hardware-agnostic parallel programming, Enzyme.jl for compiler-enhanced automatic differentiation, or Cthulhu.jl for debugging type inference issues. Furthermore, he is also the initiator and host of the monthly Julia HPC call and an ardent community advocate for using Julia for high-performance computing.

Welcome to the HPSC Lab, Valentin??! We are looking forward to working with you!

? Valentin Churavy

Together with Erik Faulhaber, Sven Berger, Christian Wei?enfels und Gregor Gassner,?we have submitted our paper "Robust and efficient pre-processing techniques for particle-based methods including dynamic boundary generation".

?

arXiv:2506.21206 reproduce me!

?

?

Abstract

Obtaining high-quality particle distributions for stable and accurate particle-based simulations poses significant challenges, especially for complex geometries. We introduce a preprocessing technique for 2D and 3D geometries, optimized for smoothed particle hydrodynamics (SPH) and other particle-based methods. Our pipeline begins with the generation of a resolution-adaptive point cloud near the geometry's surface employing a face-based neighborhood search. This point cloud forms the basis for a signed distance field, enabling efficient, localized computations near surface regions. To create an initial particle configuration, we apply a hierarchical winding number method for fast and accurate inside-outside segmentation. Particle positions are then relaxed using an SPH-inspired scheme, which also serves to pack boundary particles. This ensures full kernel support and promotes isotropic distributions while preserving the geometry interface. By leveraging the meshless nature of particle-based methods, our approach does not require connectivity information and is thus straightforward to integrate into existing particle-based frameworks. It is robust to imperfect input geometries and memory-efficient without compromising performance. Moreover, our experiments demonstrate that with increasingly higher resolution, the resulting particle distribution converges to the exact geometry.

Search