Ultra high resolution topology optimization: Brute force or smart discretizations?

Research output: Contribution to conferenceConference abstract for conferenceResearchpeer-review

3 Downloads (Pure)

Abstract

The optimal topology of large structural systems has until now been concerned with the design of individual parts and not that of complete assemblies. Following recent advances in numerical algorithms tailored for large scale structural optimization, this limitation has now be circumvented, mainly by utilizing powerfull HPC system [1]. The design approach has been demonstrated on both aircraft, bridge and ship design problems, resulting in noticeable performance enhancement. However, the increase in design resolution comes at a great cost in terms of the needed computational power. Therefore, it is interesting, if not paramount, to pursue alternative design representation schemes that allows for ultra high resolution optimal designs without the need for large computing resources. This talk will present both the brute force topology optimization approach, in which the governing PDEs are solved by classical methods, i.e. Krylov methods and multigrid preconditioning [2], as well as novel homogenization based projection schemes [3]. The latter allows for the solution of the design problem at low resolution, and by parameter extraction, one can represent the design using orders of magnitude finer design representations.
Original languageEnglish
Publication date2019
Number of pages1
Publication statusPublished - 2019
EventSIAM Conference on Computational Science and Engineering 2019 - Spokane Convention Center, Spokane, United States
Duration: 25 Feb 20191 Mar 2019

Conference

ConferenceSIAM Conference on Computational Science and Engineering 2019
LocationSpokane Convention Center
CountryUnited States
CitySpokane
Period25/02/201901/03/2019

Fingerprint Dive into the research topics of 'Ultra high resolution topology optimization: Brute force or smart discretizations?'. Together they form a unique fingerprint.

Cite this