Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic 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 325 records · Page 18

Stochastic simulation of pulverized coal (PC) processes

An increasing population and electricity demand in the U.S. require capacity expansion of power systems. The National Energy Technology Laboratory (NETL), U.S. Department of Energy (DOE), has invested considerable efforts on research and development to improve the design and simulation of these power plants. Incorporation of novel process synthesis techniques and realistic simulation methodologies yield optimal flowsheet configurations and accurate estimation of their performance parameters. To provide a better estimation of such performance indicators, simulation models should predict the process behavior based on not only deterministic values of well-known input parameters but also uncertain variables associated with simulation assumptions. In this work, the stochastic simulation of a load-following pulverized coal (PC) power plant takes into account the variation of three input variables, namely, atmospheric air temperature, atmospheric air humidity, and generation load. These uncertain variables are characterized with probability density functions (pdfs) obtained from available atmospheric and electrical energy generation data. The stochastic simulation is carried out by obtaining a sample of values from the pdfs that generates a set of scenarios under which the model is run. An efficient sampling technique [Hammersley sequence sampling (HSS)] guarantees a set of scenarios uniformly distributed throughout the uncertain variable range. Then, each model run generates results on performance parameters as cycle efficiency, carbon emissions, sulfur emissions, and water consumption that are statistically analyzed after all runs are completed. Among these parameters, water consumption is of importance because an increasing demand has been observed mostly in arid regions of the country and, therefore, constrains the operability of the processes. This water consumption is significantly affected by atmospheric uncertainties. The original deterministic process model simulation was designed in Aspen Plus, and a CAPE-OPEN compliant stochastic simulation capability is employed to run the uncertainty analysis. Initially, the influences of atmospheric conditions and load change on the performance parameters are analyzed separately to understand their individual influences on the process, and then their simultaneous variation is analyzed to generate more realistic estimations of the process performance.

97 MATHEMATICS AND COMPUTING↗

Inferring HIV Escape Rates from Multi-Locus Genotype Data

Cytotoxic T-lymphocytes (CTLs) recognize viral protein fragments displayed by major histocompatibility complex molecules on the surface of virally infected cells and generate an anti-viral response that can kill the infected cells. Virus variants whose protein fragments are not efficiently presented on infected cells or whose fragments are presented but not recognized by CTLs therefore have a competitive advantage and spread rapidly through the population. We present a method that allows a more robust estimation of these escape rates from serially sampled sequence data. The proposed method accounts for competition between multiple escapes by explicitly modeling the accumulation of escape mutations and the stochastic effects of rare multiple mutants. Applying our method to serially sampled HIV sequence data, we estimate rates of HIV escape that are substantially larger than those previously reported. The method can be extended to complex escapes that require compensatory mutations. We expect our method to be applicable in other contexts such as cancer evolution where time series data is also available.

60 APPLIED LIFE SCIENCES↗

Stochastic AC optimal power flow: A data-driven approach

There is an emerging need for efficient solutions to stochastic AC Optimal Power Flow (AC-OPF) to ensure optimal and reliable grid operations in the presence of increasing demand and generation uncertainty. Herein this paper presents a highly scalable data-driven algorithm for stochastic AC-OPF that has extremely low sample requirement. The novelty behind the algorithm’s performance involves an iterative scenario design approach that merges information regarding constraint violations in the system with data-driven sparse regression. Compared to conventional methods with random scenario sampling, our approach is able to provide feasible operating points for realistic systems with much lower sample requirements. Furthermore, multiple sub-tasks in our approach can be easily paralleled and based on historical data to enhance its performance and application. We demonstrate the computational improvements of our approach through simulations on different test cases in the IEEE PES PGLib-OPF benchmark library.

42 ENGINEERING↗

Efficient Training of Deep Neural Operator Networks via Randomized Sampling

Neural operators (NOs) employ deep neural networks to learn the mappings between infinitedimensional function spaces. Deep operator network (DeepONet), a popular NO architecture, has demonstrated success in the real-time prediction of complex dynamics across various scientific and engineering applications. In this work, we introduce a random sampling technique to be adopted during the training of DeepONet, aimed at improving the generalization ability of the model, while significantly reducing the computational time. The proposed approach targets the trunk network of the DeepONet model that outputs the basis functions corresponding to the spatiotemporal locations of the bounded domain on which the physical system is defined. While constructing the loss function, DeepONet training traditionally considers a uniform grid of spatiotemporal points at which all the output functions are evaluated for each iteration. This approach leads to a larger batch size, resulting in poor generalization and increased memory demands, due to the limitations of the stochastic gradient descent (SGD) optimizer. The proposed random sampling over the inputs of the trunk net mitigates these challenges, improving generalization and reducing the memory requirements during training, resulting in significant computational gains. We validate our hypothesis through three benchmark examples, demonstrating substantial reductions in training time while achieving comparable or lower overall test errors relative to the traditional training approach. Our results indicate that incorporating randomization in the trunk network inputs during training enhances the efficiency and robustness of DeepONet, offering a promising avenue for improving the framework’s performance in modeling complex physical systems.

Karumuri, Sharmila [Department of Civil & Systems ↗

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↗

Parallel Environment for the Creation of Stochastics 1.0

PECOS is a computational library for creating and manipulating realizations of stochastic quantities, including scalar uncertain variables, random fields, and stochastic processes. It offers a unified interface to univariate and multivariate polynomial approximations using either orthogonal or interpolation polynomials; numerical integration drivers for Latin hypercube sampling, quadrature, cubature, and sparse grids; and fast Fourier transforms using third party libraries. The PECOS core also offers statistical utilities and transformations between various representations of stochastic uncertainty. PECOS provides a C++ API through which users can generate and transform realizations of stochastic quantities. It is currently used by Sandia's DAKOTA, Stokhos, and Encore software packages for uncertainty quantification and verification. PECOS generates random sample sets and multi-dimensional integration grids, typically used in forward propagation of scalar uncertainty in computational models (uncertainty quantification (UQ)). PECOS also generates samples of random fields (RFs) and stochastic processes (SPs) from a set of user-defined power spectral densities (PSDs). The RF/SP may be either Gaussian or non-Gaussian and either stationary or nonstationary, and the resulting sample is intended for run-time query by parallel finite element simulation codes. Finally, PECOS supports nonlinear transformations of random variables via the Nataf transformation and extensions.

Field Jr, Richard↗

The star cluster mass–galactocentric radius relation: Implications for cluster formation

Whether or not the initial star cluster mass function is established through a universal, galactocentric-distance-independent stochastic process, on the scales of individual galaxies, remains an unsolved problem. This debate has recently gained new impetus through the publication of a study that concluded that the maximum cluster mass in a given population is not solely determined by size-of-sample effects. Here, we revisit the evidence in favor and against stochastic cluster formation by examining the young (≲ a few ×10{sup 8} year old) star cluster mass–galactocentric radius relation in M33, M51, M83, and the Large Magellanic Cloud. To eliminate size-of-sample effects, we first adopt radial bin sizes containing constant numbers of clusters, which we use to quantify the radial distribution of the first- to fifth-ranked most massive clusters using ordinary least-squares fitting. We supplement this analysis with an application of quantile regression, a binless approach to rank-based regression taking an absolute-value-distance penalty. Both methods yield, within the 1σ to 3σ uncertainties, near-zero slopes in the diagnostic plane, largely irrespective of the maximum age or minimum mass imposed on our sample selection, or of the radial bin size adopted. We conclude that, at least in our four well-studied sample galaxies, star cluster formation does not necessarily require an environment-dependent cluster formation scenario, which thus supports the notion of stochastic star cluster formation as the dominant star cluster-formation process within a given galaxy.

79 ASTRONOMY AND ASTROPHYSICS↗

Benders Cut Classification via Support Vector Machines for Solving Two-Stage Stochastic Programs

In this work, we consider Benders decomposition for solving two-stage stochastic programs with complete recourse based on finite samples of the uncertain parameters. We define the Benders cuts binding at the final optimal solution or the ones significantly improving bounds over iterations as valuable cuts. We propose a learning-enhanced Benders decomposition (LearnBD) algorithm, which adds a cut classification step in each iteration to selectively generate cuts that are more likely to be valuable cuts. The LearnBD algorithm includes two phases: (i) sampling cuts and collecting information from training problems and (ii) solving testing problems with a support vector machine (SVM) cut classifier. We run the LearnBD algorithm on instances of capacitated facility location and multicommodity network design under uncertain demand. Our results show that SVM cut classifier works effectively for identifying valuable cuts, and the LearnBD algorithm reduces the total solving time of all instances for different problems with various sizes and complexities.

97 MATHEMATICS AND COMPUTING↗

A weighted ℓ{sub 1}-minimization approach for sparse polynomial chaos expansions

This work proposes a method for sparse polynomial chaos (PC) approximation of high-dimensional stochastic functions based on non-adapted random sampling. We modify the standard ℓ{sub 1}-minimization algorithm, originally proposed in the context of compressive sampling, using a priori information about the decay of the PC coefficients, when available, and refer to the resulting algorithm as weightedℓ{sub 1}-minimization. We provide conditions under which we may guarantee recovery using this weighted scheme. Numerical tests are used to compare the weighted and non-weighted methods for the recovery of solutions to two differential equations with high-dimensional random inputs: a boundary value problem with a random elliptic operator and a 2-D thermally driven cavity flow with random boundary condition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Global stochastic optimization of stellarator coil configurations

In the construction of a stellarator, the manufacturing and assembling of the coil system is a dominant cost. These coils need to satisfy strict engineering tolerances, and if those are not met the project could be cancelled as in the case of the National Compact Stellarator Experiment (NCSX) project. Therefore, our goal is to find coil configurations that increase construction tolerances without compromising the performance of the magnetic field. In this paper, we develop a gradient-based stochastic optimization model which seeks robust stellarator coil configurations in high dimensions. In particular, we design a two-step method: first, we perform an approximate global search by a sample efficient trust-region Bayesian optimization; second, we refine the minima found in step one with a stochastic local optimizer. To this end, we introduce two stochastic local optimizers: BFGS applied to the sample average approximation; and Adam, equipped with a control variate for variance reduction. Numerical simulations performed on a W7-X-like coil configuration demonstrate that our global optimization approach finds a variety of promising local solutions at less than 0.1% of the cost of previous work, which considered solely local stochastic optimization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Diffusion Processes Satisfying a Conservation Law Constraint

We investigate coupled stochastic differential equations governing N non-negative continuous random variables that satisfy a conservation principle. In various fields a conservation law requires that a set of fluctuating variables be non-negative and (if appropriately normalized) sum to one. As a result, any stochastic differential equation model to be realizable must not produce events outside of the allowed sample space. We develop a set of constraints on the drift and diffusion terms of such stochastic models to ensure that both the non-negativity and the unit-sum conservation law constraint are satisfied as the variables evolve in time. We investigate the consequences of the developed constraints on the Fokker-Planck equation, the associated system of stochastic differential equations, and the evolution equations of the first four moments of the probability density function. We show that random variables, satisfying a conservation law constraint, represented by stochastic diffusion processes, must have diffusion terms that are coupled and nonlinear. The set of constraints developed enables the development of statistical representations of fluctuating variables satisfying a conservation law. We exemplify the results with the bivariate beta process and the multivariate Wright-Fisher, Dirichlet, and Lochner’s generalized Dirichlet processes.

97 MATHEMATICS AND COMPUTING↗

Subcell resolution in simplex stochastic collocation for spatial discontinuities

Subcell resolution has been used in the Finite Volume Method (FVM) to obtain accurate approximations of discontinuities in the physical space. Stochastic methods are usually based on local adaptivity for resolving discontinuities in the stochastic dimensions. However, the adaptive refinement in the probability space is ineffective in the non-intrusive uncertainty quantification framework, if the stochastic discontinuity is caused by a discontinuity in the physical space with a random location. The dependence of the discontinuity location in the probability space on the spatial coordinates then results in a staircase approximation of the statistics, which leads to first-order error convergence and an underprediction of the maximum standard deviation. To avoid these problems, we introduce subcell resolution into the Simplex Stochastic Collocation (SSC) method for obtaining a truly discontinuous representation of random spatial discontinuities in the interior of the cells discretizing the probability space. The presented SSC–SR method is based on resolving the discontinuity location in the probability space explicitly as function of the spatial coordinates and extending the stochastic response surface approximations up to the predicted discontinuity location. The applications to a linear advection problem, the inviscid Burgers’ equation, a shock tube problem, and the transonic flow over the RAE 2822 airfoil show that SSC–SR resolves random spatial discontinuities with multiple stochastic and spatial dimensions accurately using a minimal number of samples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data-Driven Selection of Tessellation Models Describing Polycrystalline Microstructures

Tessellation models have proven to be useful for the geometric description of grain microstructures in polycrystalline materials. With the use of a suitable tessellation model, the complex morphology of grains can be represented by a small number of parameters assigned to each grain, which not only entails a significant reduction in complexity, but also facilitates the investigation of certain geometric features of the microstructure. However, for a given set of microstructural data, the choice of a particular geometric model is traditionally based on researcher intuition. The model should provide a sufficiently good approximation to the data, while keeping the number of parameters small. In this paper, we discuss general aspects of the process of model selection and suggest several criteria for selecting an appropriate candidate from a certain set of tessellation models. The choice of candidate represents a trade-off between accuracy and complexity of the model. Here, the selected model is used solely to approximate given data samples, but it also provides guidance for developing stochastic tessellation models and generating virtual microstructures. Model fitting is carried out by simulated annealing, applied in a consistent manner to twelve different tessellation models.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Entropy-based closure for probabilistic learning on manifolds

In a recent paper, the authors proposed a general methodology for probabilistic learning on manifolds. The method was used to generate numerical samples that are statistically consistent with an existing dataset construed as a realization from a non-Gaussian random vector. The manifold structure is learned using diffusion manifolds and the statistical sample generation is accomplished using a projected Itˆo stochastic differential equation. This probabilistic learning approach has been extended to polynomial chaos representation of databases on manifolds and to probabilistic nonconvex constrained optimization with a fixed budget of function evaluations. The methodology introduces an isotropic-diffusion kernel with hyperparameter ". Currently, " is more or less arbitrarily chosen. In this paper, we propose a selection criterion for identifying an optimal value of ", based on a maximum entropy argument. The result is a comprehensive, closed, probabilistic model for characterizing data sets with hidden constraints. This entropy argument ensures that out of all possible models, this is the one that is the most uncertain beyond any specified constraints, which is selected. Applications are presented for several databases.

97 MATHEMATICS AND COMPUTING↗

Demonstration of Optimal Benchmark Selection Website and Validation of the q c Coverage Metric Using HEU-SOL-THERM-013-003 Experiment

In the work documented in this interim report, the experiment selection toolkit web site was demonstrated and q C coverage metric methodology was validated for IEU-MET-FAST-002-001, MIX-COMP-THERM 004-004, and HEU-SOL-THERM-013-003 experiments. 𝑞 𝐶 is an information-theoretic measure based on mutual information that quantifies the ability of candidate benchmark experiments to reduce the bias and uncertainty of a target criticality safety application. The metric and an accompanying open-source Python toolkit with a web-based interface were tested against a benchmark set of 425 experiments drawn from the International Criticality Safety Benchmark Evaluation Project Handbook. The interface is hosted at https://edim.covdef.com. It accepts sensitivity data files produced by the TSUNAMI-IP module of the SCALE code system and supports both (i) deterministic analysis using the ENDF/B-VII.0 covariance library and (ii) stochastic analysis based on user-supplied keff samples. Demonstrations on representative applications across a range of material composition, spectrum, and form show that q C -guided benchmark selection achieves greater uncertainty reduction with fewer experiments and yields more stable posterior bias and uncertainty estimates than traditional similarity coefficient ( c k )–based selection, while also capturing valuable low-ck experiments that one-to-one metrics overlook.

Abdel-khalik, Hany S. [Indiana Univ.-Purdue Univ. ↗

Learning Stochastic Parametric Differentiable Predictive Control Policies

We present a scalable unsupervised learning-based method for obtaining explicit control policies for model predictive control problems for stochastic linear systems with additive uncertainties subject to nonlinear chance constraints. We call the proposed method stochastic parametric differentiable predictive control (SP-DPC), which extends the recently proposed deterministic DPC policy optimization algorithm. We formulate the SP-DPC as a deterministic approximation to the stochastic parametric constrained optimal control problem via independent sampling of the problem's parameters and uncertainties. This formulation allows us to directly compute the policy gradients via automatic differentiation of the problem's value function, evaluated over sampled parameters and uncertainties. In particular, the computed expectation of the problem's value function is backpropagated through the finite-time closed-loop system rollouts parametrized by a known nominal system dynamics model and neural control policy. We also provide theoretical probabilistic guarantees on closed-loop stability and chance constraints satisfaction for systems controlled by learned neural policies. We demonstrate the computational efficiency and scalability of the proposed policy optimization algorithm in three numerical examples, including systems with a large number of states or subject to nonlinear constraints.

Drgona, Jan↗

Stochastic Thermo-Hydro Modeling and Neural Network Surrogate Development for Thermal Resource Assessment of the Galleries-to-Calories Geobattery

The Galleries-to-Calories Geobattery concept explores the use of abandoned coal mine workings for large-scale thermal energy transport and storage. The system involves injecting waste heat from a supercomputing facility into flooded mine galleries, where groundwater flow can store and transport thermal energy for potential recovery in downgradient district heating and cooling applications. To evaluate the feasibility and performance of the Geobattery under geological and operational uncertainty, we developed a suite of stochastic thermo-hydrological (TH) simulations using Monte Carlo sampling of key uncertain parameters (e.g., permeability, porosity, thermal conductivity, specific heat capacity) and operating conditions (e.g., injection rate, injection temperature). Results identified injection rate and temperature as the most influential parameters governing thermal front propagation, while the geometry of the room-and-pillar structure played a critical role in directing the extent and orientation of thermal advancement. Optimal combinations of material properties for maximizing heat recovery were also determined. To address the high computational cost of coupled-process stochastic modeling, we trained a neural network surrogate model on 24,000 physics-based realizations, achieving an R² > 0.99 and MAE < 0.1 for temperature predictions at monitoring locations. This surrogate enabled an additional 100,000 realizations for global sensitivity analysis and probabilistic thermal resource assessment. The integrated stochastic physics–surrogate modeling framework offers a computationally efficient tool for quantifying uncertainty, identifying key drivers, and informing early-stage design decisions for Geobattery systems.

15 - GEOTHERMAL ENERGY↗

Fast dynamic processes of solar radiation

This paper studies dynamic processes of fast-alternating solar radiation which are assessed by alternation of clouds. Most attention is devoted to clouds of type Cumulus Humilis, identified through visual recognition and/or a specially constructed automatic sensor. One second sampling period was used. Recorded data series were analyzed with regard to duration of illuminated 'windows' between shadows, their stochastic intervals, fronts and the magnitude of increments of solar irradiance. (author)

14 SOLAR ENERGY↗