On reducing computational effort in topology optimization: how far can we go?

Authors:
Oded Amir;Ole Sigmund
Affiliations:
Department of Mathematics, Technical University of Denmark, Lyngby, Denmark 2800 Kgs;Department of Mechanical Engineering, Technical University of Denmark, Lyngby, Denmark 2800 Kgs
Venue:
Structural and Multidisciplinary Optimization
Year:
2011

Citing 0
Cited 4

Interactive topology optimization on hand-held devices

Structural and Multidisciplinary Optimization
Efficient generation of large-scale pareto-optimal topologies

Structural and Multidisciplinary Optimization
Multi-objective concurrent topology optimization of thermoelastic structures composed of homogeneous porous material

Structural and Multidisciplinary Optimization
A survey of structural and multidisciplinary continuum topology optimization: post 2000

Structural and Multidisciplinary Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approximate approach to solving the nested analysis equations in topology optimization is proposed. The procedure consists of only one matrix factorization for the whole design process and a small number of iterative corrections for each design cycle. The approach is tested on 3D topology optimization problems. It is shown that the computational cost can be reduced by one order of magnitude without affecting the outcome of the optimization process.