.png){kind=icon}
.png){kind=icon}
Return
A triple acceleration method for topology optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s00158-019-02234-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a triple acceleration method (TAM) for the topology optimization (TO), which consists of three parts: multilevel mesh, initial-value-based preconditioned conjugate-gradient (PCG) method, and local-update strategy. The TAM accelerates TO in three aspects including reducing mesh scale, accelerating solving equations, and decreasing the number of updated elements. Three benchmark examples are presented to evaluate proposed method, and the result shows that the proposed TAM successfully reduces 35-80% computational time with faster convergence compared to the conventional TO while the consistent optimization results are obtained. Furthermore, the TAM is able to achieve a higher speedup for large-scale problems, especially for the 3D TOs, which demonstrates that the TAM is an effective method for accelerating large-scale TO problems.
Keywords:
Topology optimization
Triple acceleration
Multilevel mesh
Preconditioned conjugate-gradient method
Local update
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
4.8K
Citations:
1.7W