{"id":{"repo_id":"birmingham","oai_identifier":"oai:etheses.bham.ac.uk:12446"},"canonical_url":"https://search.ndltd.org/etd/birmingham/oai:etheses.bham.ac.uk:12446","repository":{"repo_id":"birmingham","name":"University of Birmingham","base_url":"https://etheses.bham.ac.uk/cgi/oai2"},"display":{"title":"Multigrid barrier and penalty methods for large scale topology optimization of solid structures","abstract":"We propose two algorithms for solving minimum compliance topology optimization problems defined on finite element meshes with several million elements, where the design geometry is parameterized on the discretized problem domain by an elementwise constant density field and we use the variable thickness sheet formulation to map the density to the material stiffness. The first method is an interior point (IP) method and the second follows the penalty-barrier multiplier (PBM) or nonlinear rescaling framework. To solve the linear systems arising in each optimization iteration, we use a multigrid-preconditioned Krylov solver. We employ a reformulation of the linear system to obtain a symmetric positive definite matrix that is amenable to standard multigrid transfer operators. We test the performance of both our algorithms on a wide range of numerical examples, comparing their performance to each other and to that of the well-established optimality criteria (OC) method. Our PBM algorithm proves to be more robust and efficient than both the IP and OC method. We then extend our approach to problems defined on unstructured meshes, which necessitates switching to an algebraic multigrid preconditioner. Using the (adaptive) smoothed aggregation method of Vaněk, Mandel, and Brezina, we propose and test different non-standard setup strategies for the multigrid transfer operators in order to identify the most efficient one for our type of problem. The PBM method is applied to the dual of the compliance minimization problem, which permits an easy integration of unilateral contact constraints. We include examples featuring such constraints in our numerical experiments, both for problems on uniform structured meshes and on unstructured meshes.","abstract_html":"We propose two algorithms for solving minimum compliance topology optimization problems defined on finite element meshes with several million elements, where the design geometry is parameterized on the discretized problem domain by an elementwise constant density field and we use the variable thickness sheet formulation to map the density to the material stiffness. The first method is an interior point (IP) method and the second follows the penalty-barrier multiplier (PBM) or nonlinear rescaling framework. To solve the linear systems arising in each optimization iteration, we use a multigrid-preconditioned Krylov solver. We employ a reformulation of the linear system to obtain a symmetric positive definite matrix that is amenable to standard multigrid transfer operators. We test the performance of both our algorithms on a wide range of numerical examples, comparing their performance to each other and to that of the well-established optimality criteria (OC) method. Our PBM algorithm proves to be more robust and efficient than both the IP and OC method. We then extend our approach to problems defined on unstructured meshes, which necessitates switching to an algebraic multigrid preconditioner. Using the (adaptive) smoothed aggregation method of Vaněk, Mandel, and Brezina, we propose and test different non-standard setup strategies for the multigrid transfer operators in order to identify the most efficient one for our type of problem. The PBM method is applied to the dual of the compliance minimization problem, which permits an easy integration of unilateral contact constraints. We include examples featuring such constraints in our numerical experiments, both for problems on uniform structured meshes and on unstructured meshes.","abstract_has_math":false,"creators":["Brune, Alexander"],"institution":"University of Birmingham","degree_name":"d_ph","degree_level":"d_ph","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022-07","date_published":"2022-07","updated_at":"2026-11-19T09:31:44Z","subjects":["QA Mathematics"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null,"record_url":null,"record_label":null,"record_kind":null,"record_source":null,"download_url":"http://etheses.bham.ac.uk//id/eprint/12446/7/Brune2022PhD.pdf","download_label":"Download PDF","download_source":"dc:identifier.uri","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://etheses.bham.ac.uk/cgi/oai2?verb=GetRecord&metadataPrefix=uketd_dc&identifier=oai%3Aetheses.bham.ac.uk%3A12446","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["na"]},{"key":"dc:creator","label":"Author","values":["Brune, Alexander"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2022-07-13"]},{"key":"dc:date.issued","label":"Date","values":["2022-07"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["College of Engineering & Physical Sciences","School of Mathematics"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Birmingham"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["http://etheses.bham.ac.uk//id/eprint/12446/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["d_ph"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["d_ph"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["QA Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.dcterms_iso639_2","label":"Language (ISO 639-2)","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://etheses.bham.ac.uk//id/eprint/12446/7/Brune2022PhD.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We propose two algorithms for solving minimum compliance topology optimization problems defined on finite element meshes with several million elements, where the design geometry is parameterized on the discretized problem domain by an elementwise constant density field and we use the variable thickness sheet formulation to map the density to the material stiffness. The first method is an interior point (IP) method and the second follows the penalty-barrier multiplier (PBM) or nonlinear rescaling framework. To solve the linear systems arising in each optimization iteration, we use a multigrid-preconditioned Krylov solver. We employ a reformulation of the linear system to obtain a symmetric positive definite matrix that is amenable to standard multigrid transfer operators. We test the performance of both our algorithms on a wide range of numerical examples, comparing their performance to each other and to that of the well-established optimality criteria (OC) method. Our PBM algorithm proves to be more robust and efficient than both the IP and OC method. We then extend our approach to problems defined on unstructured meshes, which necessitates switching to an algebraic multigrid preconditioner. Using the (adaptive) smoothed aggregation method of Vaněk, Mandel, and Brezina, we propose and test different non-standard setup strategies for the multigrid transfer operators in order to identify the most efficient one for our type of problem. The PBM method is applied to the dual of the compliance minimization problem, which permits an easy integration of unilateral contact constraints. We include examples featuring such constraints in our numerical experiments, both for problems on uniform structured meshes and on unstructured meshes."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["Multigrid barrier and penalty methods for large scale topology optimization of solid structures"]}]}],"canonical_facts":{"dc:contributor.sponsor":["na"],"dc:creator":["Brune, Alexander"],"dc:date":["2022-07-13"],"dc:date.issued":["2022-07"],"dc:description.abstract":["We propose two algorithms for solving minimum compliance topology optimization problems defined on finite element meshes with several million elements, where the design geometry is parameterized on the discretized problem domain by an elementwise constant density field and we use the variable thickness sheet formulation to map the density to the material stiffness. The first method is an interior point (IP) method and the second follows the penalty-barrier multiplier (PBM) or nonlinear rescaling framework. To solve the linear systems arising in each optimization iteration, we use a multigrid-preconditioned Krylov solver. We employ a reformulation of the linear system to obtain a symmetric positive definite matrix that is amenable to standard multigrid transfer operators. We test the performance of both our algorithms on a wide range of numerical examples, comparing their performance to each other and to that of the well-established optimality criteria (OC) method. Our PBM algorithm proves to be more robust and efficient than both the IP and OC method. We then extend our approach to problems defined on unstructured meshes, which necessitates switching to an algebraic multigrid preconditioner. Using the (adaptive) smoothed aggregation method of Vaněk, Mandel, and Brezina, we propose and test different non-standard setup strategies for the multigrid transfer operators in order to identify the most efficient one for our type of problem. The PBM method is applied to the dual of the compliance minimization problem, which permits an easy integration of unilateral contact constraints. We include examples featuring such constraints in our numerical experiments, both for problems on uniform structured meshes and on unstructured meshes."],"dc:format":["text"],"dc:identifier.uri":["http://etheses.bham.ac.uk//id/eprint/12446/7/Brune2022PhD.pdf"],"dc:language.dcterms_iso639_2":["eng"],"dc:publisher.department":["College of Engineering & Physical Sciences","School of Mathematics"],"dc:publisher.institution":["University of Birmingham"],"dc:relation.isreferencedby":["http://etheses.bham.ac.uk//id/eprint/12446/"],"dc:subject":["QA Mathematics"],"dcterms:accessrights":["public"],"dc:title":["Multigrid barrier and penalty methods for large scale topology optimization of solid structures"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["d_ph"],"dc:type.qualificationname":["d_ph"]},"updated_at":"2026-11-19T09:31:44Z"}