z-logo
Premium
Improving the efficiency of large scale topology optimization through on‐the‐fly reduced order model construction
Author(s) -
Gogu Christian
Publication year - 2014
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.4797
Subject(s) - topology optimization , mathematical optimization , benchmark (surveying) , basis (linear algebra) , topology (electrical circuits) , convergence (economics) , computer science , projection (relational algebra) , scale (ratio) , mathematics , algorithm , finite element method , engineering , economic growth , economics , geography , geodesy , physics , geometry , structural engineering , combinatorics , quantum mechanics
SUMMARY Topology optimization of large scale structures is computationally expensive, notably because of the cost of solving the equilibrium equations at each iteration. Reduced order models by projection, also known as reduced basis models, have been proposed in the past for alleviating this cost. We propose here a new method for coupling reduced basis models with topology optimization to improve the efficiency of topology optimization of large scale structures. The novel approach is based on constructing the reduced basis on the fly, using previously calculated solutions of the equilibrium equations. The reduced basis is thus adaptively constructed and enriched, based on the convergence behavior of the topology optimization. A direct approach and an approach with adjusted sensitivities are described, and their algorithms provided. The approaches are tested and compared on various 2D and 3D minimum compliance topology optimization benchmark problems. Computational cost savings by up to a factor of 12 are demonstrated using the proposed methods. Copyright © 2014 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here