Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Variance reduction”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1972

Variance reduction in Monte Carlo analysis of rarefied gas diffusion

The present analysis uses the Monte Carlo method to solve the problem of rarefied diffusion between parallel walls. The diffusing molecules are evaporated or emitted from one of two parallel walls and diffused through another molecular species. The analysis treats the diffusing molecule as undergoing a Markov random walk and the local macroscopic properties are found as the expected value of the random variable, the random walk payoff. By biasing the transition probabilities and changing the collision payoffs the expected Markov walk payoff is retained but its variance is reduced so that the M. C. result has a much smaller error.

Perlmutter, M.↗
NASA NTRS1972

Variance reduction in Monte Carlo analysis of rarefied gas diffusion.

The problem of rarefied diffusion between parallel walls is solved using the Monte Carlo method. The diffusing molecules are evaporated or emitted from one of the two parallel walls and diffuse through another molecular species. The Monte Carlo analysis treats the diffusing molecule as undergoing a Markov random walk, and the local macroscopic properties are found as the expected value of the random variable, the random walk payoff. By biasing the transition probabilities and changing the collision payoffs, the expected Markov walk payoff is retained but its variance is reduced so that the Monte Carlo result has a much smaller error.

Perlmutter, M.↗
DOE OSTI2025

Automated Hybrid Variance Reduction on Advanced Architectures in the Shift Monte Carlo Code

Monte Carlo transport methods are the most accurate schemes for solving problems with complex energy and spatial features, but they come with a high computational cost. Although hybrid methods have enabled the use of Monte Carlo transport for a large class of problems, they still require significant computing resources. Modern multicore CPUs with large numbers of compute cores and graphical processing units (GPUs) provide opportunities to optimize the memory and run-time costs of hybrid Monte Carlo methods. This paper documents the development and analysis of three Monte Carlo transport algorithms that support hybrid transport using the consistent adjoint-driven importance sampling (CADIS) and forward-weighted CADIS methods in the Shift Monte Carlo code: history-based transport using static and dynamic threading on multicore CPUs and event-based transport enabling weight window tracking on GPUs. The results are shown for two challenging hybrid problems on the Frontier supercomputer at the Oak Ridge Leadership Computing Facility. The results show that all three methods yield good performance and enable solutions of difficult fixed-source transport problems in less than 2 min on 20 nodes of Frontier. Dynamic threading was observed to give up to 20% better scaling behavior than static threading. Moreover, the AMD Instinct 250X GPU was found to give 9 to 11 times greater throughput per graphics compute die than the best CPU performance. In conclusion, additional opportunities for optimization of hybrid transport on GPUs are discussed.

Denovo↗
DOE OSTI2023

Variance Reduction within Implicit Monte Carlo Thermal Radiation Transport using the Local Importance Function Transform [Slides]

System of equations derived by Fleck and Cummings to model time-dependent thermal radiative transfer (TRT) problems: Solution of radiation specific intensity (I), non-linearly coupled to material internal energy (U); Absorption and re-emission approximated by effective scattering events. Useful for high-energy density physics simulations: i.e., astrophysics, inertial confinement fusion (ICF). Whereas deterministic methods are fully discretized and free of statistical noise, Monte Carlo methods allow for dynamic sampling of the phase space at the price of statistical noise; Monte Carlo methods are also characterized by a slow $\frac{1}{√Ν}$ convergence rate.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1973

Monte-Carlo analysis of rarefied-gas diffusion including variance reduction using the theory of Markov random walks

Molecular diffusion through a rarefied gas is analyzed by using the theory of Markov random walks. The Markov walk is simulated on the computer by using random numbers to find the new states from the appropriate transition probabilities. As the sample molecule during its random walk passes a scoring position, which is a location at which the macroscopic diffusing flow variables such as molecular flux and molecular density are desired, an appropriate payoff is scored. The payoff is a function of the sample molecule velocity. For example, in obtaining the molecular flux across a scoring position, the random walk payoff is the net number of times the scoring position has been crossed in the positive direction. Similarly, when the molecular density is required, the payoff is the sum of the inverse velocity of the sample molecule passing the scoring position. The macroscopic diffusing flow variables are then found from the expected payoff of the random walks.

Perlmutter, M.↗
NASA NTRS1975

Monte Carlo variance reduction study

A mathematical analysis of the transport of nuclear radiation through matter is presented. A computer test bed that was developed is shown, along with flow charts.

Byrn, N. R.↗
DOE OSTI2024

Moment Tensor Inversion Toolkit

The MTINV toolkit (2002-present) is a collection of computer codes and applications written to invert for the moment tensor of a seismic source given the three components of ground motion recorded at regional seismic stations (e.g., Ichinose et al., 2003). The computer codes and workflow are organized to generate moment tensor solutions for a range of source depths and origin times because of the trade-off between these two quantities. The metric used is the variance reduction and variance reduction modulated by the percent double-couple to determine the best-fit moment-tensor solution. We can solve for a deviatoric moment tensor with a constraint added for no isotropic component although this constraint can be lifted for estimating the full moment tensor like mining collapses or explosion sources.

Ichinose, GeneA↗
DOE OSTI2022

Ensemble approximate control variate estimators: Applications to multi-fidelity importance sampling.

The recent growth in multifidelity uncertainty quantification has given rise to a large set of variance reduction techniques that leverage information from model ensembles to provide variance reduction for estimates of the statistics of a high-fidelity model. In this paper we provide two contributions: (1) we utilize an ensemble estimator to account for uncertainties in the optimal weights of approximate control variate (ACV) approaches and derive lower bounds on the number of samples required to guarantee variance reduction; and (2) we extend an existing multifidelity importance sampling (MFIS) scheme to leverage control variates. Our approach directly addresses a limitation of many multifidelity sampling strategies that require the usage of pilot samples to estimate covariances. As such we make significant progress towards both increasing the practicality of approximate control variates—for instance, by accounting for the effect of pilot samples—and using multifidelity approaches more effectively for estimating low-probability events. The numerical results indicate our hybrid MFIS-ACV estimator achieves up to 50% improvement in variance reduction over the existing state-of-the-art MFIS estimator, which had already shown an outstanding convergence rate compared to the Monte Carlo method, on several problems of computational mechanics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A generalized approximate control variate framework for multifidelity uncertainty quantification

We describe and analyze a variance reduction approach for Monte Carlo (MC) sampling that accelerates the estimation of statistics of computationally expensive simulation models using an ensemble of models with lower cost. These lower cost models — which are typically lower fidelity with unknown statistics — are used to reduce the variance in statistical estimators relative to a MC estimator with equivalent cost. We derive the conditions under which our proposed approximate control variate framework recovers existing multifidelity variance reduction schemes as special cases. We demonstrate that existing recursive/nested strategies are suboptimal because they use the additional low-fidelity models only to efficiently estimate the unknown mean of the first low-fidelity model. As a result, they cannot achieve variance reduction beyond that of a control variate estimator that uses a single low-fidelity model with known mean. However, there often exists about an order-of-magnitude gap between the maximum achievable variance reduction using all low-fidelity models and that achieved by a single low-fidelity model with known mean. We show that our proposed approach can exploit this gap to achieve greater variance reduction by using non-recursive sampling schemes. The proposed strategy reduces the total cost of accurately estimating statistics, especially in cases where only low-fidelity simulation models are accessible for additional evaluations. Several analytic examples and an example with a hyperbolic PDE describing elastic wave propagation in heterogeneous media are used to illustrate the main features of the methodology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Optimizing foreground mitigation for CMB lensing with combined multifrequency and geometric methods

Here, a key challenge for current and upcoming cosmic microwave background lensing measurements is their sensitivity to biases from extragalactic foregrounds, such as Sunyaev-Zel'dovich signals or cosmic infrared background emission. Several methods have been developed to mitigate these lensing foreground biases, dividing broadly into multifrequency cleaning approaches and modifications to the estimator geometry, but how to optimally combine these methods has not yet been explored in detail. In this paper, we examine which combination of lensing foreground mitigation strategies is best able to reduce the impact of foreground contamination for a Simons Observatory-like experiment while preserving maximal signal-to-noise. Although the optimal combination obtained depends on whether bias reduction or variance reduction is prioritized and on whether polarization data is used, generally, we find that combinations involving both geometric (profile hardening, source hardening, or shear) and multifrequency (symmetric cleaning) methods perform best. For lensing power spectrum measurements from temperature (polarization and temperature), our combined estimator methods are able to reduce the bias below σ/4 or 0.3% (0.1%), a factor of 16 (30) lower than the standard quadratic estimator bias, at a modest signal-to-noise cost of only 18% (12%). In contrast, single-method foreground-mitigation approaches struggle to reduce the bias to a negligible level below σ/2 without incurring a large noise penalty. For upcoming and current experiments, our combined methods therefore represent a promising approach for making lensing measurements with negligible foreground bias.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Quasi-Stochastic Approximation and Off-Policy Reinforcement Learning: Preprint

The Robbins-Monro stochastic approximation algorithm is a foundation of many algorithmic frameworks for reinforcement learning and often an efficient approach to solving (or approximating the solution to) complex optimal control problems. In many cases, however, practitioners are unable to apply these techniques because of an inherent high variance. This paper aims to provide a general foundation for 'quasi-stochastic approximation,' in which all of the processes under consideration are deterministic, much like quasi-Monte Carlo for variance reduction in simulation. The variance reduction can be substantial, subject to tuning of pertinent parameters in the algorithm. This paper introduces a new coupling argument to establish the optimal rate of convergence provided the gain is sufficiently large. These results are established for linear models and tested also in nonideal settings. A major application of these general results is a new class of reinforcement learning algorithms for deterministic state space models. In this setting, the main contribution is a class of algorithms for approximating the value function for a given policy, using a different policy designed to introduce exploration.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

A Proof of the Asymptotic Variance of Path Length Estimators for Single-Collision Monte Carlo Source Iteration in the Thick Diffusion Limit

Here, we prove a theorem relating the variance of path length estimators for single-collision Monte Carlo source iteration to a parameter that becomes infinitesimally small in an important physical regime arising in radiative transfer. In our usage, “single-collision Monte Carlo source iteration” refers to Monte Carlo Boltzmann transport methods in which each Monte Carlo particle history includes no more than a single collision, and the physics of multiple scattering is modeled by lagging the scattering source term and iterating until this term converges. Our theorem can be used to construct variance reduction techniques which improve the order of the estimator variance. This enables calculations that would otherwise require impractically large sample sizes to achieve practical estimator uncertainties. We believe this is the first postulation of a theorem relating estimator variance to a limiting case parameter for single-collision Monte Carlo source iteration, and the first proof of such a theorem. We illustrate the theorem’s value with an example in which the authors of a transport method used the theorem to design a variance reduction technique that improved the uncertainty of their solution by a factor of about 500 for a proxy problem from radiative transfer that contains both optically-thick and optically-thin material.

Mathematics and Computing↗
DOE OSTI2020

HFIRCON Version 1.0.5 User Guide

The High Flux Isotope Reactor (HFIR) Controller (HFIRCON) code is a collection of python routines and C plugins that automate the workflow for fuel and single- or multicycle target depletion analyses for HFIR at Oak Ridge National Laboratory (ORNL). This code calls the LAVAMINT (LAVA Model Interrogator) parallel (MCNP) Monte Carlo N-Particle model interrogator to stochastically calculate cell volumes and bounding boxes, the ADVANTG (Automatic Variance Reduction Generation) code package for all variance reduction and source biasing calculations, the ORNL-Transformative Neutronics/MCNP5 transport solver for all transport solutions, and the MSX_DEPLETE module to perform all depletion calculations via the ORIGEN (Oak Ridge Isotope Generation) application programming interface. It also performs a robust set of postprocessing functions to automatically provide summaries of several key metrics that are common to a wide variety of typical HFIR design and safety-basis analyses.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Radiation Dose Modeling for Niowave’s Accelerator Driven Uranium Target Assembly 3

Molybdenum-99 is a high-value radionuclide commonly used for medical purposes within the United States. The National Nuclear Security Administration (NNSA) seeks to reliably produce the radioisotope 99 Mo without the use of highly enriched uranium. NNSA’s Office of Material Management and Minimization (M3) provides funding and government laboratory expertise to private companies to expedite the production process domestically and currently funds designs that use low-enriched uranium or other 99 Mo production pathways. Several production designs are being explored across the industry, including uranium fission and photonuclear conversion of 100 Mo targets. Niowave Inc. seeks to produce 99 Mo via a high-energy electron accelerator that strikes a lead-bismuth eutectic target that ultimately produces a consistent neutron flux. The neutron flux then interacts in a subcritical reactor core configuration to produce fission in low-enriched or natural uranium targets. These fissionable targets are then processed to extract 99 Mo. The purpose of this work is to estimate the neutron and photon dose response across Niowave’s proposed facility for worker safety during operation. Owing to the size of the proposed Niowave facility and necessary shielding, unbiased Monte Carlo radiation transport is impractical, and variance reduction methods are required. This work focuses on the weight window variance reduction method to produce high confidence dose response results within a Monte Carlo radiation transport code. Specifically, an adjoint-informed weight window methodology was created to improve the dose response estimates for accelerator-driven subcritical reactor designs. This adjoint-informed methodology was implemented for Niowave’s proposed design and improved dose results at far-field locations across the facility. Acceptable dose rate contours for the proposed facility were generated across the facility and are presented in this work.

07 ISOTOPE AND RADIATION SOURCES↗