Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 127 records · Page 7

Accurate Atomic Correlation and Total Energies for Correlation Consistent Effective Core Potentials

Very recently, we introduced a set of correlation consistent effective core potentials (ccECPs) constructed within full many-body approaches. By employing significantly more accurate correlated approaches, we were able to reach a new level of accuracy for the resulting effective core Hamiltonians. We also strived for simplicity of use and easy transferability into a variety of electronic structure methods in quantum chemistry and condensed matter physics. Here, as a reference for future use, we present exact or nearly exact total energy calculations for these ccECPs. The calculations cover H–Kr elements and are based on the state-of-the-art configuration interaction (CI), coupled-cluster (CC), and quantum Monte Carlo (QMC) calculations with systematically eliminated/improved errors. In particular, we carry out full CI/CCSD(T)/CCSDT(Q) calculations with cc-pVnZ with up to n = 6 basis sets and we estimate the complete basis set limits. Using combinations of these approaches, we achieved an accuracy of ≈1–10 mHa for K–Zn atoms and ≈0.1–0.3 mHa for all other elements—within about 1% or better of the ccECP total correlation energies. We also estimate the corresponding kinetic energies within the feasible limit of full CI calculations. In order to provide data for QMC calculations, we include fixed-node diffusion Monte Carlo energies for each element that give quantitative insights into the fixed-node biases for single-reference trial wave functions. The results offer a clear benchmark for future high-accuracy calculations in a broad variety of correlated wave function methods such as CI and CC as well is in stochastic approaches such as real space sampling QMC.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Robust Parameter Design on Dual Stochastic Response Models With Constrained Bayesian Optimization

In engineering system design, minimizing the variations of the quality measurements while guaranteeing their overall quality up to certain levels, namely the robust parameter design (RPD), is crucial. Recent works have dealt with the design of a system whose response-control variables relationship is a deterministic function with a complex shape and function evaluation is expensive. In this work, we propose a Bayesian optimization method for the RPD of stochastic functions. Dual stochastic response models are carefully designed for stochastic functions. The heterogeneous variance of the sample mean is addressed by the predictive mean of the log variance surrogate model in a two-step approach. We establish an acquisition function that favors exploration across the feasible and optimality-improvable regions to effectively and efficiently solve the stochastic constrained optimization problem. Further, the performance of our proposed method is demonstrated by the extensive numerical and case studies. Note to Practitioners-Many manufacturing processes involve undesirable variations, which create variations in the final products. For example, many emerging manufacturing processes, such as nanomanufacturing, involve complex physical and chemical dynamics and transformation, creating variations in the manufacturing output. In such processes, it is crucial to design the manufacturing processes or products so that they have minimum variations in their quality. Meanwhile, it is also important to maintain the overall quality of the designed processes or products. Furthermore, acquiring data from many advanced manufacturing processes is often very costly, especially in the designing stage. In this work, we propose a data-driven method that automatically finds the best setting of manufacturing processes or products with the minimum variations of quality and a given constraint on the average quality satisfied. Our proposed method is used before conducting every experiment; It analyzes the historical data from previous experiments and provides a setting to be used in the next experiment. Our proposed method efficiently utilizes the historical data, and thus finds the best robust setting by conducting only a small number of experiments.

42 ENGINEERING↗

Evaluation of Seismic Artificial Intelligence with Uncertainty

Artificial intelligence has transformed the seismic community with deep learning models (DLMs) that are trained to complete specific tasks within workflows. However, there is still a lack of robust evaluation frameworks for evaluating and comparing DLMs. Here, we address this gap by designing an evaluation framework that jointly incorporates two crucial aspects: performance uncertainty and learning efficiency. To target these aspects, we meticulously construct the training, validation, and test splits using a clustering method tailored to seismic data and enact an expansive training design to segregate performance uncertainty arising from stochastic training processes and random data sampling. The framework’s ability to guard against misleading declarations of model superiority is demonstrated through the evaluation of PhaseNet (Zhu and Beroza, 2018), a popular seismic phase picking DLM, under three training approaches. Our framework helps practitioners choose the best model for their problem and set performance expectations by explicitly analyzing model performance with uncertainty at varying budgets of training data.

