An algorithm for Monte Carlo time-dependent radiation transfer

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the modified random walk algorithm for Monte-Carlo radiation transfer

Min et al. (2009) presented two complementary techniques that use the diffusion approximation to allow efficient Monte-Carlo radiation transfer in very optically thick regions: a modified random walk and a partial diffusion approximation. In this note, I show that the calculations required for the modified random walk method can be significantly simplified. In particular, the diffusion coeffici...

متن کامل

An Optimal Algorithm for Monte Carlo Estimation

A typical approach to estimate an unknown quantity is to design an experiment that produces a random variable Z distributed in 0; 1] with EZ] = , run this experiment independently a number of times and use the average of the outcomes as the estimate. In this paper, we consider the case when no a priori information about Z is known except that is distributed in 0; 1]. We describe an approximatio...

متن کامل

Radiative Equilibrium and Temperature Correction in Monte Carlo Radiation Transfer

We describe a general radiative equilibrium and temperature correction procedure for use in Monte Carlo radiation transfer codes with sources of temperature-independent opacity, such as astrophysical dust. The technique utilizes the fact that Monte Carlo simulations track individual photon packets, so we may easily determine where their energy is absorbed. When a packet is absorbed, it heats a ...

متن کامل

A New Monte Carlo Method for Time-dependent Neutrino Radiation Transport

Monte Carlo approaches to radiation transport have several attractive properties compared to deterministic methods. These include simplicity of implementation, high accuracy, and good parallel scaling. Moreover, Monte Carlo methods can handle complicated geometries and are relatively easy to extend to multiple spatial dimensions, which makes them particularly interesting in modeling complex mul...

متن کامل

Monte Carlo Algorithm for Least Dependent Non-Negative Mixture Decomposition

We propose a simulated annealing algorithm (stochastic non-negative independent component analysis, SNICA) for blind decomposition of linear mixtures of non-negative sources with non-negative coefficients. The demixing is based on a Metropolis-type Monte Carlo search for least dependent components, with the mutual information between recovered components as a cost function and their non-negativ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Monthly Notices of the Royal Astronomical Society

سال: 2011

ISSN: 0035-8711

DOI: 10.1111/j.1365-2966.2011.19147.x