Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithmic differentiation”

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 361 records · Page 20

Differentiable Preisach Modeling for Characterization and Optimization of Particle Accelerator Systems with Hysteresis

Future improvements in particle accelerator performance are predicated on increasingly accurate online modeling of accelerators. Hysteresis effects in magnetic, mechanical, and material components of accelerators are often neglected in online accelerator models used to inform control algorithms, even though reproducibility errors from systems exhibiting hysteresis are not negligible in high precision accelerators. Here, we combine the classical Preisach model of hysteresis with machine learning techniques to efficiently create nonparametric, high-fidelity models of arbitrary systems exhibiting hysteresis. We experimentally demonstrate how these methods can be used in situ, where a hysteresis model of an accelerator magnet is combined with a Bayesian statistical model of the beam response, allowing characterization of magnetic hysteresis solely from beam-based measurements. Finally, we explore how using these joint hysteresis-Bayesian statistical models allows us to overcome optimization performance limitations that arise when hysteresis effects are ignored.

43 PARTICLE ACCELERATORS↗

Learning Optimal Multigrid Smoothers via Neural Networks

Multigrid methods are one of the most efficient techniques for solving large sparse linear systems arising from partial differential equations (PDEs) and graph Laplacians from machine learning applications. One of the key components of multigrid is smoothing, which aims at reducing high-frequency errors on each grid level. However, finding optimal smoothing algorithms is problem-dependent and can impose challenges for many problems. In this paper, we propose an efficient adaptive framework for learning optimized smoothers from operator stencils in the form of convolutional neural networks (CNNs). Here, the CNNs are trained on small-scale problems from a given type of PDEs based on a supervised loss function derived from multigrid convergence theories and can be applied to large-scale problems of the same class of PDEs. Numerical results on anisotropic rotated Laplacian problems and variable coefficient diffusion problems demonstrate improved convergence rates and solution time compared with classical hand-crafted relaxation methods.

97 MATHEMATICS AND COMPUTING↗

hIPPYlib-MUQ: A Bayesian Inference Software Framework for Integration of Data with Complex Predictive Models under Uncertainty

Bayesian inference provides a systematic framework for integration of data with mathematical models to quantify the uncertainty in the solution of the inverse problem. However, the solution of Bayesian inverse problems governed by complex forward models described by partial differential equations (PDEs) remains prohibitive with black-box Markov chain Monte Carlo (MCMC) methods. We present hIPPYlib-MUQ, an extensible and scalable software framework that contains implementations of state-of-the art algorithms aimed to overcome the challenges of high-dimensional, PDE-constrained Bayesian inverse problems. These algorithms accelerate MCMC sampling by exploiting the geometry and intrinsic low-dimensionality of parameter space via derivative information and low rank approximation. The software integrates two complementary open-source software packages, hIPPYlib and MUQ. hIPPYlib solves PDE-constrained inverse problems using automatically-generated adjoint-based derivatives, but it lacks full Bayesian capabilities. MUQ provides a spectrum of powerful Bayesian inversion models and algorithms, but expects forward models to come equipped with gradients and Hessians to permit large-scale solution. By combining these two complementary libraries, we created a robust, scalable, and efficient software framework that realizes the benefits of each and allows us to tackle complex large-scale Bayesian inverse problems across a broad spectrum of scientific and engineering disciplines. To illustrate the capabilities of hIPPYlib-MUQ, we present a comparison of a number of MCMC methods available in the integrated software on several high-dimensional Bayesian inverse problems. These include problems characterized by both linear and nonlinear PDEs, various noise models, and different parameter dimensions. The results demonstrate that large (~ 50×) speedups over conventional black box and gradient-based MCMC algorithms can be obtained by exploiting Hessian information (from the log-posterior), underscoring the power of the integrated hIPPYlib-MUQ framework.

97 MATHEMATICS AND COMPUTING↗

Bilevel parameter optimization for learning nonlocal image denoising models

We propose a bilevel optimization approach for the estimation of parameters in nonlocal image denoising models. The parameters we consider are both the space-dependent fidelity weight and weights within the kernel of the nonlocal operator. In both cases we investigate the differentiability of the solution operator in function spaces and derive a first order optimality system that characterizes local minima. For the numerical solution of the problems, we propose a second-order trust-region algorithm in combination with a finite element discretization of the nonlocal denoising models and we introduce a computational strategy for the solution of the resulting dense linear systems. Several experiments illustrate the applicability and effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

TAO Users Manual (Rev. 3.15)

The Toolkit for Advanced Optimization (TAO) focuses on the development of algorithms and software for the solution of large-scale optimization problems on high-performance architectures. Areas of interest include unconstrained and bound-constrained optimization, nonlinear least squares problems, optimization problems with partial differential equation constraints, and variational inequalities and complementarity constraints. The development of TAO was motivated by the scattered support for parallel computations and the lack of reuse of external toolkits in current optimization software. Our aim is to produce high-quality optimization software for computing environments ranging from workstations and laptops to massively parallel high-performance architectures. Our design decisions are strongly motivated by the challenges inherent in the use of large-scale distributed memory architectures and the reality of working with large, often poorly structured legacy codes for specific applications.

97 MATHEMATICS AND COMPUTING↗

Non-Intrusive Parallel-in-Time Solvers for Partial Differential Equations (Final Report)

Many time-dependent problems and simulations are often modeled using Partial Differential Equations. Traditional modeling approaches that use sequential time-stepping are reaching a bottleneck in optimizing efficiency. The Center of Applied Science and Computing at Lawrence Livermore National Laboratory extensively works on parallelizing these algorithms to leverage the increasing computational power from the growing number of processors in computer hardware. In particular, they aim to design non-intrusive algorithms that can generalize to a variety of problems and sizes without requiring additional information from or modifications on the original problems. Multigrid Reduction in Time (MGRIT) is a parallel-in-time algorithm that is designed to be non-intrusive. This project focuses on increasing the efficiency of MGRIT by approximating the coarse-grid operator using machine learning approaches as a means to find the most non-intrusive, or general, solution.

97 MATHEMATICS AND COMPUTING↗

Automated identification of dominant physical processes

The identification of processes that locally and approximately dominate dynamical system behavior has enabled significant advances in understanding and modeling nonlinear differential dynamical systems. Conventional methods of dominant process identification involve piecemeal and ad hoc (non-rigorous, informal) scaling analyses to identify dominant balances of governing equation terms and to delineate the spatiotemporal boundaries (boundaries in space and/or time) of each dominant balance. For the first time, we present an objective global measure of the fit of dominant balances to observations, which is desirable for automation, and was previously undefined. Furthermore, we propose a formal definition of the dominant balance identification problem in the form of an optimization problem. Here, we show that the optimization can be performed by various machine learning algorithms, enabling the automatic identification of dominant balances. Our method is algorithm agnostic and it eliminates reliance upon expert knowledge to identify dominant balances which are not known beforehand.

42 ENGINEERING↗

Machine learning methods for probabilistic locked-mode predictors in tokamak plasmas

A rotating tokamak plasma can interact resonantly with the external helical magnetic perturbations, also known as error fields. This can lead to locking and then to disruptions. We leverage machine learning (ML) methods to predict the locking events. We use a coupled third-order nonlinear ordinary differential equation model to represent the interaction of the magnetic perturbation and the plasma rotation with the error field. This model is sufficient to describe qualitatively the locking and unlocking bifurcations. Here, we explore using ML algorithms with the simulation data and experimental data, focusing on the methods that can be used with sparse datasets. These methods lead to the possibility of the avoidance of locking in real-time operations. We describe the operational space in terms of two control parameters: the magnitude of the error field and the rotation frequency associated with the momentum source that maintains the plasma rotation. The outcomes are quan- tified by order parameters that completely characterize the state, whether locked or unlocked. We use unsupervised ML methods to classify locked/unlocked states and note the usefulness of a certain normalization of the order parameters. Three supervised ML classifiers are used in suite to estimate the probability of locking in the region of control parameter space with hysteresis, i.e., the set of control parameters for which both locked and unlocked states can exist. The results show that a neural network gives the best estimate of the locking probability. An analogy of the present locking model with the van der Waals equation of state is also provided.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Evaluation of antifouling surfaces using a method that employs mussel larvae settlement quantified by machine learning

Antifouling coating development requires extensive performance testing. Coatings that prevent aquatic larval settlement are of interest because many forms of macrofouling begin at the larval stage. However, field testing can be time consuming and poorly controlled. Herein is reported a screening tool, Settlement of Larvae Assay using Mussels (SLAM), for down-selecting materials prior to field testing. The method entails using a dense concentration of mussel larvae that are allowed to settle on submerged test surfaces. Settled larvae are then quantified to provide a measure of antifouling performance. The SLAM test differentiated coatings with only slight differences in formulation. To enable efficient quantification of dense larvae settlement, an automated counting method was developed that combines two analyses: a color thresholding identifies larvae clumps, and a machine learning algorithm identifies non-clumped larvae. Finally, this automated ‘hybrid’ approach rapidly quantifies settled larvae as effectively as manual counting but in a fraction of the time.

Mytilus↗

NSGA-PINN: A Multi-Objective Optimization Method for Physics-Informed Neural Network Training

