Referenced Items are not available for this document.
A fast algorithm for accelerating the time-marching solution of time-domain integral equations pertinent to the analysis of free-space electromagnetic scattering from perfectly conducting, platelike and uniformly meshed structures is presented. The matrix-vector multiplications required by the time-marching scheme are accelerated by use of the fast Fourier transform (FFT). This acceleration is achieved in a multilevel fashion by hierarchically grouping sparse interactions to extract denser pieces that are efficiently evaluated by the FFT. The total computational cost and storage requirements of this algorithm scale as O(NtNslog2 Ns) and O(N1.5), respectively, as opposed to O(NtNs2) and O(Ns2) for classical time-marching methods (Ns and Nt denote the total number of spatial unknowns and time steps, respectively). Simulation results demonstrate the accuracy and efficiency of the algorithm.
Published in:
Antennas and Propagation, IEEE Transactions on
(Volume:50
,
Issue:
7
)
Date of Publication: Jul 2002
- Page(s):
- 971 - 982
- ISSN :
- 0018-926X
- INSPEC Accession Number:
- 7370038
- Digital Object Identifier :
- 10.1109/TAP.2002.802094
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 07 November 2002
- Issue Date :
- Jul 2002
- Sponsored by :
- IEEE Antennas and Propagation Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
