Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stochastic methods”

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
DOE OSTI2013

Monte Carlo solution for uncertainty propagation in particle transport with a stochastic Galerkin method

The stochastic Galerkin method (SGM) is an intrusive technique for propagating data uncertainty in physical models. The method reduces the random model to a system of coupled deterministic equations for the moments of stochastic spectral expansions of result quantities. We investigate solving these equations using the Monte Carlo technique. We compare the efficiency with brute-force Monte Carlo evaluation of uncertainty, the non-intrusive stochastic collocation method (SCM), and an intrusive Monte Carlo implementation of the stochastic collocation method. We also describe the stability limitations of our SGM implementation. (authors)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Preservation of physical properties of stochastic Maxwell equations with additive noise via stochastic multi-symplectic methods

Stochastic Maxwell equations with additive noise are a system of stochastic Hamiltonian partial differential equations intrinsically, possessing the stochastic multi-symplectic conservation law. It is shown that the averaged energy increases linearly with respect to the evolution of time and the flow of stochastic Maxwell equations with additive noise preserves the divergence in the sense of expectation. Moreover, we propose three novel stochastic multi-symplectic methods to discretize stochastic Maxwell equations in order to investigate the preservation of these properties numerically. We make theoretical discussions and comparisons on all of the three methods to observe that all of them preserve the corresponding discrete version of the averaged divergence. Meanwhile, we obtain the corresponding dissipative property of the discrete averaged energy satisfied by each method. Especially, the evolution rates of the averaged energies for all of the three methods are derived which are in accordance with the continuous case. Numerical experiments are performed to verify our theoretical results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Adaptive Sampling-Based Bi-Fidelity Stochastic Trust Region Method for Stochastic Derivative-Free Optimization

Bi-fidelity stochastic optimization has gained increasing attention as an efficient approach to reduce computational costs by leveraging a low-fidelity (LF) model to optimize an expensive high-fidelity (HF) objective. In this paper, we propose ASTRO-BFDF, an adaptive sampling trust-region method specifically designed for unconstrained bi-fidelity stochastic derivative-free optimization problems. In ASTRO-BFDF, the LF function serves two purposes: (i) to identify better iterates for the HF function when the optimization process indicates a high correlation between them and (ii) to reduce the variance of the HF function estimates using bi-fidelity Monte Carlo (BFMC). The algorithm dynamically determines sample sizes while adaptively choosing between crude Monte Carlo and BFMC to balance the trade-off between optimization and sampling errors. We prove that the iterates generated by ASTRO-BFDF converge to a first-order stationary point almost surely. Additionally, we demonstrate the effectiveness of the proposed algorithm through numerical experiments on synthetic benchmarks and simulation optimization problems involving discrete event systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Stochastic Galerkin methods for the steady-state Navier–Stokes equations

We study the steady-state Navier–Stokes equations in the context of stochastic finite element discretizations. Specifically, we assume that the viscosity is a random field given in the form of a generalized polynomial chaos expansion. For the resulting stochastic problem, we formulate the model and linearization schemes using Picard and Newton iterations in the framework of the stochastic Galerkin method, and we explore properties of the resulting stochastic solutions. We also propose a preconditioner for solving the linear systems of equations arising at each step of the stochastic (Galerkin) nonlinear iteration and demonstrate its effectiveness for solving a set of benchmark problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Switch Opening and Exchange Method for Stochastic Distribution Network Reconfiguration

The purpose of distribution network reconfiguration (DNR) is to determine the optimal topology of an electricity distribution network, which is an efficient measure to reduce network power losses. Electricity load demand and photovoltaic (PV) output are uncertain and vary with time of day, and will affect the optimal network topology. Single-hour deterministic DNR is incapable of handling this uncertainty and variability. Therefore, this paper proposes to solve a multi-hour stochastic DNR (SDNR). Existing solution methods for DNR are either inaccurate or excessively time-consuming, and are therefore incapable of solving multi-hour SDNRs for large distribution networks. In this regard, a switch opening and exchange (SOE) method is proposed. Starting from a looped network with all switches closed, the SOE consists of three steps. The first step is to sequentially open the switches until all of the loops are opened. The second and third steps modify the status of branches obtained in the first step to obtain better radial topologies. Five test systems are used to validate the accuracy and fast solution speed of the SOE and the superiority of multi-hour SDNR over single-hour deterministic DNR.

distribution network reconfiguration↗
DOE OSTI2012

An Adaptive Wavelet Stochastic Collocation Method for Irregular Solutions of Stochastic Partial Differential Equations

