Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “information computation”

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 847 records · Page 47
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Applications of physics informed neural operators

Abstract We present a critical analysis of physics-informed neural operators (PINOs) to solve partial differential equations (PDEs) that are ubiquitous in the study and modeling of physics phenomena using carefully curated datasets. Further, we provide a benchmarking suite which can be used to evaluate PINOs in solving such problems. We first demonstrate that our methods reproduce the accuracy and performance of other neural operators published elsewhere in the literature to learn the 1D wave equation and the 1D Burgers equation. Thereafter, we apply our PINOs to learn new types of equations, including the 2D Burgers equation in the scalar, inviscid and vector types. Finally, we show that our approach is also applicable to learn the physics of the 2D linear and nonlinear shallow water equations, which involve three coupled PDEs. We release our artificial intelligence surrogates and scientific software to produce initial data and boundary conditions to study a broad range of physically motivated scenarios. We provide the source code , an interactive website to visualize the predictions of our PINOs, and a tutorial for their use at the Data and Learning Hub for Science .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Development and Application of a Data-Driven Methodology for Validation of Risk-Informed Safety Margin Characterization Models

The document is the Final Technical Progress Report for the Nuclear Energy University Program’s Integrated Research Project (IRP) on “Development and Application of a Data-Driven Methodology for Validation of Risk-Informed Safety Margin Characterization Models” that supports the LWR Sustainability Program’s RISMC R&D Pathway. The project goal is to develop and demonstrate a data-driven methodology for validation of advanced computer models used in nuclear power plant safety analysis. Specifically, the advanced computer models are those in the toolkit developed to support risk-informed safety margin characterization (RISMC), an integrated deterministic/probabilistic safety analysis methodology developed in the Department of Energy’s Light Water Reactor Sustainability (LWR-S) program. The report reflects the progress made towards the project’s stated goal by contributions by researchers and graduate students from universities, with support from researchers from national laboratories and industry companies. The project organization, effort coordination and technical implementation are summarized, followed by discussion of main findings, issues, and path forward. Selected chapters provide a more detailed description of tasks, approaches and respective findings and recommendations. Noteworthy are contributions that serve as guidelines for methodology development. It is also noted that this report is complemented by other milestone reports (as stand-alone deliverables) that provide detailed discussion of the technical developments. The project results have been documented in a number (12) dissertations and these, 50+ peer-reviewed publications in technical journals and conference proceedings.

42 ENGINEERING↗
DOE OSTI2024

Fixed Source Sensitivity Calculations for Inertial Confinement Fusion Applications

A numerical code library was developed for the radiation transport code MCNP6.3 to calculate generalized response sensitivity coefficients for fixed source neutron transport problems with applications to inertial confinement fusion (ICF) experiments. The new MCNP6.3 dependency is used to generate a novel time convolution response that represents a neutron time-of-flight (nToF) signal. The traditional suite of macroscopic cross-section sensitivities and constrained fixed source probability distribution sensitivities are available for both the standard and the new response tallies in this library. However, novel sensitivity coefficients for the constrained hyperparameters of analytic fixed source probability distributions are emphasized in this work for their connection to ICF neutron transport models. Particularly, advanced Monte Carlo methods are developed for calculating the sensitivity of a nToF signal to perturbations in an ICF plasma’s ion temperature and burn history as well as perturbations in the target liner mass density and the shape parameters of the nToF detector’s impulse response function. Together, these capabilities form an advanced suite of computational tools that can be used to analyze and extract information from any ICF experimental platform.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Accelerating geostatistical modeling using geostatistics-informed machine Learning

Ordinary Kriging (OK) is a popular geostatistical algorithm for spatial interpolation and estimation. The computational complexity of OK changes quadratically and cubically for memory and speed, respectively, given the number of data. Therefore, it is computationally intensive and also challenging to process a large set of data, especially in three-dimensional (3D) cases. This paper develops a geostatistics-informed machine learning (GIML) model to improve the efficiency of OK by reducing the number of points required to be estimated using OK. Specifically, only a very few of the unknown points are estimated by OK to get the weights and estimations, which are used as the training dataset. Moreover, the governing equations of OK are used to guide our proposed machine learning to better reproduce the spatial distributions. Our results show that the proposed GIML can reduce the computational time of OK by at least one order of magnitude. The effectiveness of the GIML is evaluated and compared using a 2D case. Furthermore, we demonstrate its efficiency and robustness by considering a different number of training samples on various 3D simulation grids.

58 GEOSCIENCES↗
DOE OSTI2021

Learning viscoelasticity models from indirect data using deep neural networks

In this study, we propose a novel approach to model viscoelasticity materials, where rate-dependent and non-linear constitutive relationships are approximated with deep neural networks. We assume that inputs and outputs of the neural networks are not directly observable, and therefore common training techniques with input–output pairs for the neural networks are inapplicable. To that end, we develop a novel computational approach to both calibrate parametric and learn neural-network-based constitutive relations of viscoelasticity materials from indirect displacement data in the context of multiple-physics systems. We show that limited displacement data holds sufficient information to quantify the viscoelasticity behavior. We formulate the inverse computation – modeling viscoelasticity properties from observed displacement data – as a PDE-constrained optimization problem and minimize the error functional using a gradient-based optimization method. The gradients are computed by a combination of automatic differentiation and implicit function differentiation rules. The effectiveness of our method is demonstrated through numerous benchmark problems in geomechanics and porous media transport.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Physics-informed machine learning of the correlation functions in bulk fluids

The Ornstein–Zernike (OZ) equation is the fundamental equation for pair correlation function computations in the modern integral equation theory for liquids. In this work, machine learning models, notably physics-informed neural networks and physics-informed neural operator networks, are explored to solve the OZ equation. The physics-informed machine learning models demonstrate great accuracy and high efficiency in solving the forward and inverse OZ problems of various bulk fluids. The results highlight the significant potential of physics-informed machine learning for applications in thermodynamic state theory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Evolving Architectures and Considerations to address Distributed Energy Resources and Non-Wired Alternatives

The electric grid is in the beginning stage of a transformation, driven by a combination of shutdowns of coal-fired plants, commissioning of new natural-gas plants, and tremendous growth in energy supply from renewables such as wind, and solar. As utilities navigate this transformation, their progress is supported by advances in Operational Technologies (OT), and Informational Technologies (IT), such as automation, smart inverters, cloud computing, mobile computing, machine learning, big data analytics, which have the potential to enable advanced capabilities more efficiently and at a lower cost. This white paper focuses on the architectural considerations that will allow the industry to transition in a planned manner. It introduces and formalizes two architectural constructs –the data bus and the control bus. The data bus is responsible for carrying all non-operational models and information necessary to drive utility decisions. In contrast, the control bus is responsible for carrying all operational data and control actions taken at the local level, centralized level, or other levels in-between. The paper reviews those architectural considerations, their requirements and how they will evolve. This paper intends to provide a context for vendors, utilities, and their service providers to review and understand the changes that are coming and get ready for them.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

ARPA-E Grid Optimization (GO) Competition Challenge 1

The ARPA-E Grid Optimization (GO) Competition Challenge 1, from 2018 to 2019, focused on the basic Security Constrained AC Optimal Power Flow problem (SCOPF) for a single time period. The Challenge utilized sets of unique datasets generated by the ARPA-E GRID DATA program. Each dataset consisted of a collection of power system network models of different sizes with associated operating scenarios (snapshots in time defining instantaneous power demand, renewable generation, generator and line availability, etc.). The datasets were of two types: Real-Time, which included starting-point information, and Online, which did not. Week-Ahead data is also provided for some cases but was not used in the Competition. Although most datasets were synthetic and generated by GRIDDATA, a few came from industry and were only used in the Final Event. All synthetic Input Data and Team Results for the GO Competition Challenge 1 for the Sandbox, Trial Events 1 to 3, and the Final Event along with problem, format, scoring and rules descriptions are available here. Data for industry scenarios will not be made public. Challenge 1, a minimization problem, required two computational steps. Solver 1 or Code 1 solved the base SCOPF problem under a strict wall clock time limit, as would be the case in industry, and reported the base case operating point as output, which was used to compute the Objective Function value that was used as the scenario score. The feasibility of the solution was provided by the Solver 2 or Code 2, which solves the power flow problem for all contingencies based on the results from Solver 1. This is not normally done in industry, so the time limits were relaxed. In fact, there were no time limits for Trial Event 1. This proved to be a mistake, with some codes running for more than 90 hours, and a time limit of 2 seconds per contingency was imposed for all other events. Entrants were free to use their own Solver 2 or use an open-source version provided by the Competition. Containers, such as Docker, were considered to improve the portability of codes, but none that could reliably support a multi-node parallel computing environment, e.g., MPI, could be found. For more information on the competition and challenge see the "GO Competition Challenge 1 Information" and "GO Competition Challenge 1 Additional Information" resources below.

ACOPF↗
DOE OSTI2022

Data and scripts associated with the manuscript "Using Mutual Information for Global Sensitivity Analysis on Watershed Modeling"

This package contains the data and scripts used in "Using Mutual Information for Global Sensitivity Analysis on Watershed Modeling" (Jiang et al., 2022). The ARW_SWAT.zip file contains the SWAT simulation and the sensitivity analysis result in the American River Watershed. The Portage_SWAT.zip file contains the SWAT simulation and the sensitivity analysis result in the Portage River Watershed. The src folder contains the source code of sensitivity analysis and plotting functions. The notebooks folder contains the Jupyter notebooks for performing sensitivity analysis and other post analyses.Global Sensitivity Analysis (GSA) often is applied to assess the sensitivity of model outputs to their inputs using ensemble simulations. However, increasing model complexity and the associated computational cost have limited the use of most GSA approaches for process-based watershed models. We propose to use Mutual Information (MI) as a computationally efficient GSA method for watershed modeling. Such MI computed from several hundred realizations usually can capture nonlinear relationships between inputs and outputs of interest. We perform MI-based watershed sensitivity analyses in studies of the Portage River Watershed in Ohio and the American River Watershed in Washington. In these studies, MI is used to evaluate the sensitivity of river discharges simulated by the Soil and Water Assessment Tool to no less than 20 parameters for each watershed. Our MI-based sensitivity analyses achieved convergence with about 300~500 realizations, a small fraction of the ensemble size (i.e., several thousand) required by the Sobol method. Nevertheless, MI yields similar sensitivity ranking compared to the Sobol method, especially for sensitive parameters. Our study thus sheds new light on the use of MI as an affordable GSA method for computationally intensive models such as the hyper-resolution, watershed hydrobiogeochemical models.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Memory access response merging in a memory hierarchy

A system and method for efficiently processing memory requests are described. A computing system includes multiple compute units, multiple caches of a memory hierarchy and a communication fabric. A compute unit generates a memory access request that misses in a higher level cache, which sends a miss request to a lower level shared cache. During servicing of the miss request, the lower level cache merges identification information of multiple memory access requests targeting a same cache line from multiple compute units into a merged memory access response. The lower level shared cache continues to insert information into the merged memory access response until the lower level shared cache is ready to issue the merged memory access response. An intermediate router in the communication fabric broadcasts the merged memory access response into multiple memory access responses to send to corresponding compute units.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Characterization of Quantum States Based on Creation Complexity

Abstract The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state. The creation complexity of quantum states is closely related to the complexity of quantum circuits, which is crucial in developing efficient quantum algorithms that can outperform classical algorithms. A major question unanswered so far is what quantum states can be created with a number of elementary gates that scales polynomially with the number of qubits. In this work, it is first shown that for an entirely general quantum state it is exponentially hard (requires a number of steps that scales exponentially with the number of qubits) to determine if the creation complexity is polynomial. Then, it is shown that it is possible for a large class of quantum states with polynomial creation complexity to have common coefficient features such that, given any candidate quantum state, an efficient coefficient sampling procedure can be designed to determine if the state belongs to the class or not with arbitrarily high success probability. Consequently, partial knowledge of a quantum state's creation complexity is obtained, which can be useful for designing quantum circuits and algorithms involving such a state.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Deep operator network surrogate for phase-field modeling of metal grain growth during solidification

A deep operator network (DeepONet) has been constructed that generates accurate representations of phase-field model simulations for evolving two dimensional metal grain morphology growing from melt. These representations serve as lower resolution, computationally efficient stand-ins for quick parameter space exploration of solutions to the the Allen-Cahn equations that dictate the phase-field model simulations. The experimental target for the phase-field model is a uranium casting system cooling a 434 g uranium charge from a maximum temperature of 1400° C at an average rate of 30° C / min , traversing the crystallographic phases of the pure metal. Experimental parameters inform the phase-field model, whose higher resolution computational model solutions are used to train the DeepONet in a given parameter space with the aim of developing a faster, more efficient method for predicting the solidifying metal's microstructure at different potential experimental values. The final DeepONet generates high accuracy, lower resolution predictions with cumulative relative approximation error over all timesteps of less than 0.5%, while ensuring solutions remain within physically feasible ranges. Further, these relative error values are comparable with other state-of-the-art DeepONet models for microstructure evolution, while significantly reducing the amount of training data required. Training a convolutional neural network simultaneously with the DeepONet, enforcing realistic values at the complex metal grain boundaries, and mathematically encoding boundary conditions into the structure of the DeepONet improved prediction accuracy and computational efficiency over a standard DeepONet model.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Deciphering Distinct Overpotential-Dependent Pathways for Electrochemical CO 2 Reduction Catalyzed by an Iron–Terpyridine Complex

[Fe(tpyPY2Me)] 2+ ([Fe] 2+ ) is a homogeneous electrocatalyst for converting CO 2 into CO featuring low overpotentials of <100 mV, near-unity selectivity, and high activity with turnover frequencies faster than 100 000 s -1 . To identify the origins of its exceptional performance and inform future catalyst design, we report a combined computational and experimental study that establishes two distinct mechanistic pathways for electrochemical CO 2 reduction catalyzed by [Fe] 2+ as a function of applied overpotential. Electrochemical data shows the formation of two catalytic regimes at low (η TOF/2 of 160 mV) and high (η TOF/2 of 590 mV) overpotential plateaus. We propose that at low overpotentials [Fe] 2+ undergoes a two-electron reduction, two-proton-transfer mechanism (electrochemical-electrochemical-chemical-chemical, EECC), where turnover occurs through the dicationic iron complex, [Fe] 2+ . Computational analysis supports the importance of the singlet ground-state electronic structure for CO 2 binding and that the rate-limiting step is the second protonation in this low-overpotential regime. When more negative potentials are applied, an additional electron-transfer event occurs through either a stepwise or proton-coupled electron-transfer (PCET) pathway, enabling catalytic turnover from the monocationic iron complex ([Fe] + ) via an electrochemical-chemical-electrochemical-chemical (ECEC) mechanism. Comparison of experimental kinetic data obtained from variable controlled potential electrolysis (CPE) experiments with direct product detection with calculated rates obtained from the energetic span model supports the PCET pathway as the most likely mechanism. Moreover, we build upon this mechanistic understanding to propose the design of an improved ligand framework that is predicted to stabilize the key transition states identified in our study and explore their electronic structures using an energy decomposition analysis. Finally, taken together, this work highlights the value of synergistic computational/experimental approaches to decipher mechanisms of new electrocatalysts and direct the rational design of improved platforms.

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

X-ray Spectroscopy Fingerprints of Pristine and Functionalized Graphene

In this work, we demonstrate how to identify and characterize the atomic structure of pristine and functionalized graphene materials from a combination of computational simulation of X-ray spectra, on the one hand, and computer-aided interpretation of experimental spectra, on the other. Despite the enormous scientific and industrial interest, the precise structure of these 2D materials remains under debate. As we show in this study, a wide range of model structures from pristine to heavily oxidized graphene can be studied and understood with the same approach. We move systematically from pristine to highly oxidized and defective computational models, and we compare the simulation results with experimental data. Comparison with experiments is valuable also the other way around; this method allows us to verify that the simulated models are close to the real samples, which in turn makes simulated structures amenable to several computational experiments. Our results provide ab initio semiquantitative information and a new platform for extended insight into the structure and chemical composition of graphene-based materials.

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

Targeted Writing and Deleting of Magnetic Skyrmions in Two-Terminal Nanowire Devices

Controllable writing and deleting of nanoscale magnetic skyrmions are key requirements for their use as information carriers for next-generation memory and computing technologies. While several schemes have been proposed, they require complex fabrication techniques or precisely tailored electrical inputs, which limits their long-term scalability. In this work, we demonstrate an alternative approach for writing and deleting skyrmions using conventional electrical pulses within a simple, two-terminal wire geometry. X-ray microscopy experiments and micromagnetic simulations establish the observed skyrmion creation and annihilation as arising from Joule heating and Oersted field effects of the current pulses, respectively. The unique characteristics of these writing and deleting schemes, such as spatial and temporal selectivity, together with the simplicity of the two-terminal device architecture, provide a flexible and scalable route to the viable applications of skyrmions.

77 NANOSCIENCE AND NANOTECHNOLOGY↗