Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “STOCHASTIC PROCESSES”

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 1,027 records · Page 57
All sourcesNASA NTRSDOE OSTI
NASA NTRS1977

Absolute value optimization to estimate phase properties of stochastic time series

Most existing deconvolution techniques are incapable of determining phase properties of wavelets from time series data; to assure a unique solution, minimum phase is usually assumed. It is demonstrated, for moving average processes of order one, that deconvolution filtering using the absolute value norm provides an estimate of the wavelet shape that has the correct phase character when the random driving process is nonnormal. Numerical tests show that this result probably applies to more general processes.

Scargle, J. D.↗
NASA NTRS1987

Stochastic and fractal analysis of fracture trajectories

Analyses of fracture trajectories are used to investigate structures that fall between 'micro' and 'macro' scales. It was shown that fracture trajectories belong to the class of nonstationary processes. It was also found that correlation distance, which may be related to a characteristic size of a fracture process, increases with crack length. An assemblage of crack trajectory processes may be considered as a diffusive process. Chudnovsky (1981-1985) introduced a 'crack diffusion coefficient' d which reflects the ability of the material to deviate the crack trajectory from the most energetically efficient path and thus links the material toughness to its structure. For the set of fracture trajectories in AISI 304 steel, d was found to be equal to 1.04 microns. The fractal dimension D for the same set of trajectories was found to be 1.133.

Bessendorf, Michael H.↗
NASA NTRS1989

Stochastic histories of dust grains in the interstellar medium

The purpose is to study an evolving system of refractory dust grains within the Interstellar Medium (ISM). This is done via a combination of Monte Carlo processes and a system of partial differential equations, where refractory dust grains formed within supernova remnants and ejecta from high mass loss stars are subjected to the processes of sputtering and collisional fragmentation in the diffuse media and accretion within the cold molecular clouds. In order to record chemical detail, the authors take each new particle to consist of a superrefractory core plus a more massive refractory mantle. The particles are allowed to transfer to and fro between the different phases of the interstellar medium (ISM) - on a time scale of 10(exp 8) years - until either the particles are destroyed or the program finishes at a Galaxy time of 6x10(exp 9) years. The resulting chemical and size spectrum(s) are then applied to various astrophysical problems with the following results. For an ISM which has no collisional fragmentation of the dust grains, roughly 10 percent by mass of the most refractory material survives the rigors of the ISM intact, which leaves open the possibility that fossilized isotopically anomalous material may have been present within the primordial solar nebula. Stuctured or layered refractory dust grains within the model cannot explain the observed interstellar depletions of refractory material. Fragmentation due to grain-grain collisions in the diffuse phase plus the accretion of material in the molecular cloud phase can under certain circumstances cause a bimodal distribution in grain size.

Liffman, Kurt↗
DOE OSTI2023

A Machine Learning Model for Predicting Composition of Catalytic Coprocessing Products from Molecular Beam Mass Spectra

Demand for the development of an automated and integrated refining process for biofuels has increased in recent years due to the lack of generalized process inspection tools. In bio-oil upgrading processes, all process variables are maintained based on the offline specification of intermediates and products. A lack of real-time product specifications in batch-wise monitoring can cause process failure and wasted resources. Therefore, there is a need for a fast and accurate intermediates/product specification tool that can be used for real-time specification to reduce waste and mitigate the risk of process failure. Here, to address this gap, we developed a machine learning (ML) model for predicting speciated bio-oil composition, including paraffin, iso-paraffins, olefins, naphthene, and aromatics. The model is trained using the mass spectra from upgraded products collected in the vapor phase before condensation and predicts the composition of the condensed product. Training ML models using raw mass spectra is challenging due to numerous overlapped peaks originating from different parent compounds. With this in mind, we propose a protocol that (i) transforms raw mass spectra to chemistry-inspired predefined features and (ii) trains decision tree-based models using these features. Our results show that the random forest model was robust against overfitting and had the highest accuracy compared to other models. Moreover, a stochastic ablation method determined the eight most significant features while maximizing the accuracy. Our protocol facilitates real-time compositional analysis of upgraded bio-oils and thus real-time process monitoring. Additionally, this protocol enables the rational design of efficient catalysts and the determination of optimal process conditions.

09 BIOMASS FUELS↗
NASA NTRS1991

A Scheduling Algorithm for Replicated Real-Time Tasks

We present an algorithm for scheduling real-time periodic tasks on a multiprocessor system under fault-tolerant requirement. Our approach incorporates both the redundancy and masking technique and the imprecise computation model. Since the tasks in hard real-time systems have stringent timing constraints, the redundancy and masking technique are more appropriate than the rollback techniques which usually require extra time for error recovery. The imprecise computation model provides flexible functionality by trading off the quality of the result produced by a task with the amount of processing time required to produce it. It therefore permits the performance of a real-time system to degrade gracefully. We evaluate the algorithm by stochastic analysis and Monte Carlo simulations. The results show that the algorithm is resilient under hardware failures.

Yu, Albert C.↗
NASA NTRS1999

Probabilistic Structural Analysis Methods (PSAM) for Select Space Propulsion System Components

Probabilistic Structural Analysis Methods (PSAM) are described for the probabilistic structural analysis of engine components for current and future space propulsion systems. Components for these systems are subjected to stochastic thermomechanical launch loads. Uncertainties or randomness also occurs in material properties, structural geometry, and boundary conditions. Material property stochasticity, such as in modulus of elasticity or yield strength, exists in every structure and is a consequence of variations in material composition and manufacturing processes. Procedures are outlined for computing the probabilistic structural response or reliability of the structural components. The response variables include static or dynamic deflections, strains, and stresses at one or several locations, natural frequencies, fatigue or creep life, etc. Sample cases illustrates how the PSAM methods and codes simulate input uncertainties and compute probabilistic response or reliability using a finite element model with probabilistic methods.

Source record↗
DOE OSTI2022

Training reinforcement learning models via an adversarial evolutionary algorithm

When training for control problems, more episodes used in training usually leads to better generalizability, but more episodes also requires significantly more training time. There are a variety of approaches for selecting the way that training episodes are chosen, including fixed episodes, uniform sampling, and stochastic sampling, but they can all leave gaps in the training landscape. In this work, we describe an approach that leverages an adversarial evolutionary algorithm to identify the worst performing states for a given model. We then use information about these states in the next cycle of training; this process can be repeated until the desired level of model performance is met. We demonstrate this approach with the OpenAI Gym cart-pole problem. With this problem, we show that the adversarial evolutionary algorithm did not reduce the number of episodes required in training needed to attain model generalizability when compared with stochastic sampling, and actually performed slightly worse.

Coletti, Mark↗
DOE OSTI2023

Incorporation of market signals for the optimal design of post combustion carbon capture systems

Recent studies have shown that fossil generators equipped with post-combustion carbon capture (PCC) systems are needed to reduce the cost of deep decarbonization. Such generators need to be flexible and responsive to grid conditions, particularly in a high variable renewable energy (VRE) environment. In this work, we evaluate the net present value (NPV) of retrofitting an existing natural gas combined cycle (NGCC) unit with a flexible PCC system while incorporating market signals from a high VRE grid. We use our industrial partner’s NGCC configuration as representative of existing NGCC units and Svante’s rapid-temperature swing adsorption (TSA) for PCC. Because of its ability to rapidly startup/shutdown and ramp-up/ramp-down, the chosen capture technology is very attractive for load-following operations. For a given set of market signals, we formulate a two-stage stochastic multi-period optimization problem, under the price-taker assumption, to simultaneously optimize the design of the capture system and operation of the entire plant. Rigorous models for the NGCC unit, PCC system, and compression system are developed using commercial process simulators and validated with either plant or vendor data. For computational tractability, we develop surrogate/reduced-order models for use in the optimization problem. The surrogate model for the NGCC plant is constructed by linearizing the rigorous dynamic model at 75% load, while data-driven nonlinear surrogate models for the capture and compression systems are constructed using simulation data from the rigorous models. The optimization problem, formulated as a mixed integer bilinear program, is implemented in the IDAES® integrated platform and solved to global optimality using Gurobi 9.5. Using this formulation, we determine the profitability of retrofitting an existing NGCC unit with the chosen capture system for multiple regions in the U.S. under two scenarios with different carbon prices. Importantly, the results show that the optimal decision strongly depends on the region and on the carbon price, thereby demonstrating the importance of the inclusion of market signals in the design process.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2024

Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures

Here, we investigate how to port the standard interior-point method to new exascale architectures for block-structured nonlinear programs with state equations. Computationally, we decompose the interior-point algorithm into two successive operations: the evaluation of the derivatives and the solution of the associated Karush-Kuhn-Tucker (KKT) linear system. Our method accelerates both operations using two levels of parallelism. First, we distribute the computations on multiple processes using coarse parallelism. Second, each process uses SIMD/GPU accelerators locally to accelerate the operations using fine-grained parallelism. The KKT system is reduced by eliminating the inequalities and the state variables from the corresponding equations. We demonstrate our method's capability on the supercomputer Polaris, a testbed for the future exascale Aurora system. Each node is equipped with four GPUs, a setup amenable to our two-level approach. Our experiments on the stochastic optimal power flow problem show that the reduction method is 50x faster than the sparse linear solver HSL MA57 running in serial on the CPU, and 6x faster than Pardiso running in parallel on CPU on the same number of processes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Theory of mean E × B shear in a stochastic magnetic field: ambipolarity breaking and radial current

The mean E $ \times $ B shear in a stochastic magnetic field is calculated, using the radial force balance relation and transport equations. This analysis is relevant to the L → H transition with resonant magnetic perturbations, and special focus is placed upon the physics of non-ambipolar transport and radial current. The key physical process is the flow of fluctuating currents along wandering magnetic fields. The increments in poloidal and toroidal rotation, density and ion pressure are calculated. The radial envelope of the magnetic perturbations inside the plasma defines a new scale ${\ell _{{\text{env}}}}$, which is the characteristic scale of the magnetic fluctuation intensity profile. Here, the net particle outflow due to stochastic magnetic fields is calculated and is determined by the net radial current through the separatrix. Implications for the L → H transition are discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Machine learning and atomic layer deposition: Predicting saturation times from reactor growth profiles using artificial neural networks

In this work, we explore the application of deep neural networks to the optimization of atomic layer deposition (ALD) processes. In particular, we focus on a one-shot optimization problem, where we try to predict the optimal dose time that leads to saturation everywhere in the reactor based on thickness values measured at different points of an ALD reactor after a single trial growth. In order to tackle this problem, we introduce a dataset designed to train neural networks to predict saturation times based on these inputs for a cross-flow ALD reactor. Here, we then explore the predictive ability of artificial neural networks of different depths and sizes using a separate testing dataset to evaluate their accuracies. The results obtained show that networks trained using stochastic gradient descent methods can accurately predict saturation times without requiring any additional information on the surface kinetics. This provides a viable approach to minimize the number of experiments required to optimize new ALD processes in a known reactor, and it highlights the way machine learning can be leveraged for thin film growth and manufacturing. While the datasets and training procedure depend on the reactor geometry, the trained neural networks provide a general surrogate model connecting thickness values and trial dose times with optimal saturation times that can be reused for different ALD processes within the same reactor.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Computational Aspects of Single-Molecule Kinetics for Coupled Catalytic Cycles: A Spectral Analysis

Catalysis from single active sites is analyzed using methods developed from single molecule kinetics. Using a stochastic Markov state description, the observable properties of general catalytic networks of reactions are expressed using an eigenvalue decomposition of the transition matrix for the Markov process. By the use of a sensitivity analysis, the necessary eigenvalues and eigenvectors are related to the energies of controlling barriers and wells located along the reaction routes. A generalization of the energetic span theory allows the eigenvalues to be computed from several activation energies corresponding to distinct barrier-well pairings. The formalism is demonstrated accurately for model problems for a physically realistic mechanism for an alkene hydrogenation reaction on a single atom catalyst.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

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↗
NASA NTRS1986

Analysis of modeling errors in system identification

This paper is concerned with the identification of a system in the presence of several error sources. Following some basic definitions, the notion of 'near-equivalence in probability' is introduced using the concept of near-equivalence between a model and process. Necessary and sufficient conditions for the identifiability of system parameters are given. The effect of structural error on the parameter estimates for both deterministic and stochastic cases are considered.

Hadaegh, F. Y.↗
DOE OSTI2021

Jarzynski Equality for Conditional Stochastic Work

It has been established that the inclusive work for classical, Hamiltonian dynamics is equivalent to the two-time energy measurement paradigm in isolated quantum systems. However, a plethora of other notions of quantum work has emerged, and thus the natural question arises whether any other quantum notion can provide motivation for purely classical considerations. In the present analysis, we propose the conditional stochastic work for classical, Hamiltonian dynamics, which is inspired by the one-time measurement approach. This novel notion is built upon the change of expectation value of the energy conditioned on the initial energy surface. As main results, we obtain a generalized Jarzynski equality and a sharper maximum work theorem, which account for how non-adiabatic the process is. Our findings are illustrated with the parametric harmonic oscillator.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Physics-Informed Gaussian Process Regression for States Estimation and Forecasting in Power Grids

Real-time state estimation and forecasting are critical for the efficient operation of power grids. In this paper, a physics-informed Gaussian process regression (PhI-GPR) method is presented and used for forecasting and estimating the phase angle, angular speed, and wind mechanical power of a three-generator power grid system using sparse measurements. In standard data-driven Gaussian process regression (GPR), parameterized models for the prior statistics are fit by maximizing the marginal likelihood of observed data. In the PhI-GPR method, we propose to compute the prior statistics offline by solving stochastic differential equations (SDEs) governing the power grid dynamics. The short-term forecast of a power grid system dominated by wind generation is complicated by the stochastic nature of the wind and the resulting uncertainty in wind mechanical power. Here, we assume that the power grid dynamics are governed by swing equations, with the wind mechanical power fluctuating randomly in time. We solve these equations for the mean and covariances of the power grid states using the Monte Carlo simulation method. We demonstrate that the proposed PhI-GPR method can accurately forecast and estimate observed and unobserved states. For the considered problem, PhI-GPR has computational advantages over the ensemble Kalman filter (EnKF) method: In PhI-GPR, ensembles are computed offline and independently of the data acquisition process, whereas for EnFK, ensembles are computed online with data acquisition, rendering real-time forecast more challenging. We also demonstrate that the PhI-GPR forecast is more accurate than the EnKF forecast when the random mechanical wind power is non-Markovian. In contrast, the two methods produce similar forecasts for the Markovian mechanical wind power. For observed states, we show that PhI-GPR provides a forecast comparable to the standard data-driven GPR; both forecasts are significantly more accurate than the autoregressive integrated moving average (ARIMA) forecast. We also show that the ARIMA forecast is more sensitive to observation frequency and measurement errors than the PhI-GPR forecast.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2017

The Mechanism for the Energy Buildup Driving Solar Eruptive Events

The underlying origin of solar eruptive events (SEEs), ranging from giant coronal mass ejections to small coronalhole jets, is that the lowest-lying magnetic flux in the Sun's corona undergoes continual buildup of stress and free energy. This magnetic stress has long been observed as the phenomenon of "filament channels:" strongly sheared magnetic field localized around photospheric polarity inversion lines. However, the mechanism for the stress buildup-formation of filament channels-is still debated. We present magnetohydrodynamic simulations of a coronal volume that is driven by transient, cellular boundary flows designed to model the processes by which the photosphere drives the corona. The key feature of our simulations is that they accurately preserve magnetic helicity, the topological quantity that is conserved even in the presence of ubiquitous magnetic reconnection. Although small-scale random stress is injected everywhere at the photosphere, driving stochastic reconnection throughout the corona, the net result of the magnetic evolution is a coherent shearing of the lowest-lying field lines. This highly counterintuitive result-magnetic stress builds up locally rather than spreading out to attain a minimum energy state-explains the formation of filament channels and is the fundamental mechanism underlying SEEs. Furthermore, this process is likely to be relevant to other astrophysical and laboratory plasmas.

Knizhnik, K. J.↗