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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2013

Performing Probabilistic Risk Assessment Through RAVEN

The Reactor Analysis and Virtual control ENviroment (RAVEN) code is a software tool that acts as the control logic driver and post-processing engine for the newly developed Thermal-Hydraulic code RELAP-7. RAVEN is now a multi-purpose Probabilistic Risk Assessment (PRA) software framework that allows dispatching different functionalities: Derive and actuate the control logic required to simulate the plant control system and operator actions (guided procedures), allowing on-line monitoring/controlling in the Phase Space Perform both Monte-Carlo sampling of random distributed events and Dynamic Event Tree based analysis Facilitate the input/output handling through a Graphical User Interface (GUI) and a post-processing data mining module

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2017

Statistical Analyses of Post Irradiation Experiments of the BWR Forsmark

Computer codes which are to be used in nuclear safety research need to be validated prior to their application. For depletion codes, this validation can be done using data from post irradiation experiments (PIE). These experiments consist of a radiochemical analysis of small parts of a fuel rod (FR), which has been irradiated in a nuclear power plant as part of a fuel assembly (FA). This analysis allows the deduction of the isotopic composition of nuclides important for the desired application case. In addition the operation history at the sample location needs to be known and reported with the analysis results. In our work, we perform uncertainty and sensitivity analyses of a model based on a sample from the boiling water reactor (BWR) Forsmark-3 in order to deduce the influence of uncertain system parameters on the nuclide composition of the depleted fuel. In a second step we compare the resulting uncertainties of the nuclide densities with the deviation between their calculated and experimental values. The goal is to obtain quantitative uncertainty data which can be accounted for in a validation procedure. We use the Monte Carlo sampling approach, i.e. repeating the model calculation using statistically varied sets of the uncertain input parameters and analyzing the distributions of the result values statistically. BWR depletion calculations are especially demanding due to the increased complexity and heterogeneity compared to pressurized water reactors (PWR): extensively variable enrichments, complex FA geometries, partial length FRs, strong axially varying moderator density and the common use of gadolinium as burnable absorber in some of the FRs. However, the precise and correct calculation of BWR-depletion is extremely important in view of a possible application in burnup credit for BWR FAs. Therein credit is taken for the reduced reactivity of spent fuel due to the depletion of {sup 235}U for transport and intermediate or final storage.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2016

Interaction cross sections and survival rates for proposed solar system member planet nine

Motivated by the report of a possible new planetary member of the solar system, this work calculates cross sections for interactions between passing stars and this proposed Planet Nine. Evidence for the new planet is provided by the orbital alignment of Kuiper belt objects, and other solar system properties, which suggest a Neptune-mass object on an eccentric orbit with a semimajor axis a{sub 9} ≈ 400–1500 au. With such a wide orbit, Planet Nine has a large interaction cross section and is susceptible to disruption by passing stars. Using a large ensemble of numerical simulations (several million) and Monte Carlo sampling, we calculate the cross sections for different classes of orbit-altering events: (A) scattering the planet into its proposed orbit from a smaller orbit, (B) ejecting it from the solar system from its current orbit, (C) capturing the planet from another system, and (D) capturing a free-floating planet. Results are presented for a range of orbital elements with planetary mass m{sub 9} = 10 M {sub ⊕}. Removing Planet Nine from the solar system is the most likely outcome. Specifically, we obtain ejection cross sections σ{sub int} ∼ 5 × 10{sup 6} au{sup 2} (5 × 10{sup 4} au{sup 2}) for environments corresponding to the birth cluster (field). With these cross sections, Planet Nine is likely to be ejected if the Sun resides within its birth cluster longer than Δt ≳ 100 Myr. The probability of ejecting Planet Nine due to passing field stars is ≲3% over the age of the Sun. Probabilities for producing the inferred Planet Nine orbit are low (≲5%).

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Adaptive sparse polynomial dimensional decomposition for derivative-based sensitivity

