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 163 records · Page 9

MC21 analysis of the MIT PWR benchmark: Hot zero power results

MC21 Monte Carlo results have been compared with hot zero power measurements from an operating pressurized water reactor (PWR), as specified in a new full core PWR performance benchmark from the MIT Computational Reactor Physics Group. Included in the comparisons are axially integrated full core detector measurements, axial detector profiles, control rod bank worths, and temperature coefficients. Power depressions from grid spacers are seen clearly in the MC21 results. Application of Coarse Mesh Finite Difference (CMFD) acceleration within MC21 has been accomplished, resulting in a significant reduction of inactive batches necessary to converge the fission source. CMFD acceleration has also been shown to work seamlessly with the Uniform Fission Site (UFS) variance reduction method. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Techniques to improve the accuracy of noise power spectrum measurements in digital x-ray imaging based on background trends removal

Purpose: Noise characterization through estimation of the noise power spectrum (NPS) is a central component of the evaluation of digital x-ray systems. Extensive works have been conducted to achieve accurate and precise measurement of NPS. One approach to improve the accuracy of the NPS measurement is to reduce the statistical variance of the NPS results by involving more data samples. However, this method is based on the assumption that the noise in a radiographic image is arising from stochastic processes. In the practical data, the artifactuals always superimpose on the stochastic noise as low-frequency background trends and prevent us from achieving accurate NPS. The purpose of this study was to investigate an appropriate background detrending technique to improve the accuracy of NPS estimation for digital x-ray systems. Methods: In order to achieve the optimal background detrending technique for NPS estimate, four methods for artifactuals removal were quantitatively studied and compared: (1) Subtraction of a low-pass-filtered version of the image, (2) subtraction of a 2-D first-order fit to the image, (3) subtraction of a 2-D second-order polynomial fit to the image, and (4) subtracting two uniform exposure images. In addition, background trend removal was separately applied within original region of interest or its partitioned sub-blocks for all four methods. The performance of background detrending techniques was compared according to the statistical variance of the NPS results and low-frequency systematic rise suppression. Results: Among four methods, subtraction of a 2-D second-order polynomial fit to the image was most effective in low-frequency systematic rise suppression and variances reduction for NPS estimate according to the authors' digital x-ray system. Subtraction of a low-pass-filtered version of the image led to NPS variance increment above low-frequency components because of the side lobe effects of frequency response of the boxcar filtering function. Subtracting two uniform exposure images obtained the worst result on the smoothness of NPS curve, although it was effective in low-frequency systematic rise suppression. Subtraction of a 2-D first-order fit to the image was also identified effective for background detrending, but it was worse than subtraction of a 2-D second-order polynomial fit to the image according to the authors' digital x-ray system. Conclusions: As a result of this study, the authors verified that it is necessary and feasible to get better NPS estimate by appropriate background trend removal. Subtraction of a 2-D second-order polynomial fit to the image was the most appropriate technique for background detrending without consideration of processing time.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Accelerated Sensitivity Analysis in High-Dimensional Stochastic Reaction Networks

Existing sensitivity analysis approaches are not able to handle efficiently stochastic reaction networks with a large number of parameters and species, which are typical in the modeling and simulation of complex biochemical phenomena. In this paper, a two-step strategy for parametric sensitivity analysis for such systems is proposed, exploiting advantages and synergies between two recently proposed sensitivity analysis methodologies for stochastic dynamics. The first method performs sensitivity analysis of the stochastic dynamics by means of the Fisher Information Matrix on the underlying distribution of the trajectories; the second method is a reduced-variance, finite-difference, gradient-type sensitivity approach relying on stochastic coupling techniques for variance reduction. Here in this paper we demonstrate that these two methods can be combined and deployed together by means of a new sensitivity bound which incorporates the variance of the quantity of interest as well as the Fisher Information Matrix estimated from the first method. The first step of the proposed strategy labels sensitivities using the bound and screens out the insensitive parameters in a controlled manner. In the second step of the proposed strategy, a finite-difference method is applied only for the sensitivity estimation of the (potentially) sensitive parameters that have not been screened out in the first step. Results on an epidermal growth factor network with fifty parameters and on a protein homeostasis with eighty parameters demonstrate that the proposed strategy is able to quickly discover and discard the insensitive parameters and in the remaining potentially sensitive parameters it accurately estimates the sensitivities. The new sensitivity strategy can be several times faster than current state-of-the-art approaches that test all parameters, especially in “sloppy” systems. In particular, the computational acceleration is quantified by the ratio between the total number of parameters over the number of the sensitive parameters.

