Revisiting approximate reanalysis in topology optimization: on the advantages of recycled preconditioning in a minimum weight procedure
- 476 Downloads
An efficient procedure for three-dimensional continuum structural topology optimization is proposed. The approach is based on recycled preconditioning, where multigrid preconditioners are generated only at selected design cycles and re-used in subsequent cycles. Building upon knowledge regarding approximate reanalysis, it is shown that integrating recycled preconditioning into a minimum weight problem formulation can lead to a more efficient procedure than the common minimum compliance approach. Implemented in MATLAB, the run time is roughly twice faster than that of standard minimum compliance procedures. Computational savings are achieved without any compromise on the quality of the results in terms of the compliance-to-weight trade-off achieved. This provides a step towards integrating interactive 3-D topology optimization procedures into CAD software and mobile applications. MATLAB codes complementing the article can be downloaded from the author’s personal webpage.
KeywordsTopology optimization Recycled preconditioning Reanalysis of structures Combined approximations
The author is grateful to the anonymous reviewers for many insightful comments and for numerous suggestions that helped improved the article. The author wishes to thank Niels Aage and Boyan S. Lazarov for fruitful discussions on related topics. Financial support received from the European Commission Research Executive Agency, grant agreement PCIG12-GA-2012-333647, is gratefully acknowledged.
- Amir O, Aage N, Lazarov BS (2013) On multigrid-cg for efficient topology optimization. Struct Multidiscip Optim 1–15. doi: 10.1007/s00158-013-1015-5
- Ashby SF, Falgout RD (1996) A parallel multigrid preconditioned conjugate gradient algorithm for groundwater flow simulations. Nucl Sci Eng 124:145–159Google Scholar
- Bendsøe MP, Sigmund O (2003) Topology optimization-theory, methods and applications. Springer, BerlinGoogle Scholar
- Davis TA (2006) Direct methods for sparse linear system. SIAMGoogle Scholar
- Kettler R (1982) Analysis and comparison of relaxation schemes in robust multigrid and preconditioned conjugate gradient methods. In: Multigrid methods. Springer, pp 502–534Google Scholar
- Liu K, Tovar A (2013) http://et.engr.iupui.edu/tovara/top3d/
- MATLAB (2013) MATLAB version 220.127.116.114 (R2013a). Natick, MassachusettsGoogle Scholar
- Rozvany GIN, Zhou M (1992) COC methods for a single global constraint. In: Rozvany GIN (ed) Shape and layout optimization of structural systems and optimality criteria methods. Springer, BerlinGoogle Scholar
- Saad Y (2003) Iterative methods for sparse linear systems, 2nd edn. SIAMGoogle Scholar
- Tatebe O (1993) The multigrid preconditioned conjugate gradient method. In: Nasa Conference PublicationGoogle Scholar
- Tatebe O, Oyanagi Y (1994) Efficient implementation of the multigrid preconditioned conjugate gradient method on distributed memory machines. In: Supercomputing’94. Proceedings, IEEE, pp 194–203Google Scholar