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 91 records · Page 5

(U) Validation and Optimization of a 1-Dimensional Quasi-Isentropic Compression Model Using a Functionally Graded Material Flyer Plate

The fields studying highly compressed materials have been around for many years. These fields have given birth to better understandings of the solar fusion cycle and the liquid-metallic core of Jupiter. The highest pressures achieved have been at the National Ignition Facility (NIF) and more recently, the Z-Machine. One method to achieve higher levels of compression is to use quasi-isentropic (QI) compression. In practice, this means minimizing the amount of temperature increase of the target material. In their paper, J.H. Nguyen et. al. manufactured a functionally graded material (FGM) in order to help them achieve QI compression. The aim of the study described in this paper is to validate a 1-dimensional (1D) FLAG model that uses an FGM flyer to compress a copper (Cu) target. Once validated, the density/composition profile of the FGM is varied and optimized using Markov Chain Monte Carlo, specifically using a Metropolis-Hastings algorithm to find the optimal FGM profile that minimizes the temperature increase in the copper.

36 MATERIALS SCIENCE↗

Order/disorder and phase diagram of H on Pd(100)

A phase boundary for H-Pd(100) was calculated using the Metropolis (1953) algorithm and the embedded atom method (EAM) described by Daw and Foiles (1987). The calculated phase boundary agreed with an experimentally determined phase boundary in its curvature and the coverage at which maximum Tc appeared, but was about 125 K lower than the experimental phase boundary.

Tibbits, P.↗

Prototype Global Analysis of LISA Data with Multiple Source Types

The novel data analysis challenges posed by the Laser Interferometer Space Antenna (LISA) arise from the overwhelmingly large number of astrophysical sources in the measurement band and the density with which they are found in the data. Robust detection and characterization of the numerous gravitational wave sources in LISA data can not be done sequentially, but rather through a simultaneous global fit of a data model containing the full suite of astrophysical and instrumental features present in the data. While previous analyses have focused on individual source types in isolation, here we present the first demonstration of a LISA global fit analysis containing combined astrophysical populations. The prototype pipeline uses a blocked Metropolis Hastings algorithm to alternatingly fit to a population of ultra compact galactic binaries, known “verification binaries” already identified by electromagnetic observations, a population of massive black hole mergers, and an instrument noise model. The Global LISA Analysis Software Suite (GLASS) is assembled from independently developed samplers for the different model components. The modular design enables flexibility to future development by defining standard interfaces for adding new, or updating additional, components to the global fit without being overly prescriptive for how those modules must be internally designed. The GLASS pipeline is demonstrated on data simulated for the LISA Data Challenge 2b. Results of the analysis and a road-map for continued development are described in detail.

Gravitational Waves↗

Modeling Radiation Detection Using a Mixed-Effects Statistical Model for Background Variation

In this paper, we consider radiation source localization in an urban environment as an inverse problem and use Bayesian parameter estimation techniques to infer the source location and intensity. Since parameter estimation generally requires a large number of model evaluations, we employ a simplified photon transport model, as in a 2017 paper by Stefanescu, et al., to reduce computational requirements. However, the model in the 2017 paper does not account for the physical reality that background radiation varies with position within an urban locale. We incorporate statistical mixed-effects modeling into the simplified transport equation from the Stefanescu, et al. paper to reflect individual variation among the background radiation measurements at multiple detector locations. With our new model, we use a Bayesian DRAM-within-Gibbs technique, which incorporates the Delayed Rejection Adaptive Metropolis (DRAM) algorithm, to estimate the mixed-effects parameters. We note that without adequate prior information, we were unable to simultaneously estimate the set of parameters corresponding to the source intensity, source location, and individual background radiation counts. By calibrating the background in the absence of a source, we obtained narrow prior distributions, which permitted us to jointly infer the source intensity and location and the background radiation distribution.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Efficient Subset Simulation using Hamiltonian Neural Network enhanced Markov Chain Monte Carlo Methods

