|
36 | 36 | ``` |
37 | 37 | ./aggregate_gen_main [parameter_list] |
38 | 38 | ``` |
39 | | - [parameter_list] == *num_sph_SA* *levels* *kf* *Df* |
| 39 | +``` |
| 40 | + [parameter_list] == num_sph_SA levels kf Df |
40 | 41 |
|
41 | | - * *num_sph_SA* : Number of spherules in initial clusters in the 1st level of cluster-cluster aggregation (4). |
42 | | - * *levels* : Number of hierarchical levels in cluster-cluster aggregation (10). |
43 | | - * *kf* : Fractal prefactor (1.0). |
44 | | - * *Df* : Fractal dimension (2.5). |
| 42 | + num_sph_SA : Number of spherules in initial clusters in the 1st level of cluster-cluster aggregation (4). |
| 43 | + levels : Number of hierarchical levels in cluster-cluster aggregation (10). |
| 44 | + kf : Fractal prefactor (1.0). |
| 45 | + Df : Fractal dimension (2.5). |
45 | 46 |
|
46 | 47 | If you skip the [parameter_list], the code uses the default values in the parenthesis. Total number of spherules is *N* = num_sph_SA*2<sup>levels</sup>. |
47 | | - |
| 48 | +``` |
48 | 49 |
|
49 | 50 | ### Output data |
50 | 51 | The result is written in a text file "agg_N???_kf???_Df???.out", where the three strings ??? indicate the total number of spherules *N*, the fractal prefactor *kf*, and the fractal dimension *Df*. |
|
55 | 56 | ### Accuracy |
56 | 57 | Maximum error of the center-to-center distance between two-spherules in contact never exceeds 0.005 (typically < 0.001). You can change the tolerance by changing the parameter "tol" defined in "aggregate_gen_main.cpp" |
57 | 58 |
|
58 | | -### Limitation of (kf,Df) |
59 | | -Under the constraint of the fractal-scaling law, finding of an attached-and-nonoverlapped aggregate configuration could be unrealistic for compact (i.e., closely-packed) aggregates. To avoid the infinite looping of the search algorithm, please choose the geometrical parameters (kf,Df) to be kf+Df < ~3.4. |
| 59 | +### Allowed parameter range |
| 60 | +Under the constraint of the fractal-scaling law, finding of an attached-and-nonoverlapped aggregate configuration could be unrealistic for compact (i.e., closely-packed) aggregates. To avoid the infinite looping of the search algorithm, please choose the geometric parameters (kf,Df) to be kf+Df < ~3.5. |
60 | 61 |
|
61 | 62 | ### Random number seed |
62 | 63 | If necessary, random number seed can be changed at line14-15 of "aggregate_gen_main.cpp". |
63 | | - |
| 64 | +``` |
64 | 65 | (line 14) default_random_engine re(random_device{}()); // random seed |
65 | 66 | (line 15) //default_random_engine re; // fixed seed |
66 | | - |
| 67 | +``` |
67 | 68 | By default, the seed of random_number sequence is automatically changed in each execution (using random_device{}()). Fixed seed will be used if you uncomment 15th line and comment out the 14th line. |
68 | 69 |
|
69 | 70 | ### Theory |
|
0 commit comments