Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Feature removal from computational geometries, or defeaturing, is an integral part of industrial simulation pipelines. Defeaturing simplifies the otherwise costly or even impossible meshing process, speeds up the simulation, and lowers its memory footprint. Current defeaturing operators are often based on heuristic criteria and ignore the impact of the simplifications on the PDE solution. This work extends the mathematically rigorous framework developed in [5] to features subject to Dirichlet boundary conditions in Poisson problems. We derive a posteriori error estimators for negative features in the interior or on the boundary of the computational domain. The estimators' dependence on the feature size is explicit, and their evaluation only involves boundary integrals over the feature boundary. Numerical experiments in two and three dimensions showcase the validity and efficiency of the estimators.