• DocumentCode
    3860825
  • Title

    Recursive T-matrix methods for scattering from multiple dielectric and metallic objects

  • Author

    A. Sahin;E.L. Miller

  • Author_Institution
    Center for Electromagn. Res., Northeastern Univ., Boston, MA, USA
  • Volume
    46
  • Issue
    5
  • fYear
    1998
  • Firstpage
    672
  • Lastpage
    678
  • Abstract
    We present an efficient, stable, recursive T-matrix algorithm to calculate the scattered field from a heterogeneous collection of spatially separated objects. The algorithm is based on the use of higher order multipole expansions than those typically employed in recursive T-matrix techniques. The use of these expansions introduces instability in the recursions developed by Chew (1990) and by Wang and Chew (1990), specifically in the case of near-field computations. By modifying the original recursive algorithm to avoid these instabilities, we arrive at a flexible and efficient forward solver appropriate for a variety of scattering calculations. The algorithm can be applied when the objects are dielectric, metallic, or a mixture of both. We verify this method for cases where the scatterers are electrically small (fraction of a wavelength) or relatively large (12/spl lambda/). While developed for near-field calculation, this approach is applicable for far-field problems as well. Finally, we demonstrate that the computational complexity of this approach compares favorably with comparable recursive algorithms.
  • Keywords
    "Dielectrics","Electromagnetic scattering","Signal processing algorithms","Forward contracts","Geometry","Sparse matrices","Computational complexity","Electromagnetic fields","Grid computing","Boundary conditions"
  • Journal_Title
    IEEE Transactions on Antennas and Propagation
  • Publisher
    ieee
  • ISSN
    0018-926X
  • Type

    jour

  • DOI
    10.1109/8.668910
  • Filename
    668910