Ahrens, RobinRobinAhrensLe Borne, SabineSabineLe Borne2021-05-202021-05-202021-05-02Advances in Computational Mathematics 47 (3): 39 (2021-06-01)http://hdl.handle.net/11420/9572The dynamics of particle processes can be described by population balance equations which are governed by phenomena including growth, nucleation, breakage and aggregation. Estimating the kinetics of the aggregation phenomena from measured density data constitutes an ill-conditioned inverse problem. In this work, we focus on the aggregation problem and present an approach to estimate the aggregation kernel in discrete, low rank form from given (measured or simulated) data. The low-rank assumption for the kernel allows the application of fast techniques for the evaluation of the aggregation integral (O(nlogn) instead of O(n ) where n denotes the number of unknowns in the discretization) and reduces the dimension of the optimization problem, allowing for efficient and accurate kernel reconstructions. We provide and compare two approaches which we will illustrate in numerical tests. 2en1019-7168Advances in computational mathematics20213Springer Science + Business Media B.Vhttps://creativecommons.org/licenses/by/4.0/Aggregation kernelInverse methodLow rank approximationPopulation balance equationMathematikReconstruction of low-rank aggregation kernels in univariate population balance equationsJournal Article10.15480/882.354710.1007/s10444-021-09871-w10.15480/882.3547Other