FracVAL: An improved tunable algorithm of cluster-cluster aggregation for generation of fractal structures formed by polydisperse primary particles

Main Author: Ballantyne, John
Other Authors: Morán, J., Fuentes, A., Liu, F., Yon, J.
Format: Dataset
Terbitan: Mendeley , 2019
Subjects:
Online Access: https:/data.mendeley.com/datasets/mgf8wdcsfb
ctrlnum 0.17632-mgf8wdcsfb.1
fullrecord <?xml version="1.0"?> <dc><creator>Ballantyne, John</creator><title>FracVAL: An improved tunable algorithm of cluster-cluster aggregation for generation of fractal structures formed by polydisperse primary particles</title><publisher>Mendeley</publisher><description>In this study, the tunable algorithm of cluster-cluster aggregation developed by Filippov et al. (2000) for generating fractal aggregates formed by monodisperse spherical primary particles is extended to polydisperse primary particles. This new algorithm, termed FracVAL, is developed by using an innovative aggregation strategy. The algorithm is able to preserve the prescribed fractal dimension (D_f) and prefactor (k_f) for each aggregate, regardless of its size, with negligible error for lognormally distributed primary particles with the geometric standard deviation being as large as 3. In contrast, for polydisperse primary particles the direct use of Filippov et al. (2000) method, as is done by Skorupski et al. (2014), does not ensure the preservation of D_f and k_f for individual aggregates and it is necessary to generate a large number of aggregates to achieve the prescribed D_f and k_f on an ensemble basis. The performance of FracVAL is evaluated for aggregates consisting of 500 and 1000 monomers and for fractal dimension variation over the entire range of D_f between 1 and 3 and k_f between 0.1 and 2.7. Aggregates consisting of 500 monomers are generated on average in less than 2.4 min on a common laptop, illustrating the efficiency of the proposed algorithm.</description><subject>Computational Physics</subject><contributor>Mor&#xE1;n, J.</contributor><contributor>Fuentes, A.</contributor><contributor>Liu, F.</contributor><contributor>Yon, J.</contributor><type>Other:Dataset</type><identifier>10.17632/mgf8wdcsfb.1</identifier><rights>GNU Public License Version 3</rights><rights>http://www.gnu.org/licenses/gpl-3.0.en.html</rights><relation>https:/data.mendeley.com/datasets/mgf8wdcsfb</relation><date>2019-02-21T12:53:35Z</date><recordID>0.17632-mgf8wdcsfb.1</recordID></dc>
format Other:Dataset
Other
author Ballantyne, John
author2 Morán, J.
Fuentes, A.
Liu, F.
Yon, J.
title FracVAL: An improved tunable algorithm of cluster-cluster aggregation for generation of fractal structures formed by polydisperse primary particles
publisher Mendeley
publishDate 2019
topic Computational Physics
url https:/data.mendeley.com/datasets/mgf8wdcsfb
contents In this study, the tunable algorithm of cluster-cluster aggregation developed by Filippov et al. (2000) for generating fractal aggregates formed by monodisperse spherical primary particles is extended to polydisperse primary particles. This new algorithm, termed FracVAL, is developed by using an innovative aggregation strategy. The algorithm is able to preserve the prescribed fractal dimension (D_f) and prefactor (k_f) for each aggregate, regardless of its size, with negligible error for lognormally distributed primary particles with the geometric standard deviation being as large as 3. In contrast, for polydisperse primary particles the direct use of Filippov et al. (2000) method, as is done by Skorupski et al. (2014), does not ensure the preservation of D_f and k_f for individual aggregates and it is necessary to generate a large number of aggregates to achieve the prescribed D_f and k_f on an ensemble basis. The performance of FracVAL is evaluated for aggregates consisting of 500 and 1000 monomers and for fractal dimension variation over the entire range of D_f between 1 and 3 and k_f between 0.1 and 2.7. Aggregates consisting of 500 monomers are generated on average in less than 2.4 min on a common laptop, illustrating the efficiency of the proposed algorithm.
id IOS7969.0.17632-mgf8wdcsfb.1
institution Universitas Islam Indragiri
affiliation onesearch.perpusnas.go.id
institution_id 804
institution_type library:university
library
library Teknologi Pangan UNISI
library_id 2816
collection Artikel mulono
repository_id 7969
city INDRAGIRI HILIR
province RIAU
shared_to_ipusnas_str 1
repoId IOS7969
first_indexed 2020-04-08T08:31:49Z
last_indexed 2020-04-08T08:31:49Z
recordtype dc
_version_ 1686587764027424768
score 17.538404