Level-set shape optimization via polytopic discontinuous Galerkin methods
<|reference_start|>Level-set shape optimization via polytopic discontinuous Galerkin methods: We introduce a new level-set shape optimization approach based on polytopic (i.e., polygonal in two and polyhedral in three spatial dimensions) discontinuous Galerkin methods. The approach benefits from the geometric mesh flexibility of polytopic discontinuous Galerkin methods to resolve the zero-level set accurately and efficiently. Additionally, we employ suitable Runge-Kutta discontinuous Galerkin methods to update the level-set function on a fine underlying simplicial mesh. We discuss the construction and implementation of the approach, explaining how to modify shape derivate formulas to compute consistent shape gradient approximations using discontinuous Galerkin methods, and how to recover dG functions into smoother ones. Numerical experiments on unconstrained and PDE-constrained test cases evidence the good properties of the proposed methodology.<|reference_end|>
@article{fernandes2024level-set,
    title={Level-set shape optimization via polytopic discontinuous Galerkin
  methods},
    author={Raphael E. Fernandes, Emmanuil H. Georgoulis, Alberto Paganini},
    journal={arXiv preprint arXiv:2408.13206},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.13206},
    primaryClass={math.NA cs.NA math.OC}
}