Premium
The application of iterative solvers in discrete dipole approximation method for computing electromagnetic scattering
Author(s) -
Fan Z. H.,
Wang D. X.,
Chen R. S.,
Yung Edward K. N.
Publication year - 2006
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.21760
Subject(s) - krylov subspace , radar cross section , computation , discrete dipole approximation , microwave , scattering , matrix (chemical analysis) , fourier transform , computer science , computational science , dipole , computational electromagnetics , product (mathematics) , iterative method , dot product , algorithm , radar , mathematics , physics , mathematical analysis , electromagnetic field , optics , quantum mechanics , geometry , telecommunications , composite material , materials science
Abstract Several Krylov subspace iterative algorithms are compared as the solvers for the discrete dipole approximation method to analyze the electromagnetic scattering problem. Fast Fourier transform technique is exploited to accelerate the computation of matrix‐vector product. Numerical examples for homogeneous spheres indicate that the results of radar cross section agree well with the exact solutions. Some misleading concepts in literatures are clarified. We give a new comparison of the computational complexities of these methods. Faster solvers are recommended according to the size of scatterer. © 2006 Wiley Periodicals, Inc. Microwave Opt Technol Lett 48: 1741–1746, 2006; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.21760