58 GEOSCIENCES↗

Breakups are complicated: an efficient representation of collisional breakup in the superdroplet method

Abstract. A key constraint of particle-based methods for modeling cloud microphysics is the conservation of total particle number, which is required for computational tractability. The process of collisional breakup poses a particular challenge to this framework, as breakup events often produce many droplet fragments of varying sizes, which would require creating new particles in the system. This work introduces a representation of collisional breakup in the so-called “superdroplet” method which conserves the total number of superdroplets in the system. This representation extends an existing stochastic collisional-coalescence scheme and samples from a fragment size distribution in an additional Monte Carlo step. This method is demonstrated in a set of idealized box model and single-column warm-rain simulations. We further discuss the effects of the breakup dynamic and fragment size distribution on the particle size distribution, hydrometeor population, and microphysical process rates. Box model experiments serve to characterize the impacts of properties such as coalescence efficiency and fragmentation function on the relative roles of collisional breakup and coalescence. The results demonstrate that this representation of collisional breakup can produce a stationary particle size distribution, in which breakup and coalescence rates are approximately equal, and that it recovers expected behavior such as a reduction in precipitate-sized particles in the column model. The breakup algorithm presented here contributes to an open-source pythonic implementation of the superdroplet method, PySDM, which will facilitate future research using particle-based microphysics.

de Jong, Emily (ORCID:0000000253104554)↗

Effect of void positioning on the detonation sensitivity of a heterogeneous energetic material

We show although it is well-established that voids profoundly influence the initiation and reaction behaviors of heterogeneous energetic materials such as polymer-bonded explosives (PBX) and propellants, there has been little study of how void location in different constituents in the microstructures of such materials affect the macroscale behavior. Here, we use three-dimensional (3D) mesoscale simulations to study how void placement within the reactive grains versus the polymer binder influences the shock-to-detonation transition (SDT) in a polymer-bonded explosive. The material studied here has a microstructure comprised of 75% PETN (pentaerythritol tetranitrate) grains and 25% HTPB (hydroxyl-terminated polybutadiene) polymer binder by volume. Porosities up to 10% in the form of spherical voids distributed in both the grains and polymer are considered. An Arrhenius reactive burn relation is used to model the chemical kinetics of the PETN grains under shock loading, thereby resolving the heterogeneous detonation behavior of the PBX. The influence of void location on the shock initiation sensitivity of the material is quantitatively ranked by comparing the predicted run distance to detonation (RDD) for each sample. The analysis includes inherent quantification of uncertainties arising from the stochastic variations in the microstructure morphologies and void distributions by using statistically equivalent microstructure sample sets (SEMSS), leading to probabilistic formulations for the RDD as a function of shock pressure. The calculations reveal that the location of voids in the composite microstructure significantly affects the RDD. Specifically, voids exclusively within the grains cause the PBX to be more sensitive (having shorter RDD) than voids in the polymer binder. Unique probabilistic relationships are derived to map the probability of observing RDD for each void location material case, allowing for prediction of initiation behavior anywhere in the shock pressure – RDD space. These findings agree with trends reported in the literature.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Deterministic and Monte Carlo Nuclear Data Adjustment Methods [Slides]

For the Bayesian Monte Carlo methodology, a need to understand convergence of the posterior moments as a function of the number of parameter realizations is required. In high-dimensional systems, it can be very costly to sample entire parameter space and perform functional evaluation for every realization. Bayesian Monte Carlo allows one to relax the GLLS approximations of model linearity and prior/posterior PDF shape. The Bayesian Stochastic Collocation Method is a deterministic approach to “sample” the parameter space. It allows one to relax the GLLS approximations of model linearity and posterior PDF shape. Higher-order posterior moments (i.e., skewness, kurtosis, etc.) can be studied through polynomial expansion. Tensor product quadrature scales poorly and can use sparse grid quadrature methods.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