In this report applications, such as the plasma-coupled combustion system we consider, derivative-based sensitivity indices (DSI) are known to have several advantages over Sobol's total sensitivity indices, especially for small sample sizes. Several properties of derivative-based sensitivity measures are leveraged to develop a new and efficient numerical approach to estimate them. It is based on computing the DSI measures by effectively cost-free Monte Carlo sampling of an adaptively constructed orthogonal polynomial surrogate with uncertain input parameters that can have arbitrary probability distributions. The adaptivity reduces the number of necessary model evaluations, which is demonstrated both in a constructed example (the Moon function) and in two plasma-combustion systems with up to 55 uncertain parameters. Unimportant parameters are successfully identified and neglected with a low number of model evaluations, which makes it an attractive non-intrusive approach when adjoint solutions are unavailable to provide sensitivity information.

42 ENGINEERING↗
DOE OSTI2017

Determination of critical experiment correlations for experiments involving highly enriched uranium solutions

Quantifying the correlations among critical experiments has become a topic of interest over the last 10-15 years. The correlations arise from the shared use of fissile material, non-fissile materials, fixtures, and procedures in multiple experiments or multiple experiment series. A Monte Carlo sampling technique proposed as a viable technical method to evaluate these correlations has been implemented within the SCALE 6.2 Sampler sequence. This paper presents the investigation of the use of this new tool and technique for highly enriched uranium solution experiments. One of the first attempts to quantify the correlations among critical experiments examined a series of highly enriched solution experiments, including the HST-001 series. These correlations are included in the International Criticality Safety Benchmark Evaluation Project Handbook, and they form a basis for methodology comparisons. Results generated using the Sampler implementation are compared with these previously published results. Additional studies involving the HST-001 experiment series are also presented. A range of different assumptions of the independence of the geometry components, enrichments, and other material compositions are implemented to investigate the impact of these assumptions on the correlation coefficients. These effects are investigated with these experiments because the calculation time is shorter for the solution experiments than for the low-enriched lattice experiments discussed in a companion paper. The magnitude of the effects of different independence assumptions on the correlation coefficients is important to establish which parameters must be clearly identified as shared or unique for accurate correlation determinations. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2013

COSMIC MICROWAVE BACKGROUND LIKELIHOOD APPROXIMATION FOR BANDED PROBABILITY DISTRIBUTIONS

We investigate sets of random variables that can be arranged sequentially such that a given variable only depends conditionally on its immediate predecessor. For such sets, we show that the full joint probability distribution may be expressed exclusively in terms of uni- and bivariate marginals. Under the assumption that the cosmic microwave background (CMB) power spectrum likelihood only exhibits correlations within a banded multipole range, Δl{sub C}, we apply this expression to two outstanding problems in CMB likelihood analysis. First, we derive a statistically well-defined hybrid likelihood estimator, merging two independent (e.g., low- and high-l) likelihoods into a single expression that properly accounts for correlations between the two. Applying this expression to the Wilkinson Microwave Anisotropy Probe (WMAP) likelihood, we verify that the effect of correlations on cosmological parameters in the transition region is negligible in terms of cosmological parameters for WMAP; the largest relative shift seen for any parameter is 0.06σ. However, because this may not hold for other experimental setups (e.g., for different instrumental noise properties or analysis masks), but must rather be verified on a case-by-case basis, we recommend our new hybridization scheme for future experiments for statistical self-consistency reasons. Second, we use the same expression to improve the convergence rate of the Blackwell-Rao likelihood estimator, reducing the required number of Monte Carlo samples by several orders of magnitude, and thereby extend it to high-l applications.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

MAGIC: M arching Cubes Isosurface Uncertainty Visualization for G auss i an Uncertain Data With Spatial C orrelation

Here, in this paper, we study the propagation of data uncertainty through the marching cubes algorithm for isosurface visualization for correlated uncertain data. Consideration of correlation has been shown paramount for avoiding errors in uncertainty quantification and visualization in multiple prior studies. Although the problem of isosurface uncertainty with spatial data correlation has been previously addressed, there are two major limitations to prior treatments. First, there are no analytical formulations for uncertainty quantification of isosurfaces when the data uncertainty is characterized by a Gaussian distribution with spatial correlation. Second, as a consequence of the lack of analytical formulations,existing techniques resort to a Monte Carlo sampling approach, which is expensive and difficult to integrate into visualization tools. To address these limitations, we present a closed-form framework to efficiently derive uncertainty in marching cubes level-sets for Gaussian uncertain data with spatial correlation (MAGIC). To derive closed-form solutions, we leverage the Hinkley's derivation on the ratio of Gaussian distributions. With our analytical framework, we achieve a significant speed-up and enhanced accuracy of uncertainty quantification over classical Monte Carlo methods. We further accelerate our analytical solutions using many-core processors to achieve speed-ups up to 585× and integrability with production visualization tools for broader impact. We demonstrate the effectiveness of our correlation-aware uncertainty framework through experiments on meteorology, urban flow, and astrophysics simulation datasets.

