by Kumar, J., Peglow, M., Warnecke, G., Heinrich, S., Mörl, L..
Series: 2005-10, Preprints
A new discretization method for aggregation equations is developed. It is compared to the fixed pivot technique proposed by Kumar and Ramkrishna (1996, Chem. Eng. Sci. 51, 1311-1332). The numerical results for aggregation problems by discretized population balances are consistently overpredicting and diverge before the gelling point in the case of a gelling kernel. The present work establishes a new technique which assigns the particles within the intervals more precisely. This is achieved by taking first the average the newborn particles within the interval and then assigning them to the neighboring nodes such that pre-chosen properties are exactly preserved. The new technique preserves all the advantages of the conventional discretized methods and provides a significant improvement in predicting the particle size distribution (PDS). In addition, it is found that the technique is a powerful tool for the computation of gelling problems. The effectiveness of the technique is illustrated by application to serveral aggergation problems for suitably selected aggregation kernels.
Population balance, discretization, aggregation, particle, batch, gelation