97 MATHEMATICS AND COMPUTING↗

Long-Period Tidal Variations in the Length of Day

A new model of long-period tidal variations in length of day is developed. The model comprises 80 spectral lines with periods between 18.6 years and 4.7 days, and it consistently includes effects of mantle anelasticity and dynamic ocean tides for all lines. The anelastic properties followWahr and Bergen; experimental confirmation for their results now exists at the fortnightly period, but there remains uncertainty when extrapolating to the longest periods. The ocean modeling builds on recent work with the fortnightly constituent, which suggests that oceanic tidal angular momentum can be reliably predicted at these periods without data assimilation. This is a critical property when modeling most long-period tides, for which little observational data exist. Dynamic ocean effects are quite pronounced at shortest periods as out-of-phase rotation components become nearly as large as in-phase components. The model is tested against a 20 year time series of space geodetic measurements of length of day. The current international standard model is shown to leave significant residual tidal energy, and the new model is found to mostly eliminate that energy, with especially large variance reduction for constituents Sa, Ssa, Mf, and Mt.

LOD tidal oscillations↗

GANISP (GAN-assisted Importance SPlitting)

Genealogical importance splitting marches towards a rare event by iteratively selecting and replicating realizations that are headed towards a rare event. The replication step is made difficult when applied to deterministic systems as the initial conditions of the offspring realizations need to be adjusted. Typically, a random perturbation is applied to the offspring. For some cases, this cloning technique may not be adequate and prevent variance reduction in the probability estimate. A GAN-based replication process is proposed to address this limitation. The perturbations applied to the clones are physically consistent instead of being randomly chosen. The proposed method allows reducing the variance in the probability estimation.

Hassanaly, Malik↗

Towards a Robust Sampling Approach: A Computational Review and Design

As pointed out in several other works, the estimation of the reliability of the electrical grid can not be conducted without the estimation of the stochastic phenomena of electicity demand and electricity production by variable renewable sources. Therefore, sampling procedures have become integral in the design of engineering structures and analysis. Commonly referred to as Monte Carlo uncertainty analysis or integration, the general objective of these procedures is to establish specifics about the uncertainty of an output characteristic of such an engineering system, given uncertainty about its input characteristics. These sampling procedures are applied in a context in which establishing such specifics cannot be performed through other means. Variance-reduction techniques are designed to lessen the variability among estimators to estimate statistics of those output uncertainties. Importance-sampling techniques, on the other hand, are designed to reduce the number of samples needed to estimate a particular statistic—e.g., a tail probability. The combination of these approaches can reduce the computational burden considerably for a particular estimator and statistic. Importance sampling—geared and designed as it is toward improving a particular estimator—suffers, unfortunately, from the unintended consequence of reducing the performance of other estimators in terms of their variance. The objective of this paper is to offer an alternative sampling procedure where this variance does not grow unacceptably large for a suite of estimators. Moreover, it is anticipated that, with additional knowledge of how an engineering output characteristic responds to its input characteristics, tuning parameters of the input’s sampling procedure can be set to improve the output characteristic’s estimation. This work proves the effectiveness of the suggested alternative approach. Such positive outcome will lead to a decrease of the computational burden of performing stochastic optimization of integrated energy systems (e.g., components dispatch, and portfolio composition). In particular, capturing the contribution to the overall system cost of rare and unlikely events and patterns of the electricity demand and production will become less computationally expensive. This is due to the fact that the approach demonstrated here will allow the sampling of those rare occurrences more frequently without misrepresenting their probabilistic impacts.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Likelihood-informed dimension reduction for nonlinear inverse problems