The Monte Carlo method delivers an unbiased estimate of the probability of failure. However, the variance of the estimate depends on the number of evaluated samples. This number must be very large for estimations of a low probability of failure. If the evaluation of each sample is computationally expensive, the crude Monte Carlo simulation strategy is impracticable. Therefore, subset simulations are used to reduce the required number of evaluations. Subset simulations require a Markov Chain Monte Carlo sampler, such as the random walk Metropolis-Hastings algorithm. The algorithm, however, struggles with sampling in low-probability regions, especially if they are narrow. As a consequence, advanced Markov Chain Monte Carlo simulations have been developed. In particular, the Hamiltonian Monte Carlo method explores the target distribution rapidly. Driven by the idea of Hamiltonian dynamics, this sampler provides a non-random walk through the target distribution. The incorporation of subset simulation and Hamiltonian Monte Carlo methods has shown promising results for reliability analysis. One downside of the Hamiltonian Monte Carlo method is that gradient evaluations are computationally expensive, especially when dealing with high-dimensional problems and evaluating long trajectories. We show that integrating Hamiltonian neural networks in Hamiltonian Monte Carlo simulations significantly speeds up the sampling task. Furthermore, the enhancement of adaptive trajectory length within the Hamiltonian Monte Carlo results in the efficient proposal of the following states. Based on this recent enhancement, we provide a fast sampling strategy for subset simulations using Hamiltonian neural networks to replace the evaluation of the gradient and significantly speed up the Hamiltonian Monte Carlo simulation.

97 MATHEMATICS AND COMPUTING↗

Simulation of classical thermal states on a quantum computer: A transfer-matrix approach

We present a hybrid quantum-classical algorithm to simulate thermal states of classical Hamiltonians on a quantum computer. Our scheme employs a sequence of locally controlled rotations, building up the desired state by adding qubits one at a time. We identified a class of classical models for which our method is efficient and avoids potential exponential overheads encountered by Grover-like or quantum Metropolis schemes. Our algorithm also gives an exponential advantage for two-dimensional Ising models with magnetic field on a square lattice, compared with the previously known Zalka's algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A stochastic simulation method for the assessment of resistive random access memory retention reliability

This study presents an evaluation method for resistive random access memory retention reliability based on the Metropolis Monte Carlo algorithm and Gibbs free energy. The method, which does not rely on a time evolution, provides an extremely efficient way to compare the relative retention properties of metal-insulator-metal structures. It requires a small number of iterations and may be used for statistical analysis. The presented approach is used to compare the relative robustness of a single layer ZrO{sub 2} device with a double layer ZnO/ZrO{sub 2} one, and obtain results which are in good agreement with experimental data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

FIVE-YEAR WILKINSON MICROWAVE ANISOTROPY PROBE (WMAP) OBSERVATIONS: BAYESIAN ESTIMATION OF COSMIC MICROWAVE BACKGROUND POLARIZATION MAPS

We describe a sampling method to estimate the polarized cosmic microwave background (CMB) signal from observed maps of the sky. We use a Metropolis-within-Gibbs algorithm to estimate the polarized CMB map, containing Q and U Stokes parameters at each pixel, and its covariance matrix. These can be used as inputs for cosmological analyses. The polarized sky signal is parameterized as the sum of three components: CMB, synchrotron emission, and thermal dust emission. The polarized Galactic components are modeled with spatially varying power-law spectral indices for the synchrotron, and a fixed power law for the dust, and their component maps are estimated as by-products. We apply the method to simulated low-resolution maps with pixels of side 7.2 deg, using diagonal and full noise realizations drawn from the WMAP noise matrices. The CMB maps are recovered with goodness of fit consistent with errors. Computing the likelihood of the E-mode power in the maps as a function of optical depth to reionization, {tau}, for fixed temperature anisotropy power, we recover {tau} = 0.091 {+-} 0.019 for a simulation with input {tau} = 0.1, and mean {tau} = 0.098 averaged over 10 simulations. A 'null' simulation with no polarized CMB signal has maximum likelihood consistent with {tau} = 0. The method is applied to the five-year WMAP data, using the K, Ka, Q, and V channels. We find {tau} = 0.090 {+-} 0.019, compared to {tau} = 0.086 {+-} 0.016 from the template-cleaned maps used in the primary WMAP analysis. The synchrotron spectral index, {beta}, averaged over high signal-to-noise pixels with standard deviation {sigma}({beta}) < 0.25, but excluding {approx}6% of the sky masked in the Galactic plane, is -3.03 {+-} 0.04. This estimate does not vary significantly with Galactic latitude, although includes an informative prior.

79 ASTRONOMY AND ASTROPHYSICS↗

FORMATION OF CARBON DIOXIDE, METHANOL, ETHANOL, AND FORMIC ACID ON AN ICY GRAIN ANALOG USING FAST OXYGEN ATOMS

