• DocumentCode
    1081083
  • Title

    The recursive aggregate interaction matrix algorithm for multiple scatterers

  • Author

    Chew, W.C. ; Lu, C.C.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
  • Volume
    43
  • Issue
    12
  • fYear
    1995
  • fDate
    12/1/1995 12:00:00 AM
  • Firstpage
    1483
  • Lastpage
    1486
  • Abstract
    The recursive aggregate interaction matrix algorithm (RAIMA) for calculating a wave scattering solution is developed. This algorithm combines the strength of both the recursive aggregate T matrix algorithm (RATMA) and the recursive interaction matrix algorithm (RIMA) that have been previously developed. The resultant algorithm is robust for scattering problems involving highly singular Green´s functions by avoiding the violation of the addition theorem. It also has reduced computational complexity for inverting the volume integral equation of scattering. The computational complexity of RAIMA is O(N7/3) in three dimensions and O(N2) in two dimensions
  • Keywords
    Green´s function methods; computational complexity; electromagnetic wave scattering; recursive functions; computational complexity; highly singular Green´s functions; multiple scatterers; recursive aggregate T matrix algorithm; recursive aggregate interaction matrix algorithm; volume integral equation of scattering; wave scattering solution; Aggregates; Computational complexity; Electromagnetic scattering; Green´s function methods; Integral equations; Matrix decomposition; Message-oriented middleware; Moment methods; NASA; Robustness;
  • fLanguage
    English
  • Journal_Title
    Antennas and Propagation, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-926X
  • Type

    jour

  • DOI
    10.1109/8.475942
  • Filename
    475942