A fast algorithm for particle simulations
Journal of Computational Physics
Rapid solution of integral equations of scattering theory in two dimensions
Journal of Computational Physics
Journal of Computational Physics
Fast and Efficient Algorithms in Computational Electromagnetics
Fast and Efficient Algorithms in Computational Electromagnetics
IES3: Efficient Electrostatic and Electromagnetic Simulation
IEEE Computational Science & Engineering
A kernel-independent adaptive fast multipole algorithm in two and three dimensions
Journal of Computational Physics
A wideband fast multipole method for the Helmholtz equation in three dimensions
Journal of Computational Physics
A fast direct solver for scattering problems involving elongated structures
Journal of Computational Physics
Fast Directional Multilevel Algorithms for Oscillatory Kernels
SIAM Journal on Scientific Computing
Sparse Fourier Transform via Butterfly Algorithm
SIAM Journal on Scientific Computing
A precorrected-FFT method for electrostatic analysis of complicated 3-D structures
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Scaling fast multipole methods up to 4000 GPUs
Proceedings of the ATIP/A*CRC Workshop on Accelerator Technologies for High-Performance Computing: Does Asia Lead the Way?
Hi-index | 31.45 |
This paper is concerned with the fast solution of high-frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(NlogN) directional multilevel algorithm previously proposed for the acoustic scattering case to the vector electromagnetic case. We also detail how to incorporate the curl operator of the magnetic field integral equation into the algorithm. When combined with a standard iterative method, this results in an almost linear complexity solver for the combined field integral equations. In addition, the butterfly algorithm is utilized to compute the far field pattern and radar cross section with O(NlogN) complexity.