SDYN-GANs: Adversarial learning methods for multistep generative models for general order stochastic dynamics

We introduce adversarial learning methods for data-driven generative modeling of dynamics of nth-order stochastic systems. Our approach builds on Generative Adversarial Networks (GANs) with generative model classes based on stable m-step stochastic numerical integrators. From observations of trajectory samples, we introduce methods for learning long-time predictors and stable representations of the dynamics. Our approaches use discriminators based on Maximum Mean Discrepancy (MMD), training protocols using both conditional and marginal distributions, and methods for learning dynamic responses over different time-scales. We show how our approaches can be used for modeling physical systems to learn force-laws, damping coefficients, and noise-related parameters. Our adversarial learning approaches provide methods for obtaining stable generative models for dynamic tasks including long-time prediction and developing simulations for stochastic systems.

• Artificial intelligence (AI) / machine learning ↗

Contributions to Lignomics: Stochastic Generation of Oligomeric Lignin Structures for Interpretation of MALDI–FT‐ICR‐MS Results

The lack of standards to identify oligomeric molecules is a challenge for the analysis of complex organic mixtures. High-resolution mass spectrometry—specifically, Fourier-transform ion cyclotron resonance mass spectrometry (FT-ICR MS)—offers new opportunities for analysis of oligomers with the assignment of formulae (C x H y O z ) to detected peaks. However, matching a specific structure to a given formula remains a challenge due to the inability of FT-ICR MS to distinguish between isomers. Additional separation techniques and other analyses (e.g., NMR spectroscopy) coupled with comparison of results to those from pure compounds is one route for assignment of MS peaks. Unfortunately, this strategy may be impractical for complete analysis of complex, heterogeneous samples. In this study we use computational stochastic generation of lignin oligomers to generate a molecular library for supporting the assignment of potential candidate structures to compounds detected during FT-ICR MS analysis. Furthermore, this approach may also be feasible for other macromolecules beyond lignin.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms

The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. In conclusion, we numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs.

Derivative-free Optimization↗

Laplacian Smoothing Stochastic Gradient Markov Chain Monte Carlo

As an important Markov chain Monte Carlo (MCMC) method, the stochastic gradient Langevin dynamics (SGLD) algorithm has achieved great success in Bayesian learning and posterior sampling. Furthermore, SGLD typically suffers from a slow convergence rate due to its large variance caused by the stochastic gradient. In order to alleviate these drawbacks, we leverage the recently developed Laplacian smoothing technique and propose a Laplacian smoothing stochastic gradient Langevin dynamics (LS-SGLD) algorithm. We prove that for sampling from both log-concave and non-log-concave densities, LS-SGLD achieves strictly smaller discretization error in 2-Wasserstein distance, although its mixing rate can be slightly slower. Experiments on both synthetic and real datasets verify our theoretical results and demonstrate the superior performance of LS-SGLD on different machine learning tasks including posterior sampling, Bayesian logistic regression, and training Bayesian convolutional neural networks.

97 MATHEMATICS AND COMPUTING↗

A Data-Driven Methodology for Contextual Unit Commitment Using Regression Residuals

