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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
NASA NTRS2000

Nondestructive Determination of Bond Strength

Although many nondestructive techniques have been applied to detect disbonds in adhesive joints, no absolutely reliable nondestructive method has been developed to detect poor adhesion and evaluate the strength of bonded joints prior to the present work which used nonlinear ultrasonic methods to investigate adhesive bond cure conditions. Previously, a variety of linear and nonlinear ultrasonic methods with water coupling had been used to study aluminum-adhesive-aluminum laminates, prepared under different adhesive curing conditions, for possible bond strength determination. Therefore, in the course of this research effort, a variety of finite-amplitude experimental methods which could possibly differentiate various cure conditions were investigated, including normal and oblique incidence approaches based on nonlinear harmonic generation as well as several non-collinear two-wave interaction approaches. Test samples were mechanically scanned in various ways with respect to the focus of a transmitting transducer operated at several variable excitation frequencies and excitation levels. Even when powerful sample-related resonances were exploited by means of a frequency scanning approach, it was very difficult to isolate the nonlinear characteristics of adhesive bonds. However, a multi-frequency multi-power approach was quite successful and reliable. Ultrasonic tone burst signals at increasing power levels, over a wide frequency range, were transmitted through each bond specimen to determine its excitation dependent nonlinear harmonic resonance behavior. Relative amplitude changes were observed particularly in the higher harmonic spectral data and analyzed using a local displacement and strain analysis in the linear approximation. Two analysis approaches of the excitation-dependent data at specific resonances were found to be quite promising. One of these approaches may represent a very robust algorithm for classifying an adhesive bond as being properly cured or not. Another approach, in addition to differentiation between various cure conditions, may even provide information with respect to the bond strength. Several technical papers were published during the course of this research and a summary is presented in the Ph.D. dissertation of Tobias P. Berndt, a graduate student financially supported by this NASA Grant.

Source record↗
DOE OSTI2026

Laplace Transform–Based Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation

Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value transformations are well studied, eigenvalue transformations are distinct, especially for nonnormal matrices. Here, we propose an efficient quantum algorithm for performing a class of eigenvalue transformations that can be expressed as a certain type of matrix Laplace transformation. This allows us to significantly extend the recently developed linear combination of Hamiltonian simulation method [D. An, J.-P. Liu, and L. Lin, Phys. Rev. Lett., 131 (2023), 150603; D. An, A. M. Childs, and L. Lin, Commun. Math. Phys. 407, 19 (2026)] to represent a wider class of eigenvalue transformations, such as powers of the matrix inverse, 𝐴 −𝑘 , and the exponential of the matrix inverse, 𝑒 −𝐴 −1 . The latter can be interpreted as the solution of a mass-matrix differential equation of the form form 𝐴⁢𝑢′⁡⁡(𝑡) =−𝑢⁡(𝑡). We demonstrate that our eigenvalue transformation approach can solve this problem without explicitly inverting 𝐴, thereby reducing the computational complexity.

Laplace transform↗
DOE OSTI2024

Divide and conquer: Learning chaotic dynamical systems with multistep penalty neural ordinary differential equations

Forecasting high-dimensional dynamical systems is a fundamental challenge in various fields, such as geosciences and engineering. Neural Ordinary Differential Equations (NODEs), which combine the power of neural networks and numerical solvers, have emerged as a promising algorithm for forecasting complex nonlinear dynamical systems. However, classical techniques used for NODE training are ineffective for learning chaotic dynamical systems. In this work, we propose a novel NODE-training approach that allows for robust learning of chaotic dynamical systems. Here, our method addresses the challenges of non-convexity and exploding gradients associated with underlying chaotic dynamics. Training data trajectories from such systems are split into multiple, non-overlapping time windows. In addition to the deviation from the training data, the optimization loss term further penalizes the discontinuities of the predicted trajectory between the time windows. The window size is selected based on the fastest Lyapunov time scale of the system. Multi-step penalty(MP) method is first demonstrated on Lorenz equation, to illustrate how it improves the loss landscape and thereby accelerates the optimization convergence. MP method can optimize chaotic systems in a manner similar to least-squares shadowing with significantly lower computational costs. Our proposed algorithm, denoted the Multistep Penalty NODE, is applied to chaotic systems such as the Kuramoto-Sivashinsky equation, the two-dimensional Kolmogorov flow, and ERA5 reanalysis data for the atmosphere. It is observed that MP-NODE provide viable performance for such chaotic systems, not only for short-term trajectory predictions but also for invariant statistics that are hallmarks of the chaotic nature of these dynamics.

