Determining the scattered field of dense particles using recursive algorithms | Zendy

Meiners Christian | Zendy; Psilopoulos Jannis | Zendy; Jacob Arne F. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Determining the scattered field of dense particles using recursive algorithms

Author(s) -

Meiners Christian,

Psilopoulos Jannis,

Jacob Arne F.

Publication year - 2004

Publication title -

microwave and optical technology letters

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.304

H-Index - 76

eISSN - 1098-2760

pISSN - 0895-2477

DOI - 10.1002/mop.20023

Subject(s) - scattering , microwave , range (aeronautics) , algorithm , matrix (chemical analysis) , field (mathematics) , computer science , mathematics , physics , materials science , optics , engineering , telecommunications , pure mathematics , aerospace engineering , composite material

Some common and fast recursive methods for solving the scattering problem of many randomly distributed particles are reviewed. The particles are characterized by means of a T‐matrix. The useful range of these algorithms is discussed with respect to the number of scatterers and the packing density. © 2004 Wiley Periodicals, Inc. Microwave Opt Technol Lett 40: 523–529, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.20023

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research