Efficient multi-partition topology optimization
Stijn Koppen, Matthijs Langelaar, Fred van Keulen

TL;DR
This paper introduces an efficient method for solving multi-partition topology optimization problems, significantly reducing computational effort especially for large-scale problems with similar partitions, by using static condensation.
Contribution
The paper presents a novel static condensation approach for multi-partition topology optimization, enabling faster response and sensitivity calculations compared to traditional methods.
Findings
Substantial computational gains for large-scale problems.
Effective for problems with few degrees of freedom and similar partitions.
Reduces the need for large adjoint analyses.
Abstract
In topology optimization, the state of structures is typically obtained by numerically evaluating a discretized PDE-based model. The degrees of freedom of such a model can be partitioned in free and prescribed sets to define the boundary conditions. A multi-partition problem involves multiple partitions of the same discretization, typically corresponding to different loading scenarios. As a result, solving multi-partition problems involves multiple factorization/preconditionings of the system matrix, requiring a high computational effort. In this paper, a novel method is proposed to efficiently calculate the responses and accompanying design sensitivities in such multi-partition problems using static condensation for use in gradient-based topology optimization. A main problem class that benefits from the proposed method is the topology optimization of small-displacement…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