Chaotic dynamical systems↗
NASA NTRS1977

Symbolic computation of recurrence equations for the Chebyshev series solution of linear ODE's

If a linear ordinary differential equation with polynomial coefficients is converted into integrated form then the formal substitution of a Chebyshev series leads to recurrence equations defining the Chebyshev coefficients of the solution function. An explicit formula is presented for the polynomial coefficients of the integrated form in terms of the polynomial coefficients of the differential form. The symmetries arising from multiplication and integration of Chebyshev polynomials are exploited in deriving a general recurrence equation from which can be derived all of the linear equations defining the Chebyshev coefficients. Procedures for deriving the general recurrence equation are specified in a precise algorithmic notation suitable for translation into any of the languages for symbolic computation. The method is algebraic and it can therefore be applied to differential equations containing indeterminates.

Geddes, K. O.↗
DOE OSTI2024

A fully implicit, asymptotic-preserving, semi-Lagrangian algorithm for the time dependent anisotropic heat transport equation

In this paper, we extend the operator-split asymptotic-preserving, semi-Lagrangian algorithm for time dependent anisotropic heat transport equation proposed in Chacón et al. (2014) [18] to use a fully implicit time integration with backward differentiation formulas. The proposed implicit method can deal with arbitrary heat-transport anisotropy ratios $\mathcal{X}$∥ /$ \mathcal{X}$⟂ $\ggg$ 1 (with $\mathcal{X}$∥, $ \mathcal{X}$⟂ the parallel and perpendicular heat diffusivities, respectively) in complicated magnetic field topologies in an accurate and efficient manner. Further, the implicit algorithm is second-order accurate temporally and demonstrates an accurate treatment at boundary layers (e.g., island separatrices), which was not ensured by the operator-split implementation. The condition number of the resulting algebraic system is independent of the anisotropy ratio, and is inverted with preconditioned GMRES. We propose a simple preconditioner that renders the finite-dimensional linear operator compact, resulting in mesh-independent convergence rates for topologically simple magnetic fields, and convergence rates scaling as ~ (NΔt) 1/4 (with N the total mesh size and Δt the timestep) in topologically complex magnetic-field configurations. We demonstrate the accuracy and performance of the approach with test problems of varying complexity, including an analytically tractable boundary-layer problem in a straight magnetic field, and a topologically complex magnetic field featuring magnetic islands with extreme anisotropy ratios $\mathcal{X}$∥ /$ \mathcal{X}$⟂ = 10 10 ) .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Enhancing nuclear data validation analysis by using machine learning

In this work, we demonstrate how machine learning (ML) techniques can be used as an auxiliary tool for nuclear data validation analysis. The output of the ML analysis can inform evaluators and validators on the quality, or lack thereof, of specific nuclear data and benchmark experiments with respect to simulating these experimental benchmark values. To this end, measured and simulated effective neutron multiplication factors, k eff , of 875 selected ICSBEP critical assemblies and the latter's sensitivities with respect to nuclear data as well as benchmarks' features (e.g., material nuclide, core geometry) are used as input for a random forest (RF) regression model. The RF is used to encode the complex inter-dependencies between thousands of nuclear data features (i.e., sensitivity profiles and aspects describing the measurements) and 875 simulated and experimental k eff values in order to understand what nuclear data features are most informative for predicting bias. The complexity of relationships and high-dimensional space is difficult-to-impossible to search fully using simply expert judgment. As a first proof-of-concept—step, it is demonstrated that this technique is able to correctly trace large discrepancies between simulated and experimental k eff back to fabricated shortcomings in nuclear data that were perturbed to simulated k eff values. In a second, real-case scenario, step, the RF algorithm is used to validate the ENDF/B-VIII.0 library in comparison to ENDF/B-VII.1 nuclear data. One case is showcased where the chosen ML algorithms highlighted nuclear data (the 19 F(n,inl) cross section from 0.4–0.9 MeV) that are shown to be problematic by comparing them to associated differential experimental data and nuclear data from other libraries. In addition to that, it is shown that the RF results point towards poor benchmark experiments and associated underestimated uncertainties (e.g., the PU-SOL-THERM-028 series). However, using the RF algorithm for validating nuclear data with respect to k eff is currently limited to pinpointing groups of questionable nuclear data due to the inherent correlations between features introduced by the nuclear data themselves and how k eff is simulated. Due to this, we recommend that the ML methods presented be used to augment—rather than replace—the expert knowledge of evaluators and validators.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2025

