Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic process”

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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Progressive Hedging Decomposition for Solutions of Large-Scale Process Family Design Problems

In previous work, we have introduced a mathematical model for solving a discretized version of the process family design problem. This involves two sets of decision variables. One set selects which unit module designs are included in the process platform out of a candidate set of options; the other set determines which of these unit module designs are assigned to each variant. In this work, we exploit a parallelized Progressive Hedging (PH) algorithm to solve even larger scale design problems. PH is a well-known algorithm traditionally used to solve stochastic programming problems. While our problem is not a two-stage stochastic programming problem, the structure is similar, and it can be directly mapped to the PH approach, which we employ here to solve this deterministic optimization problem. We decompose our problem by process variant. We treat the platform unit module design variables as first-stage and the assignment of unit module designs to variants as second-stage, solving the problem using mpi-sppy. We demonstrate this approach on case studies of CC, water desalination, and refrigeration.

Stinchfield, Georgia↗
DOE OSTI2024

Towards provably efficient quantum algorithms for large-scale machine-learning models

Large machine learning models are revolutionary technologies of artificial intelligence whose bottlenecks include huge computational expenses, power, and time used both in the pre-training and fine-tuning process. In this work, we show that fault-tolerant quantum computing could possibly provide provably efficient resolutions for generic (stochastic) gradient descent algorithms, scaling as $\mathcal{O}$(T 2 x polylog($n$)), where n is the size of the models and T is the number of iterations in the training, as long as the models are both sufficiently dissipative and sparse, with small learning rates. Based on earlier efficient quantum algorithms for dissipative differential equations, we find and prove that similar algorithms work for (stochastic) gradient descent, the primary algorithm for machine learning. In practice, we benchmark instances of large machine learning models from 7 million to 103 million parameters. We find that, in the context of sparse training, a quantum enhancement is possible at the early stage of learning after model pruning, motivating a sparse parameter download and re-upload scheme. Our work shows solidly that fault-tolerant quantum algorithms could potentially contribute to most state-of-the-art, large-scale machine-learning problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Data-Driven Global Sensitivity Analysis of Three-Phase Distribution System with PVs

Global sensitivity analysis (GSA) of distribution system with respect to stochastic PV variations plays an important role in designing optimal voltage control schemes. This paper proposes a Kriging, i.e., Gaussian process modeling enabled data-driven GSA method. The key idea is to develop a surrogate model that captures the hidden global relationship between voltage and real and reactive power injections from the historical data. With the surrogate model, the Sobol index can be conveniently calculated to assess the global sensitivity of voltage to various power injection variations. Comparison results with other model-based GSA methods on the IEEE 37-bus feeder, such as the polynomial chaos expansion and the Monte Carlo approaches demonstrate that the proposed method can achieve accurate GSA outcomes while maintaining high computational efficiency.

distribution system analysis↗
DOE OSTI2021

Modeling and simulation of vascular tumors embedded in evolving capillary networks

Here in this work, we present a coupled 3D–1D model of solid tumor growth within a dynamically changing vascular network to facilitate realistic simulations of angiogenesis. Additionally, the model includes erosion of the extracellular matrix, interstitial flow, and coupled flow in blood vessels and tissue. We employ continuum mixture theory with stochastic Cahn–Hilliard type phase-field models of tumor growth. The interstitial flow is governed by a mesoscale version of Darcy’s law. The flow in the blood vessels is controlled by Poiseuille flow, and Starling’s law is applied to model the mass transfer in and out of blood vessels. The evolution of the network of blood vessels is orchestrated by the concentration of the tumor angiogenesis factors (TAFs); blood vessels grow towards the increasing TAFs concentrations. This process is not deterministic, allowing random growth of blood vessels and, therefore, due to the coupling of nutrients in tissue and vessels, makes the growth of tumors stochastic. We demonstrate the performance of the model by applying it to a variety of scenarios. Numerical experiments illustrate the flexibility of the model and its ability to generate satellite tumors. Simulations of the effects of angiogenesis on tumor growth are presented as well as sample-independent features of cancer.

