Search NASA⌕ Search

SEARCH · Search NASA

Results for “Metropolis algorithm”

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.

At least 109 records · Page 6

Finite-Temperature Structures of Supported Subnanometer Catalysts Inferred via Statistical Learning and Genetic Algorithm-Based Optimization

Single-atom catalysts (SACs) minimize noble metal utilization and can alter the activity and selectivity of supported metal nanoparticles. However, the morphology of active centers, including single atoms and subnanometer clusters of a few atoms, remains elusive due to experimental challenges. The computational cost to describe numerous cluster shapes and sizes makes direct first-principles calculations impractical. We present a computational framework to enable structure determination for single-atom and subnanometer cluster catalysts. As a case study, we obtained the low energy structures of Pd n (n = 1-21) clusters supported on CeO 2 (111), which are critical components of automobile three-way catalysts. Trained on density functional theory data, a three-dimensional cluster expansion is established using statistical learning to describe the Hamiltonian and predict energies of supported Pdn clusters of any structure. Low energy stable and metastable structures are identified using a Metropolis Monte Carlo-based genetic algorithm in the canonical ensemble at 300 K. We observe that supported single atoms sinter to form bilayer clusters and large cluster isomers share similarities in both shape and energy, and elucidate the significance of the support and microstructure on cluster stability. We discovered a simple surrogate structure-energy model, where the energy per atom scales with the square root of the average first coordination number, which can be used to estimate energies and compare the stability of clusters. Our framework, applicable to any metal/support system, fills an important methodological gap to predict the stability of supported metal catalysts in the subnanometer regime.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Markov Chain Monte Carlo Used in Parameter Inference of Magnetic Resonance Spectra

In this paper, we use Boltzmann statistics and the maximum likelihood distribution derived from Bayes’ Theorem to infer parameter values for a Pake Doublet Spectrum, a lineshape of historical significance and contemporary relevance for determining distances between interacting magnetic dipoles. A Metropolis Hastings Markov Chain Monte Carlo algorithm is implemented and designed to find the optimum parameter set and to estimate parameter uncertainties. In conclusion, the posterior distribution allows us to define a metric on parameter space that induces a geometry with negative curvature that affects the parameter uncertainty estimates, particularly for spectra with low signal to noise.

43 PARTICLE ACCELERATORS↗

The Metropolis Monte Carlo method with CUDA enabled Graphic Processing Units

We present a CPU–GPU system for runtime acceleration of large molecular simulations using GPU computation and memory swaps. The memory architecture of the GPU can be used both as container for simulation data stored on the graphics card and as floating-point code target, providing an effective means for the manipulation of atomistic or molecular data on the GPU. To fully take advantage of this mechanism, efficient GPU realizations of algorithms used to perform atomistic and molecular simulations are essential. Our system implements a versatile molecular engine, including inter-molecule interactions and orientational variables for performing the Metropolis Monte Carlo (MMC) algorithm, which is one type of Markov chain Monte Carlo. By combining memory objects with floating-point code fragments we have implemented an MMC parallel engine that entirely avoids the communication time of molecular data at runtime. Our runtime acceleration system is a forerunner of a new class of CPU–GPU algorithms exploiting memory concepts combined with threading for avoiding bus bandwidth and communication. The testbed molecular system used here is a condensed phase system of oligopyrrole chains. A benchmark shows a size scaling speedup of 60 for systems with 210,000 pyrrole monomers. Our implementation can easily be combined with MPI to connect in parallel several CPU–GPU duets. -- Highlights: •We parallelize the Metropolis Monte Carlo (MMC) algorithm on one CPU—GPU duet. •The Adaptive Tempering Monte Carlo employs MMC and profits from this CPU—GPU implementation. •Our benchmark shows a size scaling-up speedup of 62 for systems with 225,000 particles. •The testbed involves a polymeric system of oligopyrroles in the condensed phase. •The CPU—GPU parallelization includes dipole—dipole and Mie—Jones classic potentials.

97 MATHEMATICS AND COMPUTING↗

Hyporheic-zone Processes and Stream Oxygen Dynamics: Insights from a Multiscale Reactive Transport Model: Modeling Archive

