Abstract

We consider the numerical solution of the multivariate aggregation population balance equation on a uniform tensor grid. We introduce a multidimensional fast Fourier transformation for the efficient evaluation of the aggregation integrals leading to a reduction in the complexity order of the algorithm compared to the direct evaluation approach. We illustrate the new evaluation algorithm for two discretizations, an FEM approach as well as the sectional method. We discuss the conservation of moments for these methods and provide numerical comparisons illustrating the superior performance of FFT-based algorithms. We also discuss and numerically illustrate their potential for parallelization.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.