TY - JOUR

T1 - A numerical technique for the solution of integrodifferential equations arising from balances over populations of drops in turbulent flows

AU - Jairazbhoy, V.

AU - Tavlarides, L. L.

PY - 2000/1/5

Y1 - 2000/1/5

N2 - This paper describes a numerical technique designed to solve certain forms of partial differential equations. The method is applied to the partial integrodifferential population balance equations presented by Jairazbhoy that describe the behavior of dense liquid dispersions of interacting drops in isotropic turbulence. In the successively contained semi-discretization scheme developed, the drop number density functions are discretized into non-uniform intervals corresponding to Gaussian quadrature points. The governing equations are assumed to hold identically at all the discretization points, generating a set of ordinary integrodifferential equations that are solved by an integrator package. The integrals in each function evaluation are calculated by Gaussian quadrature. The results show that, in some cases, as many as fifteen quadrature points are required to achieve grid independence. Each additional discretization point results in an additional ordinary integrodifferential equation. To achieve comparable accuracy with a uniform discretization scheme, many more discretization points would be required, resulting in an inordinately large number of ordinary integrodifferential equations. The computations also show that, in every run, there appears to be an optimum number of discretization intervals around which incremental increases in the resolution do not increase the CPU time or perceivable accuracy of the solution.

AB - This paper describes a numerical technique designed to solve certain forms of partial differential equations. The method is applied to the partial integrodifferential population balance equations presented by Jairazbhoy that describe the behavior of dense liquid dispersions of interacting drops in isotropic turbulence. In the successively contained semi-discretization scheme developed, the drop number density functions are discretized into non-uniform intervals corresponding to Gaussian quadrature points. The governing equations are assumed to hold identically at all the discretization points, generating a set of ordinary integrodifferential equations that are solved by an integrator package. The integrals in each function evaluation are calculated by Gaussian quadrature. The results show that, in some cases, as many as fifteen quadrature points are required to achieve grid independence. Each additional discretization point results in an additional ordinary integrodifferential equation. To achieve comparable accuracy with a uniform discretization scheme, many more discretization points would be required, resulting in an inordinately large number of ordinary integrodifferential equations. The computations also show that, in every run, there appears to be an optimum number of discretization intervals around which incremental increases in the resolution do not increase the CPU time or perceivable accuracy of the solution.

UR - http://www.scopus.com/inward/record.url?scp=0034606754&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034606754&partnerID=8YFLogxK

U2 - 10.1016/S0098-1354(99)00326-9

DO - 10.1016/S0098-1354(99)00326-9

M3 - Article

AN - SCOPUS:0034606754

VL - 23

SP - 1725

EP - 1735

JO - Computers and Chemical Engineering

JF - Computers and Chemical Engineering

SN - 0098-1354

IS - 11-12

ER -