Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

Level set based topology optimisation using high-order reinitialisation methods and the discontinuous Galerkin method.

Adams, T. and Giani, S and Coombs, W.M. (2017) 'Level set based topology optimisation using high-order reinitialisation methods and the discontinuous Galerkin method.', in Proceedings of the 25th Conference on Computational Mechanics (UKACM 2017) : 11th – 13th April 2017, School of Engineering, University of Birmingham, Birmingham, UK. Birmingham: University of Birmingham, pp. 18-21.

Abstract

This paper extends the work presented in [1], which presented a topology optimisation approach using the level set method (LSM) and the discontinuous Galerkin symmetric interior penalty (SIPG) method, by applying a SIPG discretisation to a number of level set reinitialisation methods. This allows the reinitialisations methods to more accurately capture the topology during reinitialisation, and thus reduce the errors introduced by such methods during the optimisation process. Currently existing methods of level set reinitialisation include an elliptic PDEbased method [2], and a hyperbolic PDE-based method [3], as well as others. This paper presents SIPG solutions to these aforementioned PDE-based reinitialisation methods.

Item Type:Book chapter
Full text:Publisher-imposed embargo
(AM) Accepted Manuscript
File format - PDF
(404Kb)
Status:Peer-reviewed
Publisher Web site:http://ukacm2017.ukacm.org/wp-content/uploads/2017/04/Proceedings-UKACM2017-compressed.pdf
Date accepted:No date available
Date deposited:07 June 2017
Date of first online publication:2017
Date first made open access:No date available

Save or Share this output

Export:
Export
Look up in GoogleScholar