Publisher DOI: 10.1016/j.compchemeng.2016.11.002
Title: Fast algorithms for hp-discretized univariate population balance aggregation integrals
Language: English
Authors: Le Borne, Sabine  
Shahmuradyan, Lusine 
Keywords: Convolution; Fast Fourier transformation; High order polynomials; Integro-partial differential equation; Nested grids; Population balance equation
Issue Date: 2-Feb-2017
Source: Computers and Chemical Engineering (97) : 1-12 (2017-02-02)
Abstract (english): 
The efficient numerical simulation of population balance equations requires sophisticated techniques in order to combine accuracy with efficiency. We will focus on the numerical treatment of aggregation integrals that often dominate the overall time in population balance simulations. Following a finite element approach, the density distribution is discretized through a piecewise polynomial of order p > 0 on a nested grid that is refined locally toward an arbitrary point. The proposed method conserves mass while reducing the quadratic complexity (in the dimension of the solution space) of the direct computation to an almost linear complexity. The complexity improvement is based on recursion formulas exploiting orthogonality properties of basis functions along with FFT on locally equidistant portions of the grid. We present numerical results for various initial conditions and provide heuristic criteria for the choice of polynomial degree and grid refinement.
ISSN: 0098-1354
Journal: Computers & chemical engineering 
Institute: Mathematik E-10 
Document Type: Article
Project: SPP 1679: Teilprojekt "Numerische Lösungsverfahren für gekoppelte Populationsbilanzsysteme zur dynamischen Simulation multivariater Feststoffprozesse am Beispiel der formselektiven Kristallisation" 
Appears in Collections:Publications without fulltext

Show full item record

Page view(s)

Last Week
Last month
checked on Jul 5, 2022


Last Week
Last month
checked on Jun 30, 2022

Google ScholarTM


Add Files to Item

Note about this record

Cite this record


Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.