Abstract
Despite of the apparent complexity of the topology optimization method it can actually be programmed in surprisingly few lines of code. For example, if using a high level programming language like Matlab, the code for solving the basic compliance minimization problem discussed in Chap. 1 may be written in only 99 lines (Sigmund 2001a). In this appendix we first discuss the Matlab implementation of the minimum compliance problem in some detail (based on Sigmund (2001a)). Afterwards, we briefly discuss the extensions of the code to a 105-line compliant mechanism synthesis code and a 91-line code for topology optimization of conductivity problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bendsøe, M.P., Sigmund, O. (2004). Appendices. In: Topology Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05086-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-05086-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07698-5
Online ISBN: 978-3-662-05086-6
eBook Packages: Springer Book Archive