Optics Express· 2012Q1
Fast near field calculations in the discrete dipole approximation for regular rectilinear grids
- 252citations
- Q1SCImago
- 2012year
Short summary
A new algorithm using a 3D Fast Fourier Transform (FFT) reduces near-field calculation time by a factor of 10 for light scattering problems in the discrete dipole approximation.
AI-generated from the title and abstract; the full text is not read.
Key points
- A novel algorithm is presented for near-field calculations in the discrete dipole approximation.
- The algorithm utilizes a 3D Fast Fourier Transform (FFT) for efficient matrix-vector multiplication.
- It reduces computation time by a factor of 10 for moderate and large light scattering problems.
- The method calculates light electric field intensity inside and in the vicinity of scattering particles.
AI-generated from the title and abstract; the full text is not read.
Abstract
A near-field calculation of light electric field intensity inside and in the vicinity of a scattering particle is discussed in the discrete dipole approximation. A fast algorithm is presented for gridded data. This algorithm is based on one matrix times vector multiplication performed with the three dimensional fast Fourier transform. It is shown that for moderate and large light scattering near field calculations the computer time required is reduced in comparison to some of the other methods.
The authors' abstract, as published at the source. Optics Express, 2012 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Acoustics and Ultrasonics
Acoustics and UltrasonicsPhysics and Astronomy