This archive contains the data and Python scripts required to reproduce the analyses and figures in the study: Gomez-Velez, J. D., Rathore, S. S., Cohen, M. J., & Painter, S. L. (2025). Hyporheic-zone Processes and Stream Oxygen Dynamics: Insights from a Multiscale Reactive Transport Model. Submitted to Water Resources Research. The analysis utilizes the subgrid model Advection Dispersion Equation with Lagrangian Subgrids (ADELS) implemented in the Advanced Terrestrial Simulator (ATS; https://amanzi.github.io/ats/stable/). In this case, the ATS and Amanzi versions are (1) ATS version 1.5.1_f5ba18f8 and (2) Amanzi version 1.6-dev_53444cca4. The repository includes a Jupyter Notebook and the necessary data (Pandas DataFrames stored as pickle files) to generate the figures for the manuscript. Additionally, it contains Python scripts to create ATS input files, run the ATS simulations, and post-process the results. Finally, it provides routines for parameter estimation using the Single-Station Metabolism (SSM) model with the Differential Evolution Adaptive Metropolis (DREAM) Markov Chain Monte Carlo (MCMC) algorithm with ZS enhancements (DREAM-ZS).

54 ENVIRONMENTAL SCIENCES↗

Radiation Source Localization Using Surrogate Models Constructed from 3-D Monte Carlo Transport Physics Simulations

Recent research has focused on the development of surrogate models for radiation source localization in a simulated urban domain. We employ the Monte Carlo N-Particle (MCNP) code to provide high- delity simulations of radiation transport within an urban domain. The model is constructed to employ a source location (x, y, z) as input and return the estimated count rate for a set of speci ed detector locations. Because MCNP simulations are computationally expensive, we develop e cient and accurate surrogate models of the detector responses. We construct surrogate models using Gaussian processes (GP) and neural networks (NN) that we train and verify using the MCNP simulations. The trained surrogate models provide an e cient framework for Bayesian inference and experimental design. We employ Delayed Rejection Adaptive Metropolis (DRAM), a Markov Chain Monte Carlo (MCMC) algorithm, to infer the location and intensity of an unknown source. The DRAM results yield a posterior probability distribution for the source's location conditioned on the observed detector count rates. The posterior distribution exhibits regions of high and low probability within the simulated environment identifying potential source locations. In this manner, we can quantify the source location to within at least one of these regions of high probability in the considered cases. Employing these methods, we are able to reduce the space of potential source locations by at least 60%.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Bayesian Monte-Carlo Evaluation Framework for Imperfect Data [Slides]

BMC evaluation is a tool to address imperfect data & models, non-linear models, and non-normal PDFs. New posterior PDFs may need new storage formats to allow storage of non-normal PDFs. Storing posterior sets allows for: variance, covariance, skewness, etc.

97 MATHEMATICS AND COMPUTING↗

BCL::MP-fold: Membrane protein structure prediction guided by EPR restraints

For many membrane proteins, the determination of their topology remains a challenge for methods like X-ray crystallography and nuclear magnetic resonance (NMR) spectroscopy. Electron paramagnetic resonance (EPR) spectroscopy has evolved as an alternative technique to study structure and dynamics of membrane proteins. The present study demonstrates the feasibility of membrane protein topology determination using limited EPR distance and accessibility measurements. The BCL::MP-Fold (BioChemical Library membrane protein fold) algorithm assembles secondary structure elements (SSEs) in the membrane using a Monte Carlo Metropolis (MCM) approach. Sampled models are evaluated using knowledge-based potential functions and agreement with the EPR data and a knowledge-based energy function. Twenty-nine membrane proteins of up to 696 residues are used to test the algorithm. The RMSD100 value of the most accurate model is better than 8 Å for 27, better than 6 Å for 22, and better than 4 Å for 15 of the 29 proteins, demonstrating the algorithms' ability to sample the native topology. The average enrichment could be improved from 1.3 to 2.5, showing the improved discrimination power by using EPR data. Proteins 2015; 83:1947–1962. © 2015 Wiley Periodicals, Inc

Biochemistry & Molecular Biology↗

A Bayesian Approach to Real-Time Dynamic Parameter Estimation Using Phasor Measurement Unit Measurement

Here, we develop a polynomial-chaos-expansion (PCE)-based approach for decentralized dynamic parameter estimation through Bayesian inference. Using this approach, the non-Gaussian distribution of the inverted parameters is obtained. More specifically, we first represent the decentralized generator model with the PCE-based surrogate. This surrogate allows us to efficiently evaluate the time-consuming dynamic solver at parameter values through Metropolis-Hastings (M-H)-based Markov chain Monte Carlo (MCMC). Then, we propose a two-stage hybrid Markov chain Monte Carlo (MCMC) to recover a posteriori distribution of the decentralized generator model parameters. In the first stage, we use the gradient-enhanced Langevin MCMC algorithm to characterize an intermediate posterior parameter distribution. This algorithm is computationally scalable to the high-dimensional parameter space. Based on the intermediate posterior distribution, during the second stage, we use the adaptive MCMC algorithm to fine-tune the strong correlations between the parameters. Finally, the fully recovered a posterior distribution is obtained in the end. The simulation results show that the proposed PCE-based hybrid MCMC algorithm can accurately and efficiently estimate the high-dimensional generator dynamic model parameters with full probabilistic distribution provided.

42 ENGINEERING↗

Bayesian Monte-Carlo Evaluation Framework for Imperfect Nuclear Data [Slides]

BMC evaluation is a tool used to address imperfect data and models, non-linear models, and non-normal PDFs. ENDF-6 format does not allow non-normal parameter PDFs. Storing posterior sets allows for variance, covariance, skewness, etc. To better predict criticality, we should document non-normal parameter PDFs (i.e. asymmetric uncertainty) and consider non-linear sensitivity of $k_{\text{eff}}$ to resonance parameters.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Bayesian Monte-Carlo Framework: New Methods for Resonance Parameter Evaluation [Slides]

BMC evaluation is a tool to address imperfect data & models, non-linear models, and non-normal PDFs. ENDF-6 format does not allow non-normal parameter PDFs. Storing posterior sets allow for variance, covariance, skewness, etc. To better predict criticality, we could document non-normal parameter PDFs (i.e. asymmetric uncertainty), consider non-linear sensitivity of $\kappa$ eff to resonance parameters, and reduce uncertainty in key resonance parameters.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Metis: A Pure Metropolis Markov Chain Monte Carlo Bayesian Inference Library

The use of Bayesian inference in data analysis has become the standard for large scienti c experiments [1, 2]. The Monte Carlo Codes Group(XCP-3) at Los Alamos has developed a simple set of algorithms currently implemented in C++ and Python to easily perform at-prior Markov Chain Monte Carlo Bayesian inference with pure Metropolis sampling. These implementations are designed to be user friendly and extensible for customization based on speci c application requirements. This document describes the algorithmic choices made and presents two use cases.

97 MATHEMATICS AND COMPUTING↗

Generalized Metropolis acceptance criterion for hybrid non-equilibrium molecular dynamics—Monte Carlo simulations

A family of hybrid simulation methods that combines the advantages of Monte Carlo (MC) with the strengths of classical molecular dynamics (MD) consists in carrying out short non-equilibrium MD (neMD) trajectories to generate new configurations that are subsequently accepted or rejected via an MC process. In the simplest case where a deterministic dynamic propagator is used to generate the neMD trajectories, the familiar Metropolis acceptance criterion based on the change in the total energy ΔE, min[1, exp( − βΔE)], guarantees that the hybrid algorithm will yield the equilibrium Boltzmann distribution. However, the functional form of the acceptance probability is more complex when the non-equilibrium switching process is generated via a non-deterministic stochastic dissipative propagator coupled to a heat bath. Here, we clarify the conditions under which the Metropolis criterion remains valid to rigorously yield a proper equilibrium Boltzmann distribution within hybrid neMD-MC algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic evaluation of fourth-order many-body perturbation energies

A scalable, stochastic algorithm evaluating the fourth-order many-body perturbation (MP4) correction to energy is proposed. Three hundred Goldstone diagrams representing the MP4 correction are computer generated and then converted into algebraic formulas expressed in terms of Green’s functions in real space and imaginary time. They are evaluated by the direct (i.e., non-Markov, non-Metropolis) Monte Carlo (MC) integration accelerated by the redundant-walker and control-variate algorithms. The resulting MC-MP4 method is efficiently parallelized and is shown to display O(n 5.3 ) size-dependence of cost, which is nearly two ranks lower than the O(n 7 ) dependence of the deterministic MP4 algorithm. Furthermore, it evaluates the MP4/aug-cc-pVDZ energy for benzene, naphthalene, phenanthrene, and corannulene with the statistical uncertainty of 10 mE h (1.1% of the total basis-set correlation energy), 38 mE h (2.6%), 110 mE h (5.5%), and 280 mE h (9.0%), respectively, after about 10 9 MC steps.

74 ATOMIC AND MOLECULAR PHYSICS↗

Legacy of Metropolis continues through new materials donated to classified library collections

“From the very beginning of the Los Alamos project, it was inevitable that the Laboratory would suffer total immersion in computing,” said Nicholas Constantine Metropolis in 1976, reflecting his characteristic humor. Metropolis had succinctly summarized the prominent place of computing in Los Alamos’s mission and history. Metropolis himself played no small role in that “total immersion,” exemplified by the Lab’s supercomputing center, a postdoctoral fellowship, and the world-famous algorithm that carry his name. So does a collection of legacy materials in the National Security Research Center (NSRC). The NSRC, the Lab’s classified library, which also houses unclassified artifacts, recently received a new addition to the Metropolis Collections. This donation, 22 years after his death on October 17, 1999, provides tangible evidence of Metropolis’s continuing legacy at Los Alamos.

97 MATHEMATICS AND COMPUTING↗

Intrepid MCMC: Metropolis-Hastings with exploration

In engineering examples, one often encounters the need to sample from unnormalized distributions with complex shapes that may also be implicitly defined through a physical or numerical simulation model, making it computationally expensive to evaluate the associated density function. For such cases, MCMC has proven to be an invaluable tool. Random-walk Metropolis Methods (also known as Metropolis-Hastings (MH)), in particular, are highly popular for their simplicity, flexibility, and ease of implementation. However, most MH algorithms suffer from significant limitations when attempting to sample from distributions with multiple modes (particularly disconnected ones). Here, in this paper, we present Intrepid MCMC - a novel MH scheme that utilizes a simple coordinate transformation to significantly improve the mode-finding ability and convergence rate to the target distribution of random-walk Markov chains while retaining most of the simplicity of the vanilla MH paradigm. Through multiple examples, we showcase the improvement in the performance of Intrepid MCMC over vanilla MH for a wide variety of target distribution shapes. We also provide an analysis of the mixing behavior of the Intrepid Markov chain, as well as the efficiency of our algorithm for increasing dimensions. A thorough discussion is presented on the practical implementation of the Intrepid MCMC algorithm. Finally, its utility is highlighted through a Bayesian parameter inference problem for a two-degree-of-freedom oscillator under free vibration.

97 - MATHEMATICS AND COMPUTING↗

Cosmological parameters from CMB maps without likelihood approximation

We propose an efficient Bayesian Markov chain Monte Carlo (MCMC) algorithm for estimating cosmological parameters from cosmic microwave background (CMB) data without the use of likelihood approximations. It builds on a previously developed Gibbs sampling framework that allows for exploration of the joint CMB sky signal and power spectrum posterior, P(s,C{sub ℓ}|d), and addresses a long-standing problem of efficient parameter estimation simultaneously in regimes of high and low signal-to-noise ratio. To achieve this, our new algorithm introduces a joint Markov chain move in which both the signal map and power spectrum are synchronously modified, by rescaling the map according to the proposed power spectrum before evaluating the Metropolis–Hastings accept probability. Such a move was already introduced by Jewell et al., who used it to explore low signal-to-noise posteriors. However, they also found that the same algorithm is inefficient in the high signal-to-noise regime, since a brute-force rescaling operation does not account for phase information. This problem is mitigated in the new algorithm by subtracting the Wiener filter mean field from the proposed map prior to rescaling, leaving high signal-to-noise information invariant in the joint step, and effectively only rescaling the low signal-to-noise component. To explore the full posterior, the new joint move is then interleaved with a standard conditional Gibbs move for the sky map. We apply our new algorithm to simplified simulations for which we can evaluate the exact posterior to study both its accuracy and its performance, and find good agreement with the exact posterior; marginal means agree to ≲0.006σ and standard deviations to better than ∼3%. The Markov chain correlation length is of the same order of magnitude as those obtained by other standard samplers in the field.

79 ASTRONOMY AND ASTROPHYSICS↗

Diagrammatic theories of anharmonic molecular vibrations

In this review, we summarise recent developments in our laboratory in the field of many-body quantum-mechanical calculations of the anharmonic vibrational structure of molecules. Our size-extensive vibrational self-consistent field (XVSCF) and size-extensive second-order many-body perturbation (XVMP2) methods are, unlike their parent methods (VSCF and VMP2), defined in diagram- matic formulations of the energies and Dyson self-energies, leading to manifestly size-consistent expressions for zero-point energies and anharmonic vibrational frequencies calculable with much greater efficiency. The effective one-mode potentials of XVSCF are quadratic and hence the Schrödinger equation for each mode can be solved analytically, unlike VSCF, where a basis-set expansion of wave functions on more complex one-mode potentials need to be performed; VSCF potentials and their minima (anharmonic geometry) are shown to reduce to the quadratic potentials and their minima (also given analytically) of XVSCF in the thermodynamic limit. By self-consistently solving the Dyson equation with frequency-dependent self-energies, XVMP2 has the ability to calculate anharmonic frequencies of fundamentals as well as combinations and overtones in the presence of strong anharmonic resonance without a multireference or quasi-degenerate formulation, which tends to be non-size-consistent. To eliminate the computational bottleneck of XVSCF and XVMP2, which is the high-rank force-constant evaluation, we have developed alternative algorithms in which the diagrammatic equations are recast as a small number of high-dimensional integrals and then evaluated stochastically using a Metropolis Monte Carlo (MC) method. These MC-XVSCF and MC-XVMP2 methods not only remove the need for force-constant evaluation or storage, but also take into account force constants of up to infinite order according to their importance. Furthermore, they are a new branch of quantum Monte Carlo which can calculate frequencies (excitation energies) directly without fixed-node errors.

Dyson equation↗