Gürel, LeventChew, W. C.2016-02-082016-02-0819980272-4693http://hdl.handle.net/11693/27680Date of Conference: 21-26 June 1998Conference Name: Antennas and Propagation Society International Symposium, IEEE 1998A 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.EnglishAlgorithmsComputational complexityComputational methodsElectric currentsElectric impedanceElectromagnetic field theoryIntegral equationsMatrix algebraComputational electromagneticsDirect solversRecursive aggregate T-matrix algorithm (RATMA)Recursive interaction matrix algorithm (RIMA)Electromagnetic wave scatteringConference Paper10.1109/APS.1998.699139