Документ взят из кэша поисковой машины. Адрес оригинального документа : http://www.astro.spbu.ru/DOP/A-PERC/PAPER2/node2.html
Дата изменения: Fri Nov 19 12:11:47 2010
Дата индексирования: Mon Oct 1 23:30:08 2012
Кодировка:

Поисковые слова: ngc 6992
Model of clusters next up previous
Next: Neutral network approach Up: paper2 Previous: Introduction

Model of clusters

The most powerful and widely used methods to calculate the scattering matrix of a fractal cluster are based on the coupled dipoles methods (e.g. the Discrete Dipole Approximation, DDA) and the theory of light scattering by a cluster of spherical particles [2-4]. The latter approach was used by us to obtain the massive of data for neural network training. We construct a model primarily directed at interpretation of the observations of interplanetary dust.

At present the procedure of calculation of the scattering matrix is well developed for both an oriented cluster of spherical particles and for chaotically oriented clusters of such particles [4]. However, the observed dependencies of polarization of light scattered by cometary and interplanetary dust and, in particular, the orientation of the plane of polarization with respect to the scattering plane, allows one to conclude that these dust particles are to be rather chaotically oriented.

Usually to reduce the number of the input parameters one chose the cluster constituent spheres to be identical. For the model of a chaotically oriented cluster of such subparticles, the direct scattering problem has the following input parameters: the size parameter of the constituent spheres $x=2\pi a\lambda$ (where $a$ is the radius of spheres, $\lambda$ the wavelength of incident radiation), the real and imaginary parts of the complex refractive index $m$, the number of particles in the cluster ($N$) and parameters describing the cluster structure, which can be characterized by two parameters [5]: the fractal dimension $D$ and a prefactor constant $\rho$.
next up previous
Next: Neutral network approach Up: paper2 Previous: Introduction
root 2003-04-11