Structural topology optimization aims to enhance the mechanical performance of a structure while satisfying some functional constraints. Nearly all approaches proposed in the literature are iterative, and the optimal solution is found by repeatedly solving a finite element analysis (FEA). It is thus clear that the bottleneck is the high computational effort, as these approaches require solving the FEA a large number of times. In this work, we address the need for reducing the computational time by proposing a reduced basis method that relies on functional principal component analysis (FPCA). The methodology has been validated considering a simulated annealing approach for compliance minimization in 2 classical variable thickness problems. Results show the capability of FPCA to provide good results while reducing the computational times, ie, the computational time for an FEA is about one order of magnitude lower in the reduced FPCA space.
(2018). Applying functional principal components to structural topology optimization [journal article - articolo]. In INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING. Retrieved from http://hdl.handle.net/10446/170597
Applying functional principal components to structural topology optimization
Lanzarone, Ettore
2018-01-01
Abstract
Structural topology optimization aims to enhance the mechanical performance of a structure while satisfying some functional constraints. Nearly all approaches proposed in the literature are iterative, and the optimal solution is found by repeatedly solving a finite element analysis (FEA). It is thus clear that the bottleneck is the high computational effort, as these approaches require solving the FEA a large number of times. In this work, we address the need for reducing the computational time by proposing a reduced basis method that relies on functional principal component analysis (FPCA). The methodology has been validated considering a simulated annealing approach for compliance minimization in 2 classical variable thickness problems. Results show the capability of FPCA to provide good results while reducing the computational times, ie, the computational time for an FEA is about one order of magnitude lower in the reduced FPCA space.File | Dimensione del file | Formato | |
---|---|---|---|
paper.pdf
Solo gestori di archivio
Versione:
publisher's version - versione editoriale
Licenza:
Licenza default Aisberg
Dimensione del file
1.55 MB
Formato
Adobe PDF
|
1.55 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo