https://github.com/auralius/smoothed-particle-hydrodynamics
An implementation of the smoothed particle hydrodynamics based on the Philip Mocz's paper
https://github.com/auralius/smoothed-particle-hydrodynamics
cfd fluid-dynamics matlab smoothed-particle-hydrodynamics
Last synced: 10 months ago
JSON representation
An implementation of the smoothed particle hydrodynamics based on the Philip Mocz's paper
- Host: GitHub
- URL: https://github.com/auralius/smoothed-particle-hydrodynamics
- Owner: auralius
- Created: 2021-06-06T06:24:35.000Z (almost 5 years ago)
- Default Branch: main
- Last Pushed: 2024-11-07T07:44:04.000Z (over 1 year ago)
- Last Synced: 2024-11-07T08:30:53.334Z (over 1 year ago)
- Topics: cfd, fluid-dynamics, matlab, smoothed-particle-hydrodynamics
- Language: MATLAB
- Homepage:
- Size: 14 MB
- Stars: 18
- Watchers: 1
- Forks: 3
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
[](https://www.mathworks.com/matlabcentral/fileexchange/96334-smoothed-particle-hydrodynamics)
# smoothed-particle-hydrodynamics
A MATLAB implementation of the smoothed particle hydrodynamics based on the Philip Mocz's paper, in both CPU and GPU.
By using a GPU, we can speed up the computation to about 10 times. Here, I am using the NVidia Tesla K20m. It is probably the cheapest Tesla card in second-hand markets. ;-)
A normal GPU also works.
Please read Philip Mocz's paper here:
https://pmocz.github.io/manuscripts/pmocz_sph.pdf
Although the paper stated MATLAB implementation, I can only find the Python implementation in his Github repository:
https://github.com/pmocz/sph-python
These are some examples in this repository:
Example 1:
Free-falling Universitas Telkom's logo

Example 2:
Free-falling particles arranged in a grid formation

Example 3:
More free-falling particles also arranged in a grid formation ;-)

Example 4:
Waaayy more free-falling particles also arranged in a grid formation ;-) ;-)

Additional notes:
SPHDemo2D_Ex2_NeighbourSearch_CPU.m uses a very simple neighbour search mechanism to reduce the execution time. We first sort all nodes based on their distances to the origin. Hence, the adjacent nodes are neighbours.
Contact:
manurunga@yadex.com