Monte Carlo methods to calculate impact probabilities

نویسندگان
چکیده

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

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

منابع مشابه

Monte Carlo transition probabilities

Transition probabilities governing the interaction of energy packets and matter are derived that allow Monte Carlo NLTE transfer codes to be constructed without simplifying the treatment of line formation. These probabilities are such that the Monte Carlo calculation asymptotically recovers the local emissivity of a gas in statistical and radiative equilibrium. Numerical experiments with one-po...

متن کامل

Efficient Monte Carlo methods for estimating failure probabilities

We develop efficient Monte Carlo methods for estimating the failure probability of a system. An example of the problem comes from an approach for probabilistic safety assessment of nuclear power plants known as riskinformed safety-margin characterization, but it also arises in other contexts, e.g., structural reliability, catastrophe modeling, and finance. We estimate the failure probability us...

متن کامل

Monte Carlo transition probabilities . II .

An abstract should be given The macroscopic quantizations of matter into macro-atoms and radiant and thermal energies into r-and k-energy packets initiated in Paper I is completed with the definition of transition probabilities governing energy flows to and from the thermal pool. The resulting Monte Carlo method is then applied to the problem of computing the hydrogen spectrum of a Type II supe...

متن کامل

Monte Carlo and quasi-Monte Carlo methods

Monte Carlo is one of the most versatile and widely used numerical methods. Its convergence rate, O(N~^), is independent of dimension, which shows Monte Carlo to be very robust but also slow. This article presents an introduction to Monte Carlo methods for integration problems, including convergence theory, sampling methods and variance reduction techniques. Accelerated convergence for Monte Ca...

متن کامل

Introduction to Monte-Carlo Methods

converges to E(f(U)) almost surely when N tends to infinity. This suggests a very simple algorithm to approximate I: call a random number generator N times and compute the average (??). Observe that the method converges for any integrable function on [0, 1] : f is not necessarily a smooth function. In order to efficiently use the above Monte-Carlo method, we need to know its rate of convergence...

متن کامل

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


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

ژورنال

عنوان ژورنال: Astronomy & Astrophysics

سال: 2014

ISSN: 0004-6361,1432-0746

DOI: 10.1051/0004-6361/201423966