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

Publication: Research - peer-reviewJournal article – Annual report year: 2011

NullPointerException

View graph of relations

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
Publication date2011
Volume44
Journal number1
Pages25-29
ISSN1615-147X
DOIs
StatePublished
CitationsWeb of Science® Times Cited: 5

Keywords

  • Approximations, Topology optimization, Nested approach
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 5604749