Smoothed Particle Hydrodynamics in pkdgrav3 for Shock Physics Simulations. I. Hydrodynamics

Abstract We present pkdgrav3 , a high-performance, fully parallel tree smoothed particle hydrodynamics (SPH) code designed for large-scale hydrodynamic simulations including self-gravity. Building upon the long development history of pkdgrav , the code combines an efficient hierarchical tree algorithm for gravity and neighbor finding with a modern implementation of SPH optimized for massively parallel hybrid CPU/GPU architectures. Its hybrid shared/distributed memory model, combined with an asynchronous communication scheme, allows pkdgrav3 to scale efficiently to thousands of CPU cores and GPUs. We validate the numerical accuracy of pkdgrav3 using a suite of standard tests, demonstrating excellent agreement with analytic or reference solutions. The code was already used in several peer-reviewed publications to model planetary-scale impacts, where SPH’s Lagrangian nature allows for accurate tracking of material origin and thermodynamic evolution. These examples highlight pkdgrav3 ’s robustness and efficiency in simulating highly dynamical, self-gravitating systems. pkdgrav3 thus provides a powerful, flexible, and scalable platform for astrophysical and planetary applications, capable of exploiting the full potential of modern heterogeneous high-performance computing systems.

Authors

Institutions

Publication Details

Journal
The Astrophysical Journal
Published
2026-03-27
DOI
https://doi.org/10.3847/1538-4357/ae4e29
Primary Topic
Fluid Dynamics Simulations and Interactions
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Smoothed Particle Hydrodynamics in pkdgrav3 for Shock Physics Simulations. I. Hydrodynamics

Joachim Stadel, Christian Reinhardt, Thomas Meier, D. Potter
The Astrophysical Journal
Fluid Dynamics Simulations and Interactions
article

Smoothed Particle Hydrodynamics in pkdgrav3 for Shock Physics Simulations. I. Hydrodynamics

Joachim Stadel, Christian Reinhardt, Thomas Meier, D. Potter
article en

Abstract

Abstract We present pkdgrav3 , a high-performance, fully parallel tree smoothed particle hydrodynamics (SPH) code designed for large-scale hydrodynamic simulations including self-gravity. Building upon the long development history of pkdgrav , the code combines an efficient hierarchical tree algorithm for gravity and neighbor finding with a modern implementation of SPH optimized for massively parallel hybrid CPU/GPU architectures. Its hybrid shared/distributed memory model, combined with an asynchronous communication scheme, allows pkdgrav3 to scale efficiently to thousands of CPU cores and GPUs. We validate the numerical accuracy of pkdgrav3 using a suite of standard tests, demonstrating excellent agreement with analytic or reference solutions. The code was already used in several peer-reviewed publications to model planetary-scale impacts, where SPH’s Lagrangian nature allows for accurate tracking of material origin and thermodynamic evolution. These examples highlight pkdgrav3 ’s robustness and efficiency in simulating highly dynamical, self-gravitating systems. pkdgrav3 thus provides a powerful, flexible, and scalable platform for astrophysical and planetary applications, capable of exploiting the full potential of modern heterogeneous high-performance computing systems.

The Astrophysical JournalVol. 1000(2)
University of Bern (CH), ZHAW Zurich University of Applied Sciences (CH), University of Zurich (CH)
Openalex Percentile: Top 99%
Fluid Dynamics Simulations and Interactions
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.