Accurate predictive simulations of complex real world applications require numerical approximations to first, oppose the curse of dimensionality and second, converge quickly in the presence of steep gradients, sharp transitions, bifurcations or finite discontinuities in high-dimensional parameter spaces. In this paper we present a novel multi-dimensional multi-resolution adaptive (MdMrA) sparse grid stochastic collocation method, that utilizes hierarchical multiscale piecewise Riesz basis functions constructed from interpolating wavelets. The basis for our non-intrusive method forms a stable multiscale splitting and thus, optimal adaptation is achieved. Error estimates and numerical examples will used to compare the efficiency of the method with several other techniques.

adaptive sparse grids↗
DOE OSTI2017

DYNAMIC PRA OF A MULTI-UNIT PLANT

Dynamic Probabilistic Risk Analysis (PRA) methods couple stochastic methods (e.g., RAVEN, ADAPT, ADS, MCDET) with safety analysis codes (RELAP5-3D, MELCOR, MAAP) to determine risk associated to complex systems such as nuclear plants. Compared to classical PRA methods, which are based on static logic structures (e.g., Event-Trees, Fault-Trees), they can evaluate with higher resolution the safety impact of timing and sequencing of events on the accident progression. Recently, special attention has been given to nuclear plants which consist of multiple units and, in particular, on the safety impact of system dependencies, shared systems and common resources on core damage frequencies. In the literature, while classical PRA methods have been employed to model multi-unit plants, Dynamic PRA methods have never been applied to analyze a full multi-unit model. This paper presents a PRA analysis of a multi-unit plant using Dynamic PRA methods. We employ RAVEN as stochastic method coupled with RELAP5-3D. The plant under consideration consists of the three units and their associated spent fuel pools (SFPs). The studied initiating event is a seismic induced station blackout event. We will describe in detail how the multi-unit plant has been constructed and, in particular, how unit dependencies and shared resources are modeled.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

A stochastic perturbation method to generate inflow turbulence in large-eddy simulation models: Application to neutrally stratified atmospheric boundary layers

Despite the variety of existing methods, efficient generation of turbulent inflow conditions for large-eddy simulation (LES) models remains a challenging and active research area. Herein, we extend our previous research on the cell perturbation method, which uses a novel stochastic approach based upon finite amplitude perturbations of the potential temperature field applied within a region near the inflow boundaries of the LES domain [Muñoz-Esparza et al., “Bridging the transition from mesoscale to microscale turbulence in numerical weather prediction models,” Boundary-Layer Meteorol., 153, 409–440 (2014)]. The objective was twofold: (i) to identify the governing parameters of the method and their optimum values and (ii) to generalize the results over a broad range of atmospheric large-scale forcing conditions, U{sub g} = 5 − 25 m s{sup −1}, where U{sub g} is the geostrophic wind. We identified the perturbation Eckert number, Ec=U{sub g}{sup 2}/ρc{sub p}θ{sup ~}{sub pm}, to be the parameter governing the flow transition to turbulence in neutrally stratified boundary layers. Here, θ{sup ~}{sub pm} is the maximum perturbation amplitude applied, c{sub p} is the specific heat capacity at constant pressure, and ρ is the density. The optimal Eckert number was found for nonlinear perturbations allowed by Ec ≈ 0.16, which instigate formation of hairpin-like vortices that most rapidly transition to a developed turbulent state. Larger Ec numbers (linear small-amplitude perturbations) result in streaky structures requiring larger fetches to reach the quasi-equilibrium solution, while smaller Ec numbers lead to buoyancy dominated perturbations exhibiting difficulties for hairpin-like vortices to emerge. Cell perturbations with wavelengths within the inertial range of three-dimensional turbulence achieved identical quasi-equilibrium values of resolved turbulent kinetic energy, q, and Reynolds-shear stress, . In contrast, large-scale perturbations acting at the production range exhibited reduced levels of , due to the formation of coherent streamwise structures, while q was maintained, requiring larger fetches for the turbulent solution to stabilize. Additionally, the cell perturbation method was compared to a synthetic turbulence generator. The proposed stochastic approach provided at least the same efficiency in developing realistic turbulence, while accelerating the formation of large-scales associated with production of turbulent kinetic energy. Also, it is computationally inexpensive and does not require any turbulent information.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Itô-SDE MCMC method for Bayesian characterization of errors associated with data limitations in stochastic expansion methods for uncertainty quantification

