Robust and scalable h-adaptive aggregated unfitted finite elements for interface elliptic problems
Eric Neiva, Santiago Badia

TL;DR
This paper presents a new robust, scalable, and adaptive unfitted finite element method for large-scale interface elliptic problems, demonstrating high accuracy, robustness, and efficiency in complex simulations.
Contribution
It introduces a novel $h$-adaptive aggregated unfitted finite element method with a scalable Cartesian mesh engine for interface problems, extending existing approaches to complex multi-interface scenarios.
Findings
Method is well-posed and robust against cut location and material contrast.
Achieves optimal $h$-adaptive approximation properties.
Demonstrates high scalability and ease of implementation in large-scale codes.
Abstract
This work introduces a novel, fully robust and highly-scalable, -adaptive aggregated unfitted finite element method for large-scale interface elliptic problems. The new method is based on a recent distributed-memory implementation of the aggregated finite element method atop a highly-scalable Cartesian forest-of-trees mesh engine. It follows the classical approach of weakly coupling nonmatching discretisations at the interface to model internal discontinuities at the interface. We propose a natural extension of a single-domain parallel cell aggregation scheme to problems with a finite number of interfaces; it straightforwardly leads to aggregated finite element spaces that have the structure of a Cartesian product. We demonstrate, through standard numerical analysis and exhaustive numerical experimentation on several complex Poisson and linear elasticity benchmarks, that the new…
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.
