2020
DOI: 10.1016/j.cma.2020.112911
|View full text |Cite
|
Sign up to set email alerts
|

Towards solving large-scale topology optimization problems with buckling constraints at the cost of linear analyses

Abstract: This work presents a multilevel approach to large-scale topology optimization accounting for linearized buckling criteria. The method relies on the use of preconditioned iterative solvers for all the systems involved in the linear buckling and sensitivity analyses and on the approximation of buckling modes from a coarse discretization. The strategy shows three main benefits: first, the computational cost for the eigenvalue analyses is drastically cut. Second, artifacts due to local stress concentrations are al… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 45 publications
(31 citation statements)
references
References 53 publications
0
31
0
Order By: Relevance
“…One approach is to utilize multiple resolutions. This includes grid refinement as the optimization progresses; 11‐13 utilizing fine grids to represent the design together with the coarsest possible grids to solve the state problem; 14‐17 and sophisticated use of coarse grids to avoid solving a costly state problem on the fine scale 18 . Another approach is to develop scalable computational procedures that are compatible with high performance parallel hardware.…”
Section: Introductionmentioning
confidence: 99%
“…One approach is to utilize multiple resolutions. This includes grid refinement as the optimization progresses; 11‐13 utilizing fine grids to represent the design together with the coarsest possible grids to solve the state problem; 14‐17 and sophisticated use of coarse grids to avoid solving a costly state problem on the fine scale 18 . Another approach is to develop scalable computational procedures that are compatible with high performance parallel hardware.…”
Section: Introductionmentioning
confidence: 99%
“…35 and 37, respectively. Recent works have discussed and improved the efficiency to compute buckling sensitivities [15,28], but this analysis (see Eq. 38) still presents a non-trivial computational routine and potential challenges inherent to the nature of the problem.…”
Section: Step 4: Sensitivity Analysismentioning
confidence: 99%
“…This simplified approach, however, is still complicated, and explains the notable gap between compliance-only based optimization problems and those considering stability parameters [14][15][16].…”
Section: Introductionmentioning
confidence: 99%
“…Recent advances already allow accounting for buckling in TO endeavours in a computationally feasible manner [438][439][440][441][442], mitigating some of the aforementioned problems. Though, those methods rely on linearized buckling, which is generally regarded as an inadequate simplification for many engineering problems [137,443,444] and therefore, face significant opposition from many researchers.…”
Section: Buckling and Local Instability Phenomenamentioning
confidence: 99%