Reducing parameter tuning in topology optimization of flow problems using a Darcy and Forchheimer penalization

IF 6.9 1区 工程技术 Q1 ENGINEERING, MULTIDISCIPLINARY
M.J.B. Theulings , L. Noël , M. Langelaar , R. Maas
{"title":"Reducing parameter tuning in topology optimization of flow problems using a Darcy and Forchheimer penalization","authors":"M.J.B. Theulings ,&nbsp;L. Noël ,&nbsp;M. Langelaar ,&nbsp;R. Maas","doi":"10.1016/j.cma.2025.118027","DOIUrl":null,"url":null,"abstract":"<div><div>In density-based topology optimization of flow problems, flow in the solid domain is generally inhibited using a penalization approach. Setting an appropriate maximum magnitude for the penalization traditionally requires manual tuning to find an acceptable compromise between flow solution accuracy and design convergence. In this work, three penalization approaches are examined, the Darcy (D), the Darcy with Forchheimer (DF), and the newly proposed Darcy with filtered Forchheimer (DFF) approach. Parameter tuning is reduced by analytically deriving an appropriate penalization magnitude for accuracy of the flow solution. The Forchheimer penalization is found to be required to reliably predict the accuracy of the flow solution. The state-of-the-art D and DF approaches are improved by developing the novel DFF approach, based on a spatial average of the velocity magnitude. In comparison, the parameter selection in the DFF approach is more reliable, as convergence of the flow solution and objective convexity are more predictable. Moreover, a continuation approach on the maximum penalization magnitude is derived by numerical inspection of the convexity of the pressure drop response. Using two-dimensional optimization benchmarks, the DFF approach reliably finds accurate flow solutions and is less prone to converge to inferior local optima.</div></div>","PeriodicalId":55222,"journal":{"name":"Computer Methods in Applied Mechanics and Engineering","volume":"443 ","pages":"Article 118027"},"PeriodicalIF":6.9000,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Methods in Applied Mechanics and Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0045782525002993","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

In density-based topology optimization of flow problems, flow in the solid domain is generally inhibited using a penalization approach. Setting an appropriate maximum magnitude for the penalization traditionally requires manual tuning to find an acceptable compromise between flow solution accuracy and design convergence. In this work, three penalization approaches are examined, the Darcy (D), the Darcy with Forchheimer (DF), and the newly proposed Darcy with filtered Forchheimer (DFF) approach. Parameter tuning is reduced by analytically deriving an appropriate penalization magnitude for accuracy of the flow solution. The Forchheimer penalization is found to be required to reliably predict the accuracy of the flow solution. The state-of-the-art D and DF approaches are improved by developing the novel DFF approach, based on a spatial average of the velocity magnitude. In comparison, the parameter selection in the DFF approach is more reliable, as convergence of the flow solution and objective convexity are more predictable. Moreover, a continuation approach on the maximum penalization magnitude is derived by numerical inspection of the convexity of the pressure drop response. Using two-dimensional optimization benchmarks, the DFF approach reliably finds accurate flow solutions and is less prone to converge to inferior local optima.
使用Darcy和Forchheimer惩罚减少拓扑优化中的参数调整
在基于密度的流动问题拓扑优化中,通常使用惩罚方法抑制实体域中的流动。为惩罚设置适当的最大幅度通常需要手动调整,以在流量解决方案精度和设计收敛之间找到可接受的折衷方案。在这项工作中,研究了三种惩罚方法,达西(D),达西与福奇海默(DF),以及新提出的达西与滤波福奇海默(DFF)方法。通过解析推导出流量解精度的适当惩罚幅度,减少了参数的调整。发现Forchheimer惩罚是可靠地预测流动解的精度所必需的。通过开发基于速度幅度的空间平均值的新型DFF方法,改进了最先进的D和DF方法。相比之下,DFF方法的参数选择更可靠,因为流解的收敛性和目标凸性更可预测。此外,通过对压降响应的凸性进行数值检验,导出了最大惩罚幅度的延拓方法。使用二维优化基准,DFF方法可以可靠地找到精确的流解,并且不容易收敛到次优的局部最优。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
12.70
自引率
15.30%
发文量
719
审稿时长
44 days
期刊介绍: Computer Methods in Applied Mechanics and Engineering stands as a cornerstone in the realm of computational science and engineering. With a history spanning over five decades, the journal has been a key platform for disseminating papers on advanced mathematical modeling and numerical solutions. Interdisciplinary in nature, these contributions encompass mechanics, mathematics, computer science, and various scientific disciplines. The journal welcomes a broad range of computational methods addressing the simulation, analysis, and design of complex physical problems, making it a vital resource for researchers in the field.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信