Author :
Schuh, M.J. ; Woo, Alex C.
Author_Institution :
NASA Ames Res. Center, Moffett Field, CA, USA
fDate :
8/1/1995 12:00:00 AM
Abstract :
The order of an electromagnetics algorithm or code is defined by the rate at which the CPU time, and memory requirements CCPU=O(fα) and Cm=O(fβ ), respectively-grow with frequency. Knowledge of this information helps in the prediction of computer-run times and memory requirements for problems of interest. This paper presents a methodology for determining the computational and memory orders of a code. These results are presented for a finite-volume time-domain (FVTD) code and for a method-of-moments (MoM) code. Computer-resource requirements are plotted for computer runs that calculate the bistatic radar cross section (RCS) for spheres of different electrical sizes, within a set error level from the Mie-series solution. These plots are used to calculate the computational and memory orders of the codes
Keywords :
codes; electrical engineering computing; electromagnetism; finite difference time-domain analysis; method of moments; radar cross-sections; series (mathematics); CPU time; FDTD; FVTD code; Mie-series solution; RCS; bistatic radar cross section; code scaling; computational order; computer-resource requirements; computer-run times; electrical size; electromagnetics algorithm; electromagnetics code; error level; finite-volume time-domain code; frequency; memory order; memory requirements; method-of-moments code; spheres; Bistatic radar; Electromagnetic scattering; Finite difference methods; Frequency; Geometry; Message-oriented middleware; Moment methods; NASA; Postal services; Time domain analysis;
Journal_Title :
Antennas and Propagation Magazine, IEEE
