An aggregated interaction matrix algorithm

Author

Cai-Cheng Lu ; Weng Cho Chew

Author_Institution

Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA

Volume

2

fYear

1994

fDate

20-24 June 1994

Firstpage

1173

Abstract

The recursive aggregate T matrix algorithm (RATMA) has been developed to solve for the scattering solution of N subscatterers with reduced computational complexity. For a general scattering problem, a scatterer is first decomposed into N subscatterers which are non-overlapping before the RATMA is applied. In computational electromagnetics, a scatterer is often discretized by using subdomain basis functions which are overlapping, essentially decomposing a scatterer into a set of overlapping subscatterers, as in the method of moments. We describe an improved RATMA which allows for overlapping subscatterers.<>

Keywords

computational complexity; electromagnetic wave scattering; integral equations; matrix algebra; RATMA; aggregated interaction matrix algorithm; computational electromagnetics; integral equation; non-overlapping scatterers; overlapping subscatterers; recursive aggregate T matrix algorithm; reduced computational complexity; scattering problem; scattering solution; subdomain basis functions; subscatterers; Accuracy; Aggregates; Contracts; Electromagnetic scattering; Integral equations; Matrix decomposition; Moment methods; NASA; Partitioning algorithms; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Antennas and Propagation Society International Symposium, 1994. AP-S. Digest

Conference_Location

Seattle, WA, USA

Print_ISBN

0-7803-2009-3

Type

conf

DOI

10.1109/APS.1994.407881

Filename

407881