IEEE Transactions on Antennas and Propagation · 2018 · 16 citations · 32 references
ComputingComputational EngineeringElectrical EngineeringComputational ElectromagneticsElectromagneticsParallel ComputingData ParallelismIntegral Equation FormulationsMultiscale Electromagnetic ModelingParallel Numerical MethodsScattering AnalysisScattering ProblemsDiscretizationElectromagnetic Field SolverFast Multipole AccelerationHierarchical Electromagnetic SolversLow-frequency BreakdownMultilevel Fast Multipole AlgorithmNumerical DiscretizationSpatial Discretization
Electromagnetic scattering from electrically large objects with multiscale features is an increasingly important problem in computational electromagnetics. A conventional approach is to use an integral equation-based solver that is then augmented with an accelerator, a popular choice being a parallel multilevel fast multipole algorithm (MLFMA). One consequence of multiscale features is locally dense discretization, which leads to low-frequency breakdown and requires nonuniform trees. To the authors' knowledge, the literature on parallel MLFMA for such multiscale distributions capable of arbitrary accuracy is sparse; this paper aims to fill this niche. We prescribe an algorithm that overcomes this bottleneck. We demonstrate the accuracy (with respect to analytical data) and performance of the algorithm for both PEC scatterers and point clouds as large as 755λ with several hundred million unknowns and nonuniform trees as deep as 16 levels.
32