Employment of an efficient particle tracking algorithm based on barycentric coordinates in hybrid finite-volume/probability-density-function Monte Carlo methods

IF 1.7 4区 工程技术 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS International Journal for Numerical Methods in Fluids Pub Date : 2024-02-13 DOI:10.1002/fld.5263
Mohamad Bagher Barezban, Masoud Darbandi
{"title":"Employment of an efficient particle tracking algorithm based on barycentric coordinates in hybrid finite-volume/probability-density-function Monte Carlo methods","authors":"Mohamad Bagher Barezban,&nbsp;Masoud Darbandi","doi":"10.1002/fld.5263","DOIUrl":null,"url":null,"abstract":"<p>One main concern of this work is to develop an efficient particle-tracking-managing algorithm in the framework of a hybrid pressure-based finite-volume/probability-density-function (FV/PDF) Monte-Carlo (MC) solution algorithm to extend the application of FV/PDF MC methods to absolutely incompressible flows and speedup the convergence rate of solving the fluctuating velocity-turbulent frequency joint PDF equation in turbulent flow simulations. Contrary to the density-based algorithms, the pressure-based algorithms have stable convergence rates even in zero-Mach number flows. As another contribution, literature shows that the past developed methods mostly used mesh searching techniques to attribute particles to cells at the beginning of each tracking time-step. Also, they had to calculate the linear basis functions at every time-step to estimate the particle mean fields and interpolate the data. These calculations would be computationally very expensive, time-consuming, and inefficient in computational domains with arbitrary-shaped 3D meshes. As known, the barycentric tracking is a continuous particle tracking method, which provides more efficiency in case of handling 3D domains with general mesh shapes. The barycentric tracking eliminates any mesh searching technique and readily provides the convenient linear basis functions. So, this work benefits from these advantages and tracks the particles based on their barycentric coordinates.  It leads to less computational work and a better efficiency for the present method. A bluff-body turbulent flow case is examined to validate the present FV/PDF MC method. From the accuracy perspective, it is shown that the results of the present algorithm are in great agreement with experimental data and available numerical solutions. The present study shows that the number of particle time-steps required to reach the statistically steady-state condition is at least one-sixth less than the previously developed algorithms. This also approves a faster convergence rate for the present hybrid pressure-based algorithm.</p>","PeriodicalId":50348,"journal":{"name":"International Journal for Numerical Methods in Fluids","volume":"96 6","pages":"884-901"},"PeriodicalIF":1.7000,"publicationDate":"2024-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal for Numerical Methods in Fluids","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/fld.5263","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

One main concern of this work is to develop an efficient particle-tracking-managing algorithm in the framework of a hybrid pressure-based finite-volume/probability-density-function (FV/PDF) Monte-Carlo (MC) solution algorithm to extend the application of FV/PDF MC methods to absolutely incompressible flows and speedup the convergence rate of solving the fluctuating velocity-turbulent frequency joint PDF equation in turbulent flow simulations. Contrary to the density-based algorithms, the pressure-based algorithms have stable convergence rates even in zero-Mach number flows. As another contribution, literature shows that the past developed methods mostly used mesh searching techniques to attribute particles to cells at the beginning of each tracking time-step. Also, they had to calculate the linear basis functions at every time-step to estimate the particle mean fields and interpolate the data. These calculations would be computationally very expensive, time-consuming, and inefficient in computational domains with arbitrary-shaped 3D meshes. As known, the barycentric tracking is a continuous particle tracking method, which provides more efficiency in case of handling 3D domains with general mesh shapes. The barycentric tracking eliminates any mesh searching technique and readily provides the convenient linear basis functions. So, this work benefits from these advantages and tracks the particles based on their barycentric coordinates.  It leads to less computational work and a better efficiency for the present method. A bluff-body turbulent flow case is examined to validate the present FV/PDF MC method. From the accuracy perspective, it is shown that the results of the present algorithm are in great agreement with experimental data and available numerical solutions. The present study shows that the number of particle time-steps required to reach the statistically steady-state condition is at least one-sixth less than the previously developed algorithms. This also approves a faster convergence rate for the present hybrid pressure-based algorithm.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在有限体积/概率密度函数蒙特卡罗混合方法中采用基于重心坐标的高效粒子跟踪算法
这项工作的主要关注点之一是在基于压力的有限体积/概率密度函数(FV/PDF)混合蒙特卡洛(MC)求解算法框架内开发一种高效的粒子跟踪管理算法,以将 FV/PDF MC 方法的应用扩展到绝对不可压缩流,并加快湍流模拟中波动速度-湍流频率联合 PDF 方程求解的收敛速度。与基于密度的算法相反,基于压力的算法即使在零马赫数流动中也有稳定的收敛率。另一个贡献是,文献显示,过去开发的方法大多使用网格搜索技术,在每个跟踪时间步开始时将粒子归属到单元。此外,他们还必须在每个时间步计算线性基函数,以估计粒子平均场并对数据进行插值。在具有任意形状三维网格的计算域中,这些计算将非常昂贵、耗时和低效。众所周知,双曲跟踪是一种连续粒子跟踪方法,在处理具有一般网格形状的三维域时效率更高。双曲跟踪消除了任何网格搜索技术,并能提供方便的线性基函数。因此,这项工作得益于这些优势,并根据粒子的偏心坐标对其进行跟踪。 这使得本方法的计算工作量更少,效率更高。为了验证本 FV/PDF MC 方法,我们研究了一个崖体湍流案例。从精度角度来看,本算法的结果与实验数据和现有数值解非常一致。本研究表明,达到统计稳态条件所需的粒子时间步数比以前开发的算法至少少六分之一。这也证明本基于压力的混合算法收敛速度更快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal for Numerical Methods in Fluids
International Journal for Numerical Methods in Fluids 物理-计算机:跨学科应用
CiteScore
3.70
自引率
5.60%
发文量
111
审稿时长
8 months
期刊介绍: The International Journal for Numerical Methods in Fluids publishes refereed papers describing significant developments in computational methods that are applicable to scientific and engineering problems in fluid mechanics, fluid dynamics, micro and bio fluidics, and fluid-structure interaction. Numerical methods for solving ancillary equations, such as transport and advection and diffusion, are also relevant. The Editors encourage contributions in the areas of multi-physics, multi-disciplinary and multi-scale problems involving fluid subsystems, verification and validation, uncertainty quantification, and model reduction. Numerical examples that illustrate the described methods or their accuracy are in general expected. Discussions of papers already in print are also considered. However, papers dealing strictly with applications of existing methods or dealing with areas of research that are not deemed to be cutting edge by the Editors will not be considered for review. The journal publishes full-length papers, which should normally be less than 25 journal pages in length. Two-part papers are discouraged unless considered necessary by the Editors.
期刊最新文献
Issue Information Cover Image Issue Information Semi‐implicit Lagrangian Voronoi approximation for the incompressible Navier–Stokes equations A new non‐equilibrium modification of the k−ω$$ k-\omega $$ turbulence model for supersonic turbulent flows with transverse jet
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1