.png){kind=icon}
.png){kind=icon}
Return
Optimal archgrids spanning rectangular domains
.png){kind=icon}
OA
AI
DOI：10.1016/j.compstruc.2020.106371.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The theory of archgrids of minimal weight has been formulated in the late 1970s and recently reconsidered by means of duality theory in the calculus of variations. In the current study, we follow this approach by putting forward an efficient computational scheme. Trial functions for both primal and dual problems are decomposed in two function bases: trigonometric (Fourier) and polynomial (Legendre). Our focus is on structures composed of arches forming a rectangular grid, i.e. running in two mutually perpendicular directions and spanning a given rectangular domain. In the course of discussion, we show that the numerical algorithm is quickly convergent, CPU time efficient, and robust. In particular, it provides clear-cut solutions in which optimal parts of a structure are sharply distinguished from the nonoptimal, hence redundant, ones. (C) 2020 The Author(s). Published by Elsevier Ltd.
Keywords:
Topology optimization
Minimal weight
Variational approach
Ritz method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.8
Papers:
6.2K
Citations:
1.7W