arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.15070math.OC
收藏

使用水平集方法的拓扑优化拟牛顿方法

Quasi-Newton Methods for Topology Optimization Using a Level-Set Method

Fraunhofer ITWM(弗劳恩霍夫工业数学研究所);Institute of Analysis and Scientific Computing, TU Wien(维也纳工业大学分析与科学计算研究所)

Sebastian Blauth, Kevin Sturm

AI总结:

本文提出基于水平集方法的新型拟牛顿方法求解PDE约束拓扑优化问题,通过引入演化方程新视角扩展经典算法,数值实验表明该方法在迭代次数和资源消耗上显著优于现有方法。

摘要:

高效求解拓扑优化问题的能力对许多实际应用具有重要意义。因此,对高效的求解算法存在需求。在本文中,我们提出了解决PDE约束拓扑优化问题的新型拟牛顿方法。我们的方法基于并扩展了Amstutz和Andrä的流行求解算法(A new algorithm for topology optimization using a level-set method, Journal of Computational Physics, 216, 2006)。为此,我们引入了对水平集方法常用演化方程的新视角,这使我们能够推导出用于拓扑优化的拟牛顿方法。我们针对以下示例对所提方法的性能进行了数值研究:受线性和半线性椭圆Poisson问题约束的逆拓扑优化问题、线性弹性中的柔顺度最小化,以及Navier-Stokes流动中的流体优化,并将它们与当前最先进的方法进行了比较。结果表明,所提出的求解算法显著优于其他考虑的方法:它们找到优化器所需的迭代次数大幅减少,而每次迭代所需的资源仅略多一点。这表明我们提出的方法在拓扑优化领域是极具吸引力的求解方法。

英文摘要:

The ability to efficiently solve topology optimization problems is of great importance for many practical applications. Hence, there is a demand for efficient solution algorithms. In this paper, we propose novel quasi-Newton methods for solving PDE-constrained topology optimization problems. Our approach is based on and extends the popular solution algorithm of Amstutz and Andrä (A new algorithm for topology optimization using a level-set method, Journal of Computational Physics, 216, 2006). To do so, we introduce a new perspective on the commonly used evolution equation for the level-set method, which allows us to derive our quasi-Newton methods for topology optimization. We investigate the performance of the proposed methods numerically for the following examples: Inverse topology optimization problems constrained by linear and semilinear elliptic Poisson problems, compliance minimization in linear elasticity, and the optimization of fluids in Navier-Stokes flow, where we compare them to current state-of-the-art methods. Our results show that the proposed solution algorithms significantly outperform the other considered methods: They require substantially less iterations to find a optimizer while demanding only slightly more resources per iteration. This shows that our proposed methods are highly attractive solution methods in the field of topology optimization.

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

↑