cs_lagr_fragmentation.h File Reference

#include "cs_defs.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_real_t rho, cs_lnum_t main_start, cs_lnum_t main_end, cs_lnum_t agglo_start, cs_lnum_t agglo_end)
	Particle fragmentation algorithm. More...

Function Documentation

cs_lagr_fragmentation()

cs_lnum_t cs_lagr_fragmentation	(	cs_real_t	dt,
		cs_real_t	minimum_particle_diam,
		cs_real_t	rho,
		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

• Minimal particle size , called a monomere (unbreakable particle) 2) Fragmentation is binary
• Equally sized fragments (N0/2, or (N0+-1)/2) 3) Fragmentation is treated after agglomeration

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)

Parameters

[in]	cell_id	current cell id
[in]	dt	time step
[in]	minimum_particle_diam	minumum diameter (monomere diameter)
[in]	rho	particles density
[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

Returns

modified list of particles containing newly created parcels at the end