1996
DOI: 10.1016/0009-2509(95)00355-x
|View full text |Cite
|
Sign up to set email alerts
|

On the solution of population balance equations by discretization—II. A moving pivot technique

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
210
0
1

Year Published

2002
2002
2018
2018

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 418 publications
(213 citation statements)
references
References 11 publications
2
210
0
1
Order By: Relevance
“…In the absence of a growth mechanism, Kumar and Ramkrishna [22] showed that a similar system can also be constructed for pure aggregation and breakage kinetics. Here, the pivots are allowed to move within the bin which they characterize, giving an indication of how the number density distribution varies across the bin as a result of aggregation and breakage events.…”
Section: Review Of Moving and Adaptive Grid Discretization Schemes Fomentioning
confidence: 99%
“…In the absence of a growth mechanism, Kumar and Ramkrishna [22] showed that a similar system can also be constructed for pure aggregation and breakage kinetics. Here, the pivots are allowed to move within the bin which they characterize, giving an indication of how the number density distribution varies across the bin as a result of aggregation and breakage events.…”
Section: Review Of Moving and Adaptive Grid Discretization Schemes Fomentioning
confidence: 99%
“…All these methods are, however, constrained with respect to the choice of grid, as they are based on exploiting the properties of the geometric progression. More recent works by Litster et al [138] and Kumar and Ramkrishna ([124], [125]) have succeeded in extending the concept of DPBs to finer grids; the latter also offers the advantage of conserving any two chosen moments. In [126] a method particularly suited to problems with growth involving discontinuities was shown, based on the method of characteristics.…”
Section: Discretisation Methodsmentioning
confidence: 99%
“…Therefore, various numerical algorithms have been developed for solving PB equations such as method of moment [114][115][116][117], method of characteristics [108,[118][119][120][121], Monte Carlo techniques [122,123], and discretization methods including finite element technique [119,124,125], cell average methods [107], hierarchical solution strategy based on multilevel discretization [126], method of classes [82,95], fixed and moving pivot method [127,128], and finite difference/volume methods [90,119,[129][130][131]. Table 1 summarises these numerical solution methods with the further reviews below.…”
Section: Efficient Solution Of Pb Equationsmentioning
confidence: 99%