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

Oded Amir, Ole Sigmund

Research output: Contribution to journalJournal articlepeer-review

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.
Original languageEnglish
JournalStructural and Multidisciplinary Optimization
Volume44
Issue number1
Pages (from-to)25-29
ISSN1615-147X
DOIs
Publication statusPublished - 2011

Keywords

  • Approximations
  • Topology optimization
  • Nested approach

Fingerprint

Dive into the research topics of 'On reducing computational effort in topology optimization: how far can we go?'. Together they form a unique fingerprint.

Cite this