کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
470309 698436 2016 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Efficient algorithms for constraining orientation tensors in Galerkin methods for the Fokker–Planck equation
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Efficient algorithms for constraining orientation tensors in Galerkin methods for the Fokker–Planck equation
چکیده انگلیسی

This paper deals with the problem of positivity preservation in numerical algorithms for simulating fiber suspension flows. In contrast to fiber orientation models based on the Advani–Tucker evolution equations for even-order orientation tensors, the probability distribution function of fiber orientation is approximated using the Galerkin discretization of the Fokker–Planck equation with Fourier basis functions or spherical harmonics. This procedure leads to a natural generalization of orientation tensor models replacing ad hoc closure approximations by Galerkin equations for the fine-scale components. After introducing an operator splitting approach to solving the discretized Fokker–Planck equation, we present conditions and correction techniques that guarantee physically correct distribution functions. As the reader will see, the derivation of these conditions is independent of the space dimension and their applicability is not limited to the simulation of fiber suspensions.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Mathematics with Applications - Volume 71, Issue 5, March 2016, Pages 1059–1073
نویسندگان
,