Direct-quadrature generalized moment based methods were analysed in terms of accuracy, computational cost and robustness for the solution of the population balance problems in the [0,∞) and [0,1] domains. The minimum condition number of the coefficient matrix of their linear system of equations was obtained by global optimization. An heuristic scaling rule from the literature was also evaluated. The results indicate that the methods based on Legendre generalized moments are the most robust for the finite domain problems, while the DQMoM formulation that solves for the abscissas and weights using the heuristic scaling rule is the best for the infinite domain problems.
Population balance; Numerical methods; DQMoM; Generalized moments; Condition number
