Content deleted Content added
make this list because the discrete dipole approximation article is getting too long Tag: Removed redirect |
→top: context for a casual reader |
||
Line 1:
'''Discrete dipole approximation codes'''. This is a list of Discrete Dipole Approximation (DDA) codes. The "code" here indicates computer code, a particular implementation of the DDA (many of them are [[open-source]]). For theoretical approach see [[Discrete dipole approximation]] article.
Most of the codes apply to arbitrary-shaped inhomogeneous nonmagnetic particles and particle systems in free space or homogeneous dielectric host medium. The calculated quantities typically include the [[Mueller_calculus#Mueller_matrices|Mueller matrices]], [[Cross_section_(physics)#Scattering_of_light|integral cross-sections]] (extinction, absorption, and scattering), internal fields and angle-resolved scattered fields (phase function). There are some published comparisons of existing DDA codes.<ref name=penttila2007/>
===General-purpose open-source DDA codes===
These codes typically use regular grids (cubical or rectangular cuboid), [[conjugate gradient method]] to solve large [[System of linear equations|systems of linear equations]], and FFT-acceleration of the matrix-vector products which uses convolution theorem. Complexity of this approach is almost linear in number of dipoles for both time and memory.<ref name=Yurkin2007a/>
| |||