Uploaded September 2026 | Updated November 2026, 6 hours ago
This simulation uses a similar set-up as in the video youtu.be/A2bEMsJbe5E , but with Neumann boundary conditions. A wave source is producing pulses at regular time intervals during the first 20 seconds of the simulation. The source is surrounded by obstacles placed on a "sunflower" grid. This grid is obtained by placing the obstacles randomly, but with the constraint that the distance between obstacles have a minimal value.
Dirichlet boundary conditions are very easy to implement in a finite difference scheme: it suffices to keep the wave height equal to zero outside the domain, and use this zero value when computing the discrete Laplacian. For Neumann boundary conditions, however, one has to implement the condition that the normal derivative of the wave height is zero at the boundary. This is implemented here by adding "ghost" points next to the grid points in the domain, and computing their value in such a way that the normal derivative is approximately zero. These points are then used to compute the discrete Laplacian at points in the domain next to the boundary.
The color hue depends on the wave height. The curve on the right shows the wave height near the right boundary.
Render time: 36 minutes 21 seconds
Compression: crf 25
Color scheme: Turbo, by Anton Mikhailov
gist.github.com/mikhailov-work/6a308c20e494d9e0ccc29036b28faa7a
Music: "Lude Illa" by Joe Bagale
See also
https://images.math.cnrs.fr/des-ondes-dans-mon-billard-partie-i/ for more explanations (in French) on a few previous simulations of wave equations.
The simulation solves the wave equation by discretization. The algorithm is adapted from the paper hplgit.github.io/fdm-book/doc/pub/wave/pdf/wave-4print.pdf
C code: github.com/nilsberglund-orleans/YouTube-simulations
https://www.idpoisson.fr/berglund/software.html
Many thanks to Marco Mancini and Julian Kauth for helping me to accelerate my code!
#wave #obstacles #diffraction
This simulation uses a similar set-up as in the video youtu.be/A2bEMsJbe5E , but with Neumann boundary conditions. A wave source is producing pulses at regular time intervals during the first 20 seconds of the simulation. The source is surrounded by obstacles placed on a "sunflower" grid. This grid is obtained by placing the obstacles randomly, but with the constraint that the distance between obstacles have a minimal value.
Dirichlet boundary conditions are very easy to implement in a finite difference scheme: it suffices to keep the wave height equal to zero outside the domain, and use this zero value when computing the discrete Laplacian. For Neumann boundary conditions, however, one has to implement the condition that the normal derivative of the wave height is zero at the boundary. This is implemented here by adding "ghost" points next to the grid points in the domain, and computing their value in such a way that the normal derivative is approximately zero. These points are then used to compute the discrete Laplacian at points in the domain next to the boundary.
The color hue depends on the wave height. The curve on the right shows the wave height near the right boundary.
Render time: 36 minutes 21 seconds
Compression: crf 25
Color scheme: Turbo, by Anton Mikhailov
gist.github.com/mikhailov-work/6a308c20e494d9e0ccc29036b28faa7a
Music: "Lude Illa" by Joe Bagale
See also
https://images.math.cnrs.fr/des-ondes-dans-mon-billard-partie-i/ for more explanations (in French) on a few previous simulations of wave equations.
The simulation solves the wave equation by discretization. The algorithm is adapted from the paper hplgit.github.io/fdm-book/doc/pub/wave/pdf/wave-4print.pdf
C code: github.com/nilsberglund-orleans/YouTube-simulations
https://www.idpoisson.fr/berglund/software.html
Many thanks to Marco Mancini and Julian Kauth for helping me to accelerate my code!
#wave #obstacles #diffraction










