Synergistic use of ADDA and IFDDA to enhance iterative solvers in the discrete dipole approximation
Résumé
We present a new workflow that seamlessly combines IFDDA and ADDA to capitalize on the strengths of each code. Specifically, we use IFDDA to generate advanced initial fields (e.g., the uGu scalar approximation) and give them to ADDA's solvers. Our initial tests on large, optically soft spheres show that using IFDDA's uGu initialization in ADDA can accelerate iterative solver and thus reduce overall computation time.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |