Numerical Convergence in Smoothed Particle Hydrodynamics
Qirong Zhu, Lars Hernquist, Yuexing Li

TL;DR
This paper investigates the convergence properties of smoothed particle hydrodynamics (SPH), showing that true convergence requires increasing the number of neighbor particles with resolution, which impacts computational cost.
Contribution
It demonstrates that SPH convergence depends on scaling the neighbor count with particle number, providing an optimal scaling law and analyzing its computational implications.
Findings
Formal convergence requires increasing neighbor particles with resolution.
Optimal neighbor scaling is proportional to the square root of total particles.
Computational cost scales as N^{1.5} for convergent SPH simulations.
Abstract
We study the convergence properties of smoothed particle hydrodynamics (SPH) using numerical tests and simple analytic considerations. Our analysis shows that formal numerical convergence is possible in SPH only in the joint limit , , and , where is the total number of particles, is the smoothing length, and is the number of neighbor particles within the smoothing volume used to compute smoothed estimates. Previous work has generally assumed that the conditions and are sufficient to achieve convergence, while holding fixed. We demonstrate that if is held fixed as the resolution is increased, there will be a residual source of error that does not vanish as and . Formal numerical convergence in SPH is possible…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
