Discrete dipole approximation codes: Difference between revisions

Revision as of 08:32, 4 March 2019

Revision as of 08:34, 4 March 2019

Line 102:

| C

| 2018 (v.{{nbsp}}1.4.0-alpha)

| Implements fast and rigorous consideration of a plane substrate, and allows rectangular-cuboid voxels for highly oblate or prolate particles. Can also calculate [[Purcell_effect|emission (decay-rate) enhancement]] of point emitters.[[Electromagnetic_radiation#Near_and_far_fields|Near-fields]] calculation is not very efficient. Uses [[Message_Passing_Interface|MPIMessage Passing Interface]] (MPI) parallelization and can run on GPU ([[OpenCL]]).

|-

| [http://www.opendda.org/ OpenDDA]

Line 132:

| C

| 2009 (v.{{nbsp}}0.4.1)

| Uses both [[OpenMP]] and [[Message_Passing_Interface|MPI]] parallelization. Focuses on computational efficiency.

|-

| [https://github.com/steffen-kiess/dda DDA-GPU]

Line 148:

| C++

| 2016

| Runs on GPU ([[OpenCL]]). Algorithms are partly based on ADDA.

|-

| [http://www.zjuisee.zju.edu.cn/weisha/SourceForge/sourceforge.html VIE-FFT]

Line 252:

| Matlab

| 2011 (v.{{nbsp}}0.1)

| Rigorous handling of substrate, but no [[FFT]] acceleration is used.

|

|-

Line 285:

| Fortran

| 2013 (v.{{nbsp}}2.1)

| Simulates electron-energy loss spectroscopy and cathodoluminescence. Handles substrate through image approximation, but no [[FFT]] acceleration is used.

|-

| T-DDA

Line 303:

| Fortran

| 2015

| Simulates near-field radiative heat transfer. The computational bottleneck is direct matrix inversion (no [[FFT]] acceleration is used). Uses [[OpenMP]] and [[Message Passing Interface]] (MPI) parallelization.

|}