A novel model for direct numerical simulation of suspension dynamics with arbitrarily shaped convex particles

IF 7.2 2区 物理与天体物理 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Jan E. Marquardt , Nicolas Hafen , Mathias J. Krause
{"title":"A novel model for direct numerical simulation of suspension dynamics with arbitrarily shaped convex particles","authors":"Jan E. Marquardt ,&nbsp;Nicolas Hafen ,&nbsp;Mathias J. Krause","doi":"10.1016/j.cpc.2024.109321","DOIUrl":null,"url":null,"abstract":"<div><p>This study presents an innovative direct numerical simulation approach for complex particle systems with irregular shapes and large numbers. Using partially saturated methods, it accurately models arbitrary shapes, albeit at considerable computational cost when integrating a compatible contact model. The introduction of a novel parallelization strategy significantly improves the performance of the contact model, enabling efficient four-way coupled simulations. Through hindered settling studies, the criticality of the explicit contact model for maintaining simulation accuracy is highlighted, especially at high particle volume fractions and low Archimedes numbers. The feasibility of simulating thousands of arbitrarily shaped convex particles is demonstrated with up to 1934 surface-resolved particles. The study also confirms the grid independence and linear convergence of the method. It shows for the first time that cube swarms settle 13 to 26% slower than swarms of volume-equivalent spheres across different Archimedes numbers (500 to 2000) and particle volume fractions (10 to 30%). These findings emphasize the shape dependence of particle systems and suggest avenues for exploring their nuanced dynamics.</p></div>","PeriodicalId":285,"journal":{"name":"Computer Physics Communications","volume":"304 ","pages":"Article 109321"},"PeriodicalIF":7.2000,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0010465524002443/pdfft?md5=aefa678974806198e79fd9446b434c5b&pid=1-s2.0-S0010465524002443-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Physics Communications","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010465524002443","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

This study presents an innovative direct numerical simulation approach for complex particle systems with irregular shapes and large numbers. Using partially saturated methods, it accurately models arbitrary shapes, albeit at considerable computational cost when integrating a compatible contact model. The introduction of a novel parallelization strategy significantly improves the performance of the contact model, enabling efficient four-way coupled simulations. Through hindered settling studies, the criticality of the explicit contact model for maintaining simulation accuracy is highlighted, especially at high particle volume fractions and low Archimedes numbers. The feasibility of simulating thousands of arbitrarily shaped convex particles is demonstrated with up to 1934 surface-resolved particles. The study also confirms the grid independence and linear convergence of the method. It shows for the first time that cube swarms settle 13 to 26% slower than swarms of volume-equivalent spheres across different Archimedes numbers (500 to 2000) and particle volume fractions (10 to 30%). These findings emphasize the shape dependence of particle systems and suggest avenues for exploring their nuanced dynamics.

用于直接数值模拟任意形状凸颗粒悬浮动力学的新型模型
本研究针对形状不规则、数量庞大的复杂粒子系统提出了一种创新的直接数值模拟方法。利用部分饱和方法,它可以精确地模拟任意形状的粒子,尽管在集成兼容的接触模型时需要相当大的计算成本。新颖并行化策略的引入大大提高了接触模型的性能,实现了高效的四向耦合模拟。通过受阻沉降研究,凸显了显式接触模型对于保持模拟精度的关键性,尤其是在高颗粒体积分数和低阿基米德数的情况下。通过多达 1934 个表面分辨粒子,证明了模拟数千个任意形状凸粒子的可行性。研究还证实了该方法的网格独立性和线性收敛性。研究首次表明,在不同的阿基米德数(500 到 2000)和粒子体积分数(10% 到 30%)条件下,立方体粒子群的沉降速度比体积相等的球体粒子群慢 13% 到 26%。这些发现强调了粒子系统的形状依赖性,并提出了探索其微妙动态的途径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Physics Communications
Computer Physics Communications 物理-计算机:跨学科应用
CiteScore
12.10
自引率
3.20%
发文量
287
审稿时长
5.3 months
期刊介绍: The focus of CPC is on contemporary computational methods and techniques and their implementation, the effectiveness of which will normally be evidenced by the author(s) within the context of a substantive problem in physics. Within this setting CPC publishes two types of paper. Computer Programs in Physics (CPiP) These papers describe significant computer programs to be archived in the CPC Program Library which is held in the Mendeley Data repository. The submitted software must be covered by an approved open source licence. Papers and associated computer programs that address a problem of contemporary interest in physics that cannot be solved by current software are particularly encouraged. Computational Physics Papers (CP) These are research papers in, but are not limited to, the following themes across computational physics and related disciplines. mathematical and numerical methods and algorithms; computational models including those associated with the design, control and analysis of experiments; and algebraic computation. Each will normally include software implementation and performance details. The software implementation should, ideally, be available via GitHub, Zenodo or an institutional repository.In addition, research papers on the impact of advanced computer architecture and special purpose computers on computing in the physical sciences and software topics related to, and of importance in, the physical sciences may be considered.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信