This paper presents NSGA-PINN, a multi-objective optimization framework for the effective training of physics-informed neural networks (PINNs). The proposed framework uses the non-dominated sorting genetic algorithm (NSGA-II) to enable traditional stochastic gradient optimization algorithms (e.g., ADAM) to escape local minima effectively. Additionally, the NSGA-II algorithm enables satisfying the initial and boundary conditions encoded into the loss function during physics-informed training precisely. We demonstrate the effectiveness of our framework by applying NSGA-PINN to several ordinary and partial differential equation problems. In particular, we show that the proposed framework can handle challenging inverse problems with noisy data.

Lu, Binghang (ORCID:0009000160016632)↗

Optimal design of chemoepitaxial guideposts for the directed self-assembly of block copolymer systems using an inexact Newton algorithm

Directed self-assembly (DSA) of block copolymers (BCPs) is one of the most promising developments in the cost-effective production of nanoscale devices. The process makes use of the natural tendency for BCP melts to form nanoscale structures upon phase separation. The phase separation can be directed through the use of chemically patterned substrates to promote the formation of morphologies that are essential to the production of semiconductor devices. Moreover, the design of substrate pattern can be formulated as an optimization problem for which we seek optimal substrate designs that effectively produce given target morphologies. In this paper, we adopt a phase field model given by a nonlocal Cahn–Hilliard partial differential equation (PDE) based on the minimization of the Ohta–Kawasaki free energy, and present an efficient PDE-constrained optimization framework for the optimal design problem. The design variables are the locations of circular- or strip-shaped guiding posts that are used to model the substrate chemical pattern. To solve the ensuing optimization problem, we propose a variant of an inexact Newton conjugate gradient algorithm tailored to this problem. Additionally, we demonstrate the effectiveness of our computational strategy on numerical examples that span a range of target morphologies. Owing to our second-order optimizer and fast state solver, the numerical results demonstrate five orders of magnitude reduction in computational cost over previous work. The efficiency of our framework and the fast convergence of our optimization algorithm enable us to rapidly solve the optimal design problem in not only two, but also three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗

Reducing Operator Complexity of Galerkin Coarse-grid Operators with Machine Learning

Here, we propose a data-driven and machine-learning-based approach to compute non-Galerkin coarse-grid operators in multigrid (MG) methods, addressing the well-known issue of increasing operator complexity. Guided by the MG theory on spectrally equivalent coarse-grid operators, we have developed novel machine learning algorithms that utilize neural networks combined with smooth test vectors from multigrid eigenvalue problems. The proposed method demonstrates promise in reducing the complexity of coarse-grid operators while maintaining overall MG convergence for solving parametric partial differential equation problems. Numerical experiments on anisotropic rotated Laplacian and linear elasticity problems are provided to showcase the performance and comparison with existing methods for computing non-Galerkin coarse-grid operators.

97 MATHEMATICS AND COMPUTING↗

Dynamic Parameter Estimation with Physics-based Neural Ordinary Differential Equations

Accurate estimation of dynamic parameters of gen-erators is crucial to building a reliable model for dynamical studies and reliable operation of the power system. This paper develops a physics-based neural ordinary differential equations (ODE) approach to learn the parameters of generator dynamic model using phasor measurement units (PMU) data. We design a physics-based neural network to represent the swing equations of the power system dynamics. A loss function is defined as the difference between dynamic simulation results from the physics-based neural networks and pseudo PMU measurements. The parameters of generator dynamic model are iteratively updated using the neural ODEs and the adjoint method. By exploiting the mini-batch scheme in neural ODE training, the parameter estimation performance is significantly improved. Numerical study results on a 3-machine 9-bus system show that the proposed algorithm outperforms state-of-the-art baseline method in both computation time and dynamic parameter estimation accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Load-Displacement Relation and Gap Distribution Between Rough Surfaces: Partial Differential Equations Approach

We develop a theoretical model to predict the load-displacement relation and probability density function for gaps between contacting rough surfaces. We derive partial differential equations from the previous model (Joe et al., 2018), and extend them to the non-adhesive contact problem. The predictions of the present theory are compared with numerical results using the Green's function molecular dynamics algorithm, and a good agreement is obtained.

adhesion↗

Determining the effects of U/Pu ratio on subsolidus phase transitions in U-Pu-Zr metallic fuel alloys

