TY - JOUR
T1 - Time domain adaptive integral method for surface integral equations
AU - Yilmaz, Ali E.
AU - Jin, Jian Ming
AU - Michielssen, Eric
N1 - Funding Information:
Manuscript received May 9, 2003. This work was supported in part by ARO program DAAD19-00-1-0464, by the DARPA VET Program under AFOSR Contract F49620-01-1-0228, and in part by the MURI Grant F49620-01-1-04 “Analysis and design of ultrawide-band and high power microwave pulse interactions with electronic circuits and systems.” The authors 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]). Digital Object Identifier 10.1109/TAP.2004.834399
PY - 2004/10
Y1 - 2004/10
N2 - An efficient marching-on-in-time (MOT) scheme is presented for solving electric, magnetic, and combined field integral equations pertinent to the analysis of transient electromagnetic scattering from perfectly conducting surfaces residing in an unbounded homogenous medium. The proposed scheme is the extension of the frequency-domain adaptive integral/pre-corrected fast-Fourier transform (FFT) method to the time domain. Fields on the scatterer that are produced by space-time sources residing on its surface are computed: 1) by locally projecting, for each time step, all sources onto a uniform auxiliary grid that encases the scatterer; 2) by computing everywhere on this grid the transient fields produced by the resulting auxiliary sources via global, multilevel/blocked, space-time FFTs; 3) by locally interpolating these fields back onto the scatterer surface. As this procedure is inaccurate when source and observer points reside close to each other; and 4) near fields are computed classically, albeit (pre-)corrected, for errors introduced through the use of global FFTs. The proposed scheme has a computational complexity and memory requirement of O(NtN s log2 Ns) and O(N3/2 s) when applied to quasiplanar structures, and of O(N tN3/2s log2 N s) and O(N2s) when used to analyze scattering from general surfaces. Here, Ns and N t denote the number of spatial and temporal degrees of freedom of the surface current density. These computational cost and memory requirements are contrasted to those of classical MOT solvers, which scale as O(NtN2s) and O(N 2s), respectively. A parallel implementation of the scheme on a distributed-memory computer cluster that uses the message-passing interface is described. Simulation results demonstrate the accuracy, efficiency, and the parallel performance of the implementation.
AB - An efficient marching-on-in-time (MOT) scheme is presented for solving electric, magnetic, and combined field integral equations pertinent to the analysis of transient electromagnetic scattering from perfectly conducting surfaces residing in an unbounded homogenous medium. The proposed scheme is the extension of the frequency-domain adaptive integral/pre-corrected fast-Fourier transform (FFT) method to the time domain. Fields on the scatterer that are produced by space-time sources residing on its surface are computed: 1) by locally projecting, for each time step, all sources onto a uniform auxiliary grid that encases the scatterer; 2) by computing everywhere on this grid the transient fields produced by the resulting auxiliary sources via global, multilevel/blocked, space-time FFTs; 3) by locally interpolating these fields back onto the scatterer surface. As this procedure is inaccurate when source and observer points reside close to each other; and 4) near fields are computed classically, albeit (pre-)corrected, for errors introduced through the use of global FFTs. The proposed scheme has a computational complexity and memory requirement of O(NtN s log2 Ns) and O(N3/2 s) when applied to quasiplanar structures, and of O(N tN3/2s log2 N s) and O(N2s) when used to analyze scattering from general surfaces. Here, Ns and N t denote the number of spatial and temporal degrees of freedom of the surface current density. These computational cost and memory requirements are contrasted to those of classical MOT solvers, which scale as O(NtN2s) and O(N 2s), respectively. A parallel implementation of the scheme on a distributed-memory computer cluster that uses the message-passing interface is described. Simulation results demonstrate the accuracy, efficiency, and the parallel performance of the implementation.
UR - http://www.scopus.com/inward/record.url?scp=7444245099&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=7444245099&partnerID=8YFLogxK
U2 - 10.1109/TAP.2004.834399
DO - 10.1109/TAP.2004.834399
M3 - Article
AN - SCOPUS:7444245099
SN - 0018-926X
VL - 52
SP - 2692
EP - 2708
JO - IEEE Transactions on Antennas and Propagation
JF - IEEE Transactions on Antennas and Propagation
IS - 10
ER -