{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/151810"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/151810","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Accelerating topology optimization codes using mesh refinement continuation","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","abstract_html":"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","abstract_has_math":false,"creators":["Chen, Austin"],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Civil and Environmental Engineering","school":null,"contributors":[],"advisors":["Carstensen, Josephine V."],"committee_chairs":[],"committee_members":[],"year":2023,"date_issued":"2023-06","date_published":"2023-06","updated_at":"2026-07-22T22:21:23Z","subjects":[],"languages":[],"rights":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"],"rights_urls":["https://rightsstatements.org/page/InC-EDU/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/151810","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Carstensen, Josephine V."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Civil and Environmental Engineering"]},{"key":"dc:creator","label":"Author","values":["Chen, Austin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2023-08-23T16:10:29Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2023-08-23T16:10:29Z"]},{"key":"dc:date.issued","label":"Date","values":["2023-06"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master","Master of Engineering in Civil and Environmental Engineering"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"]},{"key":"dc:rights.uri","label":"Rights URI","values":["https://rightsstatements.org/page/InC-EDU/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/151810"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Accelerating topology optimization codes using mesh refinement continuation"]}]}],"canonical_facts":{"dc:contributor.advisor":["Carstensen, Josephine V."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Civil and Environmental Engineering"],"dc:creator":["Chen, Austin"],"dc:date.accessioned":["2023-08-23T16:10:29Z"],"dc:date.available":["2023-08-23T16:10:29Z"],"dc:date.issued":["2023-06"],"dc:description.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"],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/151810"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"],"dc:rights.uri":["https://rightsstatements.org/page/InC-EDU/1.0/"],"dc:title":["Accelerating topology optimization codes using mesh refinement continuation"],"dc:type":["Thesis"],"thesis:degree_name":["Master","Master of Engineering in Civil and Environmental Engineering"]},"updated_at":"2026-07-22T22:21:23Z"}