Explainable and Differentiable Reinforcement Learning for Multi-objective Optimization in Particle Accelerators

Operating particle accelerators involves optimizing multiple goals simultaneously, which can be challenging due to trade-offs among objectives. While evolutionary algorithms like the genetic algorithm (GA) have been used for various Multi-Objective Optimization (MOO) tasks, they are not inherently suited for complex control problems. This talk highlights two variations of Reinforcement Learning (RL) for concurrently optimizing heat load and trip rates at the Continuous Electron Beam Accelerator Facility (CEBAF). The problem involves strict constraints on individual states, actions, and overall energy requirements of the beam. First, this talk highlights how differentiability can be harnessed through a Deep Differentiable Reinforcement Learning (DDRL) approach to address MOO issues within particle accelerators. We examine the DDRL method alongside Model Free Reinforcement Learning (MFRL), GA, and Bayesian Optimization (BO). The performance of these methods is assessed by generating a Pareto-front for two objectives. Our findings indicate that DDRL excels in handling high-dimensional problems more effectively than MFRL, BO, and GA. Next, we will show integration of explainable physics-based constraints into RL algorithms to enhance trans- parency and trust in decision-making processes by enabling users to verify that agents adhere to established physical principles. This surrogate function can be modeled using neural networks or sparse dictionary mod- els. By examining the mathematical form of the learned constraint function, we are able to confirm the agent has learned to use the established physics of each environment provided but the surrogate model. In addi- tion, we find that the introduction of a mathematical functional dictionary based surrogate model enables our reinforcement learning algorithms to reliably converge for difficult high-dimensional accelerator controls environments.

