Recursive algorithms for computational electromagnetics

Efficient and fast recursive algorithms for both the spectral-domain and the space-domain solutions of the electromagnetic scattering problems have been developed. These algorithms have less than $O(N\sp3)$ computational complexities and less than $O(N\sp2)$ memory requirements for arbitrary geometries of scatterers clustered together. Although the algorithms are discussed as they are applied to the electromagnetic scattering problems, their domains of applicability can be extended to other types of electromagnetic problems (e.g., guidance, resonance, and radiation) and also to other types of field and wave equations (e.g., acoustic, elastic, and Schrodinger).

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Electrical Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Gurel, Levent

Contributors dc:contributor

• Chew, Weng Cho

• Engineering, Electronics and Electrical

Statement dc:rights

• Copyright 1991 Gurel, Levent

Language dc:language

eng

Identifier

AAI9210822
(UMI)AAI9210822

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/18958