A hierarchical FFT algorithm (HIL-FFT) for accelerating marching-on-in-time methods

A. E. Yilmaz, D. S. Weile, J. M. Jin, E. Michielssen

Research output: Contribution to journalConference articlepeer-review

Abstract

Transient electromagnetic scattering from uniformly meshed plate-like structures was analyzed using hierarchial Fast fourier transform (FFT)- based marching-on-in-time solver. The algorithm hierarchially divides the scatterer into regions and periodically computes interactions among these regions using three dimensional FFT. Interaction was computed in higher levels for regions closer than a pre-set buffer distance. It was found that FFT based algorithms reduced the computational complexity of frequency-domain integral equation solvers.

Original languageEnglish (US)
Pages (from-to)510-513
Number of pages4
JournalIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
Volume4
StatePublished - Nov 26 2001
Event2001 IEEE Antennas and Propagation Society International Symposium-Adaptive Arrays in Communications- - Boston, MA, United States
Duration: Jul 8 2001Jul 13 2001

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'A hierarchical FFT algorithm (HIL-FFT) for accelerating marching-on-in-time methods'. Together they form a unique fingerprint.

Cite this