Rajput, Kishansingh [Thomas Jefferson National Acc↗
DOE OSTI2022

Multi-fidelity modeling to predict the rheological properties of a suspension of fibers using neural networks and Gaussian processes

Unveiling the rheological properties of fiber suspensions is of paramount interest to many industrial applications. There are multiple factors, such as fiber aspect ratio and volume fraction, that play a significant role in altering the rheological behavior of suspensions. Three-dimensional (3D) numerical simulations of coupled differential equations of the suspension of fibers are computationally expensive and time-consuming. Machine learning algorithms can be trained on the available data and make predictions for the cases where no numerical data are available. However, some widely used machine learning surrogates, such as neural networks, require a relatively large training dataset to produce accurate predictions. Multi-fidelity models, which combine high-fidelity data from numerical simulations and less expensive lower fidelity data from resources such as simplified constitutive equations, can pave the way for more accurate predictions. Here, we focus on neural networks and the Gaussian processes with two levels of fidelity, i.e., high and low fidelity networks, to predict the steady-state rheological properties, and compare them to the single-fidelity network. High-fidelity data are obtained from direct numerical simulations based on an immersed boundary method to couple the fluid and solid motion. The low-fidelity data are produced by using constitutive equations. Multiple neural networks and the Gaussian process structures are used for the hyperparameter tuning purpose. Results indicate that with the best choice of hyperparameters, both the multi-fidelity Gaussian processes and neural networks are capable of making predictions with a high level of accuracy with neural networks demonstrating marginally better performance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Lagrangian particle simulation of hydrogen pellets and SPI into runaway electron beam in ITER

Numerical studies of the ablation of pellets and shattered pellet injection (SPI) fragments into a runaway electron beam in ITER have been performed using a time-dependent pellet ablation code [Samulyak et al., Nucl. Fusion, 61(4), 046007 (2021)]. The code resolves detailed ablation physics near pellet fragments and large-scale expansion of ablated clouds. The study of a single-fragment ablation quantifies the influence of various factors, in particular, the impact ionization by runaway electrons and cross-field transport models, on the dynamics of ablated plasma and its penetration into the runaway beam. Simulations of SPI performed using different numbers of pellet fragments study the formation and evolution of the ablation clouds and their large-scale dynamics in ITER. In conclusion, the penetration depth of the ablation clouds is found to be of the order of 50 cm.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Generative deep-learning reveals collective variables of Fermionic systems

Complex processes of fermionic systems ranging from protein folding to nuclear fission often follow a low-dimensional reaction path parametrized in terms of a few collective variables. In nuclear theory, variables related to the shape of the nuclear density in a mean-field picture are key to describing the large amplitude collective motion of the neutrons and protons. Exploring the adiabatic energy landscape spanned by these degrees of freedom reveals the possible reaction channels while simulating the dynamics in this reduced space yields their respective probabilities. Unfortunately, this theoretical framework breaks down whenever the systems encounters a quantum phase transition with respect to the collective variables. Here, in this study, we introduce a novel generative deep-learning algorithm designed to build reaction paths that ensure that the many-fermion wave function stays differentiable with respect to the collective variables. This approach is applicable to any fermionic system described by a coherent state. We use the case of potential energy curves in the 16 O nucleus within the Hartree-Fock theory to illustrate its main features.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Generalized master equation for particle transport in binary random media with renewal statistics

Particle transport in binary stochastic mixtures is classically modeled assuming Markovian or exponential mixing statistics but in many applications material memory invalidates the Markov assumption. For non-Markovian mixing characterized by alternating renewal processes, a transport-theoretic framework is presented that provides an exact description of transport in nonscattering random binary media with general non-exponential statistics. Our approach is to Markovianize the problem by augmenting the {material type, particle flux} state space with the age or distance from the last interface. A Chapman-Kolmogorov equation is formulated for the joint probability density of the material type, particle flux, and age, and subsequently reduced to a generalized Master equation (GME) in differential form. This constitutes the primary result of this work. A state-updating Monte Carlo algorithm consistent with the GME is developed and benchmarked against analytical solutions for multiple chord-length laws. For purely absorbing renewal statistical media, the GME reproduces analytical benchmarks for the equilibrium age distribution, interior mean/variance of material-conditioned fluxes, and boundary transmittance. Simulations further demonstrate that a Markov (exponential) approximation of non-exponential statistics can introduce large errors in transmittance and interior flux profiles. Lastly, the reintroduction of memory due to scattering is briefly addressed through heuristic considerations.

Fluctuations & noise↗
DOE OSTI2026

PDEHats

This is code used to train and evaluate neural partial differential equation solvers on an open source fluid flow data. We evaluate two standard deep learning algorithms for their ability to generalize, a desirable capability for trusthworthy and performant models.

Amarel, James↗
DOE OSTI2025

Estimating Ice Water Content for Winter Storms from Millimeter-Wavelength Radar Measurements Using a Synthesis of Polarimetric and Dual-Frequency Radar Observations

The potential of millimeter-wavelength radar-based ice water content (IWC) estimation is demonstrated using a Ka-band Scanning Polarimetric Radar (KASPR) for the U.S. northeast coast winter storms. Two IWC relations for Ka-band polarimetric radar measurements are proposed: one that uses a combination of the radar reflectivity Z and the estimated total number concentration of snow particles N t and the other based on the joint use of Z, specific differential phase K DP , and the degree of riming f rim . A key element of the algorithms is to obtain the “Rayleigh-equivalent” value of Z measured at the Ka band, i.e., the corresponding Z at a longer radar wavelength for which Rayleigh scattering takes place. This is achieved via polarimetric retrieval of the mean volume diameter D m and incorporating the relationship between the dual-wavelength ratio DWR S/Ka and D m . Those techniques allow for retrievals from single millimeter-wavelength radar measurements and do not necessarily require the dual-wavelength ratio (DWR) measurements, if the DWR–D m relation and Rayleigh assumption for Ka-band K DP are valid. Comparison between the quasivertical profile product obtained from KASPR and the columnar vertical profile product generated from the nearby WSR-88D S-band radar measurements demonstrates that the DWR S/Ka can be estimated from the two close radars without the need for collocated radar beams and synchronized antenna scanning and can be used for determining the Rayleigh-equivalent value of Z. As a result, the performance of the suggested techniques is evaluated for seven winter storms using surface disdrometer and snow accumulation measurements.

Cloud retrieval↗
DOE OSTI2020

Effect of GPS Manipulation to Traditional and Next Generation Relay Protection

This project’s objective is to test the effect of GPS timing variations on relay protection algorithms to determine vulnerabilities and the associated hazards to the electric grid. This will focus on differential protection which utilizes peer to peer communication between substations to determine if the current is not equivalent. This requires the use of GPS to sync the two substations and can be vulnerable to GPS manipulation. However, the effects of GPS manipulation are not a commonly known risk. Therefore, this LDRD will address the risks of GPS manipulation for such a widely implemented technology. For differential protection a GPS resilient architecture was implemented and tested for differential protective relays through a direct serial fiber connection between the two relays. This allows for one relay to be the master and provide synchronization outside of timestamp for differential protection.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1983

Robot arm dynamic model reduction for control

General methods are described by which the mathematical complexities of explicit and exact state equations of robot arms can be reduced to a simplified and compact state equation representation without introducing significant errors into the robot arm dynamic model. The model reduction methods are based on homogeneous coordinates and on the Langrangian algorithm for robot arm dynamics, and utilize matrix, vector and numeric analysis techniques. The derivation of differential vector representation of centripetal and Coriolis forces which has not yet been established in the literature is presented.

Bejczy, A. K.↗
NASA NTRS1989

Personal computer study of finite-difference methods for the transonic small disturbance equation

Calculation of unsteady flow phenomena requires careful attention to the numerical treatment of the governing partial differential equations. The personal computer provides a convenient and useful tool for the development of meshes, algorithms, and boundary conditions needed to provide time accurate solution of these equations. The one-dimensional equation considered provides a suitable model for the study of wave propagation in the equations of transonic small disturbance potential flow. Numerical results for effects of mesh size, extent, and stretching, time step size, and choice of far-field boundary conditions are presented. Analysis of the discretized model problem supports these numerical results. Guidelines for suitable mesh and time step choices are given.

Bland, Samuel R.↗
NASA NTRS1990

Personal computer study of finite-difference methods for the transonic small disturbance equation

Calculation of unsteady flow phenomena requires careful attention to the numerical treatment to the governing partial differential equations. The personal computer provides a convenient and useful tool for the development of meshes, algorithms, and boundary conditions needed to provide time accurate solution of these equations. The one-dimensional equation considered provides a suitable model for the study of wave propagation in the equations of transonic small disturbance potential flow. Numerical results for effects of mesh size, extent, and stretching, time step size, and choice of far-field boundary conditions are presented. Analysis of the discretized model problem supports these numerical results. Guidelines for suitable mesh and time step choices are given.

Bland, Samuel R.↗
NASA NTRS1990

A fully Sinc-Galerkin method for Euler-Bernoulli beam models

A fully Sinc-Galerkin method in both space and time is presented for fourth-order time-dependent partial differential equations with fixed and cantilever boundary conditions. The Sinc discretizations for the second-order temporal problem and the fourth-order spatial problems are presented. Alternate formulations for variable parameter fourth-order problems are given which prove to be especially useful when applying the forward techniques to parameter recovery problems. The discrete system which corresponds to the time-dependent partial differential equations of interest are then formulated. Computational issues are discussed and a robust and efficient algorithm for solving the resulting matrix system is outlined. Numerical results which highlight the method are given for problems with both analytic and singular solutions as well as fixed and cantilever boundary conditions.

Smith, R. C.↗