The intrinsic dimensionality of an inverse problem is affected by prior information, the accuracy and number of observations, and the smoothing properties of the forward operator. From a Bayesian perspective, changes from the prior to the posterior may, in many problems, be confined to a relatively low-dimensional subspace of the parameter space. We present a dimension reduction approach that defines and identifies such a subspace, called the 'likelihood-informed subspace' (LIS), by characterizing the relative influences of the prior and the likelihood over the support of the posterior distribution. This identification enables new and more efficient computational methods for Bayesian inference with nonlinear forward models and Gaussian priors. In particular, we approximate the posterior distribution as the product of a lower-dimensional posterior defined on the LIS and the prior distribution marginalized onto the complementary subspace. Markov chain Monte Carlo sampling can then proceed in lower dimensions, with significant gains in computational efficiency. We also introduce a Rao–Blackwellization strategy that de-randomizes Monte Carlo estimates of posterior expectations for additional variance reduction. We demonstrate the efficiency of our methods using two numerical examples: inference of permeability in a groundwater system governed by an elliptic PDE, and an atmospheric remote sensing problem based on Global Ozone Monitoring System (GOMOS) observations.

42 ENGINEERING↗

Physics-Informed Active Learning With Simultaneous Weak-Form Latent Space Dynamics Identification

The parametric greedy latent space dynamics identification (gLaSDI) framework has demonstrated promising potential for accurate and efficient modeling of high-dimensional nonlinear physical systems. However, it remains challenging to handle noisy data. Here, to enhance robustness against noise, we incorporate the weak-form estimation of nonlinear dynamics (WENDy) into gLaSDI. In the proposed weak-form gLaSDI (WgLaSDI) framework, an autoencoder and WENDy are trained simultaneously to discover intrinsic nonlinear latent-space dynamics of high-dimensional data. Compared with the standard sparse identification of nonlinear dynamics (SINDy) employed in gLaSDI, WENDy enables variance reduction and robust latent space discovery, therefore leading to more accurate and efficient reduced-order modeling. Furthermore, the greedy physics-informed active learning in WgLaSDI enables adaptive sampling of optimal training data on the fly for enhanced modeling accuracy. The effectiveness of the proposed framework is demonstrated by modeling various nonlinear dynamical problems, including viscous and inviscid Burgers' equations, time-dependent radial advection, and the Vlasov equation for plasma physics. With data that contains 5%–10% Gaussian white noise, WgLaSDI outperforms gLaSDI by orders of magnitude, achieving 1%–7% relative errors. Compared with the high-fidelity models, WgLaSDI achieves 121 to 1779x speed-up.

97 MATHEMATICS AND COMPUTING↗

Dispersion-enhanced sequential batch sampling for adaptive contour estimation

In computer simulation and optimal design, sequential batch sampling offers an appealing way to iteratively stipulate optimal sampling points based upon existing selections and efficiently construct surrogate modeling. Nonetheless, the issue of near duplicates poses tremendous quandary for sequential learning. It refers to the situation that selected critical points cluster together in each sampling batch, which are individually but not collectively informative towards the optimal design. Near duplicates severely diminish the computational efficiency as they barely contribute extra information towards update of the surrogate. To address this issue, we impose a dispersion criterion on concurrent selection of sampling points, which essentially forces a sparse distribution of critical points in each batch, and demonstrate the effectiveness of this approach in adaptive contour estimation. Specifically, we adopt Gaussian process surrogate to emulate the simulator, acquire variance reduction of the critical region from new sampling points as a dispersion criterion, and combine it with the modified expected improvement (EI) function for critical batch selection. The critical region here is the proximity of the contour of interest. This proposed approach is vindicated in numerical examples of a two-dimensional four-branch function, a four-dimensional function with a disjoint contour of interest and a time-delay dynamic system.

97 MATHEMATICS AND COMPUTING↗

Modeling rarefied gas chemistry with QuiPS, a novel quasi-particle method

The goal of this work is to build up the capability of quasi-particle simulation (QuiPS), a novel flow solver, such that it can adequately model the rarefied portion of an atmospheric reentry trajectory. Direct simulation Monte Carlo (DSMC) is the conventional solver for such conditions, but struggles to resolve transient flows, trace species, and high-level internal energy states due to stochastic noise. Quasi-particle simulation (QuiPS) is a novel Boltzmann solver that describes a system with a discretized, truncated velocity distribution function. The resulting fixed-velocity, variable weight quasi-particles enable smooth variation of macroscopic properties. The distribution function description enables the use of a variance-reduced collision model, greatly minimizing expense near equilibrium. This work presents the addition of a neutral air chemistry model to QuiPS and some demonstrative 0D simulations. The explicit representation of internal distributions in QuiPS reveals some of the flaws in existing physics models. Overall, variance reduction, a key feature of QuiPS, can greatly reduce expense of multi-dimensional calculations, but is only cheaper when the gas composition is near chemical equilibrium.

42 ENGINEERING↗

Dose Maps In/Around Target and Test Cell for DONES During the Operation

DONES (DEMO-Oriented Neutron Source) is to be constructed in order to investigate materials that are intended to be used for DEMO (DEMOnstration Power Plant) since they will be irradiated with very high fluxes of neutrons. A deuteron beam will bombard a lithium target situated in the so called Test Cell (TC) shielded with concrete. Monte Carlo simulations by means of the MCNP (Monte Carlo N-Particle) code were carried out to calculate both horizontal and vertical radiation dose maps in and around of the TC facility. Three geometrical configurations of the shielding and two kinds of concrete (ordinary and magnetite ones) were examined. For each case a spatial dose distribution and an accompanying errors map were provided. Advanced techniques of variance reduction were applied to compute doses in and outside of thick concrete walls. On the grounds of the obtained results a final configuration of the shielding was selected.

07 ISOTOPE AND RADIATION SOURCES↗

Weak-form latent space dynamics identification

Recent work in data-driven modeling has demonstrated that a weak formulation of model equations enhances the noise robustness of a wide range of computational methods. In this paper, we demonstrate the power of the weak form to enhance the LaSDI (Latent Space Dynamics Identification) algorithm, a recently developed data-driven reduced order modeling technique. We introduce a weak form-based version WLaSDI (Weak-form Latent Space Dynamics Identification). WLaSDI first compresses data, then projects onto the test functions and learns the local latent space models. Notably, WLaSDI demonstrates significantly enhanced robustness to noise. With WLaSDI, the local latent space is obtained using weak-form equation learning techniques. Compared to the standard sparse identification of nonlinear dynamics (SINDy) used in LaSDI, the variance reduction of the weak form guarantees a robust and precise latent space recovery, hence allowing for a fast, robust, and accurate simulation. We demonstrate the efficacy of WLaSDI vs. LaSDI on several common benchmark examples including viscid and inviscid Burgers', radial advection, and heat conduction. For instance, in the case of 1D inviscid Burgers' simulations with the addition of up to 100% Gaussian white noise, the relative error remains consistently below 6% for WLaSDI, while it can exceed 10,000% for LaSDI. Similarly, for radial advection simulations, the relative errors stay below 15% for WLaSDI, in stark contrast to the potential errors of up to 10,000% with LaSDI. Moreover, speedups of several orders of magnitude can be obtained with WLaSDI. For example applying WLaSDI to 1D Burgers' yields a 140X speedup compared to the corresponding full order model.

97 MATHEMATICS AND COMPUTING↗

Shutdown dose rate analysis with the Shift Monte Carlo radiation transport code and modular verification workflow

Calculation of the shutdown dose rate is crucial for safe fusion reactor operations. The Rigorous-two-step (R2S) method is a method that requires connected neutron transport, activation, and gamma transport. Shift has integrated variance reduction with a deterministic solver Denovo, supports multiple geometry formats, and is scalable. These features make it an attractive transport solver choice for an R2S workflow. An R2S workflow for the Shift Monte Carlo code is developed and compared to the existing Oak Ridge National Laboratory Shutdown Dose Rate Code Suite (ORCS) workflow. Also, a Python framework for integrating two R2S workflows is developed to mix and match each step in the R2S workflow for improved collaboration and verification experience. In this study, results show that the Shift-Denovo R2S workflow and the ORCS workflow calculate the shutdown dose rate of the ITER Shutdown Dose Rate benchmark problem with an average relative error of 2.285%.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An efficient, robust, domain-decomposition algorithm for particle Monte Carlo

A previously described algorithm [T.A. Brunner, T.J. Urbatsch, T.M. Evans, N.A. Gentile, Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo, Journal of Computational Physics 212 (2) (2006) 527-539] for doing domain decomposed particle Monte Carlo calculations in the context of thermal radiation transport has been improved. It has been extended to support cases where the number of particles in a time step are unknown at the beginning of the time step. This situation arises when various physical processes, such as neutron transport, can generate additional particles during the time step, or when particle splitting is used for variance reduction. Additionally, several race conditions that existed in the previous algorithm and could cause code hangs have been fixed. This new algorithm is believed to be robust against all race conditions. The parallel scalability of the new algorithm remains excellent.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An Extension of Implicit Monte Carlo Diffusion: Multigroup and The Difference Formulation

