Introduction
Maxwell interface problems are central to electromagnetic applications, such as simulating fields in motors or complex electronic components. Traditionally, these problems require "fitted" meshes where element boundaries align with material interfaces. In 3D, generating such meshes is computationally expensive and often leads to poor-quality elements (slivers) that degrade accuracy. This paper presents a new family of 3D Immersed Finite Element (IFE) spaces that solve these problems on simple, unfitted Cartesian meshes, achieving optimal convergence without the complexity of traditional fitted methods.
The Challenge of Unfitted Meshes
Unfitted mesh methods allow the interface to cut through elements, simplifying mesh generation significantly. However, standard unfitted methods often struggle to maintain accuracy because they do not naturally account for the physical "jumps" in electromagnetic fields at material boundaries. Many existing solutions rely on complex penalty terms that are difficult to tune and can hinder solver performance.
Methodology: Nédélec-type IFE Spaces
The authors propose a framework based on three core innovations:
- Nédélec-type IFE Spaces: Special shape functions are constructed for $H(\text{curl})$ and $H(\text{div})$ spaces. These functions "encode" the physical jump conditions directly, making the basis functions themselves aware of the material interface.
- Discrete de Rham Complex: The paper proves that these new IFE spaces form a complete de Rham complex. This mathematical structure is essential for ensuring that simulations are physically consistent and free of "spurious solutions."
- Petrov-Galerkin (PG) Formulation: By using IFE spaces for trial functions and standard conforming FE spaces for test functions, the authors achieve optimal convergence without needing extra penalty terms. This keeps the resulting linear systems manageable and square.
Fast Solvers and Robustness
To handle the resulting linear systems, which can be non-symmetric near the interface, the authors developed a modified Hiptmair-Xu (HX) preconditioner. This solver includes a "block diagonal smoother" specifically targeting elements near the interface.
Numerical experiments on benchmark problems—including flat, spherical, and torus interfaces—confirm that the method achieves optimal $O(h)$ convergence in the $H(\text{curl})$ norm and $O(h^2)$ in the $L^2$ norm. The solver remains robust even when the interface is extremely close to mesh nodes, a scenario that often causes standard methods to fail. For a problem with over 2.4 million degrees of freedom, the solver converged in just 41-43 iterations, demonstrating its efficiency for large-scale 3D problems.
Conclusion
This work provides a robust, penalty-free approach to 3D Maxwell interface problems. By leveraging the de Rham complex and a Petrov-Galerkin scheme, the authors enable high-accuracy simulations on simple meshes. Future work may extend this framework to higher-order elements and provide more rigorous theoretical proofs for 3D stability conditions.
Summary updated