A comparative study of efficient iterative solvers for the discrete dipole approximation
Résumé
The discrete dipole approximation (DDA) is used to compute the electromagnetic diffraction of a three-dimensional object. Computationally, the DDA involves solving large, dense systems of linear equations through iterative methods such as QMR, GPBiCG and BiCGstab. In this paper, we propose to study two new methods (IDR() and GPBiCGstab()) for objects larger than the wavelength of illumination. We show that while IDR() can present a reduced computation time compared to other methods, it may not converge in some cases. Conversely, GPBiCGstab() always converges and also has a reduced computation time compared to QMR, GPBiCG and BiCGstab.
Domaines
Physique [physics]Origine | Fichiers produits par l'(les) auteur(s) |
---|