Elsevier Science Home
Computer Physics Communications Program Library
Full text online from Science Direct
Programs in Physics & Physical Chemistry
CPC Home

[Licence| Download | New Version Template] admh_v1_0.tar.gz(307 Kbytes)
Manuscript Title: Accelerated self-consistent radiative transfer based on the Monte- Carlo method.
Authors: S. Wolf, Th. Henning
Program title: MC3D
Catalogue identifier: ADMH_v1_0
Distribution format: tar.gz
Journal reference: Comput. Phys. Commun. 132(2000)166
Programming language: Fortran.
Computer: Alpha Workstation, Intel Pentium/Pentium II.
Operating system: Compaq TruUnix 4.0F, SuSE Linux V4.3 ... V6.3.
RAM: 50M words
Word size: 8
Keywords: Astrophysics, Radiative transfer, Interstellar matter, Circumstellar shells.
Classification: 1.3, 21.2.

Nature of problem:
For the interpretation of spectra, images, and polarization maps of young stellar objects (YSO) and active galactic nuclei (AGN), radiative transfer simulations provide the necessary basis. Nowadays, for the interpretation of very high-resolution maps, there exists a strong need for a code which solves the radiative transfer problem even in the case of very complex model configurations (e.g., clumpy dust density distributions, binary systems, direct usage of dust density distributions obtained from hydrodynamical simulations).

Solution method:
The radiative transfer problem is solved with the help of the Monte-Carlo method. The radiatve energy is partitioned in so-called test photons. Scattering, absorption and re-emission processes by spherical dust grains are considered. Images, polarization maps, and spectral energy distributions (SED) of the considered objects can be obtained.

Restrictions:
The program as presented can handle one dust component defined by a certain radius and chemical composition. However, this is not a principal restriction. It works best for dust density configurations with an optical depth of about tau=10**-3 ... 10**+3.

Unusual features:
None

Running time:
The typical running time of the program depends on the complexity of the problem and the geometry of the model. It amounts to several minutes ... several hours.