نتایج جستجو برای: monte carlo nparticle simulation

تعداد نتایج: 602147  

Journal: :Journal of physics 2021

We develop a classical Monte Carlo algorithm based on quasi-classical approximation for pseudospin S = 1 Hamiltonian in real space to construct phase diagram of model cuprate with high Tc. A description takes into account both local and nonlocal correlations, Heisenberg spin-exchange interaction, correlated single-particle, two-particle transport. formulate state selection given parameterizatio...

Alireza Karimian, Arman Rahmim Mehdi Nasri Nasrabadi, Nematollah Ahmadi

Introduction: The CT machine utilizes a bowtie filter to shape the X-ray beam and remove lower energy photons. Configuration of this bowtie filter is complex and its geometry is often not available in detail. It causes the CT dose index (CTDI) be with the different values in measurement versus Monte Carlo simulation studies and other analytical calculations. It is important esp...

2013
S. Romano

The subject of the present paper is computer simulation of a-solid and liquid nitrogen, using a Lennard-Jones atom-atom potential and the isothermal-isobaric Monte-Carlo method. Two sets of calculations were performed, both at the same pressure (1 atm) and temperatures (a-solid at 25 and 35.6 K, liquid at 63.15 and 77.35 K). In the first set the molecules are assumed to be rigid, whereas in the...

Journal: :J. Comput. Physics 2008
Tim P. Schulze

This paper concerns Kinetic Monte Carlo (KMC) algorithms that have a singleevent execution time independent of the system size. Two methods are presented— one that combines the use of inverted-list data structures with rejection Monte Carlo and a second that combines inverted lists with the Marsaglia-Norman-Cannon algorithm. The resulting algorithms apply to models with rates that are determine...

Journal: :Operations Research 2008
Michael B. Giles

We show that multigrid ideas can be used to reduce the computational complexity of estimating an expected value arising from a stochastic differential equation using Monte Carlo path simulations. In the simplest case of a Lipschitz payoff and an Euler discretisation, the computational cost to achieve an accuracy of O( ) is reduced from O( −3) to O( −2(log )2). The analysis is supported by numer...

Journal: :Mathematics and Computers in Simulation 2017

Journal: :Monthly Notices of the Royal Astronomical Society 2013

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید