Skip to main content

Research Repository

Advanced Search

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

Adams, T.; Giani, S; Coombs, W.M.

Authors

T. Adams



Contributors

A. Faramarzi
Editor

S. Dirar
Editor

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.

Citation

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

Conference Name 25th Conference on Computational Mechanics UKACM 2017.
Conference Location Birmingham, UK
Start Date Apr 11, 2017
End Date Apr 13, 2017
Publication Date Apr 13, 2017
Deposit Date Jun 7, 2017
Publicly Available Date Mar 29, 2024
Publisher University of Birmingham
Pages 18-21
Book Title Proceedings of the 25th Conference on Computational Mechanics (UKACM 2017) : 11th – 13th April 2017, School of Engineering, University of Birmingham, Birmingham, UK.
Public URL https://durham-repository.worktribe.com/output/1147130
Publisher URL http://ukacm2017.ukacm.org/wp-content/uploads/2017/04/Proceedings-UKACM2017-compressed.pdf