Title :
Fast algorithm for electromagnetic solution of modified-geometry problems
Author_Institution :
IBM Res. Div., Yorktown Heights, NY, USA
fDate :
June 28 1993-July 2 1993
Abstract :
A fast algorithm is presented for the full-wave electromagnetic scattering solution of a class of modified-geometry problems. The algorithm assumes that the solution for a scattering structure, which, in general, may be composed of multiple scatterers, is known and stored. With the addition of a new scatterer to the problem, this algorithm avoids the solution of the modified problem from the beginning, and, instead, makes use of the stored solution of the original structure. This algorithm reduces not only the computation time but also the computational complexity of the solution from O(n/sup 3/) to O(n/sup 2/), if there are n unknowns in the problem.<>
Keywords :
S-matrix theory; computational complexity; electromagnetic wave scattering; computation time; computational complexity; fast algorithm; full-wave electromagnetic scattering; modified-geometry problems; multiple scatterers; Boundary conditions; Computational complexity; Computational electromagnetics; Computer displays; Electromagnetic scattering; Equations; Filling; Perturbation methods; Solids;
Conference_Titel :
Antennas and Propagation Society International Symposium, 1993. AP-S. Digest
Conference_Location :
Ann Arbor, MI, USA
Print_ISBN :
0-7803-1246-5
DOI :
10.1109/APS.1993.385402