Monte Carlo Perturbation Analysis of Dimension and Density Variations of the Monte Carlo N-Particle Annular Core Research Reactor Model fuel.
Abstract not provided.
Currie, Karissa↗
SEARCH · Engineering Papers
Results for “Monte Carlo”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
A High-Efficiency Delayed Update Algorithm for Evaluating Slater Determinants in Quantum Monte Carlo
For quantum Monte Carlo simulations of molecular systems or supercells with thousands of electrons, matrix operations related to Slater determinants lead the computational cost. McDaniel et al. [J. Chem. Phys. 2017, 147, 174107] proposed a delayed update algorithm to increase computational efficiency by using matrix–matrix multiplication when updating the inverse matrices of Slater determinants. However, preparing intermediate matrices for applying the Sherman–Morrison–Woodbury formula remained a bottleneck. Here, in this work, we introduce an improved algorithm for CPUs and GPUs that (1) reduces this bottleneck by iteratively updating the intermediate matrices and (2) is efficient at any acceptance ratio, with no cost for rejected moves on CPUs and minimal cost on GPUs. We show the full scheme of integrating the delayed update algorithm into a single-electron move. The high efficiency of our algorithm is demonstrated on CPUs and GPUs for a 512 atom/6144 valence electron calculation, with 12× and 2× overall speed-up compared to traditional rank-1 update schemes in diffusion quantum Monte Carlo, respectively.
Luo, Ye [Argonne National Laboratory (ANL), Argonn↗
Lefschetz thimble quantum Monte Carlo for spin systems
Monte Carlo simulations are useful tools for modeling quantum systems, but in some cases they suffer from a sign problem, leading to an exponential slow down in their convergence to a value. While solving the sign problem is generically NP hard, many techniques exist for mitigating the sign problem in specific cases; in particular, the technique of deforming the Monte Carlo simulation's plane of integration onto Lefschetz thimbles (complex hypersurfaces of stationary phase) has seen significant success in the context of quantum field theories. We extend this methodology to spin systems by utilizing spin coherent state path integrals to reexpress the spin system's partition function in terms of continuous variables. Using some toy systems, we demonstrate its effectiveness at lessening the sign problem in this setting, despite the fact that the initial mapping to spin coherent states introduces its own sign problem. The standard formulation of the spin coherent path integral is known to make use of uncontrolled approximations; despite this, for large spins they are typically considered to yield accurate results, so it is somewhat surprising that our results show significant systematic errors. Furthermore, possibly of independent interest, our use of Lefschetz thimbles to overcome the intrinsic sign problem in spin coherent state path integral Monte Carlo enables a novel numerical demonstration of a breakdown in the spin coherent path integral.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
A variance deconvolution estimator for efficient uncertainty quantification in Monte Carlo radiation transport applications
Monte Carlo simulations are at the heart of many high-fidelity simulations and analyses for radiation transport systems. As is the case with any complex computational model, it is important to propagate sources of input uncertainty and characterize how they affect model output. Unfortunately, uncertainty quantification (UQ) is made difficult by the stochastic variability that Monte Carlo transport solvers introduce. The standard method to avoid corrupting the UQ statistics with the transport solver noise is to increase the number of particle histories, resulting in very high computational costs. In this contribution, we propose and analyze a sampling estimator based on the law of total variance to compute UQ variance even in the presence of residual noise from Monte Carlo transport calculations. Here, we rigorously derive the statistical properties of the new variance estimator, compare its performance to that of the standard method, and demonstrate its use on neutral particle transport model problems involving both attenuation and scattering physics. We illustrate, both analytically and numerically, the estimator’s statistical performance as a function of available computational budget and the distribution of that budget between UQ samples and particle histories. We show analytically and corroborate numerically that the new estimator is unbiased, unlike the standard approach, and is more accurate and precise than the standard estimator for the same computational budget.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Singular value decomposition of adjoint flux distributions for Monte Carlo variance reduction
Monte Carlo (MC) shielding calculations often use weight windows (WWs) and biased sources formed from a deterministic estimate of the adjoint flux to improve the convergence rate of tallies. This requires a significant amount of computer memory, which can limit the memory available for high-resolution tally output. A new method is proposed for reducing these memory requirements by using singular value decomposition (SVD) in linear or logarithmic space to approximate the adjoint flux. This method’s performance is evaluated using the Shift and Denovo codes for streaming and diffusion base case problems, followed by problems using the Westinghouse AP1000 and the Joint European Torus. The log SVD reduced WW memory requirements by an order of magnitude in all cases without a significant performance penalty. Additionally, the linear SVD reduced biased source memory requirements by an order of magnitude, but further investigation is needed to account for observed limitations.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Threadsafe Dynamic Neighbor Lists for Monte Carlo Ray Tracing
Monte Carlo (MC) transport codes offer high-fidelity modeling of particle transport physics, but their high computational cost makes them impractical for many applications. For some applications such as multiphysics and depletion that use finely discretized geometries, a large portion of this computational cost is attributable to ray tracing. Neighbor lists are a well-known method for accelerating ray-tracing calculations in a MC code, but despite their prevalence, little work has been published on the details of their implementation. The fine details can have a significant impact on performance, particularly when using shared-memory parallelism. This paper addresses these details of implementation with a discussion of different neighbor list schemes and their impact on software runtime. Performance tests were run by using OpenMC on a pin-cell problem discretized with up to 200 axial regions. The results demonstrate that switching from surface-based to cell-based neighbor lists leads to a 10 faster calculation rate for the most fine discretization. Finally, using a threadsafe shared-memory data structure results in a 20% faster calculation rate versus simple threadprivate neighbor lists. Results here show that a data structure that is contiguous in memory improves performance by only 1% to 2% over noncontiguous linked lists.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Accelerating astronomical and cosmological inference with preconditioned Monte Carlo
ABSTRACT We introduce preconditioned Monte Carlo (PMC), a novel Monte Carlo method for Bayesian inference that facilitates efficient sampling of probability distributions with non-trivial geometry. PMC utilizes a Normalizing Flow (NF) in order to decorrelate the parameters of the distribution and then proceeds by sampling from the preconditioned target distribution using an adaptive Sequential Monte Carlo (SMC) scheme. The results produced by PMC include samples from the posterior distribution and an estimate of the model evidence that can be used for parameter inference and model comparison, respectively. The aforementioned framework has been thoroughly tested in a variety of challenging target distributions achieving state-of-the-art sampling performance. In the cases of primordial feature analysis and gravitational wave inference, PMC is approximately 50 and 25 times faster, respectively, than nested sampling (NS). We found that in higher dimensional applications, the acceleration is even greater. Finally, PMC is directly parallelisable, manifesting linear scaling up to thousands of CPUs.
79 ASTRONOMY AND ASTROPHYSICS↗
A Potts Model parameter study of particle size, Monte Carlo temperature, and “Particle-Assisted Abnormal Grain Growth”
A Potts Model was proposed to account for temperature and particle heterogeneity-dependent Zener Pinning. This was accomplished by relating the random fluctuations of grain boundary position allowed by the Potts Model switching probability at finite simulation temperature to experimentally observed grain growth stagnation behavior. We assume that these fluctuations arise from random fluctuations in the thermodynamic and kinetic properties of the grain boundaries and/or interfaces as they change with temperature. As an application of this model, the grain growth kinetics of U-10 wt. % Mo nuclear fuels were simulated with the input of microstructural images during different heat treatment processes. Simulated average grain growth behavior is in good agreement with experiments.
Frazier, William E.↗
Identification of non-Fermi liquid fermionic self-energy from quantum Monte Carlo data
Quantum Monte Carlo (QMC) simulations of correlated electron systems provide unbiased information about system behavior at a quantum critical point (QCP) and can verify or disprove the existing theories of non-Fermi liquid (NFL) behavior at a QCP. However, simulations are carried out at a finite temperature, where quantum critical features are masked by finite-temperature effects. Here, we present a theoretical framework within which it is possible to separate thermal and quantum effects and extract the information about NFL physics at T = 0. We demonstrate our method for a specific example of 2D fermions near an Ising ferromagnetic QCP. We show that one can extract from QMC data the zero-temperature form of fermionic self-energy Σ(ω) even though the leading contribution to the self-energy comes from thermal effects. We find that the frequency dependence of Σ(ω) agrees well with the analytic form obtained within the Eliashberg theory of dynamical quantum criticality, and obeys ω 2/3 scaling at low frequencies. Our results open up an avenue for QMC studies of quantum critical metals.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Adaptive tau-leaping methods for microscopic-lattice kinetic Monte Carlo simulations
Traditional Kinetic Monte Carlo (KMC) approaches, rooted in Gillespie’s stochastic simulation algorithm, become computationally demanding in systems with a large range of timescales. The goal of this work is to propose and study new adaptive lattice-KMC time integration strategies for spatially non-uniform systems. To that end, two novel adaptive tau-leaping methods and their corresponding time integration strategies are developed based on the idea of the “n-fold” direct KMC method. These strategies allow for the simultaneous execution of multiple reactions, advancing time by adaptively selected coarse increments. We present numerical experiments comparing the proposed methods with existing approaches in a catalytic surface kinetics application involving ammonia decomposition.
Bimolecular reactions↗
Advanced Multilevel Monte Carlo Methods
This article reviews the application of some advanced Monte Carlo techniques in the context of multilevel Monte Carlo (MLMC). MLMC is a strategy employed to compute expectations, which can be biassed in some sense, for instance, by using the discretization of an associated probability law. The MLMC approach works with a hierarchy of biassed approximations, which become progressively more accurate and more expensive. Additionally, using a telescoping representation of the most accurate approximation, the method is able to reduce the computational cost for a given level of error versus i.i.d. sampling from this latter approximation. All of these ideas originated for cases where exact sampling from couples in the hierarchy is possible. This article considers the case where such exact sampling is not currently possible. We consider some Markov chain Monte Carlo and sequential Monte Carlo methods, which have been introduced in the literature, and we describe different strategies that facilitate the application of MLMC within these methods.
97 MATHEMATICS AND COMPUTING↗
gRASPA
GPU Monte Carlo Simulation Code with a taste of RASPA We present enhancements in Monte Carlo simulation speed and functionality within an open-source code, gRASPA, which uses graphical processing units (GPUs) to achieve significant performance improvements compared to serial, CPU implementations of Monte Carlo. The code supports a wide range of Monte Carlo simulations, including canonical ensemble (NVT), grand canonical, NVT Gibbs, Widom test particle insertions, and continuous-fractional component Monte Carlo. Implementation of grand canonical transition matrix Monte Carlo (GC-TMMC) and a novel feature to allow different moves for the different components of metal-organic framework (MOF) structures exemplify the capabilities of gRASPA for precise free energy calculations and enhanced adsorption studies, respectively. The introduction of a High-Throughput Computing (HTC) mode permits many Monte Carlo simulations on a single GPU device for accelerated materials discovery. The code can incorporate machine learning (ML) potentials. The open-source nature of gRASPA promotes reproducibility and openness in science, and users may add features to the code and optimize it for their own purposes. The code is written in CUDA/C++ and SYCL/C++ to support different GPU vendors. The gRASPA code is publicly available at https://github.com/snurr-group/gRASPA.
Li, Zhao [Purdue/Northwestern/Notre Dame Universit↗
Microcanonical Hamiltonian Monte Carlo
We develop Microcanonical Hamiltonian Monte Carlo (MCHMC), a class of models that follow fixed energy Hamiltonian dynamics, in contrast to Hamiltonian Monte Carlo (HMC), which follows canonical distribution with different energy levels. MCHMC tunes the Hamiltonian function such that the marginal of the uniform distribution on the constant-energy-surface over the momentum variables gives the desired target distribution. We show that MCHMC requires occasional energy-conserving billiard-like momentum bounces for ergodicity, analogous to momentum resampling in HMC. We generalize the concept of bounces to a continuous version with partial direction preserving bounces at every step, which gives energy-conserving underdamped Langevin-like dynamics with non-Gaussian noise (MCLMC). MCHMC and MCLMC exhibit favorable scalings with condition number and dimensionality. We develop an efficient hyperparameter tuning scheme that achieves high performance and consistently outperforms NUTS HMC on several standard benchmark problems, in some cases by orders of magnitude.
97 MATHEMATICS AND COMPUTING↗
The History of Monte Carlo and MCNP at Los Alamos [Slides]
The Monte Carlo method for radiation particle transport has its origins at LANL dating back to the 1940’s. The creators of these methods were Drs. Stanislaw Ulam, John von Neumann, Robert Richtmyer, and Nicholas Metropolis. Monte Carlo methods for particle transport have been driving computational developments since the beginning of modern computers; this continues today. In the 1950’s and 1960’s, these new methods were organized into a series of special-purpose Monte Carlo codes, including MCS, MCN, MCP, and MCG. These codes were able to transport neutrons and photons for specialized LANL applications. In 1977, these separate codes were combined to create the LANL Monte Carlo N-Particle (MCNP) radiation particle transport code. In 1983, MCNP3 was released for public distribution to the Radiation Safety Information Computational Center (RSICC). MCNP6.3 will be released late in 2021. Each year, LANL has ~100 MCNP new users and RSICC ~1250 new licenses distributed. This talk will review the Los Alamos history of the development of the modern Monte Carlo method and MCNP.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Static Self-Energy and Effective Mass of the Homogeneous Electron Gas from Quantum Monte Carlo Calculations
We discuss the methodology of quantum Monte Carlo calculations of the effective mass based on the static self-energy Σ(k,0). We then use variational Monte Carlo calculations of Σ(k,0) of the homogeneous electron gas at various densities to obtain results very close to perturbative G 0 W 0 calculations for values of the density parameter 1 ≤ r s ≤ 10. Here, the obtained values for the effective mass are close to diagrammatic Monte Carlo results and disagree with previous quantum Monte Carlo calculations based on a heuristic mapping of excitation energies to those of an ideal gas.
36 MATERIALS SCIENCE↗
Application of Monte Carlo Algorithms to Cardiac Imaging Reconstruction
Monte Carlo algorithms have a growing impact on nuclear medicine reconstruction processes. One ofthe main limitations of myocardial perfusion imaging (MPI) is the effective mitigation of the scattering component,which is particularly challenging in Single Photon Emission Computed Tomography (SPECT). In SPECT,no timing information can be retrieved to locate the primary source photons. Monte Carlo methods allow anevent-by-event simulation of the scattering kinematics, which can be incorporated into a model of the imagingsystem response. This approach was adopted in the late Nineties by several authors, and recently took advantageof the increased computational power made available by high-performance CPUs and GPUs. These recent developmentsenable a fast image reconstruction with improved image quality, compared to deterministic approaches.Deterministic approaches are based on energy-windowing of the detector response, and on the cumulative estimateand subtraction of the scattering component. In this paper, we review the main strategies and algorithms tocorrect the scattering effect in SPECT and focus on Monte Carlo developments, which nowadays allow the threedimensionalreconstruction of SPECT cardiac images in a few seconds.
Pharmacology & Pharmacy↗
Generalized Bayesian Monte Carlo Evaluation [Slides]
Bayesian Monte Carlo is a tool to address imperfect data & models, non-linear models, non-normal PDFs, and integration of differential and integral data. Simple propagation to criticality shows effects of new $\mathcal{L}$($β|z,γ$).
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Continuous-time Monte Carlo renormalization group
We implement the Monte Carlo renormalization group approach in the continuous-time Monte Carlo simulation of a quantum system. In this work, we demonstrate numerically the emergent isotropy between space and time at large distances for the systems that exhibit Lorentz invariance at quantum criticality. Here, this allows us to estimate accurately the sound velocity for these quantum systems. $\textit{Q}$-state Potts models in one and two space dimensions are used to illustrate the method.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