Fast direct (noniterative) solvers for integral-equation formulations of scattering problems
Date
1998
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Proceedings of the Antennas and Propagation Society International Symposium, IEEE 1998
Print ISSN
0272-4693
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
298 - 301
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Citation Stats
Attention Stats
Usage Stats
2
views
views
5
downloads
downloads
Series
Abstract
A family of direct (noniterative) solvers with reduced computational complexity is proposed for solving problems involving resonant or near-resonant structures. Based on the recursive interaction matrix algorithm, the solvers exploit the aggregation concept of the recursive aggregate T-matrix algorithm to accelerate the solution. Direct algorithms are developed to compute the scattered field and the current coefficient, and invert the impedance matrix. Computational complexities of these algorithms are expressed in terms of the number of harmonics P required to express the scattered field of a larger scatterer made up of N scatterers. The exact P-N relation is determined by the geometry.
Course
Other identifiers
Book Title
Keywords
Algorithms, Computational complexity, Computational methods, Electric currents, Electric impedance, Electromagnetic field theory, Integral equations, Matrix algebra, Computational electromagnetics, Direct solvers, Recursive aggregate T-matrix algorithm (RATMA), Recursive interaction matrix algorithm (RIMA), Electromagnetic wave scattering