Name
Abstract | ||
|---|---|---|
A variety of production processes in chemistry and biotechnology are concerned with particles dispersed in an environmental phase. The particle distribution is mathematically described by the solution of population balance equations of integro-differential type. We are concerned with the aggregation process: it invokes an integral term that is usually numerically expensive to evaluate and often dominates the total simulation cost. We will expose the algorithmic details of an efficient approach based on a separable approximation of the aggregation kernel and a subsequent fast Fourier transformation. This approach reduces the originally quadratic complexity to an almost optimal complexity O(n log n) in the dimension of the approximation space. We include numerical tests illustrating its application to representative aggregation kernels from the literature. While originally developed in the context of a discretization with piecewise constant functions, we illustrate how these ideas can be applied in the setting of the popular sectional methods. (C) 2014 Elsevier Ltd. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.compchemeng.2014.12.011 | Computers & Chemical Engineering |
Keywords | Field | DocType |
Population balance equation,Aggregation,Convolution,Separable kernel approximation,FFT | Kernel (linear algebra),Discretization,Population,Mathematical optimization,Population balance equation,Convolution,Fast Fourier transform,Time complexity,Mathematics,Piecewise | Journal |
Volume | ISSN | Citations |
74 | 0098-1354 | 3 |
PageRank | References | Authors |
0.72 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| le borne | 1 | 33 | 9.07 |
| Lusine Shahmuradyan | 2 | 4 | 1.11 |
| Kai Sundmacher | 3 | 49 | 12.51 |