Nils Berglund | A "molecular sieve": sorting particles by size @NilsBerglund | Uploaded September 2024 | Updated October 2024, 1 hour ago.
In this simulation, I tried to come up with a system that is able to sort particles according to their size. It consists in three grids of obstacles with decreasing space between them, acting as particle sieves. The obstacles rotate and exert a tangential force on the particles, in order to decrease clogging of the sieves.
The conveyor belt effect results from the segments forming the belt exerting a tangential force on the polygons, in addition to the normal force. The tangential force is proportional to the difference between the tangential speed of the polygon and the speed of the belt.
To compute the force and torque of polygon j on polygon i, the code computes the distance of each vertex of polygon j to the faces of polygon i. If this distance is smaller than a threshold, the force increases linearly with a large spring constant. In addition, radial forces between the vertices of the polygons have been added, whenever a vertex of polygon j is not on a perpendicular to a face of polygon i. This is important, because otherwise triangles can approach each other from the vertices, and when one vertex moves sideways, it is suddenly strongly accelerated, causing numerical instability. A weak Lennard-Jones interaction between polygons has been added, as it seems to increase numerical stability.
Unlike in some previous videos involving interacting polygons, there is no thermostat in this simulation. Instead, friction forces (both linear and angular) have been added for numerical stability. In addition, the particles are subject to a gravitational force directed downwards.
The color of the polygons depends on their size.
To save on computation time, particles are placed into a "hash grid", each cell of which contains between 3 and 10 particles. Then only the influence of other particles in the same or neighboring cells is taken into account for each particle.
The Lennard-Jones potential is strongly repulsive at short distance, and mildly attracting at long distance. It is widely used as a simple yet realistic model for the motion of electrically neutral molecules. The force results from the repulsion between electrons due to Pauli's exclusion principle, while the attractive part is a more subtle effect appearing in a multipole expansion. For more details, see en.wikipedia.org/wiki/Lennard-Jones_potential
Render time: 50 minutes 6 seconds
Compression: crf 23
Color scheme: Turbo, by Anton Mikhailov
gist.github.com/mikhailov-work/6a308c20e494d9e0ccc29036b28faa7a
Music: "Crystal" by Vibe Tracks
Current version of the C code used to make these animations:
github.com/nilsberglund-orleans/YouTube-simulations
https://www.idpoisson.fr/berglund/software.html
Some outreach articles on mathematics:
https://images.math.cnrs.fr/auteurs/nils-berglund/
(in French, some with a Spanish translation)
#molecular_dynamics #polygons #conveyor
In this simulation, I tried to come up with a system that is able to sort particles according to their size. It consists in three grids of obstacles with decreasing space between them, acting as particle sieves. The obstacles rotate and exert a tangential force on the particles, in order to decrease clogging of the sieves.
The conveyor belt effect results from the segments forming the belt exerting a tangential force on the polygons, in addition to the normal force. The tangential force is proportional to the difference between the tangential speed of the polygon and the speed of the belt.
To compute the force and torque of polygon j on polygon i, the code computes the distance of each vertex of polygon j to the faces of polygon i. If this distance is smaller than a threshold, the force increases linearly with a large spring constant. In addition, radial forces between the vertices of the polygons have been added, whenever a vertex of polygon j is not on a perpendicular to a face of polygon i. This is important, because otherwise triangles can approach each other from the vertices, and when one vertex moves sideways, it is suddenly strongly accelerated, causing numerical instability. A weak Lennard-Jones interaction between polygons has been added, as it seems to increase numerical stability.
Unlike in some previous videos involving interacting polygons, there is no thermostat in this simulation. Instead, friction forces (both linear and angular) have been added for numerical stability. In addition, the particles are subject to a gravitational force directed downwards.
The color of the polygons depends on their size.
To save on computation time, particles are placed into a "hash grid", each cell of which contains between 3 and 10 particles. Then only the influence of other particles in the same or neighboring cells is taken into account for each particle.
The Lennard-Jones potential is strongly repulsive at short distance, and mildly attracting at long distance. It is widely used as a simple yet realistic model for the motion of electrically neutral molecules. The force results from the repulsion between electrons due to Pauli's exclusion principle, while the attractive part is a more subtle effect appearing in a multipole expansion. For more details, see en.wikipedia.org/wiki/Lennard-Jones_potential
Render time: 50 minutes 6 seconds
Compression: crf 23
Color scheme: Turbo, by Anton Mikhailov
gist.github.com/mikhailov-work/6a308c20e494d9e0ccc29036b28faa7a
Music: "Crystal" by Vibe Tracks
Current version of the C code used to make these animations:
github.com/nilsberglund-orleans/YouTube-simulations
https://www.idpoisson.fr/berglund/software.html
Some outreach articles on mathematics:
https://images.math.cnrs.fr/auteurs/nils-berglund/
(in French, some with a Spanish translation)
#molecular_dynamics #polygons #conveyor
![[Flash warning] A planar wave crossing a gradient index lens at an angle](https://i.ytimg.com/vi/vZ_pKzjFXvo/hqdefault.jpg "[Flash warning] A planar wave crossing a gradient index lens at an angle
The first part of this video shows some flashing due to the formation of standing waves.
This is a variant of the simulation https://youtu.be/CdpTq3dSrXA , in which the incoming planar wave makes a small angle with the axis of symmetry of the lens. The videos are inspired by Huygens Optics recent short https://youtube.com/shorts/VGd3Ajnp6e0 showing the principle of a gradient index lens.
Lenses focus incoming rays of light by delaying them more near the center of the lens than at its periphery. This is often done with a material of constant index of refraction, by making the lens thicker near the center, as shown for instance in the simulation https://youtu.be/rrJJBh9ubUE . However, one can also build lenses of constant thickness, by making the index of refraction of their material depend on the location in the lens.In this simulation, the index decreases like sqrt(n0² - a*r²), where r is the distance to the axis of symmetry. This results in the incoming planar wave being focused at a point in the focal plane, marked by a vertical line. The plot to the right shows a time-averaged value of the field along that plane.
This video has two parts, showing the same evolution with two different color gradients:
Wave height: 0:00
Averaged wave energy: 1:03
In the first part, the color hue depends on the height of the wave. In the second part, it depends on the energy of the wave, averaged over a sliding time window.
There are periodic boundary conditions between the top and bottom boundaries, absorbing boundary conditions on the right boundary, and a time-periodic signal is imposed on the left boundary. The display at the right shows the signal along the focal plane, which is indicated by a vertical line.
Render time: 30 minutes 1 second
Compression: crf 23
Color scheme: Part 1 - Twilight by Bastian Bechtold
https://github.com/bastibe/twilight
Part 2 - Inferno by Nathaniel J. Smith and Stefan van der Walt
https://github.com/BIDS/colormap
Music: Chicago by Joe Bagale
See also https://images.math.cnrs.fr/Des-ondes-dans-mon-billard-partie-I.html 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 https://hplgit.github.io/fdm-book/doc/pub/wave/pdf/wave-4print.pdf
C code: https://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 #lens #gradient_index")
