The construction of a matrix for the discrete dipole approximation (DDA) on surface and its relationship to an iterative solver is analyzed. It is shown that the spectral characteristics of the DDA for free space and surface correlates to different convergence characteristics. Compared with the free
Extending the applicability of the discrete dipole approximation for multi-scale features on surface
β Scribed by Euiwon Bae; E. Daniel Hirleman
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 675 KB
- Volume
- 107
- Category
- Article
- ISSN
- 0022-4073
No coin nor oath required. For personal study only.
β¦ Synopsis
Many problems in science and engineering involve significant physical entities and processes that span a substantial range of dimensions. In the case of characterization of bacteria on growth media using light scattering the length scales of interest can be classified as micro-scale (single bacterium), macro-scale (bacterial colonies of more than 10 12 bacterium that have passed through the exponential growth phase and reached mm size), and the intermediate or meso-scale of several tens of hundreds of bacteria. Light scattering approaches, to be effective in determining physical properties such as morphology and material composition, must comprehend this spectrum of length scales. The discrete dipole approximation (DDA), a powerful modeling tool for rigorous 3-D vector scattering, has shown its capability to predict the light scattering from micro-scale objects. To be able to accommodate meso-scale objects, we need to extend the computational limits of the DDA method such that it could compute object sizes of 10l-30l characteristic dimension (i.e. volumes of 10 3 -10 4 cubic wavelengths). To accomplish this, an analysis of the DDA method was performed for meso-scale cases of interest especially in biological applications. Based on this study, we propose new Sommerfeld integration paths and a revised iterative algorithm that combine to provide substantial improvements in the size of the computational domain that can be modeled for a given convergence criterion.
π SIMILAR VOLUMES
## Abstract Several Krylov subspace iterative algorithms are compared as the solvers for the discrete dipole approximation method to analyze the electromagnetic scattering problem. Fast Fourier transform technique is exploited to accelerate the computation of matrixβvector product. Numerical exampl