Gaussian↗
DOE OSTI2018

Fast Approximate Union Volume in High Dimensions with Line Samples

The classical problem of calculating the volume of the union of d-dimensional balls is known as "Union Volume." We present line-sampling approximation algorithms for Union Volume. Our methods may be extended to other Boolean operations, such as setminus; or to other shapes, such as hyper-rectangles. The deterministic, exact approaches for Union Volume do not scale well to high dimensions. However, we adapt several of these exact approaches to approximation algorithms based on sampling. We perform local sampling within each ball using lines. We have several variations, depending on how the overlapping volume is partitioned, and depending on whether radial, axis-aligned, or other line patterns are used. Our variations fall within the family of Monte Carlo sampling, and hence have about the same theoretical convergence rate, 1 /$\sqrt{M}$, where M is the number of samples. In our limited experiments, line-sampling proved more accurate per unit work than point samples, because a line sample provides more information, and the analytic equation for a sphere makes the calculation almost as fast. We performed a limited empirical study of the efficiency of these variations. We suggest a more extensive study for future work. We speculate that different ball arrangements, differentiated by the distribution of overlaps in terms of volume and degree, will benefit the most from patterns of line samples that preferentially capture those overlaps. Acknowledgement We thank Karl Bringman for explaining his BF-ApproxUnion (ApproxUnion) algorithm [3] to us. We thank Josiah Manson for pointing out that spoke darts oversample the center and we might get a better answer by uniform sampling. We thank Vijay Natarajan for suggesting random chord sampling. The authors are grateful to Brian Adams, Keith Dalbey, and Vicente Romero for useful technical discussions. This work was sponsored by the Laboratory Directed Research and Development (LDRD) Program at Sandia National Laboratories. This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research (ASCR), Applied Mathematics Program. Sandia National Laboratories is a multi-mission laboratory managed and operated by National Technology and Engineering Solutions of Sandia, LLC., a wholly owned subsidiary of Honeywell International, Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Preserving correlations between trajectories for efficient path sampling

Importance sampling of trajectories has proved a uniquely successful strategy for exploring rare dynamical behaviors of complex systems in an unbiased way. Carrying out this sampling, however, requires an ability to propose changes to dynamical pathways that are substantial, yet sufficiently modest to obtain reasonable acceptance rates. Satisfying this requirement becomes very challenging in the case of long trajectories, due to the characteristic divergences of chaotic dynamics. Here, we examine schemes for addressing this problem, which engineer correlation between a trial trajectory and its reference path, for instance using artificial forces. Our analysis is facilitated by a modern perspective on Markov chain Monte Carlo sampling, inspired by non-equilibrium statistical mechanics, which clarifies the types of sampling strategies that can scale to long trajectories. Viewed in this light, the most promising such strategy guides a trial trajectory by manipulating the sequence of random numbers that advance its stochastic time evolution, as done in a handful of existing methods. In cases where this “noise guidance” synchronizes trajectories effectively, as the Glauber dynamics of a two-dimensional Ising model, we show that efficient path sampling can be achieved for even very long trajectories.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Multigroup Scattering in Monte Carlo Radiation Transport Codes [Slides]

Legendre truncations to multigroup scattering distributions are not amenable to Monte Carlo sampling due to negative values. We have implemented two moment-preserving methods in MGMC that capture the shape of the truncation, are non-negative over [-1, 1], and can be efficiently sampled on CPUs and GPUs. MGMC can now simulate neutrons with anisotropic scattering mechanics and MGMC shows good agreement with LANL production codes PARTISN.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2014

Exploring theory space with Monte Carlo reweighting