Day after day, system operators are faced with the challenge of taking unit commitment (UC) decisions under uncertain net load conditions. The standard operating procedure for taking UC decisions begins by leveraging auxiliary data on covariates (such as the day of the week or latest weather information) to generate a point prediction for net load, which is used in solving a deterministic UC problem. Such an approach, however, is known to deliver a notoriously poor out-of-sample (OOS) performance, as it completely disregards the stochastic nature of net load. While stochastic programming models explicitly represent uncertainty, they mostly do so using a generic set of scenarios that neglect covariate observations, squandering useful auxiliary data that could be harnessed to glean insights into uncertainty. In this article, we discuss a contextual stochastic optimization approach to UC, which effectively exploits covariate observations while explicitly assessing uncertainty so as to boost the OOS performance of UC decisions. The key thrust of our approach is to leverage regression models, along with their empirical residuals, to set up and solve sample average approximation problems. Not only do we prove that our approach satisfies the requisite conditions for asymptotic optimality and consistency laid out in (Kannan et al., 2022), but we also assess its performance on several case studies conducted using real-world data collected in California ISO and New York ISO grids. In conclusion, results show that the proposed approach can significantly improve OOS performance compared to alternative methods proposed in the literature under varying dataset sizes.

Yurdakul, Ogun↗

Allocation and Operation of A Hydropneumatic Energy Storage with Building Microgrid

Behind-meter application for a recently invented hydropneumatic Ground-Level Integrated Diverse Energy Storage (GLIDES) is focused in this research. Considering possible uncertainties from solar radiation and electricity load in a building microgrid, two-stage stochastic programming is adopted for 15-min operation and a mixed-integer nonlinear stochastic model is built with integrated energy systems of GLIDES, solar panel and power generating unit. In order to make the model computationally tractable, we use sample average approximate method to decrease associated complexity with sample size and improve solving efficiency. The experimental results in deterministic and stochastic operation indicate that best candidate solution from SAA are superior to the solution from expected value problem in terms of optimality gap and variance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimal Control of Biomass Feedstock Processing System Under Uncertainty in Biomass Quality

Planning of biorefinery operations is complicated by the stochastic nature of physical and chemical characteristics of biomass feedstock, such as, moisture level and carbohydrate content. Biomass characteristics affect the performance of the equipment which feed the reactor and the efficiency of the conversion process in a biorefinery. We propose a stochastic optimization model to identify a blend of feedstocks, inventory levels, and operating conditions of equipment to ensure a continuous flowing of biomass to the reactor while meeting the requirements of the biochemical conversion process. We propose a sample average approximation (SAA) of the model, and develop an efficient algorithm to solve the SAA model. A feedstock preprocessing process consists of two-stage grinding and pelleting is used to develop a case study. Extensive numerical analysis are conducted which lead to a number of observations. Our main observation is that sequencing bales based on moisture level and carbohydrate content leads to robust solutions that improve processing time and processing rate of the reactor. We provide a number of managerial insights that facilitate the implementation of the model proposed. Note to Practitioners—This paper is motivated by the challenges faced in the bioenergy industry. The focus of this paper is on plants which use the biochemical conversion process to generate liquid fuels. It has been observed that variations in biomass characteristics, such as moisture content, cause variations in feeding of the system which lead to under-utilization of equipment. A requirement of biochemical conversion process is to maintain the carbohydrate content of biomass processed by the reactor, larger than a threshold. We propose a model that identifies the inventory levels and operating conditions of equipment to ensure a continuous flowing of biomass to the reactor. The goal is to improve equipment utilization while satisfying the requirements of the conversion process. The model is tested using real-life data. We found out that by sequencing bales based on moisture level and carbohydrate content, a plant can reduce variability in the system leading to improved system reliability, higher processing rates of the reactor, and higher throughput.

09 BIOMASS FUELS↗

DeepONet-grid-UQ: A trustworthy deep operator framework for predicting the power grid’s post-fault trajectories

