Accelerating refractive-index sweeps in the discrete dipole approximation using shifted Krylov subspace method
C. Argentin, K. Inzhevatkin, M. Yurkin
· 0 citations
Sponsored
AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
3 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
Computing the T-matrix of arbitrarily shaped scatterers: addatmatrix wrapper for the ADDA code
The discrete dipole approximation is a general method to simulate light scattering by particles with arbitrary shape and composition and any simulation method, including the DDA, can be used to compute the T-matrix, the response of a particle to any incident wave and allows analytical orientation averaging.
M. Yurkin, Krzysztof M. Czajkowski, L. Pattelli
· 0 citations
Computer Programs in Physics Floating-point–consistent cross-verification methodology for reproducible and interoperable DDA solvers with fair benchmarking
C. Argentin, P. Chaumet, M. Gross et al.
· 0 citations