3D–1D coupled blood flow models↗
DOE OSTI2025

Effect of pattern transfer process on roughness of block copolymer patterns from directed self-assembly

Block copolymer-directed self-assembly (DSA) remains promising for improving pattern quality and reducing the stochastic variations that challenge high numerical aperture extreme ultraviolet lithography. Equally critical is refining pattern transfer methods for accurately transferring the rectified DSA features to the underlying substrate. We compare two atomic layer deposition (ALD)-based techniques: sequential infiltration synthesis (SIS) and dry liftoff, applied to polystyrene-block-poly(methyl methacrylate) (PS-b-PMMA) DSA patterns. Both methods utilize aluminum oxide hard masks, with one synthesized through infiltration into the PMMA domains and the other through conformal ALD coating. High-resolution scanning electron micrographs were analyzed to measure line edge, width, and placement roughness for both the line (PMMA) and space (PS) features. Although both methods yielded similar overall 3σ rms roughness, they differed significantly in the frequency-dependent power spectral density (PSD) profiles. SIS reduced line placement roughness at length scales associated with the polymer pitch, but increased space width roughness at low frequencies, whereas dry liftoff mimicked the frequency content of the original guiding pattern. This study underscores the importance of PSD evaluation in selecting optimal pattern transfer strategies for specific applications.

Block copolymers↗
DOE OSTI2021

Stochastic microstructural analysis of ceramic matrix composites using a high-fidelity multiscale framework

This paper presents a high-fidelity multiscale framework to simulate the mechanical behavior of ceramic matrix composites (CMCs), accounting for the complex micromorphology captured using detailed material characterization. First, high-resolution micrographs are obtained for the specific carbon fiber silicon-carbide-nitride matrix (C/SiNC) CMC to characterize the variability of the architectural features and manufacturing-induced defects at the microscale. An image processing algorithm is then used to precisely estimate the size and distribution of all subscale features and defects from the micrographs. The information is then used to generate a three-dimensional stochastic representative volume element (SRVE) to reconstruct microscale constituents accounting for the variability. As a result, the generated SRVEs are simulated using the high-fidelity generalized method of cells (HFGMC) micromechanics theory to investigate the effects of defects on the elastic properties of C/SiNC CMCs.

Ceramic Matrix Composites↗
DOE OSTI2023

Stochastic Price Generation for Evaluating Wholesale Electricity Market Bidding Strategies

This work presents a novel method for generating electricity price scenarios from statistical properties of past electricity prices using a hybrid statistical and reduced-form stochastic model. Previous work in applying stochastic differential equations (SDE) to model electricity prices has focused on daily average prices. To extend stochastic price generation methods to hourly or sub-hourly pricing, we address several weaknesses in the state-of-the-art: (1) we replace the mean-reversion component of the SDE with an ARIMA process that is better able to characterize the daily and weekly trends; (2) we extend the price-spike, or jump process to account for conditional probabilities of price spikes occurring in consecutive time steps by replacing the traditional Poisson process for modeling jumps with a generalized point process model inspired by brain neuron models; and (3) we replace the traditional method of estimating spike intensity with empirical variance with a Markov process based on observed price spike intensity transitions. The method is demonstrated with electricity prices from the US ERCOT market and a use-case example is provided for bidding an energy storage unit into the day-ahead and real-time energy markets of ERCOT using stochastic optimization methods. Results show that the the synthetic price model out performs a (naive) persistence forecast model by resulting in 24% to 47% more in profits over 168 simulated days.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2020

A Two-Stage Decomposition Approach for AC Optimal Power Flow

The alternating current optimal power flow (AC-OPF) problem is critical to power system operations and planning, but it is generally hard to solve due to its nonconvex and large-scale nature. Furthermore, this paper proposes a scalable decomposition approach in which the power network is decomposed into a master network and a number of subnetworks, where each network has its own AC-OPF subproblem. This formulates a two-stage optimization problem and requires only a small amount of communication between the master and subnetworks. The key contribution is a smoothing technique that renders the response of a subnetwork differentiable with respect to the input from the master problem, utilizing properties of the barrier problem formulation that naturally arises when subproblems are solved by a primal-dual interior-point algorithm. Consequently, existing efficient nonlinear programming solvers can be used for both the master problem and the subproblems. The advantage of this framework is that speedup can be obtained by processing the subnetworks in parallel, and it has convergence guarantees under reasonable assumptions. The formulation is readily extended to instances with stochastic subnetwork loads. Numerical results show favorable performance and illustrate the scalability of the algorithm which is able to solve instances with more than 11 million buses.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Development of a three-dimensional APOLLO3 neutrons deterministic scheme for the CABRI reactor

CABRI is an experimental reactor to study the fuel behavior during reactivity injection transients. These transients being highly multiphysics, the development of suitable modeling and simulation tools to simulate them is important for the optimization of the tests and the control of the experimental conditions. This paper focuses on the development of an APOLLO3 deterministic core calculation tool dedicated to the CABRI transient analysis. It represents the first stage of the incremental process for the implementation of a multiphysics time-dependent modeling of the CABRI transient. The neutron calculation scheme is based on a classical two-step approach. The first step consists of a 281-energy group calculation flux with the TDT-MOC (Method Of Characteristics) solver for cross-section space and energy (23 groups) collapsing for the CABRI different assembly clusters. The bias on a 2D core neutron calculation due to the self-shielding calculation and collapsing on a restricted pattern are investigated thanks to a comparison with a direct full 2D calculation on a quarter of core. The second step relies on a pin-resolved transport 3D transport core calculation with the SN solver MINARET. A progressive numerical validation process is followed to quantify the calculation biases on reactivity and reaction rates at each step using reference calculations with the stochastic code TRIPOLI4. The next development stage toward a multiphysics scheme will be the implementation of the 3D-kinetics equation resolution and the coupling with a core thermal-hydraulics model. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2024

Is stochastic thermodynamics the key to understanding the energy costs of computation?

The relationship between the thermodynamic and computational properties of physical systems has been a major theoretical interest since at least the 19th century. It has also become of increasing practical importance over the last half-century as the energetic cost of digital devices has exploded. Importantly, real-world computers obey multiple physical constraints on how they work, which affects their thermodynamic properties. Moreover, many of these constraints apply to both naturally occurring computers, like brains or Eukaryotic cells, and digital systems. Most obviously, all such systems must finish their computation quickly, using as few degrees of freedom as possible. This means that they operate far from thermal equilibrium. Furthermore, many computers, both digital and biological, are modular, hierarchical systems with strong constraints on the connectivity among their subsystems. Yet another example is that to simplify their design, digital computers are required to be periodic processes governed by a global clock. None of these constraints were considered in 20th-century analyses of the thermodynamics of computation. The new field of stochastic thermodynamics provides formal tools for analyzing systems subject to all of these constraints. We argue here that these tools may help us understand at a far deeper level just how the fundamental thermodynamic properties of physical systems are related to the computation they perform.

computation↗
DOE OSTI2020

Comparison between mirror Langmuir probe and gas-puff imaging measurements of intermittent fluctuations in the Alcator C-Mod scrape-off layer

