TY - JOUR
T1 - Fast analysis of transient scattering in lossy media
AU - Yilmaz, Ali E.
AU - Weile, Daniel S.
AU - Shanker, Balasubramanian
AU - Jin, Jian Ming
AU - Michielssen, Eric
N1 - Funding Information:
Manuscript received October 26, 2001; revised February 7, 2002. This work was supported in part by a grant from AFOSR via the MURI program under Contract F49620-96-1-0025, by a grant from DARPA VET Program under Contract F49620-01-1-0228, and by a MURI program on “Effects of RF-pulses on electronic circuits and systems.” A. E. Yılmaz, J. M. Jin, and E. Michielssen are with the Center for Computational Electromagnetics, Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL 61801 USA (e-mail: [email protected]).
PY - 2002
Y1 - 2002
N2 - The solution of time-domain integral equations pertinent to scattering from perfectly conducting objects residing in unbounded lossy media is considered. The computational cost of classical marching-on-in-time (MOT) schemes for the solution of such equations scales as O(Nt2N s2), where Nt and Ns are the number of temporal and spatial unknowns, respectively. In this letter, a fast Fourier transform (FFT)-based algorithm that reduces the computational complexity to O(NtNs2 log2 Nt) is introduced. When combined with spatial FFT algorithms, the proposed scheme further reduces the complexity of MOT-based integral equation solvers, for example to O(NtNs log(NtNs) log Nt) if the objects are uniformly meshed. Numerical simulations that demonstrate the accuracy and efficiency of the algorithm are presented.
AB - The solution of time-domain integral equations pertinent to scattering from perfectly conducting objects residing in unbounded lossy media is considered. The computational cost of classical marching-on-in-time (MOT) schemes for the solution of such equations scales as O(Nt2N s2), where Nt and Ns are the number of temporal and spatial unknowns, respectively. In this letter, a fast Fourier transform (FFT)-based algorithm that reduces the computational complexity to O(NtNs2 log2 Nt) is introduced. When combined with spatial FFT algorithms, the proposed scheme further reduces the complexity of MOT-based integral equation solvers, for example to O(NtNs log(NtNs) log Nt) if the objects are uniformly meshed. Numerical simulations that demonstrate the accuracy and efficiency of the algorithm are presented.
KW - Electromagnetic (EM)
KW - Fast algorithms
KW - Fast fourier transform (FFT)
KW - Integral equations
KW - Lossy media
KW - Transients
UR - http://www.scopus.com/inward/record.url?scp=0041506569&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0041506569&partnerID=8YFLogxK
U2 - 10.1109/LAWP.2002.802577
DO - 10.1109/LAWP.2002.802577
M3 - Article
AN - SCOPUS:0041506569
SN - 1536-1225
VL - 1
SP - 14
EP - 17
JO - IEEE Antennas and Wireless Propagation Letters
JF - IEEE Antennas and Wireless Propagation Letters
ER -