Theories of new physics often involve a large number of unknown parameters which need to be scanned. Additionally, a putative signal in a particular channel may be due to a variety of distinct models of new physics. This makes experimental attempts to constrain the parameter space of motivated new physics models with a high degree of generality quite challenging. We describe how the reweighting of events may allow this challenge to be met, as fully simulated Monte Carlo samples generated for arbitrary benchmark models can be effectively re-used. Specifically, we suggest procedures that allow more efficient collaboration between theorists and experimentalists in exploring large theory parameter spaces in a rigorous way at the LHC.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

An adaptive Kriging surrogate method for efficient uncertainty quantification with an application to geological carbon sequestration modeling

We present that in numerical modeling of geological carbon sequestration (GCS), uncertainty quantification (UQ) is usually needed to evaluate the impact of uncertain model parameters on model predictions caused by limited measurements and incomplete knowledge of the parameters. However, UQ for GCS is computationally expensive due to the large ensemble of complex and lengthy model simulations. In this study, we propose an adaptive Kriging method to build a fast-to-evaluate surrogate of the GCS model to alleviate the heavy computational burden. The surrogate model is efficiently generated using a Taylor expansion-based adaptive experimental design algorithm that combines a distance-based exploration criterion and an exploitation criterion to adaptively search for informative training samples. In addition, we analyze the uncertainty brought by substituting the surrogate for the actual simulation model and explore its influence on UQ results. Lastly, our method is demonstrated in a synthetic GCS model and its performance is evaluated in comparison with the conventional Monte Carlo sampling. Results indicate that our method can greatly improve the computational efficiency in UQ and provide an effective and reliable UQ solution with the consideration of surrogate uncertainty.

58 GEOSCIENCES↗
NASA NTRS2014

Statistical Symbolic Execution with Informed Sampling

Symbolic execution techniques have been proposed recently for the probabilistic analysis of programs. These techniques seek to quantify the likelihood of reaching program events of interest, e.g., assert violations. They have many promising applications but have scalability issues due to high computational demand. To address this challenge, we propose a statistical symbolic execution technique that performs Monte Carlo sampling of the symbolic program paths and uses the obtained information for Bayesian estimation and hypothesis testing with respect to the probability of reaching the target events. To speed up the convergence of the statistical analysis, we propose Informed Sampling, an iterative symbolic execution that first explores the paths that have high statistical significance, prunes them from the state space and guides the execution towards less likely paths. The technique combines Bayesian estimation with a partial exact analysis for the pruned paths leading to provably improved convergence of the statistical analysis. We have implemented statistical symbolic execution with in- formed sampling in the Symbolic PathFinder tool. We show experimentally that the informed sampling obtains more precise results and converges faster than a purely statistical analysis and may also be more efficient than an exact symbolic analysis. When the latter does not terminate symbolic execution with informed sampling can give meaningful results under the same time and memory limits.

Reliability↗
DOE OSTI2021

Exploration of multifidelity UQ sampling strategies for computer network applications.

Network modeling is a powerful tool to enable rapid analysis of complex systems that can be challenging to study directly using physical testing. Here, two approaches are considered: emulation and simulation. The former runs real software on virtualized hardware, while the latter mimics the behavior of network components and their interactions in software. Although emulation provides an accurate representation of physical networks, this approach alone cannot guarantee the characterization of the system under realistic operative conditions. Operative conditions for physical networks are often characterized by intrinsic variability (payload size, packet latency, etc.) or a lack of precise knowledge regarding the network configuration (bandwidth, delays, etc.); therefore uncertainty quantification (UQ) strategies should be also employed. UQ strategies require multiple evaluations of the system with a number of evaluation instances that roughly increases with the problem dimensionality, i.e., the number of uncertain parameters. It follows that a typical UQ workflow for network modeling based on emulation can easily become unattainable due to its prohibitive computational cost. In this paper, a multifidelity sampling approach is discussed and applied to network modeling problems. The main idea is to optimally fuse information coming from simulations, which are a low-fidelity version of the emulation problem of interest, in order to decrease the estimator variance. By reducing the estimator variance in a sampling approach it is usually possible to obtain more reliable statistics and therefore a more reliable system characterization. Several network problems of increasing difficulty are presented. For each of them, the performance of the multifidelity estimator is compared with respect to the single fidelity counterpart, namely, Monte Carlo sampling. For all the test problems studied in this work, the multifidelity estimator demonstrated an increased efficiency with respect to MC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Reducing the Cost of Energy Differences in Variational Monte Carlo with Spotlight Sampling

