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

Oded Amir; Ole Sigmund

doi:https://doi.org/10.1007/s00158-010-0586-7

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

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	25-29
Number of pages	5
Journal	Structural and Multidisciplinary Optimization
Volume	44
Issue number	1
DOIs	https://doi.org/10.1007/s00158-010-0586-7
State	Published - Jul 2011
Externally published	Yes

Keywords

Approximations
Nested approach
Topology optimization

All Science Journal Classification (ASJC) codes

Software
Control and Systems Engineering
Computer Science Applications
Computer Graphics and Computer-Aided Design
Control and Optimization

Access to Document

https://doi.org/10.1007/s00158-010-0586-7

Cite this

@article{fc422982ea0d42b9832831ae12329a1c,

title = "On reducing computational effort in topology optimization: How far can we go?",

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.",

keywords = "Approximations, Nested approach, Topology optimization",

author = "Oded Amir and Ole Sigmund",

note = "Funding Information: This work received support from the Eurohorcs/ ESF European Young Investigator Award (EURYI, www.esf.org/euryi ) through the grant “Synthesis and topology optimization of optomechanical systems”. We wish to thank the reviewers for their valuable comments and contributions to the discussion section. We are also grateful to Krister Svanberg for allowing us to use the MMA code.",

year = "2011",

month = jul,

doi = "https://doi.org/10.1007/s00158-010-0586-7",

language = "الإنجليزيّة",

volume = "44",

pages = "25--29",

journal = "Structural and Multidisciplinary Optimization",

issn = "1615-147X",

publisher = "Springer Verlag",

number = "1",

}

TY - JOUR

T1 - On reducing computational effort in topology optimization

T2 - How far can we go?

AU - Amir, Oded

AU - Sigmund, Ole

N1 - Funding Information: This work received support from the Eurohorcs/ ESF European Young Investigator Award (EURYI, www.esf.org/euryi ) through the grant “Synthesis and topology optimization of optomechanical systems”. We wish to thank the reviewers for their valuable comments and contributions to the discussion section. We are also grateful to Krister Svanberg for allowing us to use the MMA code.

PY - 2011/7

Y1 - 2011/7

N2 - 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.

AB - 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.

KW - Approximations

KW - Nested approach

KW - Topology optimization

UR - http://www.scopus.com/inward/record.url?scp=79958162199&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/s00158-010-0586-7

DO - https://doi.org/10.1007/s00158-010-0586-7

M3 - مقالة

SN - 1615-147X

VL - 44

SP - 25

EP - 29

JO - Structural and Multidisciplinary Optimization

JF - Structural and Multidisciplinary Optimization

IS - 1

ER -

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

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this