Hierarchical Finite-Element Analysis of Multiscale Electromagnetic Problems via Sparse Operator-Adapted Wavelet Decomposition
F. Şık, F. L. Teixeira, B. Shanker
TL;DR
This work tackles multiscale electromagnetic analysis with a finite-element formulation augmented by operator-adapted wavelet decompositions that decouple resolution levels, enabling independent scale solves and avoiding costly remeshing of coarser levels. The authors develop a hierarchical, sparse, matrix-based framework that constructs operator-adapted bases on unstructured meshes, computes refinement structures via local, linear-algebraic procedures, and solves level-wise systems with Krylov methods and SPAI-based preconditioning. They demonstrate near-linear computational performance ($\approx O(N)$) on 2D problems such as L- and U-shaped waveguides and a leaky MPSi waveguide, achieving errors comparable to conventional finest-level FE solutions while substantially reducing inter-scale coupling and memory usage. The approach offers a scalable path for high-fidelity multiscale EM simulations and can be extended to 3D and hp/adaptive polygonal hierarchies to further improve efficiency and applicability in complex geometries.
Abstract
In this paper, we present a finite element method (FEM) framework enhanced by an operator-adapted wavelet decomposition algorithm designed for the efficient analysis of multiscale electromagnetic problems. Usual adaptive FEM approaches, while capable of achieving the desired accuracy without requiring a complete re-meshing of the computational domain, inherently couple different resolution levels. This coupling requires recomputation of coarser-level solutions whenever finer details are added to improve accuracy, resulting in substantial computational overhead. Our proposed method addresses this issue by decoupling resolution levels. This feature enables independent computations at each scale that can be incorporated into the solutions to improve accuracy whenever needed, without requiring re-computation of coarser-level solutions. The main algorithm is hierarchical, constructing solutions from finest to coarser levels through a series of sparse matrix-vector multiplications. Due to its sparse nature, the overall computational complexity of the algorithm is nearly linear. Moreover, Krylov subspace iterative solvers are employed to solve the final linear equations, with ILU preconditioners that enhance solver convergence and maintain overall computational efficiency. The numerical experiments presented in this article verify the high precision and nearly linear computational complexity of the proposed algorithm.
