arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1009.4975math.NAcs.CEcs.NA
收藏

拓扑优化的动态自适应网格细化

Dynamic Adaptive Mesh Refinement for Topology Optimization

University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Virginia Tech(弗吉尼亚理工大学)

Shun Wang, Eric de Sturler, Glaucio H. Paulino

AI总结:

提出一种结合自适应网格细化和粗化的拓扑优化方法,在保持高分辨率的同时减少计算成本,并通过数值实验证明其等效于均匀网格最优设计且显著缩短计算时间。

摘要:

我们提出了一种改进的拓扑优化方法,同时包含自适应网格细化和粗化。由于拓扑优化中的总体积分数通常较小,经过几次初始迭代后,计算域大部分为空。因此,在这些区域中拥有许多小单元是低效的,它们显著增加了整体计算成本,但对计算和设计的精度贡献甚微。同时,我们希望高空间分辨率以获得精确的三维设计,从而尽可能避免后处理或解释。动态自适应网格细化(AMR)提供了平衡这两个需求的可能性。我们讨论了拓扑优化对AMR的要求以及实现这些要求的算法特性。数值设计问题表明:(1)我们的AMR策略用于拓扑优化得到的设计与均匀网格上的最优设计等效;(2)不满足所提出要求的AMR策略可能导致次优设计;(3)我们的AMR策略显著减少了计算最优设计的时间。

英文摘要:

We present an improved method for topology optimization with both adaptive mesh refinement and derefinement. Since the total volume fraction in topology optimization is usually modest, after a few initial iterations the domain of computation is largely void. Hence, it is inefficient to have many small elements, in such regions, that contribute significantly to the overall computational cost but contribute little to the accuracy of computation and design. At the same time, we want high spatial resolution for accurate three-dimensional designs to avoid postprocessing or interpretation as much as possible. Dynamic adaptive mesh refinement (AMR) offers the possibility to balance these two requirements. We discuss requirements on AMR for topology optimization and the algorithmic features to implement them. The numerical design problems demonstrate (1) that our AMR strategy for topology optimization leads to designs that are equivalent to optimal designs on uniform meshes, (2) how AMR strategies that do not satisfy the postulated requirements may lead to suboptimal designs, and (3) that our AMR strategy significantly reduces the time to compute optimal designs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