Fully parallel code for Monte Carlo simulation

We present a fully parallel version of Monte Carlo simulation of the Ising model using the Metropolis algorithm. In the 3-dimensional version the performance can be enhanced by a factor >20 in 16-bit word processors relative to other multispin codes. This factor could be further increased if implemented in 64-bit word computers.     

A new proposal for Monte Carlo simulation of fermions on a lattice

With F flavours of matter fields extrapolation to negative F effectively changes bosons into fermions and vice-versa. Extrapolatingresults of calculations performed with bosonic quarks we reproduce results obtained by evaluating the fermion determinant in some simple examples. We find an example of a long computer run apparently converging to the wrong answer when systematic lattice site access is used.     

A Monte Carlo simulation of coagulation

A Monte Carlo simulation technique is described for the study of the coagulation of suspended particles. The method is computationally efficient since the particle trajectories are not used to determine coagulations. Instead, pairs of particles are assigned probabilities to coagulate and the evolution is computed as a stochastic Markov game. We also describe a simple analytic method to obtain the stationary distribution of sizes for the various mechanisms of relative particle motion. It is demonstrated that the simulation yields the correct stationary size distribution independent of initial condition.     

A new multispin coding algorithm for Monte Carlo simulation of the Ising model

We present a new algorithm for Monte Carlo simulation of the Ising model. The usual serial architecture of a computer is exploited in a novel way, enabling parallel but independent calculations to be carried out on as many spins as there are bits in a computer word in each fundamental move. The algorithm enjoys a substantial increase in execution speed over more usual multispin coding algorithms. By its very nature, the algorithm constitutes a design for a special-purpose processor.     

Z箍缩中子编码诊断系统模拟平台搭建

开发了基于Geant4的Z箍缩中子编码成像系统模拟平台,实现聚变中子编码成像诊断系统各关键部件的完整模拟。获得了低中子产额（约1010量级）下,中子经编码孔编码后在闪烁体阵列中形成的发光分布图像。利用维纳滤波、Richardson-Lucy（RL）及遗传算法（GA）对低中子产额下获得的极低信噪比图像进行重建,并对信噪比、中子产额及重建效果进行了对比研究,结果表明：遗传算法对低信噪比中子编码图像的重建具有很强的鲁棒性;中子编码图像的信噪比与遗传算法重建结果的准确性呈正比。     

Z箍缩中子编码诊断系统模拟平台搭建

开发了基于Geant4的Z箍缩中子编码成像系统模拟平台,实现聚变中子编码成像诊断系统各关键部件的完整模拟。获得了低中子产额（约1010量级）下,中子经编码孔编码后在闪烁体阵列中形成的发光分布图像。利用维纳滤波、Richardson-Lucy（RL）及遗传算法（GA）对低中子产额下获得的极低信噪比图像进行重建,并对信噪比、中子产额及重建效果进行了对比研究,结果表明:遗传算法对低信噪比中子编码图像的重建具有很强的鲁棒性;中子编码图像的信噪比与遗传算法重建结果的准确性呈正比。     

FLUKA Monte Carlo simulation code as used for radiation studies in the Alice experiment

The main features of the FLUKA Monte Carlo code, which can deal with transport and interaction of electromagnetic and hadronic particles, are summarized. The physical models embedded in FLUKA are described. Application of the code for the radiation background calculations. Especially, the origin and composition of the intense radiation field to be expected in parts of the ALICE detector for the coming multi-TeV LHC collider is described. It is important to evaluate the risk of radiation damage in detectors and electronics equipment. The text was submitted by the author in English.     

A Monte Carlo simulation of random surfaces

We use a previously proposed stochastic process and carry out Monte Carlo simulations for two models of random surfaces defined on hypercubic lattices. Tests are carried out in five dimensions. The critical coupling constants are estimated for both models. One of the models allows also results on its entropy.     

Monte Carlo simulation of two-dimensional Ising model with logarithmic exchange interaction

Monte Carlo simulation was done to a 2-D Ising model with exchange interaction depending logarithmically on distance. This model is equivalent to a 2-D Coulomb gas.A configuration corresponding to bound pairs of opposite charges appears below T_c, while above T_c pairs are dissolved into free charges.     

ISSDE: A Monte Carlo implicit simulation code based on Stratonovich SDE approach of Coulomb collision

A Monte Carlo implicit simulation program, Implicit Stratonovich Stochastic Differential Equations(ISSDE), is developed for solving stochastic differential equations(SDEs) that describe plasmas with Coulomb collision. The basic idea of the program is the stochastic equivalence between the Fokker–Planck equation and the Stratonovich SDEs. The splitting method is used to increase the numerical stability of the algorithm for dynamics of charged particles with Coulomb collision. The cases of Lorentzian plasma, Maxwellian plasma and arbitrary distribution function of background plasma have been considered. The adoption of the implicit midpoint method guarantees exactly the energy conservation for the diffusion term and thus improves the numerical stability compared with conventional Runge–Kutta methods. ISSDE is built with C++ and has standard interfaces and extensible modules. The slowing down processes of electron beams in unmagnetized plasma and relaxation process in magnetized plasma are studied using the ISSDE, which shows its correctness and reliability.     

Monte Carlo simulation of mictomagnets

