Mollified finite element approximants of arbitrary order and smoothness
Eky Febrianto, Michael Ortiz, Fehmi Cirak

TL;DR
This paper introduces mollified basis functions of arbitrary order and smoothness for finite element approximations on convex polytopes, enhancing approximation properties and enabling boundary condition application via Nitsche's method.
Contribution
It proposes a novel mollified basis function construction for arbitrary polytope partitions, improving finite element approximation flexibility and accuracy.
Findings
Optimal convergence demonstrated for Poisson problems
Supports arbitrary polynomial order and smoothness
Enables boundary conditions with Nitsche's method
Abstract
The approximation properties of the finite element method can often be substantially improved by choosing smooth high-order basis functions. It is extremely difficult to devise such basis functions for partitions consisting of arbitrarily shaped polytopes. We propose the mollified basis functions of arbitrary order and smoothness for partitions consisting of convex polytopes. On each polytope an independent local polynomial approximant of arbitrary order is assumed. The basis functions are defined as the convolutions of the local approximants with a mollifier. The mollifier is chosen to be smooth, to have a compact support and a unit volume. The approximation properties of the obtained basis functions are governed by the local polynomial approximation order and mollifier smoothness. The convolution integrals are evaluated numerically first by computing the boolean intersection between…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
