Nacional'nyy issledovatel'skiy Tomskiy gosudarstvennyy universitet
This work presents a neural network preconditioner for the discrete dipole approximation that substantially accelerates electromagnetic scattering computations for arbitrarily shaped particles. Standard iterative solvers lose efficiency at high refractive indices and fine discretizations. The proposed architecture encodes particle geometry and optical parameters, then predicts spectral corrections to the inverse interaction matrix in the Fourier domain. Integration of the module into the ADDA code achieves up to 48 times speedup in iteration count and ensures convergence in previously divergent cases. Experiments confirm robust performance for refractive indices with real parts exceeding 2.0. The approach is effective within the training distribution but requires retraining for each new configuration and currently does not generalize to unseen particle shapes.
discrete dipole method, light scattering, neural network preconditioner, iterative methods, fast Fourier transform
1. Yurkin M.A., Hoekstra A.G. The DDA code ADDA: Capabilities and known limitations // JQSRT. 2011. V.112. P.2234–2247.
2. ADDA. https://github.com/adda-team/adda
3. Van der Vorst H.A. Bi-CGSTAB // SIAM J. Sci. Stat. Comput. 1992. V.13. P.631–644.
4. Hausner P. et al. Neural Incomplete Factorization // arXiv:2305.16368. 2023.



