Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stochastic methods”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,531 records · Page 85

Stabilization of the 81-channel coherent beam combination using machine learning

We develop a rapidly converging algorithm for stabilizing a large channel-count diffractive optical coherent beam combination. An 81-beam combiner is controlled by a novel, machine-learning based, iterative method to correct the optical phases, operating on an experimentally calibrated numerical model. A neural-network is trained to detect phase errors based on interference pattern recognition of uncombined beams adjacent to the combined one. Due to the non-uniqueness of solutions in the full space of possible phases, the network is trained within a limited phase perturbation/error range. This also reduces the number of samples needed for training. Simulations have proven that the network can converge in one step for small phase perturbations. When the trained neural-network is applied to a realistic case of 360 degree full range, an iterative scheme exploits random walking at the beginning, with the accuracy of prediction on phase feedback direction, to allow the neural-network to step into the training range for fast convergence. This neural-network-based iterative method of phase detection works tens of times faster than the commonly used stochastic parallel gradient descent approach (SPGD) using a single-detector and random dither when both are tested with random phase perturbations.

Wang, Dan↗

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

LandScan Mosaic

The LandScan program at Oak Ridge National Laboratory (ORNL), in collaboration with the National Geospatial-Intelligence Agency (NGA), continues to deliver the most accurate and up to date global, high resolution gridded population data. Additionally, the latest advancements in the LandScan HD methodology led to reduced latency in development of rapid updates for geopolitical events. With momentum towards reporting more up to date population estimates, feedback from the user community expressed interest in reporting population estimates in ranges - whether to express a level of uncertainty or confirm to leadership and stakeholders the modeled data are estimates. Building upon the need to understand uncertainty or confidence in the modeled data and report ranges at the global scale, LandScan Mosaic was developed. LandScan Mosaic represents the next generation of high-resolution population modeling, building upon the established success of previous LandScan HD iterations. While LandScan HD employed a deterministic big data fusion approach, LandScan Mosaic enhances this methodology by integrating advanced machine learning techniques to impute missing, yet crucial, population model parameters. This advancement allows for probabilistic modeling of building occupancy and population distribution, incorporating uncertainty quantification through Monte Carlo sampling methods. By combining big data fusion with machine learning-driven imputation and stochastic modeling, LandScan Mosaic provides a more comprehensive and robust representation of population dynamics. LandScan Mosaic will be following the in the footsteps of its longstanding counterpart LandScan Global and releasing a global gridded population raster, at the 3-arcsecond resolution. This technical report documents the current stage of development of LandScan Mosaic, detailing the methodologies and data sources behind the modeling. Stakeholders are encouraged to use this document as an authoritative reference for insight into Mosaic’s data development processes. However, readers should note that LandScan Mosaic remains in a late-stage research and development phase, and methodologies and data presented here are subject to refinements ahead of the anticipated global release in Summer 2025. Feedback and inquiries from users and stakeholders are welcomed as we continue to refine and enhance this important population resource.

97 MATHEMATICS AND COMPUTING↗

Status of dual control theory

Theoretical studies of decision making and stochastic processes are discussed. Several approaches are described for an improved performing control method. It is shown that control performance is highly dependent on the knowledge of the unknown parameters in the system.

Tse, E.↗

Placing dynamic sensors and actuators on flexible space structures

Input/Output Cost Analysis involves decompositions of the quadratic cost function into contributions from each stochastic input and each weighted output. In the past, these suboptimal cost decomposition methods of sensor and actuator selection (SAS) have been used to locate perfect (infinite bandwidth) sensor and actuators on large scale systems. This paper extends these ideas to the more practical case of imperfect actuators and sensors with dynamics of their own. NASA's SCOLE examples demonstrate that sensor and actuator dynamics affect the optimal selection and placement of sensors and actuators.

Norris, Gregory A.↗

A stochastic precipitation disaggregation scheme for GCM applications

In the surface hydrologic parameterization of general circulation models (GCMs), it is commonly assumed that the precipitation processes are homogeneous over a GCM grid square and that the precipitation intensity is uniformly distributed. Based on evidence that the spatial distribution of precipitation within a GCM grid square is crucial for the land surface hydrology parameterization, a few researchers have explored the impacts of assuming that the precipitation is exponentially distributed. This paper explores the suitability of the aforementioned assumptions. First, a statistical analysis is conducted of historical precipitation data for three GCM grids in different regions of the United States. The analysis suggests that neither the uniform nor the exponential distribution assumption may be suitable at the GCM grid scale and, that instead, the spatial variability in precipitation is characterized by statistical patterns that are inhomogeneous. These patterns vary from grid to grid and are induced by the interaction between atmospheric conditions and various land surface characteristics, such as topographical features, surface properties, etc. Within the same grid square, however, the statistical patterns are generally constant from year to year. Based on this analysis, a computationally viable (i.e., usable with GCMs) stochastic precipitation disaggregation scheme that utilizes these stable statistical patterns is proposed. The method was used to generate spatially distributed hourly rainfall for a summer season in the southwestern region of the continental United States. Analysis of the results shows that the methodology preserves the seasonal characteristics of spatial variability in precipitation that is observed in the long-term historical data.

Gao, Xiaogang↗

Jet Mixing Enhancement by Feedback Control

The objective of this work has been to produce methodologies for high speed jet noise reduction based on natural mechanisms and enhanced feedback control to affect frequencies and structures in a prescribed manner. In this effort the two-point hot wire measurements obtained in the Langley jet facility by Ukeiley were used in conjuction with linear stochastic estimation (LSE) to implement the LSE component of the complementary technique. This method combines the Proper Orthogonal Decomposition (POD) and LSE to provide an experimental low dimensional time dependent description of the flow field. From such a description it should be possible to identify short time high strain rate events in the jet which contribute to the noise. The main task completed for this effort is summarized: LSE experiments were performed at the downstream locations where the two point hot wire measurements have been obtained by Ukeiley. These experiments involved sampling simultaneously hot wire signals from a relatively course spatial grid in gamma and theta. From this simultaneous data, coupled with the two-point measurements of Ukeiley via the LSE components of the complementary technique, an experimental low dimensional description of the jet at 4, 5, 6, 7 and 8 diameters downstream was obtained for Mach numbers of 0.3 and 0.6. We first present an overview of the theory involved. We finish up with a statement of the work performed and finally provide charts from a 1999 APS talk which summarizes the results.

Glauser, Mark↗

Aeroservoelastic Optimization under Stochastic Gust Constraints

This work considers the aeroservoelastic optimization of a highly flexible transport aircraft wingbox with several control surfaces distributed along the trailing edge. The steady deflections of the control surfaces are designed to alleviate static maneuver loads, while the unsteady deflections are designed to alleviate stochastic continuous gust disturbances. Spatially-detailed unsteady stochastic stress and panel buckling constraints are formulated via modal acceleration, and by methods to locate the most-probable failure point along an equal-probability hypersurface. For the case considered here, it is found that the inclusion of such gust constraints during optimization presents a sizable structural mass penalty. In some cases, this mass penalty can be completely recovered with controlled gust load alleviation.

Stanford, Bret K.↗

Characterizing the elements of Earth s radiative budget: Applying uncertainty quantification to the CESM

Understanding and characterizing sources of uncertainty in climate modeling is an important task. Because of the ever increasing sophistication and resolution of climate modeling it is increasing important to develop uncertainty quantification methods that minimize the computational cost that occurs when these methods are added to climate modeling. This research explores the application of sparse stochastic collocation with polynomial edge detection to characterize portions of the probability space associated with the Earth s radiative budget in the Community Earth System Model (CESM). Specifically, we develop surrogate models with error estimates for a range of acceptable input parameters that predict statistical values of the Earth s radiative budget as derived from the CESM simulation. We extend these results in resolution from T31 to T42 and in parameter space increasing the degrees of freedom from two to three.

Archibald, Richard K↗

Guiding the Design of Heterogeneous Electrode Microstructures for Li-Ion Batteries: Microscopic Imaging, Predictive Modeling, and Machine Learning

Electrochemical and mechanical properties of lithium-ion battery materials are heavily dependent on their 3D microstructure characteristics. A quantitative understanding of the role played by stochastic microstructures is critical for the prediction of material properties and for guiding synthesis processes. Furthermore, tailoring microstructure morphology is also a viable way of achieving optimal electrochemical and mechanical performances of lithium-ion cells. To facilitate the establishment of microstructure-resolved modeling and design methods, a review covering spatially and temporally resolved imaging of microstructure and electrochemical phenomena, microstructure statistical characterization and stochastic reconstruction, microstructure-resolved modeling for property prediction, and machine learning for microstructure design is presented here. The perspectives on the unresolved challenges and opportunities in applying experimental data, modeling, and machine learning to improve the understanding of materials and identify paths toward enhanced performance of lithium-ion cells are presented.

25 ENERGY STORAGE↗

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↗

Stochastic quantum Krylov protocol with double-factorized Hamiltonians

Here we propose a class of randomized quantum Krylov diagonalization (rQKD) algorithms capable of solving the eigenstate estimation problem with modest quantum resource requirements. Compared to previous real-time evolution quantum Krylov subspace methods, our approach expresses the time evolution operator e –i$\widehat{H}$$\tau$ as a linear combination of unitaries and subsequently uses a stochastic sampling procedure to reduce circuit depth requirements. While our methodology applies to any Hamiltonian with fast-forwardable subcomponents, we focus on its application to the explicitly double-factorized electronic-structure Hamiltonian. To demonstrate the potential of the proposed rQKD algorithm on near-term quantum devices, we provide numerical benchmarks for a variety of molecular systems with circuit-based state-vector simulators including the effects of sampling noise, achieving ground-state energy errors of less than 1 kcal mol -1 with circuit depths orders of magnitude shallower than those required for low-rank deterministic Trotter-Suzuki decompositions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bayesian data assimilation for stochastic multiscale models of transport in porous media.

We investigate Bayesian techniques that can be used to reconstruct field variables from partial observations. In particular, we target fields that exhibit spatial structures with a large spectrum of lengthscales. Contemporary methods typically describe the field on a grid and estimate structures which can be resolved by it. In contrast, we address the reconstruction of grid-resolved structures as well as estimation of statistical summaries of subgrid structures, which are smaller than the grid resolution. We perform this in two different ways (a) via a physical (phenomenological), parameterized subgrid model that summarizes the impact of the unresolved scales at the coarse level and (b) via multiscale finite elements, where specially designed prolongation and restriction operators establish the interscale link between the same problem defined on a coarse and fine mesh. The estimation problem is posed as a Bayesian inverse problem. Dimensionality reduction is performed by projecting the field to be inferred on a suitable orthogonal basis set, viz. the Karhunen-Loeve expansion of a multiGaussian. We first demonstrate our techniques on the reconstruction of a binary medium consisting of a matrix with embedded inclusions, which are too small to be grid-resolved. The reconstruction is performed using an adaptive Markov chain Monte Carlo method. We find that the posterior distributions of the inferred parameters are approximately Gaussian. We exploit this finding to reconstruct a permeability field with long, but narrow embedded fractures (which are too fine to be grid-resolved) using scalable ensemble Kalman filters; this also allows us to address larger grids. Ensemble Kalman filtering is then used to estimate the values of hydraulic conductivity and specific yield in a model of the High Plains Aquifer in Kansas. Strong conditioning of the spatial structure of the parameters and the non-linear aspects of the water table aquifer create difficulty for the ensemble Kalman filter. We conclude with a demonstration of the use of multiscale stochastic finite elements to reconstruct permeability fields. This method, though computationally intensive, is general and can be used for multiscale inference in cases where a subgrid model cannot be constructed.

54 ENVIRONMENTAL SCIENCES↗

Jump rates for surface diffusion of large molecules from first principles

We apply a recently developed stochastic model for the surface diffusion of large molecules to calculate jump rates for 9,10-dithioanthracene on a Cu(111) surface. The necessary input parameters for the stochastic model are calculated from first principles using density functional theory (DFT). We find that the inclusion of van der Waals corrections to the DFT energies is critical to obtain good agreement with experimental results for the adsorption geometry and energy barrier for diffusion. The predictions for jump rates in our model are in excellent agreement with measured values and show a marked improvement over transition state theory (TST). We find that the jump rate prefactor is reduced by an order of magnitude from the TST estimate due to frictional damping resulting from energy exchange with surface phonons, as well as a rotational mode of the diffusing molecule.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MASTODON: An Open-Source Software for Seismic Analysis and Risk Assessment of Critical Infrastructure

Seismic analysis and risk assessment of safety-critical infrastructure like hospitals, nuclear power plants, dams, and facilities handling radioactive materials involve computationally intensive numerical models and coupled multiphysics scenarios. They are also performed in a strict regulatory environment that requires high software quality assurance standards, and in the case of safety-related nuclear facilities, a conformance to the American Society of Mechanical Engineers Nuclear Quality Assurance (NQA-1) standard. This paper introduces the open-source finite-element software, MASTODON (Multi-hazard Analysis of Stochastic Time-Domain Phenomena), which implements state-of-the-art seismic analysis and risk assessment tools in a quality-controlled environment. MASTODON is built on MOOSE (Multi-physics Object-Oriented Simulation Environment), which is a highly parallelizable, NQA-1 conforming, coupled multiphysics, finite-element framework developed at Idaho National Laboratory. MASTODON is capable of fault rupture and source-to-site wave propagation using the domain reduction method, nonlinear site response, and soil-structure interaction analysis, implicit and explicit time integration, automated stochastic simulations, and seismic probabilistic risk assessment. When coupled with other MOOSE applications, MASTODON can also solve strongly and weakly coupled multiphysics problems. This paper presents a summary of the capabilities of MASTODON and some demonstrative examples.

42 ENGINEERING↗

Stochastic economic dispatch of wind power under uncertainty using clustering-based extreme scenarios

Operation of power systems with high penetrations of renewable energy sources requires tools for robust decision making under uncertainty. Stochastic economic dispatch and stochastic unit commitment are effective techniques for planning and operation under uncertainty, whose effectiveness depends on the cardinality and quality of the scenario set. Here, this article proposes a machine learning method using -means clustering for capturing relevant physical information from a large population of analog scenarios. Extreme scenario samples drawn from the clusters are used in a two-stage stochastic economic dispatch computation. The effectiveness of the proposed approach is assessed on a synthetic 200-bus system with a geographic footprint over Illinois, USA for four months from each season of WIND Toolkit data. The combination of -means clustering with importance sampling is shown to reduce the total operational cost by over 43% compared to sampling from populations based on heuristic clustering-based methods. Additionally, the variability in the mean cost is about 56% lower than the variability using Monte Carlo sampling. Moreover, the operational cost with the presented approach is shown to be close to the cost calculated based on a hindsight exact wind profile, signifying a highly accurate quantification of wind uncertainty by the presented -means clustering based sampling method.

17 WIND ENERGY↗

A rigorous sequential update strategy for parallel kinetic Monte Carlo simulation

The kinetic Monte Carlo (kMC) method is used in many scientific fields in applications involving rare-event transitions. Due to its discrete stochastic nature, efforts to parallelize kMC approaches often produce unbalanced time evolutions requiring complex implementations to ensure correct statistics. In the context of parallel kMC, the sequential update technique has shown promise by generating high quality distributions with high relative efficiencies for short-range systems. In this work, we provide an extension of the sequential update method in a parallel context that rigorously obeys detailed balance, which guarantees exact equilibrium statistics for all parallelization settings. Furthermore, our approach also preserves nonequilibrium dynamics with minimal error for many parallelization settings, and can be used to achieve highly precise sampling.

36 MATERIALS SCIENCE↗

Implementation of the D1S Methodology for Shutdown Dose Rate Calculations in the OpenMC Monte Carlo Particle Transport Code

We present an implementation of the direct one-step (D1S) methodology for shutdown dose rate (SDR) calculations in the OpenMC Monte Carlo particle transport code. In addition to being the first fully open-source D1S implementation, it is also the first to require no ad hoc source code or nuclear data library modifications. The code can seamlessly switch between production of prompt and decay photons based on a user input parameter, and the decay data needed for decay photon generation are made available through a depletion chain file, which is already used for OpenMC’s built-in depletion/activation solver. A set of Python functions significantly eases the burden of computing and applying time correction factors needed to properly account for the time dependence of radionuclide activity. To assess the accuracy of the D1S implementation, SDR calculations have been carried out for three problems: a prism of iron irradiated by 14-MeV neutrons, the ITER port plug computational benchmark, and the Frascati Neutron Generator (FNG) ITER dose rate benchmark problem from the Shielding INtegral Benchmark Archive and Database (SINBAD). For each of these problems, comparisons were made to calculations using the rigorous two-step (R2S) method. The results on the iron prism problem illustrate how the D1S method achieves superior spatial resolution compared to the R2S method without the need for spatial discretization of the activation regions. The D1S and R2S results for the ITER port plug benchmark agree well with previously reported results in the literature. While the D1S results are 10% to 15% lower than the R2S results, this may be due to stochastic uncertainty and/or spatial discretization in the R2S calculations. On the FNG dose rate benchmark problem, the D1S method produces dose rate estimates that are within 4% of the dose rates predicted using a cell-based R2S workflow. The D1S estimates of the SDR are also in reasonable agreement with the experimental measurements and show the same basic trends that have been observed in previous works. A qualitative analysis of the execution time and uncertainty for the R2S and D1S workflows suggests that the D1S method would attain a higher figure of merit.

D1S method↗