Fast Multilevel Algorithms for the Electromagnetic Analysis of Quasi-Planar Structures
Jandhyala, Vikram
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/81246
Description
Title
Fast Multilevel Algorithms for the Electromagnetic Analysis of Quasi-Planar Structures
Author(s)
Jandhyala, Vikram
Issue Date
1998
Doctoral Committee Chair(s)
Eric Michielssen
Department of Study
Electrical Engineering
Discipline
Electrical Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Language
eng
Abstract
The analysis of electromagnetic scattering and radiation from quasi-planar structures is a topic of great current interest, owing to the wide range of applications. A host of structures and surfaces are included in the quasi-planar class, including rough surfaces, quantum well infrared photodetector gratings, planar microwave circuits, microstrip arrays, diffractive optical elements, and solar cells. The prediction of electromagnetic radiation and scattering is essential in applications involving the structures listed above. Possibly the most widespread class of techniques for this purpose is based on integral-equation formulations and method of moments (MoM) solutions. In such an approach, analysis problems are reduced to solutions of matrix equations of dimension N, where N is dependent on the electrical dimensions of the scatterer. Direct inversion of a large matrix can become impractical for even moderately large N, owing to a computational cost of O(N$\sp{3}$). Furthermore, even the O(N$\sp{2}$) CPU time (per iteration) and memory requirements of iterative solvers can become prohibitive for frequently encountered, large-scale, realistic problems. In this dissertation, new multilevel, rigorous, integral-equation solution techniques, based on a steepest-descent fast multipole (SDFMM) formulation, are developed for solving scattering problems involving large quasi-planar structures. These techniques promise to open the door to the full-wave analysis of complex quasi-planar structures to an extent not possible to date, owing to their O(N) CPU time (per iteration) and memory requirements. The SDFMM relies on a combined steepest-descent path and an inhomogeneous plane-wave representation of Greens' functions, and exploits the quasi-planarity of scatterers to reduce the computational complexity. In this dissertation, the SDFMM is developed in its full generality to tackle a host of electromagnetic scattering problems that find application in remote sensing, microelectronic devices, and communication systems. Large and flexible computer codes are written for analyzing scattering from perfectly conducting and penetrable rough surfaces, for studying optical absorption by quasi-random gratings in quantum-well infrared photodetectors, and for predicting radiation and scattering from large and finite microstrip antenna arrays.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
