Fast solvers for one dimensional light scattering in the discrete dipole approximation
نویسندگان
چکیده
منابع مشابه
Discrete-dipole approximation for scattering calculations
The discrete-dipole approximation (DDA) for scattering calculations, including the relationship between the DDA and other methods, is reviewed. Computational considerations, i.e., the use of complex-conjugate gradient algorithms and fast-Fourier-transform methods, are discussed. We test the accuracy of the DDA by using the DDA to compute scattering and absorption by isolated, homogeneous sphere...
متن کاملLight scattering by cubical particle in the WKB approximation
In this work, we determined the analytical expressions of the form factor of a cubical particle in the WKB approximation. We adapted some variables (size parameter, refractive index, the scattering angle) and found the form factor in the approximation of Rayleigh-Gans-Debye (RGD), Anomalous Diffraction (AD), and determined the efficiency factor of the extinction. Finally, to illustrate our form...
متن کاملComparison between the pseudo-spectral time domain method and the discrete dipole approximation for light scattering simulations
The pseudo-spectral time domain (PSTD) and the discrete dipole approximation (DDA) are two popular and robust methods for the numerical simulation of dielectric particle light scattering. The present study compares the numerical performances of the two methods in the computation of the single-scattering properties of homogeneous dielectric spheres and spheroids for which the exact solutions can...
متن کاملRadiation forces in the discrete-dipole approximation.
The theory of the discrete-dipole approximation (DDA) for light scattering is extended to allow for the calculation of radiation forces on each dipole in the DDA model. Starting with the theory of Draine and Weingartner [Astrophys. J. 470, 551 (1996)] we derive an expression for the radiation force on each dipole. These expressions are reformulated into discrete convolutions, allowing for an ef...
متن کاملFast Iterative Solvers for Discrete Stokes Equations
Abstract. We consider saddle point problems that result from the finite element discretization of stationary and instationary Stokes equations. Three efficient iterative solvers for these problems are treated, namely the preconditioned CG method introduced by Bramble and Pasciak, the preconditioned MINRES method and a method due to Bank et al. We give a detailed overview of algorithmic aspects ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2004
ISSN: 1094-4087
DOI: 10.1364/opex.12.003149