Please use this identifier to cite or link to this item:
|Title:||A hybrid sensitivity filtering method for topology optimization||Authors:||Wang, S.Y.
Existence of solutions
|Issue Date:||2008||Citation:||Wang, S.Y.,Lim, K.M.,Khoo, B.C.,Wang, M.Y. (2008). A hybrid sensitivity filtering method for topology optimization. CMES - Computer Modeling in Engineering and Sciences 24 (1) : 21-50. ScholarBank@NUS Repository.||Abstract:||In topology optimization, filtering techniques have become quite popular in practice. In this paper, an accurate and efficient hybrid sensitivity filtering approach based on the traditional and bilateral sensitivity filtering approaches is proposed. In the present hybrid approach, the traditional sensitivity filter is applied to a sub-domain where numerical instabilities are likely to occur to overcome the numerical instabilites robustly. Filtering on mesh-independent holes identified by an image-processing-based technique is prohibited to reduce the computational cost. The bilateral approach is employed for the corresponding nearest neighboring elements of the mesh-independent holes to drive the 0-1 convergence of their boundaries. As a result, the optimal designs can be checkerboard-free, mesh-independent and mostly black-and-white. The possible side effects of the traditional and bilateral sensitivity filtering approaches can be alleviated. Existence of solutions can be ensured in a more accurate manner. The high accuracy and efficiency of the present approach are illustrated with classical examples in minimum compliance design. It is suggested that the present hybrid approach for topology optimization be highly appealing. Copyright © 2008 Tech Science Press.||Source Title:||CMES - Computer Modeling in Engineering and Sciences||URI:||http://scholarbank.nus.edu.sg/handle/10635/54280||ISSN:||15261492|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 23, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.