MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Accelerating topology optimization codes using mesh refinement continuation

Author(s)
Chen, Austin
Thumbnail
DownloadThesis PDF (2.306Mb)
Advisor
Carstensen, Josephine V.
Terms of use
In Copyright - Educational Use Permitted Copyright retained by author(s) https://rightsstatements.org/page/InC-EDU/1.0/
Metadata
Show full item record
Abstract
A new concept for an algorithm accelerating topology optimization programs is introduced and explained in detail, which involves a continuation of increasing mesh resolutions to achieve low-compliance solutions with largely reduced computation times. Comparisons with examples from relevant literature show speedups of up to approximately 60% on discretizations up to the order of 106 elements for common benchmark problems. Improvements in speed can be attributed to taking advantage of running code on coarse meshes as a faster way to generate smart initial guesses to be reused as inputs for subsequent runs on finer meshes. A MATLAB script for the new algorithm and associated modifications to existing topology optimization code is included. Keywords: Topology Optimization, Mesh Refinement, Computational Efficiency, MATLAB
Date issued
2023-06
URI
https://hdl.handle.net/1721.1/151810
Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Publisher
Massachusetts Institute of Technology

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.