Monte Carlo simulations of a binary alloy with impurity concentrations between 20 and 45 at.% have been carried out. The proportion of large clusters relative to that of small clusters increases with the number of MC diffusion steps as well as impurity concentration. Magnetic susceptibility peaks become more prominent and occur at higher temperatures with increasing impurity concentration. The different peaks in the susceptibility and specific heat curves seem to correspond to different sized clusters. A freezing model would explain the observed behaviour with the large clusters freezing first and the small clusters contributing to susceptibility (specific heat) peaks at lower temperatures.Contribution No. 153 from the Solid State and Structural Chemistry Unit     

A multi-phase Monte Carlo technique for simulation of radiative transfer

Evidence is presented which shows that the transfer of radiation in a set of homogeneous scattering atmospheres, characterized by different phase functions but the same value of ω_o, can be simultaneously simulated with Monte Carlo techniques in a single computer run. Furthermore, it is shown that the computation time increases very slowly with the number of phase functions processed.     

A new Monte Carlo simulation for two models of self-avoiding lattice trees in two dimensions

By means of a new Monte Carlo sampling of a grand canonical ensemble, we verify universality for the critical exponents and of two models of lattice trees constrained to be self-avoiding on sites or on bonds. The attrition constants are also obtained. This algorithm, a generalization of that recently proposed by Berretti and Sokal for random walks, appears to optimize the critical slowing down in the scaling region. Systematic and statistical errors are carefully estimated.     

Monte Carlo simulation for ultra-small MOS devices

This paper discusses advanced needs of Monte Carlo simulation approaches for MOS silicon devices scaled below 0.1 μ m channel length. For predictive simulation over a wide range of biases, it is necessary to provide the Monte Carlo procedure with tuning capabilities to adjust the mobility through calibration of the interface roughness scattering. This is accomplished by introducing a semi-empirical procedure with a physical elastic scattering rate and an inelastic rate with tunable strength. To resolve the role of hot carriers in relation to oxide interface damage, it is also important to realize fully bipolar MOS simulation, so that one can analyze the transport of impact-ionization generated carriers and secondary ionization. As the devices become quite small, three-dimensional simulation can be not only feasible, but also necessary to resolve the granularity of doping profiles and the complete carrier–carrier and carrier–ion interactions. Issues of device Monte Carlo implementation on parallel environments are discussed, and a practical approach for resolving the short-range forces of the charge–charge interaction in three dimensionals is described. Several examples and preliminary results are presented to illustrate the various issues.     

Monte Carlo simulation for radiative kaon decays

For high precision measurements of K decays, the presence of radiated photons cannot be neglected. The Monte Carlo simulations must include the radiative corrections in order to compute the correct event counting and for efficiency calculations. In this paper, a method for simulating such decays is briefly described. Arrival of the final proofs: 24 November 2005     

蒙特卡罗粒子输运程序JMCT研制

介绍了具有自主知识产权的蒙特卡罗(MC)粒子输运程序JMCT的初步研制成果。JMCT基于三维组合几何支撑软件框架JCOGIN,采用模块化,分成多层管理结构,可处理多群碰撞和连续能量碰撞,可进行粒子并行和区域分解并行两种并行方法,并具有良好的可扩展性和高速通信技术,同时配有可视化建模前处理软件。介绍了JMCT采用的多群物质碰撞机制,展示了程序模拟计算测试模型的结果,与MCNP程序计算结果一致。JMCT串行计算速度相比MCNP提高了约3 倍;在20 480个处理器核上模拟2109样本,并行效率可达70%。     

闪光X射线照相蒙特卡罗程序的并行化

研究了闪光X射线辐射照像蒙特卡罗程序(FXRMC)在MPI平台下的并行计算实现,给出了实现过程中并行随机数的产生方法。对并行程序的测试结果表明：并行程序与串行程序结果一致,加速比比较理想,呈线性增长,并行效率在16个处理器上可达80%以上。算例的结果说明了并行化可有效地解决程序计算散射技术性能时的耗时问题,从而有效化解FXRMC耗时和大规模计算的困难,提高了FXRMC程序的计算规模和计算速度,达到了研究要求。 (Institute of Fluid Physics, CAEP, P. O. Box 919-105, Mianyang 621900, China)     

蒙特卡罗粒子输运程序JMCT研制

介绍了具有自主知识产权的蒙特卡罗(MC)粒子输运程序JMCT的初步研制成果。JMCT基于三维组合几何支撑软件框架JCOGIN,采用模块化,分成多层管理结构,可处理多群碰撞和连续能量碰撞,可进行粒子并行和区域分解并行两种并行方法,并具有良好的可扩展性和高速通信技术,同时配有可视化建模前处理软件。介绍了JMCT采用的多群物质碰撞机制,展示了程序模拟计算测试模型的结果,与MCNP程序计算结果一致。JMCT串行计算速度相比MCNP提高了约3 倍;在20 480个处理器核上模拟2109样本,并行效率可达70%。     

Efficient kinetic Monte Carlo simulation

This paper concerns kinetic Monte Carlo (KMC) algorithms that have a single-event 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 determined by the local environment but are otherwise arbitrary, time-dependent and spatially heterogeneous. While especially useful for crystal growth simulation, the algorithms are presented from the point of view that KMC is the numerical task of simulating a single realization of a Markov process, allowing application to a broad range of areas where heterogeneous random walks are the dominate simulation cost.