具有光滑和粗糙管材的树状网络中最佳湍流的缩放定律以及强力定律流体

Ashish, Garg, Himanshu, Mishra, Jayati, Sarkar, Sudip K., Pattanayek
{"title":"具有光滑和粗糙管材的树状网络中最佳湍流的缩放定律以及强力定律流体","authors":"Ashish, Garg, Himanshu, Mishra, Jayati, Sarkar, Sudip K., Pattanayek","doi":"10.26434/chemrxiv-2024-2zt43-v2","DOIUrl":null,"url":null,"abstract":"In this study, we develop a comprehensive analytical framework to derive the optimal scaling laws for turbulent flows within tree-like self-similar branching networks, integrating a non-Newtonian power-law fluid model with index $n$. Our analysis encompasses turbulent flows occurring in both smooth and rough tubes under constraints of network's tube-volume and tube surface area. We introduce the non-dimensional conductance parameter $E$ to quantify flow conditions, investigating its variations with diameter ratio $\\beta$, length ratio $\\gamma$, branch splitting $N$, and branching generation levels $m$. Our findings reveal a decrease in $E$ with increasing $\\gamma$, $N$, and $m$, highlighting the influence of these parameters on flow conductance. Under volume constraint, we identify optimal flow conditions for both smooth and rough tube networks, characterized by distinct scaling laws as $ D_{k+1}/D_{k} = \\beta^* = N^{-(10n+1)/(24n+3)} $, and $D_{k+1}/D_{k} = N^{-3/7} $ (or flow rate proportional to $D_k^{(24n+3)/(10n+1)}$ and $D_k^{7/3}$ ), respectively, where $D_k$ is tube-diameter and $\\dot{m}_k$ is the mass flow-rate in a branch at the $k_{th}$ level . Notably, the scaling in the rough tube network remains independent of the power-law index $n$, unlike the smooth tube network where it depends on $n$. Similarly, under surface-area constraint, we observe distinct optimal flow conditions for smooth and rough tube networks as with different scaling laws as $D_{k+1}/D_{k} = \\beta^* = N^{-(10n+1)/(21n+2)} $, and $D_{k+1}/D_{k} = N^{-1/2} $ (or flow rate proportional to $D_k^{(21n+2)/(10n+1)}$ and $D_k^{2}$ ), respectively, again smooth tube network showing dependency on the power-law index $n$. Moreover, we uncover a trend where the scaling exponent slope decreases with increasing $n$ in volume constraint networks, while the opposite holds true for surface-area constraint networks. In conclusion, our research significantly extends the applicability of Murray's Law, offering valuable insights into the design and optimization of branching networks under various constraints and fluid properties. By incorporating non-Newtonian fluid behavior and considering tube-wall characteristics, our findings contribute to enhancing the efficiency and performance of diverse engineering systems involving fluid flow.","PeriodicalId":9813,"journal":{"name":"ChemRxiv","volume":"63 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Scaling Laws for Optimal Turbulent Flow in Tree-Like Networks with Smooth and Rough Tubes and Power-Law Fluids\",\"authors\":\"Ashish, Garg, Himanshu, Mishra, Jayati, Sarkar, Sudip K., Pattanayek\",\"doi\":\"10.26434/chemrxiv-2024-2zt43-v2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this study, we develop a comprehensive analytical framework to derive the optimal scaling laws for turbulent flows within tree-like self-similar branching networks, integrating a non-Newtonian power-law fluid model with index $n$. Our analysis encompasses turbulent flows occurring in both smooth and rough tubes under constraints of network's tube-volume and tube surface area. We introduce the non-dimensional conductance parameter $E$ to quantify flow conditions, investigating its variations with diameter ratio $\\\\beta$, length ratio $\\\\gamma$, branch splitting $N$, and branching generation levels $m$. Our findings reveal a decrease in $E$ with increasing $\\\\gamma$, $N$, and $m$, highlighting the influence of these parameters on flow conductance. Under volume constraint, we identify optimal flow conditions for both smooth and rough tube networks, characterized by distinct scaling laws as $ D_{k+1}/D_{k} = \\\\beta^* = N^{-(10n+1)/(24n+3)} $, and $D_{k+1}/D_{k} = N^{-3/7} $ (or flow rate proportional to $D_k^{(24n+3)/(10n+1)}$ and $D_k^{7/3}$ ), respectively, where $D_k$ is tube-diameter and $\\\\dot{m}_k$ is the mass flow-rate in a branch at the $k_{th}$ level . Notably, the scaling in the rough tube network remains independent of the power-law index $n$, unlike the smooth tube network where it depends on $n$. Similarly, under surface-area constraint, we observe distinct optimal flow conditions for smooth and rough tube networks as with different scaling laws as $D_{k+1}/D_{k} = \\\\beta^* = N^{-(10n+1)/(21n+2)} $, and $D_{k+1}/D_{k} = N^{-1/2} $ (or flow rate proportional to $D_k^{(21n+2)/(10n+1)}$ and $D_k^{2}$ ), respectively, again smooth tube network showing dependency on the power-law index $n$. Moreover, we uncover a trend where the scaling exponent slope decreases with increasing $n$ in volume constraint networks, while the opposite holds true for surface-area constraint networks. In conclusion, our research significantly extends the applicability of Murray's Law, offering valuable insights into the design and optimization of branching networks under various constraints and fluid properties. By incorporating non-Newtonian fluid behavior and considering tube-wall characteristics, our findings contribute to enhancing the efficiency and performance of diverse engineering systems involving fluid flow.\",\"PeriodicalId\":9813,\"journal\":{\"name\":\"ChemRxiv\",\"volume\":\"63 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ChemRxiv\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26434/chemrxiv-2024-2zt43-v2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ChemRxiv","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26434/chemrxiv-2024-2zt43-v2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本研究中,我们建立了一个全面的分析框架,以推导树状自相似分支网络中湍流的最优缩放规律,并整合了指数为 $n$ 的非牛顿幂律流体模型。在网络的管体积和管表面积的约束下,我们的分析涵盖了在光滑和粗糙管内发生的湍流。我们引入了非尺寸传导参数 $E$ 来量化流动条件,并研究了它随直径比 $\beta$、长度比 $\gamma$、分支分裂 $N$ 和分支生成水平 $m$ 的变化。我们的研究结果表明,随着 $\gamma$、$N$ 和 $m$ 的增加,$E$ 也在减少,这突出表明了这些参数对流动传导的影响。在体积约束条件下,我们确定了光滑管网和粗糙管网的最佳流动条件,其特征是不同的缩放规律:$ D_{k+1}/D_{k} = \beta^* = N^{-(10n+1)/(24n+3)} $ 和 $D_{k+1}/D_{k} = N^{-3/7} (或流速与$D_{k+1}/D_{k}成比例)。或流量分别与 $D_k^{(24n+3)/(10n+1)}$ 和 $D_k^{7/3}$ 成正比),其中 $D_k$ 是管道直径,$\dot{m}_k$ 是 $k_{th}$ 级分支中的质量流量。值得注意的是,粗糙管网中的缩放与幂律指数 $n$ 无关,这与光滑管网中取决于 $n$ 的情况不同。同样,在表面积约束条件下,我们观察到光滑管网和粗糙管网的最佳流动条件不同,其缩放规律分别为 $D_{k+1}/D_{k} = \beta^* = N^{-(10n+1)/(21n+2)} $、和 $D_{k+1}/D_{k} = N^{-1/2} $ (或流速分别与 $D_k^{(21n+2)/(10n+1)}$ 和 $D_k^{2}$ 成正比),同样光滑的管网显示出对幂律指数 $n$ 的依赖性。此外,我们还发现了一种趋势,即在体积约束网络中,缩放指数斜率随 $n$ 的增加而减小,而在面积约束网络中则相反。总之,我们的研究极大地扩展了默里定律的适用范围,为在各种约束条件和流体特性下设计和优化分支网络提供了宝贵的见解。通过纳入非牛顿流体行为并考虑管壁特性,我们的研究成果有助于提高涉及流体流动的各种工程系统的效率和性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Scaling Laws for Optimal Turbulent Flow in Tree-Like Networks with Smooth and Rough Tubes and Power-Law Fluids
In this study, we develop a comprehensive analytical framework to derive the optimal scaling laws for turbulent flows within tree-like self-similar branching networks, integrating a non-Newtonian power-law fluid model with index $n$. Our analysis encompasses turbulent flows occurring in both smooth and rough tubes under constraints of network's tube-volume and tube surface area. We introduce the non-dimensional conductance parameter $E$ to quantify flow conditions, investigating its variations with diameter ratio $\beta$, length ratio $\gamma$, branch splitting $N$, and branching generation levels $m$. Our findings reveal a decrease in $E$ with increasing $\gamma$, $N$, and $m$, highlighting the influence of these parameters on flow conductance. Under volume constraint, we identify optimal flow conditions for both smooth and rough tube networks, characterized by distinct scaling laws as $ D_{k+1}/D_{k} = \beta^* = N^{-(10n+1)/(24n+3)} $, and $D_{k+1}/D_{k} = N^{-3/7} $ (or flow rate proportional to $D_k^{(24n+3)/(10n+1)}$ and $D_k^{7/3}$ ), respectively, where $D_k$ is tube-diameter and $\dot{m}_k$ is the mass flow-rate in a branch at the $k_{th}$ level . Notably, the scaling in the rough tube network remains independent of the power-law index $n$, unlike the smooth tube network where it depends on $n$. Similarly, under surface-area constraint, we observe distinct optimal flow conditions for smooth and rough tube networks as with different scaling laws as $D_{k+1}/D_{k} = \beta^* = N^{-(10n+1)/(21n+2)} $, and $D_{k+1}/D_{k} = N^{-1/2} $ (or flow rate proportional to $D_k^{(21n+2)/(10n+1)}$ and $D_k^{2}$ ), respectively, again smooth tube network showing dependency on the power-law index $n$. Moreover, we uncover a trend where the scaling exponent slope decreases with increasing $n$ in volume constraint networks, while the opposite holds true for surface-area constraint networks. In conclusion, our research significantly extends the applicability of Murray's Law, offering valuable insights into the design and optimization of branching networks under various constraints and fluid properties. By incorporating non-Newtonian fluid behavior and considering tube-wall characteristics, our findings contribute to enhancing the efficiency and performance of diverse engineering systems involving fluid flow.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信