Carbon dioxide (CO{sub 2}), methanol (CH{sub 3}OH), ethanol (CH{sub 3}CH{sub 2}OH), and formic acid (HCOOH) have been formed in collisions of a superthermal, 9 eV beam of O({sup 3} P) atoms with CH{sub 4} molecules, with an over coat of CO molecules, adsorbed on a gold surface at 4.8 K. The products are detected using temperature programmed-desorption and quadrupole mass spectrometry. Identification of the species is carried out through use of the Metropolis random walk algorithm as constrained by the fractionation patterns of the detected species. Relative formation yields are reported and reaction sequences are given to account for possible formation routes.

79 ASTRONOMY AND ASTROPHYSICS↗

Statistical modelling and Bayesian inversion for a Compton imaging system: application to radioactive source localization

Abstract This paper presents a statistical forward model for a Compton imaging system, called Compton imager. This system, under development at the University of Illinois Urbana Champaign, is a variant of Compton cameras with a single type of sensors which can simultaneously act as scatterers and absorbers. This imager is convenient for imaging situations requiring a wide field of view. The proposed statistical forward model is then used to solve the inverse problem of estimating the location and energy of point-like sources from observed data. This inverse problem is formulated and solved in a Bayesian framework by using a Metropolis within Gibbs algorithm for the estimation of the location, and an expectation-maximization algorithm for the estimation of the energy. This approach leads to more accurate estimation when compared with the deterministic standard back-projection approach, with the additional benefit of uncertainty quantification in the low photon imaging setting.

Tarpau, Cécilia (ORCID:0000000286539490)↗

PyDREAM: high-dimensional parameter inference for biological models in python

Biological models contain many parameters whose values are difficult to measure directly via experimentation and therefore require calibration against experimental data. Markov chain Monte Carlo (MCMC) methods are suitable to estimate multivariate posterior model parameter distributions, but these methods may exhibit slow or premature convergence in high-dimensional search spaces. Here, we present PyDREAM, a Python implementation of the (Multiple-Try) Differential Evolution Adaptive Metropolis [DREAM(ZS)] algorithm developed by Vrugt and ter Braak (2008) and Laloy and Vrugt (2012). PyDREAM achieves excellent performance for complex, parameter-rich models and takes full advantage of distributed computing resources, facilitating parameter inference and uncertainty estimation of CPU-intensive biological models.

59 BASIC BIOLOGICAL SCIENCES↗

Adaptive Metropolis Sampling with Product Distributions

The Metropolis-Hastings (MH) algorithm is a way to sample a provided target distribution pi(z). It works by repeatedly sampling a separate proposal distribution T(x,x') to generate a random walk {x(t)}. We consider a modification of the MH algorithm in which T is dynamically updated during the walk. The update at time t uses the {x(t' less than t)} to estimate the product distribution that has the least Kullback-Leibler distance to pi. That estimate is the information-theoretically optimal mean-field approximation to pi. We demonstrate through computer experiments that our algorithm produces samples that are superior to those of the conventional MH algorithm.

Wolpert, David H.↗

Improved Nested Sampling and Surrogate-Enabled Comparison With Other Marginal Likelihood Estimators

Estimating marginal likelihood is of central importance to Bayesian model selection and/or model averaging. The nested sampling method has been recently used together with the Metropolis-Hasting (M-H) sampling algorithm for estimating marginal likelihood. This study develops a new implementation of nested sampling by using the DiffeRential Evolution Adaptive Metropolis (DREAMzs) sampling algorithm. The two implementations of nested sampling are evaluated for four models of a synthetic groundwater flow modeling. The DREAMzs-based nested sampling outperforms the M-H-based nested sampling in terms of their accuracy, convergence, efficiency, and stability, which is attributed to the fact that DREAMzs is more robust than M-H for parameter sampling. The nested sampling method is also compared with four other methods (arithmetic mean, harmonic mean, stabilized harmonic mean, and thermodynamic integration) commonly used for estimating marginal likelihood and posterior probability of the four groundwater models. The comparative study requires hundreds of millions of model executions, which would not be possible without using surrogate models to replace the original models. Using the arithmetic mean estimator as the reference, the comparison reveals that thermodynamic integration outperforms nested sampling in terms of accuracy and stability, whereas nested sampling is more computationally efficient to reach to convergence. Here, the harmonic mean and stabilized harmonic mean methods give the worst marginal likelihood estimation. Accurate marginal likelihood estimation is important for accurate estimation of posterior model probability and better predictive performance of Bayesian model averaging.