This paper proposes a novel data-driven method for the reliable prediction of the power grid’s post-fault trajectories, i.e., the power grid’s dynamic response after a disturbance or fault. Here, the proposed method is based on the recently proposed concept of Deep Operator Networks (DeepONets). Unlike traditional neural networks that learn to approximate functions, DeepONets are designed to approximate nonlinear operators, i.e., mappings between infinite-dimensional spaces. Under this operator framework, we design a novel and efficient DeepONet that (i) takes as inputs the trajectories collected before and during the fault and (ii) outputs the predicted post-fault trajectories. In addition, we endow our method with the much-needed ability to balance efficiency with reliable/trustworthy predictions via uncertainty quantification. To this end, we propose and compare two novel methods that enable quantifying the predictive uncertainty. First, we propose a Bayesian DeepONet (B-DeepONet) that uses stochastic gradient Hamiltonian Monte-Carlo to sample from the posterior distribution of the DeepONet trainable parameters. Then, we design a Probabilistic DeepONet (Prob-DeepONet) that uses a probabilistic training strategy to enable quantifying uncertainty at virtually no extra computational cost. Finally, we validate the proposed methods’ predictive power and uncertainty quantification capability using the New York-New England power grid model.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Machine learning approach for vibronically renormalized electronic band structures

Here, we present a machine learning (ML) method for efficient computation of vibrational thermal expectation values of physical properties from first principles. Our approach is based on the nonperturbative frozen phonon formulation in which stochastic Monte Carlo algorithm is employed to sample configurations of nuclei in a supercell at finite temperatures based on a first-principles phonon model. A deep-learning neural network is trained to accurately predict physical properties associated with sampled phonon configurations, thus bypassing the time-consuming ab initio calculations. To incorporate the point-group symmetry of the electronic system into the ML model, group-theoretical methods are used to develop a symmetry-invariant descriptor for phonon configurations in the supercell. We apply our ML approach to compute the temperature dependent electronic energy gap of silicon based on density functional theory (DFT). We show that, with less than a hundred DFT calculations for training the neural network model, an order of magnitude larger number of sampling can be achieved for the computation of the vibrational thermal expectation values. Our work highlights the promising potential of ML techniques for finite temperature first-principles electronic structure methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A Dynamic Amplitude-Correcting Gradient Estimation Technique to Align X-ray Focusing Optics

High-brightness X-rays, as produced at synchrotrons and X-ray free electron laser (XFEL) facilities, are used to characterize materials in a variety of scientific experiments. In most cases, effective use of the high-energy light requires precisely-aligned focusing optics; one example being a compound refractive lens (CRL). To align a CRL, the position and rotation must be optimized along four axes. In practice, this is a labor-intensive, time-consuming manual process that can monopolize scarce experimental time at the necessary X-ray facilities. Models of the expected Xray transmission function suggest that this task can be automated; however, the temporally-varying intensity at X-ray free electron laser facilities preclude the direct use of standard implementations of optimization solvers such as steepest descent algorithms. In this paper, we propose a novel technique to estimate the gradient of noisy functions with temporally-varying amplitudes. We construct this dynamicamplitude correction by systematically sampling a fixed central location within the standard finite difference stencil, accounting for the observed changes in time, and normalizing the difference quotients against those fluctuations. In addition to a rigorous error analysis of the sampling technique, we demonstrate its efficacy in stochastic descent optimization methods. Further, we demonstrate how this approach may be implemented to optimize X-ray focusing optics at synchrotrons or XFEL facilities

97 MATHEMATICS AND COMPUTING↗

Adaptive Uncertainty Quantification for Stochastic Hyperbolic Conservation Laws

Here, we propose a predictor-corrector adaptive method for the study of hyperbolic partial differential equations (PDEs) under uncertainty. Constructed around the framework of stochastic finite volume (SFV) methods, our approach circumvents sampling schemes or simulation ensembles while also preserving fundamental properties, in particular hyperbolicity of the resulting systems and conservation of the discrete solutions. Furthermore, we augment the existing SFV theory with a priori convergence results for statistical quantities, in particular push-forward densities, which we demonstrate through numerical experiments. By linking refinement indicators to regions of the physical and stochastic spaces, we drive anisotropic refinements of the discretizations, introducing new degrees of freedom where deemed profitable. To illustrate our proposed method, we consider a series of numerical examples for nonlinear hyperbolic PDEs based on Burgers’ and Euler’s equations.

97 MATHEMATICS AND COMPUTING↗