Here, we investigate an approximate sampling scheme that can significantly reduce the cost scaling of variational Monte Carlo when it is employed to predict the energy differences associated with local chemical changes. Inspired by side-chaining and embedding methods, this spotlight sampling approach adopts an approximate fragmented Hamiltonian and correlated sampling to reduce cost scaling to the point that it is essentially linear with system size, with the potential to go sublinear if certain conditions are met. In tests on bond stretching energies in alcohols, hydrogen dimer chains, and molecules with various degrees of π-system delocalization, we observe the anticipated linear scaling and an explicit cost crossover with standard variational Monte Carlo.

Bumann, Sonja [University of California, Berkeley,↗
DOE OSTI2016

Reconstruction of elongated bubbles fusing the information from multiple optical probes through a Bayesian inference technique

In this communication, a novel optical technique has been proposed for the reconstruction of the shape of a Taylor bubble using measurements from multiple arrays of optical sensors. The deviation of an optical beam passing through the bubble depends on the contour of bubble surface. A theoretical model of the deviation of a beam during the traverse of a Taylor bubble through it has been developed. Using this model and the time history of the deviation captured by the sensor array, the bubble shape has been reconstructed. The reconstruction has been performed using an inverse algorithm based on Bayesian inference technique and Markov chain Monte Carlo sampling algorithm. The reconstructed nose shape has been compared with the true shape, extracted through image processing of high speed images. Finally, an error analysis has been performed to pinpoint the sources of the errors.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

Photometric Objects around Cosmic Webs (PAC) Delineated in a Spectroscopic Survey. I. Methods

We provide a method for estimating the projected density distribution ${\bar{n}}_{2}{w}_{p}({r}_{p})$ of photometric objects around spectroscopic objects in a spectroscopic survey. This quantity describes the distribution of photometric sources with certain physical properties (e.g., luminosity, mass, and color) around cosmic webs (PAC) traced by the spectroscopic objects. The method can make full use of current and future deep and wide photometric surveys to explore the formation of galaxies up to medium redshift (z s < 2) 3 with the aid of cosmological spectroscopic surveys that sample only a fairly limited species of objects (e.g., emission line galaxies). As an example, we apply the PAC method to the CMASS spectroscopic and HSC-SSP PDR2 photometric samples to explore the distribution of galaxies for a wide range of stellar masses from 10 9.0 to 10 12.0 M ⊙ around massive galaxies at z s ≈ 0.6. Using the abundance-matching method, we model ${\bar{n}}_{2}{w}_{p}({r}_{p})$ in N-body simulation using Markov chain Monte Carlo sampling, and we accurately measure the stellar–halo mass relation and stellar mass function for the whole mass range. We can also measure the conditional stellar mass function of satellites for central galaxies of different mass. The PAC method has many potential applications for studying the evolution of galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

A compute-bound formulation of Galerkin model reduction for linear time-invariant dynamical systems

This work aims to advance computational methods for projection-based reduced-order models (ROMs) of linear time-invariant (LTI) dynamical systems. For such systems, current practice relies on ROM formulations expressing the state as a rank-1 tensor (i.e., a vector), leading to computational kernels that are memory bandwidth bound and, therefore, ill-suited for scalable performance on modern architectures. This weakness can be particularly limiting when tackling many-query studies, where one needs to run a large number of simulations. This work introduces a reformulation, called rank-2 Galerkin, of the Galerkin ROM for LTI dynamical systems which converts the nature of the ROM problem from memory bandwidth to compute bound. We present the details of the formulation and its implementation, and demonstrate its utility through numerical experiments using, as a test case, the simulation of elastic seismic shear waves in an axisymmetric domain. We quantify and analyze performance and scaling results for varying numbers of threads and problem sizes. In conclusion, we present an end-to-end demonstration of using the rank-2 Galerkin ROM for a Monte Carlo sampling study. We show that the rank-2 Galerkin ROM is one order of magnitude more efficient than the rank-1 Galerkin ROM (the current practice) and about 970 times more efficient than the full-order model, while maintaining accuracy in both the mean and statistics of the field.

97 MATHEMATICS AND COMPUTING↗