This paper is concerned with the characterization and the propagation of errors associated with data limitations in polynomial-chaos-based stochastic methods for uncertainty quantification. Such an issue can arise in uncertainty quantification when only a limited amount of data is available. When the available information does not suffice to accurately determine the probability distributions that must be assigned to the uncertain variables, the Bayesian method for assigning these probability distributions becomes attractive because it allows the stochastic model to account explicitly for insufficiency of the available information. In previous work, such applications of the Bayesian method had already been implemented by using the Metropolis–Hastings and Gibbs Markov Chain Monte Carlo (MCMC) methods. In this paper, we present an alternative implementation, which uses an alternative MCMC method built around an Itô stochastic differential equation (SDE) that is ergodic for the Bayesian posterior. We draw together from the mathematics literature a number of formal properties of this Itô SDE that lend support to its use in the implementation of the Bayesian method, and we describe its discretization, including the choice of the free parameters, by using the implicit Euler method. We demonstrate the proposed methodology on a problem of uncertainty quantification in a complex nonlinear engineering application relevant to metal forming.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2013

MULTILEVEL ACCELERATION OF STOCHASTIC COLLOCATION METHODS FOR PDE WITH RANDOM INPUT DATA

Stochastic Collocation (SC) methods for stochastic partial differential equa- tions (SPDEs) suffer from the curse of dimensionality, whereby increases in the stochastic dimension cause an explosion of computational effort. To combat these challenges, multilevel approximation methods seek to decrease computational complexity by balancing spatial and stochastic discretization errors. As a form of variance reduction, multilevel techniques have been successfully applied to Monte Carlo (MC) methods, but may be extended to accelerate other methods for SPDEs in which the stochastic and spatial degrees of freedom are de- coupled. This article presents general convergence and computational complexity analysis of a multilevel method for SPDEs, demonstrating its advantages with regard to standard, single level approximation. The numerical results will highlight conditions under which multilevel sparse grid SC is preferable to the more traditional MC and SC approaches.

Webster, Clayton G↗
DOE OSTI2015

A multilevel stochastic collocation method for SPDEs

We present a multilevel stochastic collocation method that, as do multilevel Monte Carlo methods, uses a hierarchy of spatial approximations to reduce the overall computational complexity when solving partial differential equations with random inputs. For approximation in parameter space, a hierarchy of multi-dimensional interpolants of increasing fidelity are used. Rigorous convergence and computational cost estimates for the new multilevel stochastic collocation method are derived and used to demonstrate its advantages compared to standard single-level stochastic collocation approximations as well as multilevel Monte Carlo methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Efficient Ensemble-Based Stochastic Gradient Methods for Optimization Under Geological Uncertainty

Ensemble-based stochastic gradient methods, such as the ensemble optimization (EnOpt) method, the simplex gradient (SG) method, and the stochastic simplex approximate gradient (StoSAG) method, approximate the gradient of an objective function using an ensemble of perturbed control vectors. These methods are increasingly used in solving reservoir optimization problems because they are not only easy to parallelize and couple with any simulator but also computationally more efficient than the conventional finite-difference method for gradient calculations. In this work, we show that EnOpt may fail to achieve sufficient improvement of the objective function when the differences between the objective function values of perturbed control variables and their ensemble mean are large. On the basis of the comparison of EnOpt and SG, we propose a hybrid gradient of EnOpt and SG to save on the computational cost of SG. We also suggest practical ways to reduce the computational cost of EnOpt and StoSAG by approximating the objective function values of unperturbed control variables using the values of perturbed ones. We first demonstrate the performance of our improved ensemble schemes using a benchmark problem. Results show that the proposed gradients saved about 30–50% of the computational cost of the same optimization by using EnOpt, SG, and StoSAG. As a real application, we consider pressure management in carbon storage reservoirs, for which brine extraction wells need to be optimally placed to reduce reservoir pressure buildup while maximizing the net present value. Results show that our improved schemes reduce the computational cost significantly.

58 GEOSCIENCES↗
DOE OSTI2012

Stochastic sampling method with MCNPX for nuclear data uncertainty propagation in criticality safety applications

In the domain of criticality safety, the efficient propagation of uncertainty in nuclear data to uncertainty in k{sub eff} is an important area of current research. In this paper, a method based on stochastic sampling is presented for uncertainty propagation in MCNPX calculations. To that aim, the nuclear data (i.e. cross sections) are assumed to have a multivariate normal distribution and simple random sampling is performed following this presumed probability distribution. A verification of the developed stochastic sampling procedure with MCNPX is then conducted using the {sup 239}Pu Jezebel experiment as well as the PB-2 BWR and TMI-1 PWR pin cell models from the Uncertainty Analysis in Modeling (UAM) exercises. For the Jezebel case, it is found that the developed stochastic sampling approach predicts similar k{sub eff} uncertainties compared to conventional sensitivity and uncertainty methods. For the UAM models, slightly lower uncertainties are obtained when comparing to existing preliminary results. Further details of these verification studies are discussed and directions for future work are outlined. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