Here, ternary alloys consisting primarily of uranium, plutonium, and zirconium (U-Pu-Zr) are among the leading candidate fuel systems considered for fast spectrum nuclear reactors. Despite historical operation data from the testing of U-Pu-Zr rods in the Experimental Breeder Reactor-II, considerable uncertainty about the evolution of phases and microstructure across the ternary composition space exists. Due to sluggish kinetics and other difficulties in handling metal actinide specimens, quantitative measurements of phase-transitions in U-Pu-Zr alloys remain sparse in scientific literature, with most investigators reporting either phase-transition temperatures or phase identification data, but not both from the same specimens. The purpose of this paper is to critically compare experimental and calculated phase transition data and correlate with the microstructure and phase characterization data of as-cast and annealed U-Pu-Zr alloys. Phase transition peaks were measured using differential scanning calorimetry in the subsolidus regions (723-948 K) of three ternary U-Pu-Zr alloys with the same zirconium concentration but various U/Pu ratios. Overlapping peaks were deconvoluted using a Frazier-Suzuki peak fitting algorithm, and the critical peak temperatures and enthalpies were calculated. In general, increasing concentrations of Pu were associated with enhanced thermal stability of the body-centered cubic γ phase upon both heating and cooling. Experimental phase transition temperatures in this study tended to agree well with the predictions of the established ternary phase diagrams and other reported phase transition temperatures in literature. Additionally, the TAF-ID thermodynamic database was used to calculate a U-Pu-40 at.% Zr pseudobinary diagram as well as ternary diagrams from 773 to 973 K. The equilibrium phase transition temperatures tended to be considerably lower than measured peak temperatures upon both heating and cooling. Recommendations for improving the quality of data in future U-Pu-Zr characterization studies are also discussed.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Inference of neutrino flavor evolution through data assimilation and neural differential equations

The evolution of neutrino flavor in dense environments such as core-collapse supernovae and binary compact object mergers constitutes an important and unsolved problem. Its solution has potential implications for the dynamics and heavy-element nucleosynthesis in these environments. In this paper, we build upon recent work to explore inference-based techniques for the estimation of model parameters and neutrino flavor evolution histories. Here, we combine data assimilation, ordinary differential equation solvers, and neural networks to craft an inference approach tailored for nonlinear dynamical systems. Using this architecture, and a simple two-neutrino-beam, two-flavor model, we compare the performances of nine different optimization algorithms and expand upon previous assessments of the efficacy of inference for tackling problems in flavor evolution. We find that employing this new architecture, together with evolutionary optimization algorithms, accurately captures flavor histories in the small-scale model and allows us to quickly explore both model parameters and initial flavor content. In future work we plan to extend these inference techniques to large numbers of neutrinos.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Parametric Modeling and Economic Analysis of a 2MW th 3-Stream sCO 2 Heat Exchanger

Here, this paper presents the design and cost optimization of a novel 2MW th 3-stream sCO2 plate-fin heat exchanger. This heat exchanger design is unique in that it uses reduced metal oxide particle-to-sCO2 heat exchanger for cost-effective energy storage applications. The design uses low velocity, laminar air as the re-oxidizing reactant to transfer the heat of the re-oxidizing reaction to a sCO2 power loop. The design of the heat exchanger is based on a 2-D, 3-fluid plate/fin heat transfer model. The model parameterizes the size, shape, and number of passages of the heat exchanger to calculate the temperature profile, pressure drop, and fluid velocities of all three fluids. Global heat exchanger parameters such as the effectiveness and total heat transferred to the sCO2 are then calculated for overall performance. Due to the value and increased use of sCO2 heat exchangers in power cycles, a cost model of the system based on the unique high temperature/high pressure operating conditions was created using quotes from reference projects and market analysis. These quoted air-to-sCO2 heat exchangers are then processed using multiple weighting factors pertinent to heat exchanger design, including heat exchanger type, maximum temperature, differential pressures, fluids, duty, and more. These factors are then used in an exponential function in order to generate a parameterized cost curve. The design and cost of the heat exchanger are then optimized using the SMPSO genetic algorithm in Python. The optimization objectives for the system are to maximize the overall system effectiveness, including an air recuperator for preheating, and to minimize unit costs. Additional constraints are added to the system for the sCO2 and air pressure drops, air velocity to reduce particle entrainment, and the length and volume of the heat exchanger.

Cost Model↗

Spatial Mapping of Electrostatic Fields in 2D Heterostructures

In situ electron microscopy is an effective tool for understanding the mechanisms driving novel phenomena in 2D structures. However, due to practical challenges, it is difficult to address these technologically relevant 2D heterostructures with electron microscopy. Here, we use the differential phase contrast (DPC) imaging technique to build a methodology for probing local electrostatic fields during electrical operation with nanoscale spatial resolution in such materials. We find that, by combining a traditional DPC setup with a high-pass filter, we can largely eliminate electric fluctuations emanating from short-range atomic potentials. Using a method based on this filtering algorithm, a priori electric field expectations can be directly compared with experimentally derived values to readily identify inhomogeneities and potentially problematic regions. Furthermore, we use this platform to analyze the electric field and charge density distribution across layers of hBN and MoS 2 .

79 ASTRONOMY AND ASTROPHYSICS↗