Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Monte Carlo Sampling”

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 793 records · Page 44

PDV Uncertainty Estimation & Methods Comparison

Several methods are presented for estimating the rapidly changing instantaneous frequency of a time varying signal that is contaminated by measurement noise. Useful a posteriori error estimates for several methods are verified numerically through Monte Carlo simulation. However, given the sampling rates of modern digitizers, sub-nanosecond variations in velocity are shown to be reliably measurable in most (but not all) cases. Results support the hypothesis that in many PDV regimes of interest, sub-nanosecond resolution can be achieved.

47 OTHER INSTRUMENTATION↗

Decoding Golden Eagle Movement Behavior from High-Resolution, Variable-Rate Telemetry Data Through Bayesian Filtering

The recent advances in animal tracking technology have enabled the collection of a vast amount of in situ data regarding the movement of wildlife at high spatiotemporal resolution. These data are usually available at variable time resolutions and contains noise (error) originating from GPS fixes. Decoding movement characteristics, particularly of flying animals, from telemetry data while handling these factors is a challenging yet important task for conservation purposes. Typically, this task is broken into two subtasks: resampling, and model calibration. The resampling subtask converts the variable rate positional data into a constant time interval data, while the model calibration subtask uses the resampled data to tune time-invariant parameters of the proposed models. For telemetry data at high temporal resolutions (order of 1 second), it is very challenging to decouple noise from actual movements using interpolation-based resampling techniques. Any errors introduced during resampling can significantly alter the the calibration and prediction attributes of the movement model. We address this problem through a unified Bayesian state-space framework that can handle both the resampling and calibration tasks in a single step. In addition, we use the speed and heading of the bird from telemetry data to regularize the position information of the bird. We use a Kalman filtering approach to include these nonlinearly related motion parameters within the state space framework. We cross-validated to quantify how this inclusion affects the model performance in estimating true bird movements. The relationship between the true state of the bird and environmental and topographical covariates is then represented parametrically. These parameters are then tuned using stochastic sampling strategies like Markov Chain Monte Carlo (MCMC). We use the telemetry data collected from golden eagles in the western USA to demonstrate the applicability of this approach to build a predictive, probabilistic movement model. Our preliminary results show that this approach provides improved predictive performance in terms of capturing higher-order motion parameters such as angular and horizontal accelerations, which may have simpler and more direct relationships with environmental covariates than corresponding speeds. In this talk, we will demonstrate how this state-space approach benefits the prediction capabilities of a movement model in simulating golden eagle paths through a wind power plant in Wyoming given certain atmospheric conditions. The model outcomes are aimed at informing mitigation strategies that can minimize the potential for collisions of golden eagles with wind turbines.

Bayesian methods↗

Monte Carlo Techniques for Nuclear Systems - Theory Lectures

