9 Computational Electromagnetics: The Finite-Difference Time-Domain Method
631frequencies thought to be important in the physics of theproblem. Typically, 10 to 20 samples per wavelength areneeded. The sampling time is selected to ensure numericalstability of the algorithm.Overall, FDTD and related techniques are marching-in-timeprocedures that simulate the continuous actual electromag-netic waves in a finite spatial region by sampled-data numer-ical analogs propagating in a computer data space. Time-stepping continues as the numerical wave analogs propagatein the space lattice to causally connect the physics of themodeled region. For simulations where the modeled regionmust extend to infinity, absorbing boundary conditions(ABCs) are employed at the outer lattice truncation planes,which ideally permit, all outgoing wave analogs to exit theregion with negligible reflection. Phenomena such as induc-tion of surface currents, scattering and multiple scattering,aperture penetration, and cavity excitation are modeled time-step by time-step by the action of the numerical analog to thecurl equations. Self-consistency of these modeled phenomenais generally ensured if their spatial and temporal variations arewell resolved by the space and time sampling process. In fact,the goal is to provide a self-consistent model of the mutualcoupling of all of the electrically small volume cells constitut-ing the structure and its near field, even if the structure spanstens of wavelengths in three dimensions and there are hun-dreds of millions of space cells.Time-stepping is continued until the desired late-time pulseresponse is observed at the field points of interest. For linearwave interaction problems, the sinusoidal response at thesefield points can be obtained over a wide band of frequenciesby discrete Fourier transformation of the computed fieldversus time waveforms at these points. Prolonged "ringing"of the computed field waveforms due to a high Q-factor orlarge electrical size of the structure being modeled requires acombination of extending the computational window in timeand extrapolating the windowed data before Fourier trans-formation.
9.1.4 Classes of Algorithms
Current FDTD and related space-grid time-domain algorithmsare fully explicit solvers employing highly vectorizable andparallel schemes for time-marching the six components ofthe electric and magnetic field vectors at each of the spacecells. The explicit nature of the solvers is usually maintained byemploying a leapfrog time-stepping scheme. Current methodsdiffer primarily in how the space lattice is set up. In fact,gridding methods can be categorized according to the degreeof structure or regularity in the mesh cells.
Almost Completely Structured
In this case, the space lattice is organized so that its unit cellsare congruent wherever possible. The most basic example ofsuch a mesh is the pioneering work of Yee (1966), whoemployed a uniform Cartesian grid having rectangular cells.Staircasing was used to approximate the surface of structuralfeatures not parallel to the grid coordinate axes. Later workshowed that it is possible to modify the size and shape of thespace cells located immediately adjacent to a structural featureto conformally fit its surface (Jurgens
et al.,
1992; Dey andMittra, 1997). This result is accurate and computationallyefficient for large structures because the number of modifiedcells is proportional to the surface area of the structure. Thus,the number of modified cells becomes progressively smallerrelative to the number of regular cells filling the structurevolume as its size increases. As a result, the computer resourcesneeded to implement a fully conformal model approximatethose required for a staircased model. A key disadvantage ofthis technique, however, is that special mesh-generation soft-ware must be constructed.
Surface-Fitted
In this case, the space lattice is globally distorted to fit theshape of the structure of interest. The lattice can be dividedinto multiple zones to accommodate a set of distinct surfacefeatures (Shankar
et al.,
1990). The major advantage of thisapproach is that well-developed mesh-generation software ofthis type is available. The major disadvantage, relative to theYee algorithm, is the substantial added computer burden due
to:
• Memory allocations for the position and stretchingfactors of each cell• Extra computer operations to implement Maxwell's equa-tions at each cell and to enforce field continuity at theinterfaces of adjacent cellsAnother disadvantage is the possible presence of numericaldissipation in the time-stepping algorithm used for suchmeshes. This can limit the range of electrical size of the structurebeing modeled due to numerical wave-attenuation artifacts.
Completely Unstructured
In an unstructured case, the space containing the structure ofinterest is completely filled with a collection of lattice cells ofvarying sizes and shapes but conforms to the structure surface(Madsen and Ziolkowski, 1990). As for the case of surface-fitted lattices, mesh-generation software is available andcapable of modeling complicated three-dimensional shapespossibly having volumetric inhomogeneities. A key disadvan-tage of this approach is its potential for numerical inaccuracyand instability due to the unwanted generation of highlyskewed space cells at random points in the lattice. A seconddisadvantage is the difficulty in mapping the unstructuredmesh computations onto the architecture of either parallelvector computers or massively parallel machines. Thestructure-specific irregularity of the mesh mandates a robustpreprocessing algorithm that optimally assigns specific meshcells to specific processors.
Leave a Comment