The application of iterative solvers in discrete dipole approximation method for computing electromagnetic scattering

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