Nonuniform grid time domain (NGTD) algorithm for fast evaluation of transient wave fields
A novel algorithm to efficiently compute transient wave fields produced by known three-dimensional source constellations is proposed. The algorithm uses domain decomposition concepts and comprises two steps to be repeated for each subdomain considered. In the first step, delay- and amplitude- compen...
Saved in:
Published in: | IEEE transactions on antennas and propagation Vol. 54; no. 7; pp. 1943 - 1951 |
---|---|
Main Authors: | , , |
Format: | Journal Article |
Language: | English |
Published: |
New York, NY
IEEE
01-07-2006
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | A novel algorithm to efficiently compute transient wave fields produced by known three-dimensional source constellations is proposed. The algorithm uses domain decomposition concepts and comprises two steps to be repeated for each subdomain considered. In the first step, delay- and amplitude- compensated fields, produced by sources residing inside each subdomain are computed at a sparse set of points surrounding the observation domain. In the second step, total fields in the observer domain are evaluated by interpolation, delay and amplitude restoration, and aggregation of subdomain fields. The proposed scheme is well-suited to accelerate the solution of time domain integral equations by marching on in time, to carry out time domain physical optics calculations, and to realize near- to far-field transformations of transients. Moreover, the scheme automatically adapts to, and takes advantage of, special geometrical features of the source-observer constellation studied, a key benefit when analyzing quasi-planar configurations. In addition, it realizes a seamless transition from the dynamic to the quasi-static regime, thus facilitating a unified treatment of electrically large and small problems. Last but not least, the scheme is remarkably simple to implement. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0018-926X 1558-2221 |
DOI: | 10.1109/TAP.2006.877186 |