Statistical properties of the scrape-off layer plasma fluctuations are studied in ohmically heated plasmas in the Alcator C-Mod tokamak. For the first time, plasma fluctuations as well as parameters that describe the fluctuations are compared across measurements from a mirror Langmuir probe (MLP) and from gas-puff imaging (GPI) that sample the same plasma discharge. This comparison is complemented by an analysis of line emission time-series data, synthesized from the MLP electron density and temperature measurements. The fluctuations observed by the MLP and GPI typically display relative fluctuation amplitudes of order unity together with positively skewed and flattened probability density functions. Such data time series are well described by an established stochastic framework that models the data as a superposition of uncorrelated, two-sided exponential pulses. The most important parameter of the process is the intermittency parameter, $γ=τ_d/τ_w$, where τd denotes the duration time of a single pulse and $τ_w$ gives the average waiting time between consecutive pulses. In this study we show, using a new deconvolution method, that these parameters can be consistently estimated from different statistics of the data. We also show that the statistical properties of the data sampled by the MLP and GPI diagnostic are very similar. Finally, a synthetic GPI signal using only plasma parameters sampled by the MLP shows qualitatively different fluctuation statistics from the measured GPI signal.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

NRAP-Open-IAM: Open-Source Integrated Assessment Model

NRAP Open IAM is the latest evolution in a series of quantitative models developed under the U.S. Department of Energy’s National Risk Assessment Partnership (NRAP) to address risk assessment, risk management and containment assurance questions of geological carbon storage (GCS). NRAP Open IAM allows a user to define a site specific GCS scenario, characterize important site features, events, and processes (considering uncertainty), couple together reduced order models of various system components to rapidly forecast response to CO 2 injection, and perform stochastic analysis to quantify containment effectiveness, leakage risk, and impact to receptors of concern.

Vasylkivska, Veronika S.↗
DOE OSTI2023

Statistical Learning for Nonlinear Model Reduction from Local Simulations of Stochastic and Particle- and Agent-Based Systems

Stochastic physical systems across the sciences that have very high-dimensional state spaces, with a large number of fast degrees of freedom that force direct simulators to proceed by integration steps that are orders of magnitude smaller than events of interests (e.g., particle collisions). Examples range from molecular motion to dynamics of large populations of cells. A grand challenge in the simulation and understanding of such systems is the systematic construction of accurate, interpretable, reduced models, enabling faster simulations, revealing fundamental properties of the dynamics, and predicting phenomena of interest that the original simulator could not reached with sufficient accuracy or within a given computational budget. In this projected we developed novel statistical estimation/machine learning techniques for analyzing and building empirical reduced models for important families of high-dimensional stochastic systems, in particular: - we developed techniques for estimating interaction kernels in interacting particle- and agent-based systems, which are ubiquitous in Physics, Biology and many other sciences, given observed trajectories of the system; - we developed techniques for nonlinear model reduction for high-dimensional stochastic systems that have a small number of unknown, nonlinear slow variables, and a large number of fast modes, that are possibly of large magnitude, given observed short trajectories of the system in the form of bursts of trajectories from different initial conditions; - we developed novel techniques for estimating linear dynamical systems on graphs when both the dynamics and the underlying graph are unknown, and we have a sparse set of space-time observations; - we considered the problem of estimating an unknown nonlinear observation function of a standard process (e.g. Brownian motion), so that we can recognized if an observed dynamics is "just" a nonlinear version of a known dynamics; we also developed benchmarks for learning algorithms aimed at learning and classifying diffusion processes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Generative network-based approaches to generate stochastic realizations

Generative Adversarial Network (GAN) – based models have been successfully applied in generating different geological models in the literature. However, it is still challenging to use GAN to generate geological realizations with extremely sparse conditioning data (e.g. several well data), which may be regarded as local noise by GAN during the training process. In this work, we propose a novel conditional Generative Adversarial Neural Operator (cGANO) to tackle this challenge. In cGANO, the mapping between conditioning data and output is established through the U-shaped neural operators (UNO), which better preserves local information. Another advantage of using UNO comes from its grid-independent property, which makes the generation of downscaling stochastic geologic realizations possible. We tested the model performance on the IBDP geostatistical dataset with 100 realizations.

58 GEOSCIENCES↗
DOE OSTI2023

Laser Wakefield Accelerator modelling with Variational Neural Networks

A machine learning model was created to predict the electron spectrum generated by a GeV-class laser wakefield accelerator. The model was constructed from variational convolutional neural networks, which mapped the results of secondary laser and plasma diagnostics to the generated electron spectrum. An ensemble of trained networks was used to predict the electron spectrum and to provide an estimation of the uncertainty of that prediction. It is anticipated that this approach will be useful for inferring the electron spectrum prior to undergoing any process that can alter or destroy the beam. In addition, the model provides insight into the scaling of electron beam properties due to stochastic fluctuations in the laser energy and plasma electron density.

43 PARTICLE ACCELERATORS↗
DOE OSTI2022

Microstructure-Sensitive Uncertainty Quantification for Crystal Plasticity Finite Element Constitutive Models Using Stochastic Collocation Methods

Uncertainty quantification (UQ) plays a major role in verification and validation for computational engineering models and simulations, and establishes trust in the predictive capability of computational models. In the materials science and engineering context, where the process-structure-property-performance linkage is well known to be the only road mapping from manufacturing to engineering performance, numerous integrated computational materials engineering (ICME) models have been developed across a wide spectrum of length-scales and time-scales to relieve the burden of resource-intensive experiments. Within the structure-property linkage, crystal plasticity finite element method (CPFEM) models have been widely used since they are one of a few ICME toolboxes that allows numerical predictions, providing the bridge from microstructure to materials properties and performances. Several constitutive models have been proposed in the last few decades to capture the mechanics and plasticity behavior of materials. While some UQ studies have been performed, the robustness and uncertainty of these constitutive models have not been rigorously established. In this work, we apply a stochastic collocation (SC) method, which is mathematically rigorous and has been widely used in the field of UQ, to quantify the uncertainty of three most commonly used constitutive models in CPFEM, namely phenomenological models (with and without twinning), and dislocation-density-based constitutive models, for three different types of crystal structures, namely face-centered cubic (fcc) copper (Cu), body-centered cubic (bcc) tungsten (W), and hexagonal close packing (hcp) magnesium (Mg). Our numerical results not only quantify the uncertainty of these constitutive models in stress-strain curve, but also analyze the global sensitivity of the underlying constitutive parameters with respect to the initial yield behavior, which may be helpful for robust constitutive model calibration works in the future.

36 MATERIALS SCIENCE↗
DOE OSTI2022

A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems

Constructing surrogate models for uncertainty quantification (UQ) on complex partial differential equations (PDEs) having inherently high-dimensional O(10 n ), n ≥ 2, stochastic inputs (e.g., forcing terms, boundary conditions, initial conditions) poses tremendous challenges. The “curse of dimensionality” can be addressed with suitable unsupervised learning techniques used as a pre-processing tool to encode inputs onto lower-dimensional subspaces while retaining its structural information and meaningful properties. In this work, we review and investigate thirteen dimension reduction methods including linear and nonlinear, spectral, blind source separation, convex and non-convex methods and utilize the resulting embeddings to construct a mapping to quantities of interest via polynomial chaos expansions (PCE). Here, we refer to the general proposed approach as manifold PCE (m-PCE), where manifold corresponds to the latent space resulting from any of the studied dimension reduction methods. To investigate the capabilities and limitations of these methods we conduct numerical tests for three physics-based systems (treated as black-boxes) having high-dimensional stochastic inputs of varying complexity modeled as both Gaussian and non-Gaussian random fields to investigate the effect of the intrinsic dimensionality of input data. We demonstrate both the advantages and limitations of the unsupervised learning methods and we conclude that a suitable m-PCE model provides a cost-effective approach compared to alternative algorithms proposed in the literature, including recently proposed expensive deep neural network-based surrogates and can be readily applied for high-dimensional UQ in stochastic PDEs.

42 ENGINEERING↗