Fast algorithm for scattering from planar arrays of conducting patches
Date
1998-04
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
1
views
views
19
downloads
downloads
Citation Stats
Series
Abstract
A direct (noniterative) algorithm for the solution of the electromagnetic scattering from three-dimensional planar arrays of conducting patches is developed. For an N-unknown problem, the computational complexity of this new solution technique is shown to be O(N2 log2N), which is considerably lower than the O(N3) computational complexity of the conventional direct solution techniques. The advantages of the reduction in the computational complexity is pronounced in the solution of large electromagnetics problems, such as scattering from large and finite arrays of patches, synthesis and analysis of finite-sized frequency selective surfaces (FSS's), and radiation and scattering from large phased-array antennas, to name a few.
Source Title
IEEE Microwave and Guided Wave Letters
Publisher
Institute of Electrical and Electronics Engineers
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English