Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Equation learning”

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 757 records · Page 42
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Machine learning-based microstructure prediction during laser sintering of alumina

Abstract Predicting material’s microstructure under new processing conditions is essential in advanced manufacturing and materials science. This is because the material’s microstructure hugely influences the material’s properties. We demonstrate an elegant machine learning algorithm that faithfully predicts the microstructure under new conditions, without the need of knowing the governing laws. We name this algorithm, RCWGAN-GP, which is regression-based conditional generative adversarial networks with Wasserstein loss function and gradient penalty. This algorithm was trained with experimental SEM micrographs from laser-sintered alumina under various laser powers. The RCWGAN-GP realistically regenerates the SEM micrographs under the trained laser powers. Impressively, it also faithfully predicts the alumina’s microstructure under unexplored laser powers. The predicted microstructure features, including the morphology of the sintered particles and the pores, match the experimental SEM micrographs very well. We further quantitatively examined the prediction accuracy of the RCWGAN-GP. We trained the algorithm with computer-created micrograph datasets of secondary-phase growth governed by the well-known Johnson–Mehl–Avrami (JMA) equation. The RCWGAN-GP accurately regenerates the micrographs at the trained time series, in terms of the grains’ shapes, sizes, and spatial distributions. More importantly, the predicted secondary phase fraction accurately follows the JMA curve.

08 HYDROGEN↗
DOE OSTI2022

Physics‐Informed Machine Learning Method for Large‐Scale Data Assimilation Problems

Abstract We develop a physics‐informed machine learning approach for large‐scale data assimilation and parameter estimation and apply it for estimating transmissivity and hydraulic head in the two‐dimensional steady‐state subsurface flow model of the Hanford Site given synthetic measurements of said variables. In our approach, we extend the physics‐informed conditional Karhunen‐Loéve expansion (PICKLE) method to modeling subsurface flow with unknown flux (Neumann) and varying head (time‐dependent Dirichlet) boundary conditions. We demonstrate that the PICKLE method is comparable in accuracy with the standard maximum a posteriori (MAP) method, but is significantly faster than MAP for large‐scale problems. Both methods use a mesh to discretize the computational domain. In MAP, the parameters and states are discretized on the mesh; therefore, the size of the MAP parameter estimation problem directly depends on the mesh size. In PICKLE, the mesh is used to evaluate the residuals of the governing equation, while the parameters and states are approximated by the truncated conditional Karhunen‐Loéve expansions with the number of parameters controlled by the smoothness of the parameter and state fields, and not by the mesh size. For a considered example, we demonstrate that the computational cost of PICKLE increases near linearly (as N 1.15 ) with the number of grid nodes N , while that of MAP increases much faster (as N 3.28 ). We also show that once trained for one set of Dirichlet boundary conditions (i.e., one river stage), the PICKLE method provides accurate estimates of the hydraulic head for any value of the Dirichlet boundary conditions (i.e., for any river stage).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Efficient Bayesian inference with latent Hamiltonian neural networks in No-U-Turn Sampling

When sampling for Bayesian inference, one popular approach in the computational field is to use Hamiltonian Monte Carlo (HMC) and specifically the No-U-Turn Sampler (NUTS), which automatically decides the end time of the Hamiltonian trajectory. However, HMC and NUTS can require numerous numerical gradients of the target density and can prove slow in practice when relying on computationally expensive forward models. We propose Latent Hamiltonian neural networks (L-HNNs) with HMC and NUTS for solving Bayesian inference problems. Once trained, L-HNNs do not require numerical gradients of the target density during sampling, and hence numerous evaluations of the forward computational model. Moreover, L-HNNs satisfy important properties such as perfect time reversibility and Hamiltonian conservation, making them well-suited for use within HMC and NUTS because stationarity can be shown. We also propose the integration of L-HNNs in an online error monitoring scheme, in which numerical gradients of the target density are used for a few samples whenever the L-HNNs prediction errors are large. This online error monitor scheme prevents sample degeneracy in regions of low probability density and ensures robust uncertainty quantification. We demonstrate L-HNNs in NUTS with online error monitoring on several analytical examples involving complex, heavy-tailed, and high-local-curvature probability densities. We then demonstrate the applicability of L-HNNs in NUTS to two computational case studies, namely the Allen-Cahn stochastic partial differential equation and an elliptic partial differential equation with 25 and 50 inference parameters, respectively. Overall, the L-HNNs in NUTS with online error monitoring satisfactorily inferred these probability densities. In conclusion, compared to traditional NUTS, L-HNNs in NUTS with online error monitoring required 1–2 orders of magnitude fewer numerical gradients of the target density and improved the effective sample size (ESS) per gradient (which is a measure of both the sampling quality and the computational expense) by an order of magnitude.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Structure–Property Linkage in Alloys Using Graph Neural Network and Explainable Artificial Intelligence

Deep learning tools have recently shown significant potential for accelerating the prediction of microstructure–property linkage in materials. While deep neural networks like convolution neural networks (CNNs) can extract physics information from 3D microstructure images, they often require a large network architecture and substantial training time. In this research, we trained a graph neural network (GNN) using phase field generated microstructures of Ni-Al alloys to predict the evolution of mechanical properties. We found that a single GNN is capable of accurately predicting the strengthening of Ni-Al alloys with microstructures of varying sizes and dimensions, which cannot otherwise be done with a CNN. Additionally, GNN requires significantly less GPU utilization than CNN and offers more interpretable explanation of predictions using saliency analysis as features are manually defined in the graph. We also utilize explainable artificial intelligence tool Bayesian Inference to determine the coefficients in the power law equation that governs coarsening of precipitates. Overall, our work demonstrates the ability of the GNN to accurately and efficiently extract relevant information from material microstructures without having restrictions on microstructure size or dimension and offers an interpretable explanation.

Chemistry↗
DOE OSTI2024

Multicode benchmark on simulated Ti K-edge x-ray absorption spectra of Ti-O compounds

X-ray absorption spectroscopy (XAS) is an element-specific materials characterization technique that is sensitive to structural and electronic properties. First-principles simulated XAS has been widely used as a powerful tool to interpret experimental spectra and draw physical insights. Recently, there has also been growing interest in building computational XAS databases to enable data analytics and machine learning applications. However, there are non-trivial differences among commonly used XAS simulation codes, both in underlying theoretical formalism and in technical implementation. Reliable and reproducible computational XAS databases require systematic benchmark studies. In this work, we benchmarked Ti K-edge XAS simulations of ten representative Ti-O binary compounds, which we refer to as the Ti-O-10 dataset, using three state-of-the-art codes: XSPECTRA, OCEAN and exciting. We systematically studied the convergence behavior with respect to the input parameters and developed a workflow to automate and standardize the calculations to ensure converged spectra. Our benchmark comparison considers a 35 eV spectral range starting from the K-edge onset, representative of widely used near-edge spectra. Quantitative comparison over this range is based on Spearman’s rank correlation score (r sp ). Our results show: (1) the two Bethe-Salpeter equation (BSE) codes (OCEAN and exciting) have excellent agreement with an average $r$ $sp$ of 0.998; (2) good agreement is obtained between the core-hole potential code (XSPECTRA) and BSE codes (OCEAN and exciting) with an average $r$ $sp$ of 0.990, and this smaller $r$ $sp$ reflects the noticeable differences in the main edge spectral shape that can be primarily attributed to the difference in the strength of the screened core-hole potential; (3) simulations from both methods overall reproduce well the main experimental spectral features of rutile and anatase, and the different treatments of the screened core-hole potential have visible impact on pre-edge intensities and the peak ratio of the main edge; (4) there exist moderate differences in the relative edge alignment of the three codes with a standard deviation of about 0.2 eV, which arise from multiple contributions including the frozen core approximation, final state effects, and different approximations used for the self-energy correction. In conclusion, our benchmark study provides important standards for first-principles XAS simulations with broad impact in data-driven XAS analysis.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Newton versus the machine: solving the chaotic three-body problem using deep neural networks

ABSTRACT Since its formulation by Sir Isaac Newton, the problem of solving the equations of motion for three bodies under their own gravitational force has remained practically unsolved. Currently, the solution for a given initialization can only be found by performing laborious iterative calculations that have unpredictable and potentially infinite computational cost, due to the system’s chaotic nature. We show that an ensemble of converged solutions for the planar chaotic three-body problem obtained using an arbitrarily precise numerical integrator can be used to train a deep artificial neural network (ANN) that, over a bounded time interval, provides accurate solutions at a fixed computational cost and up to 100 million times faster than the numerical integrator. In addition, we demonstrate the importance of training an ANN using converged solutions from an arbitrary precise integrator, relative to solutions computed by a conventional fixed precision integrator, which can introduce errors in the training data, due to numerical round-off and time discretization, that are learned by the ANN. Our results provide evidence that, for computationally challenging regions of phase space, a trained ANN can replace existing numerical solvers, enabling fast and scalable simulations of many-body systems to shed light on outstanding phenomena such as the formation of black hole binary systems or the origin of the core collapse in dense star clusters.

Breen, Philip G.↗
DOE OSTI2023

PETSc/TAO Users Manual (Rev. 3.19)

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) and the Toolkit for Advanced Optimization (TAO) for the numerical solution of partial differential equations and related problems on high-performance computers. PETSc/TAO is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication. PETSc/TAO includes a large suite of parallel linear solvers, nonlinear solvers, time integrators, and opti mization that may be used in application codes written in Fortran, C, C++, and Python (via petsc4py; see Getting Started). PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than packages such as MATLAB or a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++, python, or Fortran and experience using a debugger such as gdb or lldb, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than “rolling them” yourself. For many tasks a package such as MATLAB is often the best tool; PETSc is not intended for the classes of problems for which effective MATLAB code can be written. There are several packages, built on PETSc, that may satisfy your needs without requiring directly using PETSc. We recommend reviewing these packages functionality before starting to code directly with PETSc. PETSc can be used to provide a “MPI parallel linear solver” in an otherwise sequential, or OpenMP parallel code. This approach cannot provide extremely large improvements in the application time by utilizing large numbers of MPI processes but can still improve the performance. Certainly all parts of a previously sequential code need not be parallelized but the matrix generation portion must be parallelized to expect true scalability to large numbers of MPI processes. See PCMPI for details on how to utilize the PETSc MPI linear solver server. Since PETSc is under continued development, small changes in usage and calling sequences of routines will occur. PETSc has been supported for twenty-five years; see mailing list information on our website for information on contacting support.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

PETSc Users Manual (Rev. 3.13)

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication. PETSc includes an expanding suite of parallel linear solvers, nonlinear solvers, and time integrators that may be used in application codes written in Fortran, C, C++, and Python. PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++, python, or Fortran and experience using a debugger such as gdb or dbx, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than \rolling them" yourself.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Computing Nonlinear Power Spectra Across Dynamical Dark Energy Model Space with Neural ODEs

I show how to compute the nonlinear power spectrum across the entire $w(z)$ dynamical dark energy model space. Using synthetic ΛCDM data, I train a neural ordinary differential equation (ODE) to infer the evolution of the nonlinear matter power spectrum as a function of the background expansion and mean matter density across ∼9 Gyr of cosmic evolution. After training, the model generalises to any dynamical dark energy model parameterised by $w(z)$. With little optimisation, the neural ODE is accurate to within 4% up to $k = 5\, h\, {\mathrm Mpc}^{−1}$. Unlike simulation rescaling methods, neural ODEs naturally extend to summary statistics beyond the power spectrum that are sensitive to the growth history.

cosmology↗
DOE OSTI2022

When Do Extended Physics-Informed Neural Networks (XPINNs) Improve Generalization?

Physics-informed neural networks (PINNs) have become a popular choice for solving high-dimensional partial differential equations (PDEs) due to their excellent approximation power and generalization ability. Recently, extended PINNs (XPINNs) based on domain decomposition methods have attracted considerable attention due to their effectiveness in modeling multiscale and multiphysics problems and their parallelization. However, theoretical understanding of their convergence and generalization properties remains unexplored. In this study, we take an initial step towards understanding how and when XPINNs outperform PINNs. Specifically, for general multilayer PINNs and XPINNs, we first provide a prior generalization bound via the complexity of the target functions in the PDE problem and a posterior generalization bound via the posterior matrix norms of the networks after optimization. Moreover, based on our bounds, we analyze the conditions under which XPINNs improve generalization. Concretely, our theory shows that the key building block of XPINN, namely, the domain decomposition, introduces a tradeoff for generalization. On the one hand, XPINNs decompose the complex PDE solution into several simple parts, which decreases the complexity needed to learn each part and boosts generalization. On the other hand, decomposition leads to less training data being available in each subdomain, and hence such a model is typically prone to overfitting and may become less generalizable. Empirically, we choose five PDEs to show when XPINNs perform better than, similar to, or worse than PINNs, hence demonstrating and justifying our new theory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Variational multiscale reinforcement learning for discovering reduced order closure models of nonlinear spatiotemporal transport systems

Abstract A central challenge in the computational modeling and simulation of a multitude of science applications is to achieve robust and accurate closures for their coarse-grained representations due to underlying highly nonlinear multiscale interactions. These closure models are common in many nonlinear spatiotemporal systems to account for losses due to reduced order representations, including many transport phenomena in fluids. Previous data-driven closure modeling efforts have mostly focused on supervised learning approaches using high fidelity simulation data. On the other hand, reinforcement learning (RL) is a powerful yet relatively uncharted method in spatiotemporally extended systems. In this study, we put forth a modular dynamic closure modeling and discovery framework to stabilize the Galerkin projection based reduced order models that may arise in many nonlinear spatiotemporal dynamical systems with quadratic nonlinearity. However, a key element in creating a robust RL agent is to introduce a feasible reward function, which can be constituted of any difference metrics between the RL model and high fidelity simulation data. First, we introduce a multi-modal RL to discover mode-dependant closure policies that utilize the high fidelity data in rewarding our RL agent. We then formulate a variational multiscale RL (VMRL) approach to discover closure models without requiring access to the high fidelity data in designing the reward function. Specifically, our chief innovation is to leverage variational multiscale formalism to quantify the difference between modal interactions in Galerkin systems. Our results in simulating the viscous Burgers equation indicate that the proposed VMRL method leads to robust and accurate closure parameterizations, and it may potentially be used to discover scale-aware closure models for complex dynamical systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Extending the Takagi-Taupin equations for x-ray nanobeam Bragg coherent diffraction

We present an approach for simulating x-ray nanobeam Bragg coherent diffraction patterns based on the Takagi-Taupin equations. Compared to conventional methods, the current approach can be universally applied to any weakly strained system including semi-infinite crystals that diffract dynamically. It addresses issues such as the curved wave front and redivergence of the focused incident beam. In conclusion, we show excellent agreement with experimental data for a strained La 0.7 ⁢Sr 0.3⁢ MnO 3 thin film on a SrTiO 3 substrate and a path to extracting physical information using automatic differentiation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Inorganic Halide Double Perovskites with Optoelectronic Properties Modulated by Sublattice Mixing

All-inorganic halide double perovskites have emerged as a promising class of materials that are potentially more stable and less toxic than lead-containing hybrid organic-inorganic perovskite optoelectronic materials. In this work, 311 cesium chloride double perovskites (Cs 2 BB'Cl 6 ) were selected from a set of 903 compounds as likely being stable on the basis of a statistically learned tolerance factor (t) for perovskite stability. First-principles calculations on these 311 double perovskites were then performed to assess their stability and identify candidates with band gaps appropriate for optoelectronic applications. We predict that 261 of the 311 Cs 2 BB'Cl 6 compounds are likely synthesizable on the basis of a thermodynamic analysis of their decomposition to competing compounds (decomposition enthalpy <0.05 eV/atom). Of these 261 likely synthesizable compounds, 47 contain no toxic elements and have direct or nearly direct (within 100 meV) band gaps between 1 and 3 eV, as computed with hybrid density functional theory (HSE06). Within this set, we identify the triple-alkali perovskites Cs 2 [Alk] + [TM] 3+ Cl 6 , where Alk is a group 1 alkali cation and TM is a transition-metal cation, as a class of Cs 2 BB'Cl 6 double perovskites with remarkable optical properties, including large and tunable exciton binding energies as computed by the GW-Bethe-Salpeter equation (GW-BSE) method. We attribute the unusual electronic structure of these compounds to the mixing of the Alk-Cl and TM-Cl sublattices, leading to materials with small band gaps, large exciton binding energies, and absorption spectra that are strongly influenced by the identity of the transition metal. The role of the double-perovskite structure in enabling these unique properties is probed through an analysis of the electronic structures and chemical bonding of these compounds in comparison with other transition-metal and alkali transition-metal halides.

14 SOLAR ENERGY↗
DOE OSTI2021

End-to-End Differentiable Modeling and Management of the Environment

Focal Area: (2) Data acquisition and assimilation enabled by machine learning, AI, and advanced methods including experimental/network design/optimization. We emphasize the importance of leveraging optimization techniques from AI/machine learning (ML) to solve challenging problems in Earth system modeling. Science Challenge: Automatic differentiation has had a transformative effect on ML by allowing the calculation of gradients of arbitrary functions in an incredibly large class of models. We can potentially realize similar improvements in parameter estimation and control for Earth system models (ESMs) by reimplementing them in computational frameworks from ML. Practitioners working with large (>10 7 parameters) models in ML and AI can obtain good predictive performance in a range of spatiotemporal tasks by making use of optimization via stochastic gradient descent and incorporating prior knowledge at multiple levels. We propose writing ESMs in open-source computational frameworks such as Torch, Tensorflow, and JAX to greatly expand the scope of environmental forecasting and management challenges, which can be addressed by leveraging automatic differentiation and gradient descent-like algorithms. We do not call for a wholesale replacement of physical models with data-driven surrogates, but rather advocate for interleaving physical and empirical equations in a manner that is most faithful to the extent of our scientific knowledge and observational data. Central to this topic is the merging of differentiable physical simulations with differentiable optimization layers, which are now both beginning to come to the forefront.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Comprehensive framework for data-driven model form discovery of the closure laws in thermal-hydraulics codes

The two-phase two-fluid model is a basis of many thermal-hydraulics codes used in design, licensing, and safety considerations of nuclear power plants. Thermal-hydraulics codes rely on the closure laws to close the system of conservation equations and describe the interactions between phases. These laws, derived from years of experimental investigations, are semi-empirical correlations that lack generality and have a limited range of applicability. Increase of computational power, availability of new experiments, and development of high-fidelity simulations has increased the number of validation data. The discrepancies between the code predictions and the validation data are a great source of knowledge. Missing physics that are not included in the model but are important for the considered phenomena can be discovered by propagating the information from the experimental results through the model. Furthermore, physics-discovered data-driven model form (P3DM) methodology integrates available integral effect tests and separate effects tests to determine the necessary corrections to the model form of the closure laws. In contrast to existing calibration techniques, the methodology modifies the functional form of the closure laws. Based on the functional form of the correction, the missing physics that were not included in the original model can be discovered. The methodology provides the alternative to the machine learning approach, in which the model is discovered in the form of the intractable black-box relation. In this work, the methodology was applied to the CTF subchannel code to improve the prediction of the two-phase flow phenomena.

42 ENGINEERING↗
DOE OSTI2022

Discovering causal structure with reproducing-kernel Hilbert space ε -machines

We merge computational mechanics’ definition of causal states (predictively equivalent histories) with reproducing-kernel Hilbert space (RKHS) representation inference. The result is a widely applicable method that infers causal structure directly from observations of a system’s behaviors whether they are over discrete or continuous events or time. A structural representation—a finite- or infinite-state kernel ϵ-machine—is extracted by a reduced-dimension transform that gives an efficient representation of causal states and their topology. In this way, the system dynamics are represented by a stochastic (ordinary or partial) differential equation that acts on causal states. We introduce an algorithm to estimate the associated evolution operator. Paralleling the Fokker–Planck equation, it efficiently evolves causal-state distributions and makes predictions in the original data space via an RKHS functional mapping. We demonstrate these techniques, together with their predictive abilities, on discrete-time, discrete-value infinite Markov-order processes generated by finite-state hidden Markov models with (i) finite or (ii) uncountably infinite causal states and (iii) continuous-time, continuous-value processes generated by thermally driven chaotic flows. The method robustly estimates causal structure in the presence of varying external and measurement noise levels and for very high-dimensional data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Regression Analysis with the Directed Infusion of Data

Integrating artificial intelligence and machine learning tools into industry necessitates large-scale collaborative efforts that ensure the robust and accurate execution of downstream analytics such as time series prediction, uncertainty quantification, grid optimization, and condition monitoring. However, concerns related to data privacy pervade the nuclear industry due to the proprietary nature of its data and the possibility of data leakage. Legacy techniques such as encryption often require the explicit transmission of data to trustworthy parties, thereby inviting data leakage concerns. The ideal collaboration scenario avoids the explicit dissemination of data/code while maintaining experimental fidelity, which is currently accomplished using various techniques such as trusted execution environments, homomorphic encryption, differential privacy, and multimatrix masking. These techniques, however, often necessitate a trade-off between trust, efficiency, and utility. This article extends a previously proposed technique called the directed infusion of data (DIOD) that ensures data privacy, allows for scalable obfuscation, and combats the risk of data leakage without compromising utility. The experiments discussed in this article examine a regression-type scenario using DIOD with the goal of preserving the inferential link between two variables. Using the point-kinetics equations, regression experiments compare the performance of a model trained using the original data to that of a model trained using the obfuscated data, which produced identical results. Our claim is further strengthened by an information theoretic proof and experiment, which showed that the inferential content between variables remains the same after obfuscation, thereby avoiding the required communication of the proprietary data.

47 - OTHER INSTRUMENTATION↗