اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptical depth in polarised Monte Carlo radiative transfer
81
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Context: The Monte Carlo method is the most widely used method to solve radiative transfer problems in astronomy, especially in a fully general 3D geometry. A crucial concept in any Monte Carlo radiative transfer code is the random generation of the next interaction location. In polarised Monte Carlo radiative transfer with aligned non-spherical grains, the nature of dichroism complicates the concept of optical depth. Aims: We investigate in detail the relation between optical depth and the optical properties and density of the attenuating medium in polarised Monte Carlo radiative transfer codes that take into account dichroic extinction. Methods: Based on solutions for the radiative transfer equation, we discuss the optical depth scale in polarised radiative transfer with spheroidal grains. We compare the dichroic optical depth to the extinction and total optical depth scale. Results: In a dichroic medium, the optical depth is not equal to the usual extinction optical depth, nor to the total optical depth. For representative values of the optical properties of dust grains, the dichroic optical depth can differ from the extinction or total optical depth by several ten percent. A closed expression for the dichroic optical depth cannot be given, but it can be derived efficiently through an algorithm that is based on the analytical result corresponding to elongated grains with a uniform grain alignment. Conclusions: Optical depth is more complex in dichroic media than in systems without dichroic attenuation, and this complexity needs to be considered when generating random free path lengths in Monte Carlo radiative transfer simulations. There is no benefit in using approximations instead of the dichroic optical depth.
قيم البحث
اقرأ أيضاً
The theory and numerical modelling of radiation processes and radiative transfer play a key role in astrophysics: they provide the link between the physical properties of an object and the radiation it emits. In the modern era of increasingly high-qu
ality observational data and sophisticated physical theories, development and exploitation of a variety of approaches to the modelling of radiative transfer is needed. In this article, we focus on one remarkably versatile approach: Monte Carlo Radiative Transfer (MCRT). We describe the principles behind this approach, and highlight the relative ease with which they can (and have) been implemented for application to a range of astrophysical problems. All MCRT methods have in common a need to consider the adverse consequences of Monte Carlo noise in simulation results. We overview a range of methods used to suppress this noise and comment on their relative merits for a variety of applications. We conclude with a brief review of specific applications for which MCRT methods are currently popular and comment on the prospects for future developments.
A crucial aspect of 3D Monte Carlo radiative transfer is the choice of the spatial grid used to partition the dusty medium. We critically investigate the use of octree grids in Monte Carlo dust radiative transfer, with two different octree constructi
on algorithms (regular and barycentric subdivision) and three different octree traversal algorithms (top-down, neighbour list, and the bookkeeping method). In general, regular octree grids need higher levels of subdivision compared to the barycentric grids for a fixed maximum cell mass threshold criterion. The total number of grid cells, however, depends on the geometry of the model. Surprisingly, regular octree grid simulations turn out to be 10 to 20% more efficient in run time than the barycentric grid simulations, even for those cases where the latter contain fewer grid cells than the former. Furthermore, we find that storing neighbour lists for each cell in an octree, ordered according to decreasing overlap area, is worth the additional memory and implementation overhead: using neighbour lists can cut down the grid traversal by 20% compared to the traditional top-down method. In conclusion, the combination of a regular node subdivision and the neighbour list method results in the most efficient octree structure for Monte Carlo radiative transfer simulations.
We combine a Monte Carlo radiative transfer code with an SPH code, so that -- assuming thermal equilibrium -- we can calculate dust-temperature fields, spectral energy distributions, and isophotal maps, for the individual time-frames generated by an
SPH simulation. On large scales, the radiative transfer cells (RT cells) are borrowed from the tree structure built by the SPH code, and are chosen so that their size -- and hence the resolution of the calculated temperature field -- is comparable with the resolution of the density field. We refer collectively to these cubic RT cells as the global grid. The code is tested and found to treat externally illuminated dust configurations very well. However, when there are embedded discrete sources, i.e. stars, these produce very steep local temperature gradients which can only be modelled properly if -- in the immediate vicinity of, and centred on, each embedded star -- we supplement the global grid with a star grid of closely spaced concentric RT cells.
The Monte Carlo method is a powerful tool for performing radiative equilibrium calculations, even in complex geometries. The main drawback of the standard Monte Carlo radiative equilibrium methods is that they require iteration, which makes them nume
rically very demanding. Bjorkman & Wood recently proposed a frequency distribution adjustment scheme, which allows radiative equilibrium Monte Carlo calculations to be performed without iteration, by choosing the frequency of each re-emitted photon such that it corrects for the incorrect spectrum of the previously re-emitted photons. Although the method appears to yield correct results, we argue that its theoretical basis is not completely transparent, and that it is not completely clear whether this technique is an exact rigorous method, or whether it is just a good and convenient approximation. We critically study the general problem of how an already sampled distribution can be adjusted to a new distribution by adding data points sampled from an adjustment distribution. We show that this adjustment is not always possible, and that it depends on the shape of the original and desired distributions, as well as on the relative number of data points that can be added. Applying this theorem to radiative equilibrium Monte Carlo calculations, we provide a firm theoretical basis for the frequency distribution adjustment method of Bjorkman & Wood, and we demonstrate that this method provides the correct frequency distribution through the additional requirement of radiative equilibrium. We discuss the advantages and limitations of this approach, and show that it can easily be combined with the presence of additional heating sources and the concept of photon weighting. However, the method may fail if small dust grains are included... (abridged)
We study the multi-dimensional radiative transfer phenomena using the ISMC scheme, in both gray and multi-frequency problems. Implicit Monte-Carlo (IMC) schemes have been in use for five decades. The basic algorithm yields teleportation errors, where
photons propagate faster than the correct heat front velocity. Recently [Poette and Valentin, J. Comp. Phys., 412, 109405 (2020)], a new implicit scheme based on the semi-analog scheme was presented and tested in several one-dimensional gray problems. In this scheme, the material energy of the cell is carried by material-particles, and the photons are produced only from existing material particles. As a result, the teleportation errors vanish, due to the infinite discrete spatial accuracy of the scheme. We examine the validity of the new scheme in two-dimensional problems, both in Cartesian and Cylindrical geometries. Additionally, we introduce an expansion of the new scheme for multi-frequency problems. We show that the ISMC scheme presents excellent results without teleportation errors in a large number of benchmarks, especially against the slow classic IMC convergence.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
