#include "cs_defs.h" Include dependency graph for cs_lagr_fragmentation.h:
 Include dependency graph for cs_lagr_fragmentation.h:Go to the source code of this file.
| Functions | |
| cs_lnum_t | cs_lagr_fragmentation (cs_real_t dt, cs_real_t minimum_particle_diam, cs_lnum_t main_start, cs_lnum_t main_end, cs_lnum_t agglo_start, cs_lnum_t agglo_end) | 
| Particle fragmentation algorithm.  More... | |
| cs_lnum_t cs_lagr_fragmentation | ( | cs_real_t | dt, | 
| cs_real_t | minimum_particle_diam, | ||
| cs_lnum_t | main_start, | ||
| cs_lnum_t | main_end, | ||
| cs_lnum_t | agglo_start, | ||
| cs_lnum_t | agglo_end | ||
| ) | 
Particle fragmentation algorithm.
Parcels represent physical particles with similar properties (size). The number of physical particles in a parcel is represented by the statistical weight.
For each parcel, the number of fragmentation events is generated with a Poisson distribution that depends on the fragmentation kernel.
Working hypotheses: 1) Discrete diameters
Warning: particle indices are not necessarily contiguous (due to agglomeration occuring before).
Two contiguous groups: particles present before agglomeration newly created particles (due to agglomeration)
| [in] | dt | time step | 
| [in] | minimum_particle_diam | minumum diameter (monomere diameter) | 
| [in] | main_start | index of the first particle in cell present before the agglomeration | 
| [in] | main_end | index after the last particle in cell, present before the agglomeration | 
| [in] | agglo_start | index of the first particle in cell, created by the agglomeration | 
| [in] | agglo_end | index after the last particle in cell, created by the agglomeration |