Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sahin, A. ; Center for Electromagn. Res., Northeastern Univ., Boston, MA, USA ; Miller, E.L.

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λ). 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

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:46 ,  Issue: 5 )