54 ENVIRONMENTAL SCIENCES↗

Algorithms in Diffraction Profile Analysis

This chapter introduces several approaches to crystallographic structure refinement from diffraction profile data including the Rietveld method, global optimization methods, and Bayesian modeling. First, the Rietveld method and related nonlinear least squares approaches to analyzing diffraction profiles are briefly discussed. We then review the most common algorithms within global optimization as alternative methods of structure solution: grid search, simulated annealing, and genetic algorithms. As the Rietveld method is the standard tool for analyzing diffraction profile data, we catalogue its challenges and limitations. A Bayesian approach to diffraction profile analysis is presented as an alternative, along with several sampling algorithms including Gibbs sampling, variants of Metropolis sampling, Hamiltonian Monte Carlo, and approximate Bayesian computing. These sampling algorithms are applied to the fitting of a neutron diffraction profile from a National Institute of Standards and Technology silicon standard reference material, and their results are compared.

Singh, Susheela↗

Metropolis–Hastings Monte Carlo Method for Neutron Emissivity Tomographic Inversion in Tokamak Plasma

The article presents a new approach to plasma neutron emissivity reconstruction based on the Metropolis–Hastings Monte Carlo algorithm. The algorithm is based on a biased random walk. A dedicated computer code generates pseudo-random samples within the domain that contains the solution. The properly chosen objective function ensures convergence to the desired solution. The method allows to overcome the problem of trapping in local minima by accepting, with some finite probability, changes in the direction opposite to that indicated by the objective function. The developed method was tested using a synthetic data set. The results show that the method provides reliable reconstructions and thus can be used as an alternative or complementary method to the commonly applied ones. The method capabilities were also tested against noise present in the line-integrated projections.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Applications of the worldline Monte Carlo formalism in quantum mechanics

Highlights: Universal approach to the numerical computation of the Euclidean path integral. Inspired by recent work in relativistic quantum field theory. Here adapted to non-relativistic quantum mechanics. Worked out for the computation of propagators and ground-state energies. Special smoothing procedure for singular potentials. -- Abstract: In recent years efficient algorithms have been developed for the numerical computation of relativistic single-particle path integrals in quantum field theory. Here, we adapt this “worldline Monte Carlo” approach to the standard problem of the numerical approximation of the non-relativistic path integral, resulting in a formalism whose characteristic feature is the fast, non-recursive generation of an ensemble of trajectories that is independent of the potential, and is thus universally applicable. The numerical implementation discretises the trajectories with respect to their time parametrisation but maintains a continuous spatial domain. In the case of singular potentials, the discretised action gets adapted to the singularity through a “smoothing” procedure. We show for a variety of examples (the harmonic oscillator in various dimensions, the modified Pöschl–Teller potential, delta-function potentials, the Coulomb and Yukawa potentials) that the method allows one to obtain fast and reliable estimates for the Euclidean propagator and use them in a certain time window suitable for extracting the ground state energy. Usually Monte Carlo calculations in quantum mechanics are performed using algorithms that involve a more specific adaptation to the potential, and we briefly compare our method with the most widely used such algorithms, which are of Metropolis type. As an aside, we apply it for studying the classical limit where nearly classical trajectories are expected to dominate in the path integral. We expect the advances made here to be useful also in the relativistic case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient random-sampling method for calculating double occupancy of Gutzwiller wave function in single-band 1D and 2D lattices

In this paper, we report a random sampling method for computing the expectation value of physical quantities based on the Gutzwiler variational wave function. As the first application, we calculated the double occupancy, which is a critical quantity for under- standing the correlation effects in many-body systems, for single-band 1D and 2D lattices. We demonstrated that the random sampling scheme is more efficient than an existing Metropolis Monte-Carlo algorithm. For the 1D Hubbard model with only nearest-neighbor hopping, our results are almost identical to the exact analytic solution. We have also studied systems to which analytic solutions are not available, including the 1D lattices with next-nearest-neighbor hopping and 2D lattices. In addition, constraints on real-space con gurations can be easily implemented in the current scheme to further improve the Gutzwiller wave function. As an example, we calculated the double occupancy for 1D Hubbard model by applying the constraint that all double-occupied sites are paired with an empty site. With enhanced correlation between double-occupied and empty sites, the constraint results in much improved ground-state energy for 1D Hubbard model with strong on-site repulsion.

74 ATOMIC AND MOLECULAR PHYSICS↗