Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Fan et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: