Efficient computational techniques for electromagnetic propagation and scattering
Wagner, Robert Louis
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/23594
Description
Title
Efficient computational techniques for electromagnetic propagation and scattering
Author(s)
Wagner, Robert Louis
Issue Date
1996
Doctoral Committee Chair(s)
Chew, Weng Cho
Department of Study
Engineering, Electronics and Electrical
Engineering, Mechanical
Physics, Electricity and Magnetism
Discipline
Engineering, Electronics and Electrical
Engineering, Mechanical
Physics, Electricity and Magnetism
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Engineering, Mechanical
Physics, Electricity and Magnetism
Language
eng
Abstract
Electromagnetic propagation and scattering problems are important in many application areas such as communications, high-speed circuitry, medical imaging, geophysical remote sensing, nondestructive testing, and radar. This thesis develops several new techniques for the efficient computer solution of such problems.
Most of this thesis deals with the efficient solution of electromagnetic scattering problems formulated as surface integral equations. A standard method of moments (MOM) formulation is used to reduce the problem to the solution of a dense, $N \times\ N$ matrix equation, where N is the number of surface current unknowns. An iterative solution technique is used, requiring the computation of many matrix-vector multiplications.
Techniques developed for this problem include the ray-propagation fast multipole algorithm (RPFMA), which is a simple, non-nested, physically intuitive technique based on the fast multipole method (FMM). The RPFMA is implemented for two-dimensional surface integral equations, and reduces the cost of a matrix-vector multiplication from $O(N\sp2$) to $O(N\sp{4/3}$). The use of wavelets is also studied for the solution of two-dimensional surface integral equations. It is shown that the use of wavelets as basis functions produces a MOM matrix with substantial sparsity. However, unlike the RPFMA, the use of a wavelet basis does not reduce the computational complexity of the problem. In other words, the sparse MOM matrix in the wavelet basis still has $O(N\sp2$) significant entries. The fast multipole method-fast Fourier transform (FMM-FFT) method is developed to compute the scattering of an electromagnetic wave from a two-dimensional rough surface. The resulting algorithm computes a matrix-vector multiply in $O(N \log\ N$) operations. This algorithm is shown to be more efficient than another $O(N \log\ N$) algorithm, the multi-level fast multipole algorithm (MLFMA), for surfaces of small height. For surfaces with larger roughness, the MLFMA is found to be more efficient. Using the MLFMA, Monte Carlo simulations are carried out to compute the statistical properties of the electromagnetic scattering from two-dimensional random rough surfaces.
Finally, Liao's absorbing boundary condition (ABC) is studied in detail. This is an approximate ABC used to truncate the computational mesh in the finite-difference time-domain (FDTD) method. Unique results, both theoretical and numerical, are presented.
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.
