#include "cs_defs.h" Include dependency graph for cs_lagr_agglo.h:
 Include dependency graph for cs_lagr_agglo.h:Go to the source code of this file.
| Functions | |
| void | cs_lagr_agglo_merge_arrays (cs_lnum_2_t arr1[], cs_lnum_2_t arr2[], cs_lnum_t n1, cs_lnum_t n2, cs_lnum_2_t arr3[]) | 
| Merge two sorted arrays in a third sorted array.  More... | |
| cs_lnum_t | cs_lagr_agglomeration (cs_lnum_t cell_id, cs_real_t dt, cs_real_t minimum_particle_diam, cs_lnum_t start_particle, cs_lnum_t end_particle) | 
| Agglomeration algorithm based on algorithms used in rare gas modelling.  More... | |
| void cs_lagr_agglo_merge_arrays | ( | cs_lnum_2_t | arr1[], | 
| cs_lnum_2_t | arr2[], | ||
| cs_lnum_t | n1, | ||
| cs_lnum_t | n2, | ||
| cs_lnum_2_t | arr3[] | ||
| ) | 
Merge two sorted arrays in a third sorted array.
| [in] | arr1 | first sorted array | 
| [in] | arr2 | second sorted array | 
| [in] | n1 | size of first sorted array | 
| [in] | n2 | size of second sorted array | 
| [in,out] | arr3 | preallocated array that will contain the sorted merge of the two previous arrays | 
| cs_lnum_t cs_lagr_agglomeration | ( | cs_lnum_t | cell_id, | 
| cs_real_t | dt, | ||
| cs_real_t | minimum_particle_diam, | ||
| cs_lnum_t | start_particle, | ||
| cs_lnum_t | end_particle | ||
| ) | 
Agglomeration algorithm based on algorithms used in rare gas modelling.
Parcels represent physical particles with similar properties (size). The number of physical particles in a parcel is represented by the statistical weight.
Working hypotheses:
1) Discrete diameters
| [in] | cell_id | current cell id | 
| [in] | dt | time step | 
| [in] | minimum_particle_diam | minumum diameter (monomere diameter) | 
| [in] | start_particle | index of the first particle | 
| [in] | end_particle | index after the last particle |