Results 121 to 130 of about 185,877 (166)
Some of the next articles are maybe not open access.
Computing in Science & Engineering, 2006
Although the Metropolis algorithm dates back to at least 1953, the fact that it could be used for approximate counting has become clear only in recent years. An algorithm specifically designed for counting was created around the same time as the Metropolis algorithm by some of the same researchers. This other Monte Carlo method, now known as sequential
Isabel Beichl, Francis Sullivan
openaire +1 more source
Although the Metropolis algorithm dates back to at least 1953, the fact that it could be used for approximate counting has become clear only in recent years. An algorithm specifically designed for counting was created around the same time as the Metropolis algorithm by some of the same researchers. This other Monte Carlo method, now known as sequential
Isabel Beichl, Francis Sullivan
openaire +1 more source
Analysis of a Monte-Carlo Nystrom Method
SIAM Journal on Numerical Analysis, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Florian Feppon, Habib Ammari
openaire +2 more sources
Monte Carlo and quasi-Monte Carlo methods
Acta Numerica, 1998Monte Carlo is one of the most versatile and widely used numerical methods. Its convergence rate, O(N−1/2), 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 ...
openaire +1 more source
1987
The term ‘Monte Carlo methods’ is used to refer to two different, though closely related, techniques. The first meaning, currently the less common one among economists, is the evaluation of definite integrals by use of random variables. The idea is to evaluate \(\int_a^b {F\left( x \right)} {\text{d}}x\) where x may be a vector) by estimating \(\int_a ...
openaire +1 more source
The term ‘Monte Carlo methods’ is used to refer to two different, though closely related, techniques. The first meaning, currently the less common one among economists, is the evaluation of definite integrals by use of random variables. The idea is to evaluate \(\int_a^b {F\left( x \right)} {\text{d}}x\) where x may be a vector) by estimating \(\int_a ...
openaire +1 more source
The 13th international conference on laser interactions and related plasma phenomena, 1997
Monte Carlo methods appropriate to simulate the transport of x-rays, neutrons, ions and electrons in Inertial Confinement Fusion targets are described and analyzed. The Implicit Monte Carlo method of x-ray transport handles symmetry within indirect drive ICF hohlraums well, but can be improved 50X in efficiency by angular biasing the x-rays towards the
openaire +1 more source
Monte Carlo methods appropriate to simulate the transport of x-rays, neutrons, ions and electrons in Inertial Confinement Fusion targets are described and analyzed. The Implicit Monte Carlo method of x-ray transport handles symmetry within indirect drive ICF hohlraums well, but can be improved 50X in efficiency by angular biasing the x-rays towards the
openaire +1 more source
A monte carlo method for factorization
BIT, 1975The following simple method will find small prime factors \(p\) of a number \(n\) in \(O(p^{1/2})\) arithmetical operations as opposed to the \(O(p)\) operations required by trial division. Let \(x_0=2\), \(x_{i+1}\equiv x_i^2-1\pmod n\) (other similar sequences may be used). Generate in turn the pairs \((x_j,x_{2j})\), accumulating the product \(\pmod
openaire +2 more sources
2019
The sequential use of random numbers, to sample the values of probability variables, allows obtaining solutions to mathematical problems such as the Monte Carlo method, that allows to model stochastic parameters or deterministic based on random sampling.
Lorenzo Cevallos-Torres +1 more
openaire +1 more source
The sequential use of random numbers, to sample the values of probability variables, allows obtaining solutions to mathematical problems such as the Monte Carlo method, that allows to model stochastic parameters or deterministic based on random sampling.
Lorenzo Cevallos-Torres +1 more
openaire +1 more source
Optimization by Monte Carlo Methods
2009It may be that the problem of optimization entails more time and effort by mankind than any other mathematical problem. For example, it permeates nearly all design and engineering projects.
Ronald W. Shonkwiler, Franklin Mendivil
openaire +1 more source
Reliability Engineering & System Safety, 2010
To reduce cost of Monte Carlo (MC) simulations for time-consuming processes, Bayesian Monte Carlo (BMC) is introduced in this paper. The BMC method reduces number of realizations in MC according to the desired accuracy level. BMC also provides a possibility of considering more priors. In other words, different priors can be integrated into one model by
openaire +1 more source
To reduce cost of Monte Carlo (MC) simulations for time-consuming processes, Bayesian Monte Carlo (BMC) is introduced in this paper. The BMC method reduces number of realizations in MC according to the desired accuracy level. BMC also provides a possibility of considering more priors. In other words, different priors can be integrated into one model by
openaire +1 more source
Monte Carlo and Quasi-Monte Carlo Methods 2004
2006Invariance Principles with Logarithmic Averaging for Ergodic Simulations.- Technical Analysis Techniques versus Mathematical Models: Boundaries of Their Validity Domains.- Weak Approximation of Stopped Dffusions.- Approximation of Stochastic Programming Problems.- The Asymptotic Distribution of Quadratic Discrepancies.- Weighted Star Discrepancy of ...
openaire +1 more source