Implicit Monte Carlo (IMC) and Implicit Monte Carlo Diffusion (IMD) are approaches to the numerical solution of the equations of radiative transfer. IMD was previously derived and numerically tested on grey, or frequency-integrated problems. In this research, we extend Implicit Monte Carlo Diffusion (IMD) to account for frequency dependence, and we implement the difference formulation as a source manipulation variance reduction technique. We derive the relevant probability distributions and present the frequency dependent IMD algorithm, with and without the difference formulation. The IMD code with and without the difference formulation was tested using both grey and frequency dependent benchmark problems. The Su and Olson semi-analytic Marshak wave benchmark was used to demonstrate the validity of the code for grey problems. The Su and Olson semi-analytic picket fence benchmark was used for the frequency dependent problems. The frequency dependent IMD algorithm reproduces the results of both Su and Olson benchmark problems. Frequency group refinement studies indicate that the computational cost of refining the group structure is likely less than that of group refinement in deterministic solutions of the radiation diffusion methods. Our results show that applying the difference formulation to the IMD algorithm can result in an overall increase in the figure of merit for frequency dependent problems. However, the creation of negatively weighted particles from the difference formulation can cause significant numerical instabilities in regions of the problem with sharp spatial gradients in the solution. An adaptive implementation of the difference formulation may be necessary to focus its use in regions that are at or near thermal equilibrium.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Energy and momentum preserving Coulomb collision model for kinetic Monte Carlo simulations of plasma steady states in toroidal fusion devices

A kinetic Monte Carlo model suited for self-consistent transport studies is proposed and tested. The Monte Carlo collision operator is based on a widely used model of Coulomb scattering by a drifting Maxwellian and a new algorithm enforcing the momentum and energy conservation laws. The difference to other approaches consists in a specific procedure of calculating the background Maxwellian parameters, which does not require ensemble averaging and, therefore, allows for the use of single-particle algorithms. This possibility is useful in transport balance (steady state) problems with a phenomenological diffusive ansatz for the turbulent transport, because it allows a direct use of variance reduction methods well suited for single particle algorithms. In addition, a method for the self-consistent calculation of the electric field is discussed. Results of testing of the new collision operator using a set of 1D examples, and preliminary results of 2D modelling in realistic tokamak geometry, are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Implementation, capabilities, and benchmarking of Shift, a massively parallel Monte Carlo radiation transport code

This paper discusses the implementation, capabilities, and validation of Shift, a massively parallel Monte Carlo radiation transport package developed and maintained at Oak Ridge National Laboratory. It has been developed to scale well from laptop to small computing clusters to advanced supercomputers. Special features of Shift include hybrid capabilities for variance reduction such as CADIS and FW-CADIS, and advanced parallel decomposition and tally methods optimized for scalability on supercomputing architectures. Shift has been validated and verified against various reactor physics benchmarks and compares well to other state-of-the-art Monte Carlo radiation transport codes such as MCNP5, CE KENO-VI, and OpenMC. Some specific benchmarks used for verification and validation include the CASL VERA criticality test suite and several Westinghouse AP1000 ® problems. These benchmark and scaling studies show promising results.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A low-rank control variate for multilevel Monte Carlo simulation of high-dimensional uncertain systems

Multilevel Monte Carlo (MLMC) is a recently proposed variation of Monte Carlo (MC) simulation that achieves variance reduction by simulating the governing equations on a series of spatial (or temporal) grids with increasing resolution. Instead of directly employing the fine grid solutions, MLMC estimates the expectation of the quantity of interest from the coarsest grid solutions as well as differences between each two consecutive grid solutions. When the differences corresponding to finer grids become smaller, hence less variable, fewer MC realizations of finer grid solutions are needed to compute the difference expectations, thus leading to a reduction in the overall work. Here this paper presents an extension of MLMC, referred to as multilevel control variates (MLCV), where a low-rank approximation to the solution on each grid, obtained primarily based on coarser grid solutions, is used as a control variate for estimating the expectations involved in MLMC. Cost estimates as well as numerical examples are presented to demonstrate the advantage of this new MLCV approach over the standard MLMC when the solution of interest admits a low-rank approximation and the cost of simulating finer grids grows fast.

97 MATHEMATICS AND COMPUTING↗