These are lecture notes for a Monte Carlo class given at the University of New Mexico. The following topics are covered: course information; nuclear eng. review & MC; random numbers and sampling; computational geometry; collision physics; tallies and statistics; eigenvalue calculations I; eigenvalue calculations II; eigenvalue calculations III; variance reduction; parallel Monte Carlo; parameter studies; fission matrix and higher eigenmodes; doppler broadening; Monte Carlo depletion; HTGR modeling; coupled MC and T/H calculations; fission energy deposition. Solving particle transport problems with the Monte Carlo method is simple - just simulate the particle behavior. The devil is in the details, however. These lectures provide a balanced approach to the theory and practice of Monte Carlo simulation codes. The first lectures provide an overview of Monte Carlo simulation methods, covering the transport equation, random sampling, computational geometry, collision physics, and statistics. The next lectures focus on the state-of-the-art in Monte Carlo criticality simulations, covering the theory of eigenvalue calculations, convergence analysis, dominance ratio calculations, bias in Keff and tallies, bias in uncertainties, a case study of a realistic calculation, and Wielandt acceleration techniques. The remaining lectures cover advanced topics, including HTGR modeling and stochastic geometry, temperature dependence, fission energy deposition, depletion calculations, parallel calculations, and parameter studies. This portion of the class focuses on using MCNP to perform criticality calculations for reactor physics and criticality safety applications. It is an intermediate level class, intended for those with at least some familiarity with MCNP. Class examples provide hands-on experience at running the code, plotting both geometry and results, and understanding the code output. The class includes lectures & hands-on computer use for a variety of Monte Carlo calculations. Beginning MCNP users are encouraged to review LA-UR-09-00380, "Criticality Calculations with MCNP: A Primer (3nd Edition)" (available at http:// mcnp.lanl.gov under "Reference Collection") prior to the class. No Monte Carlo class can be complete without having students write their own simple Monte Carlo routines for basic random sampling, use of the random number generator, and simplified particle transport simulation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Observations on variational and projector Monte Carlo methods

Variational Monte Carlo and various projector Monte Carlo (PMC) methods are presented in a unified manner. Similarities and differences between the methods and choices made in designing the methods are discussed. Both methods where the Monte Carlo walk is performed in a discrete space and methods where it is performed in a continuous space are considered. It is pointed out that the usual prescription for importance sampling may not be advantageous depending on the particular quantum Monte Carlo method used and the observables of interest, so alternate prescriptions are presented. The nature of the sign problem is discussed for various versions of PMC methods. A prescription for an exact PMC method in real space, i.e., a method that does not make a fixed-node or similar approximation and does not have a finite basis error, is presented. This method is likely to be practical for systems with a small number of electrons. Approximate PMC methods that are applicable to larger systems and go beyond the fixed-node approximation are also discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Variance reduction via simultaneous importance sampling and control variates techniques using vegas

Monte Carlo (MC) integration is an important calculational technique in the physical sciences. Practical considerations require that the calculations are performed as accurately as possible for a given set of computational resources. To improve the accuracy of MC integration, a number of useful variance reduction algorithms have been developed, including importance sampling and control variates. In this work, we demonstrate how these two methods can be applied simultaneously, thus combining their benefits. We provide a python wrapper, named CoVVVR, which implements our approach in the VEGAS program. The improvements are quantified with several benchmark examples from the literature.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The use of latin hypercube sampling for the efficient estimation of confidence intervals

Latin hypercube sampling (LHS) has long been used as a way of assuring adequate sampling of the tails of distributions in a Monte Carlo analysis and provided the framework for the uncertainty analysis performed in the NUREG-1150 risk assessment. However, this technique has not often been used in the performance of regulatory analyses due to the inability to establish confidence levels on the quantiles of the output distribution. Recent work has demonstrated a method that makes this possible. This method is compared to the procedure of crude Monte Carlo using order statistics, which is currently used to establish confidence levels. The results of several statistical examples demonstrate that the LHS confidence interval method can provide a more accurate and precise solution, but issues remain when applying the technique generally. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

An Efficient Sampling-Based Method for Sensitivity and Uncertainty Analysis Through RAVEN

Sensitivity analysis (SA) and uncertainty quantification (UQ) are now widely recognized as essential parts of analyses for complex nuclear systems. Plenty of well-established methodologies are already available for performing SA and UQ, such as Monte Carlo analysis, adjoint-based method, and variance decomposition. The focus of this summary is on developing an efficient sampling-based approach to perform SA and UQ through RAVEN. RAVEN (Risk Analysis and Virtual control Environment) is a software framework able to perform SA and UQ, currently under development at the Idaho National Laboratory. In literature, a number of approaches have been developed to accelerate the process of SA and UQ for large complex systems, such as principal component analysis (PCA) of input space, input-output correlation analysis, and intersection subspace methods. The fundamental idea is to identify the dominant active directions in the parameter space prior to conducting SA and UQ. The premise is that the number of active directions is much less than the dimensionality of input space. In this work, the PCA or Karhunen-Loeve expansion or SVD method is implemented in RAVEN to identify the active directions. This approach is also combined with the forward sampling approaches, such as Monte Carlo, Grid, Latin Hypercube, and Response Surface Design sampling approaches that are currently available in RAVEN, to perform SA and UQ more efficiently. The summary is organized as follows. In the following section, we present the PCA-based forward sampling approach. The effectiveness and efficiency are discussed in the numerical results section. The paper then ends with a concluding summary. In this summary, we have presented PCA-based forward sampling approach to perform SA and UQ. The goal is to reduce the computational overhead for repetitive executions of complex nuclear systems that are generally required when performing SA and UQ. The control of correlations between input parameters is implemented in RAVEN to better represent the input relationships. In addition, we are currently examining our implementations with more realistic models, and we are also focusing on implementation of some new high-dimensional input reduction techniques in RAVEN. (authors)

97 MATHEMATICS AND COMPUTING↗

Analytic treatment of source photon emission times to reduce noise in implicit Monte Carlo calculations

Statistical uncertainty is inherent to any Monte Carlo simulation of radiation transport problems. In space-angle-frequency independent radiative transfer calculations, the uncertainty in the solution is entirely due to random sampling of source photon emission times. We have developed a modification to the Implicit Monte Carlo algorithm that eliminates noise due to sampling of the emission time of source photons. In problems that are independent of space, angle, and energy, the new algorithm generates a smooth solution, while a standard implicit Monte Carlo solution is noisy. For space- and angle-dependent problems, the new algorithm exhibits reduced noise relative to standard implicit Monte Carlo in some cases, and comparable noise in all other cases. In conclusion, the improvements are limited to short time scales; over long time scales, noise due to random sampling of spatial and angular variables tends to dominate the noise reduction from the new algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

RAVEN Beta Release

This documents the release of the Risk Analysis Virtual Environment (RAVEN) code. A description of the RAVEN code is provided, and discussion of the release process for the M2LW-16IN0704045 milestone. The RAVEN code is a generic software framework to perform parametric and probabilistic analysis based on the response of complex system codes. RAVEN is capable of investigating the system response as well as the input space using Monte Carlo, Grid, or Latin Hyper Cube sampling schemes, but its strength is focused toward system feature discovery, such as limit surfaces, separating regions of the input space leading to system failure, using dynamic supervised learning techniques. RAVEN has now increased in maturity enough for the Beta 1.0 release.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

The multi-element probabilistic collocation method (ME-PCM): Error analysis and applications

Stochastic spectral methods are numerical techniques for approximating solutions to partial differential equations with random parameters. In this work, we present and examine the multi-element probabilistic collocation method (ME-PCM), which is a generalized form of the probabilistic collocation method. In the ME-PCM, the parametric space is discretized and a collocation/cubature grid is prescribed on each element. Both full and sparse tensor product grids based on Gauss and Clenshaw-Curtis quadrature rules are considered. We prove analytically and observe in numerical tests that as the parameter space mesh is refined, the convergence rate of the solution depends on the quadrature rule of each element only through its degree of exactness. In addition, the L{sup 2} error of the tensor product interpolant is examined and an adaptivity algorithm is provided. Numerical examples demonstrating adaptive ME-PCM are shown, including low-regularity problems and long-time integration. We test the ME-PCM on two-dimensional Navier-Stokes examples and a stochastic diffusion problem with various random input distributions and up to 50 dimensions. While the convergence rate of ME-PCM deteriorates in 50 dimensions, the error in the mean and variance is two orders of magnitude lower than the error obtained with the Monte Carlo method using only a small number of samples (e.g., 100). The computational cost of ME-PCM is found to be favorable when compared to the cost of other methods including stochastic Galerkin, Monte Carlo and quasi-random sequence methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An improved target velocity sampling algorithm for free gas elastic scattering

We present an improved algorithm for sampling the target velocity when simulating elastic scattering in a Monte Carlo neutron transport code that correctly accounts for the energy dependence of the scattering cross section. The algorithm samples the relative velocity directly, thereby avoiding a potentially inefficient rejection step based on the ratio of cross sections. Here, we have shown that this algorithm requires only one rejection step, whereas other methods of similar accuracy require two rejection steps. The method was verified against stochastic and deterministic reference results for upscattering percentages in 238 U. Simulations of a light water reactor pin cell problem demonstrate that using this algorithm results in a 3% or less penalty in performance when compared with an approximate method that is used in most production Monte Carlo codes

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Uncertainty quantification in elastic constants of SiC f /SiC m tubular composites using global sensitivity analysis

Silicon carbide fiber and silicon carbide matrix (SiC f /SiC m ) tubes produced through the chemical vapor infiltration process have become a candidate cladding material in nuclear applications. The performance of this composite is influenced by many variables such as braiding angle, porosity, material properties, etc., which vary over a range of values due to the inherent fluctuations in the manufacturing process. In this study, the variability in elastic constants of SiC f /SiC m composite has been quantified through multiscale finite element (FE) simulations, variable screening, and high-fidelity surrogate modeling. The key variables dominantly affecting the elastic constants of SiC f /SiC m tubes were identified using global sensitivity analysis. A surrogate to the high-fidelity FE-based model was used in Monte Carlo simulations to generate a hundred thousand samples from which the uncertainty in elastic constants was assessed. It turned out that the coefficient of variation was less than 10%.

Materials Science↗

Dynamic Simulation Probabalistic Risk Assessment Model for an Enceladus Sample Return Mission

Enceladus, a moon of Saturn, has geyser-like jets that spray plumes of material into orbit. These jets could enable a free-flying spacecraft to collect samples and return them to Earth for study to determine if they contain the building blocks of life. The Office of Planetary Protection at NASA requires containment of any unsterilized samples and prohibits destructive impact of the spacecraft upon return to Earth, with a sample release probability of less than 1 in 1,000,000 as a recommended goal. This paper describes a probabilistic risk assessment model that uses dynamic simulation techniques to capture the physics-based, time- and state-dependent interactions between the sample return system and the environment, which drive the risk of sample release. The dynamic approach uses a Monte Carlo-style simulation to integrate the many phases and sources of risk for a sample return mission. The model is used to assess the achievability of the planetary protection reliability goal. This is accomplished by performing sensitivity studies assessing the impact of modeling assumptions to identify where uncertainties drive the risk. These results, in turn, are used to examine the feasibility of meeting key design and performance parameters that are needed to achieve the reliability goal for a given architecture with existing technologies.

Dynamic Simulation↗

Calculating Free Energies Using Scaled-Force Molecular Dynamics Algorithm

One common objective of molecular simulations in chemistry and biology is to calculate the free energy difference between different states of the system of interest. Examples of problems that have such an objective are calculations of receptor-ligand or protein-drug interactions, associations of molecules in response to hydrophobic, and electrostatic interactions or partition of molecules between immiscible liquids. Another common objective is to describe evolution of the system towards a low energy (possibly the global minimum energy), 'native' state. Perhaps the best example of such a problem is folding of proteins or short RNA molecules. Both types of problems share the same difficulty. Often, different states of the system are separated by high energy barriers, which implies that transitions between these states are rare events. This, in turn, can greatly impede exploration of phase space. In some instances this can lead to 'quasi non-ergodicity', whereby a part of phase space is inaccessible on timescales of the simulation. A host of strategies has been developed to improve efficiency of sampling the phase space. For example, some Monte Carlo techniques involve large steps which move the system between low-energy regions in phase space without the need for sampling the configurations corresponding to energy barriers (J-walking). Most strategies, however, rely on modifying probabilities of sampling low and high-energy regions in phase space such that transitions between states of interest are encouraged. Perhaps the simplest implementation of this strategy is to increase the temperature of the system. This approach was successfully used to identify denaturation pathways in several proteins, but it is clearly not applicable to protein folding. It is also not a successful method for determining free energy differences. Finally, the approach is likely to fail for systems with co-existing phases, such as water-membrane systems, because it may lead to spontaneous mixing. A similar difficulty may be encountered in any method relying on global modifications of phase space.

Darve, Eric↗

Monte Carlo inversion of seismic data

The analytic solution to the linear inverse problem provides estimates of the uncertainty of the solution in terms of standard deviations of corrections to a particular solution, resolution of parameter adjustments, and information distribution among the observations. It is shown that Monte Carlo inversion, when properly executed, can provide all the same kinds of information for nonlinear problems. Proper execution requires a relatively uniform sampling of all possible models. The expense of performing Monte Carlo inversion generally requires strategies to improve the probability of finding passing models. Such strategies can lead to a very strong bias in the distribution of models examined unless great care is taken in their application.

Wiggins, R. A.↗

Testing Nesting DXTRAN Spheres for Neutron Transport in Air

The deterministic transport sphere (DXTRAN sphere) is a technology that can be utilized in MCNP for improving sampling in the vicinity of a particular geometry, when the solid angle, between the source and particular geometry, is small. At a collision event, a DXTRAN particle is created and deterministically transported to the DXTRAN sphere, while the colliding particle (NONDXTRAN particle) continues transporting as if no DXTRAN event had occurred. Weight is balanced by killing the NONDXTRAN particle when traversing the DXTRAN sphere. If set up correctly, the DXTRAN particle placed on the DXTRAN sphere has a high probability of interacting with the geometry within the DXTRAN sphere. The Central Limit Theorem (CLT) states that the estimated mean approaches a normal distribution with known variance as the number of random samples grows sufficiently large. In reality the variance is seldom known and therefore must be estimated. In a Monte Carlo calculation, one must determine when the number of random samples is sufficiently large for the CLT to be satisfied. For the CLT to be satisfied, the first two moments (mean and variance) must exist. The second moment, the variance of a normal distribution is estimated. The slope test, which uses the largest 201 history scores of each tally fluctuation chart (TFC) bin fit to a Pareto function, is used to determine if the largest history scores decrease faster than 1/x{sup 3}. If the slope is less than 3, then enough histories have not yet been sampled such to meet the second moment existence requirement of the CLT. Usually, a slope of less than 3 indicates that the effects of high weight scores have not been satisfactorily sampled; such a consequence can also be manifested in examining trends in the 4. moment, the variance of the variance (VOV). For example, when examining the TFC, if the VOV is monotonically decreasing for a few sets of histories and then drastically increases for the next set of histories, chances are a rare high weight score, significantly greater than the average score, was encountered. As a result of the 1/R{sup 2} term, a point detector can achieve an extremely high weight, much greater than the average, as the distance from collision to point detector approaches zero. To remedy this difficulty, a 'radius of exclusion' is applied, where within the radius of exclusion 'the point detector estimate is assumed to be the average flux uniformly distributed'. A DXTRAN sphere can suffer from the same weight fluctuation as collisions in the vicinity of the DXTRAN sphere produce much larger weights than collisions happening far from the DXTRAN sphere. If the rare large weight put on the DXTRAN sphere then scores in a tally, there will be a significant increase in the VOV and the slope may drop below 3. To compliment that analysis, here we utilize an air composition and density that varies as a function of altitude, detailing the trials and tribulations of attempting to pass the 10 statistical checks for a variety of single and nested DXTRAN sphere approaches. The objective here is to illuminate important considerations for radiation transport problems with small solid angles in a scatter medium of few mean free paths (MFPs)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Monte Carlo investigation of experimental data requirements for fitting polynomial functions

This report examines the extent to which sample size affects the accuracy of a low order polynomial approximation of an experimentally observed quantity and establishes a trend toward improvement in the accuracy of the approximation as a function of sample size. The task is made possible through a simulated analysis carried out by the Monte Carlo method, in which data are generated by using several transcendental or algebraic functions as models. Contaminated data of varying amounts are fitted to linear quadratic or cubic polynomials, and the behavior of the mean-squared error of the residual variance is determined as a function of sample size. Results indicate that the effect of the size of the sample is significant only for relatively small sample sizes and diminishes drastically for moderate and large amounts of experimental data.

Canavos, G. C.↗