Abstract
Material interpolation schemes, like SIMP, are very popular in topology optimization. They convert the difficult 0-1 problem into a nonlinear programming problem defined over a convex set by involving an interpolation (or penalization) function, usually constructed in rather empirical ways. This paper gives an insight into such methods with the help of the notion of topological sensitivity, and in particular provides some arguments for the choice of the penalization function. A simple algorithm based on these concepts is proposed and illustrated by numerical experiments.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
