Fast algorithm for scattering from planar arrays of conducting patches

Date
1998-04
Advisor
Instructor
Source Title
IEEE Microwave and Guided Wave Letters
Print ISSN
1051-8207
Electronic ISSN
Publisher
Institute of Electrical and Electronics Engineers
Volume
8
Issue
4
Pages
155 - 157
Language
English
Type
Article
Journal Title
Journal ISSN
Volume Title
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.

Course
Other identifiers
Book Title
Keywords
Algorithms, Antenna arrays, Frequency selective surface, Scattering, Algorithms, Computational complexity, Electromagnetic wave scattering, Green's function, Mathematical models, Frequency selective surfaces (FSS), Antenna phased arrays
Citation
Published Version (Please cite this version)