Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/87341
Type: Artigo de periódico
Title: An Algorithm For The Topology Optimization Of Geometrically Nonlinear Structures
Author: Gomes F.A.M.
Senne T.A.
Abstract: SUMMARY: Most papers on topology optimization consider that there is a linear relation between the strains and displacements of the structure, implicitly assuming that the displacements of the structure are small. However, when the external loads applied to the structure are large, the displacements also become large, so it is necessary to suppose that there is a nonlinear relation between strains and displacements. In this case, we say that the structure is geometrically nonlinear. In practice, this means that the linear system that needs to be solved each time the objective function of the problem is evaluated is replaced by an ill-conditioned nonlinear system of equations. Moreover, the stiffness matrix and the derivatives of the problem also become harder to compute.The objective of this work is to solve topology optimization problems under large displacements through a new optimization algorithm, named sequential piecewise linear programming. This method relies on the solution of convex piecewise linear programming subproblems that include second order information about the objective function. To speed up the algorithm, these subproblems are converted into linear programming ones. The new algorithm is not only globally convergent to stationary points but our numerical experiments also show that it is efficient and robust. © 2014 John Wiley & Sons, Ltd.
Editor: John Wiley and Sons Ltd
Rights: fechado
Identifier DOI: 10.1002/nme.4686
Address: http://www.scopus.com/inward/record.url?eid=2-s2.0-84904070738&partnerID=40&md5=b85fd3aa389de49620e29687daa74d94
Date Issue: 2014
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
2-s2.0-84904070738.pdf1.22 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.