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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

The explicit computation of integration algorithms and first integrals for ordinary differential equations with polynomials coefficients using trees

This note is concerned with the explicit symbolic computation of expressions involving differential operators and their actions on functions. The derivation of specialized numerical algorithms, the explicit symbolic computation of integrals of motion, and the explicit computation of normal forms for nonlinear systems all require such computations. More precisely, if R = k(x(sub 1),...,x(sub N)), where k = R or C, F denotes a differential operator with coefficients from R, and g member of R, we describe data structures and algorithms for efficiently computing g. The basic idea is to impose a multiplicative structure on the vector space with basis the set of finite rooted trees and whose nodes are labeled with the coefficients of the differential operators. Cancellations of two trees with r + 1 nodes translates into cancellation of O(N(exp r)) expressions involving the coefficient functions and their derivatives.

Crouch, P. E.↗
DOE OSTI2022

Differentially Private K -Means Clustering Applied to Meter Data Analysis and Synthesis

The proliferation of smart meters has resulted in a large amount of data being generated. It is increasingly apparent that methods are required for allowing a variety of stakeholders to leverage the data in a manner that preserves the privacy of the consumers. The sector is scrambling to define policies, such as the so called ‘15/15 rule’, to respond to the need. However, the current policies fail to adequately guarantee privacy. Here, in this paper, we address the problem of allowing third parties to apply K-means clustering, obtaining customer labels and centroids for a set of load time series by applying the framework of differential privacy. We leverage the method to design an algorithm that generates differentially private synthetic load data consistent with the labeled data. We test our algorithm’s utility by answering summary statistics such as average daily load profiles for a 2-dimensional synthetic dataset and a real-world power load dataset.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Machine Learning Pattern Recognition Algorithm With Applications to Coherent Laser Combination

Herein we analyze a new kind of machine learning algorithm designed to feedback stabilize coherently combined lasers. This algorithm learns differential, rather than absolute, values of action in phase space, in order to facilitate learning on initially unstable systems. Experiments have shown that this approach can control small-scale spatial beam combination with high stability. In this paper we analyze the algorithm's performance and limitations in depth, showing that it can continuously learn during operation in order to track changes. Using simulation, we extend the application to temporal combination, and show that it scales to more complex instances by combining 81 beams.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1987

Differential sampling for fast frequency acquisition via adaptive extended least squares algorithm

This paper presents a differential signal model along with appropriate sampling techinques for least squares estimation of the frequency and frequency derivatives and possibly the phase and amplitude of a sinusoid received in the presence of noise. The proposed algorithm is recursive in mesurements and thus the computational requirement increases only linearly with the number of measurements. The dimension of the state vector in the proposed algorithm does not depend upon the number of measurements and is quite small, typically around four. This is an advantage when compared to previous algorithms wherein the dimension of the state vector increases monotonically with the product of the frequency uncertainty and the observation period. Such a computational simplification may possibly result in some loss of optimality. However, by applying the sampling techniques of the paper such a possible loss in optimality can made small.

Kumar, Rajendra↗
DOE OSTI2021

Reconstructing magnetic deflections from sets of proton images using differential evolution

Proton imaging is a powerful technique for imaging electromagnetic fields within an experimental volume, in which spatial variations in proton fluence are a result of deflections to proton trajectories due to interaction with the fields. When deflections are large, proton trajectories can overlap, and this nonlinearity creates regions of greatly increased proton fluence on the image, known as caustics. The formation of caustics has been a persistent barrier to reconstructing the underlying fields from proton images. We have developed a new method for reconstructing the path-integrated magnetic fields, which begins to address the problem posed by caustics. Our method uses multiple proton images of the same object, each image at a different energy, to fill in the information gaps and provide some uniqueness when reconstructing caustic features. We use a differential evolution algorithm to iteratively estimate the underlying deflection function, which accurately reproduces the observed proton fluence at multiple proton energies simultaneously. We test this reconstruction method using synthetic proton images generated for three different, cylindrically symmetric field geometries at various field amplitudes and levels of proton statistics and present reconstruction results from a set of experimental images. Here, the method we propose requires no assumption of deflection linearity and can reliably solve for fields underlying linear, nonlinear, and caustic proton image features for the selected geometries and is shown to be fairly robust to noise in the input proton intensity.

47 OTHER INSTRUMENTATION↗
NASA NTRS1990

Comparison and testing of extended Kalman filters for attitude estimation of the Earth Radiation Budget Satellite

This paper presents the testing and comparison of two extended Kalman filters (EKFs) developed for the Earth Radiation Budget Satellite (ERBS). One EKF updates the attitude quaternion using a four-component additive error quaternion. This technique is compared to that of a second EKF, which uses a multiplicative error quaternion. Brief developments of the algorithms are included. The convergence properties, singularity problems, and normalization techniques of the two filters are addressed. Both filters are tested with simulated ERBS sensor data in addition to real ERBS sensor data. The results of the two filters are also compared to those from the ERBS operational ground support software, which uses a batch differential correction algorithm to estimate attitude and gyro biases.

Bar-Itzhack, Itzhack Y.↗
DOE OSTI2021

Testing Surrogate-Based Optimization with the Fortified Branin-Hoo Extended to Four Dimensions

Some popular functions used to test global optimization algorithms have multiple local optima, all with the same value, making them all global optima. It is easy to make them more challenging by fortifying them via adding a localized bump at the location of one of the optima. In previous work the authors illustrated this for the Branin-Hoo function and the popular differential evolution algorithm, showing that the fortified Branin-Hoo required an order of magnitude more function evaluations. This paper examines the effect of fortifying the Branin-Hoo function on surrogate- based optimization, which usually proceeds by adaptive sampling. Two algorithms are considered. The EGO algorithm, which is based on a Gaussian process (GP) and an algorithm based on radial basis functions (RBF). EGO is found to be more frugal in terms of the number of required function evaluations required to identify the correct basin, but it is expensive to run on a desktop, limiting the number of times the runs could be repeated to establish sound statistics on the number of required function evaluations. The RBF algorithm was cheaper to run, providing more sound statistics on performance. A four-dimensional version of the Branin-Hoo function was introduced in order to assess the effect of dimensionality. Furthermore, it was found that the difference between the ordinary function and the fortified one was much more pronounced for the four-dimensional function compared to the two dimensional one.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2010

Station Keeping of Small Outboard-Powered Boats

Three station keeping controllers have been developed which work to minimize displacement of a small outboard-powered vessel from a desired location. Each of these three controllers has a common initial layer that uses fixed-gain feedback control to calculate the desired heading of the vessel. A second control layer uses a common fixed-gain feedback controller to calculate the net forward thrust, one of two algorithms for controlling engine angle (Fixed-Gain Proportional-integral-derivative (PID) or PID with Adaptively Augmented Gains), and one of two algorithms for differential throttle control (Fixed-Gain PID and PID with Adaptive Differential Throttle gains), which work together to eliminate heading error. The three selected controllers are evaluated using a numerical simulation of a 33-foot center console vessel with twin outboards that is subject to wave, wind, and current disturbances. Each controller is tested for its ability to maintain position in the presence of three sets of environmental disturbances. These algorithms were tested with current velocity of 1.5 m/s, significant wave height of 0.5 m, and wind speeds of 2, 5, and 10 m/s. These values were chosen to model conditions a small vessel may experience in the Gulf Stream off of Fort Lauderdale. The Fixed-gain PID controller progressively got worse as wind speeds increased, while the controllers using adaptive methodologies showed consistent performance over all weather conditions and decreased heading error by as much as 20%. Thus, enhanced robustness to environmental changes has been gained by using an adaptive algorithm.

Fisher, A. D.↗
NASA NTRS1993

Rate determination from vector observations

Vector observations are a common class of attitude data provided by a wide variety of attitude sensors. Attitude determination from vector observations is a well-understood process and numerous algorithms such as the TRIAD algorithm exist. These algorithms require measurement of the line of site (LOS) vector to reference objects and knowledge of the LOS directions in some predetermined reference frame. Once attitude is determined, it is a simple matter to synthesize vehicle rate using some form of lead-lag filter, and then, use it for vehicle stabilization. Many situations arise, however, in which rate knowledge is required but knowledge of the nominal LOS directions are not available. This paper presents two methods for determining spacecraft angular rates from vector observations without a priori knowledge of the vector directions. The first approach uses an extended Kalman filter with a spacecraft dynamic model and a kinematic model representing the motion of the observed LOS vectors. The second approach uses a 'differential' TRIAD algorithm to compute the incremental direction cosine matrix, from which vehicle rate is then derived.

Weiss, Jerold L.↗
DOE OSTI2025

HFBTHO-AD: Differentiation of a nuclear energy density functional code

The HFBTHO code implements a nuclear energy density functional solver to model the structure of atomic nuclei. HFBTHO has previously been used to calibrate energy functionals and perform sensitivity analysis by using derivative-free methods. To enable derivative-based optimization and uncertainty quantification approaches, we must compute the derivatives of HFBTHO outputs with respect to the parameters of the energy functional, which are a subset of all input parameters of the code. Here, we use the algorithmic/automatic differentiation (AD) tool Tapenade to differentiate HFBTHO. We compare the derivatives obtained using AD against finite-difference approximation and examine the performance of the derivative computation.

Algorithmic differentiation↗
DOE OSTI2022

Q-POP-Thermo: A general-purpose thermodynamics solver for ferroelectric materials

We report that Q-POP-Thermo is a program designed to compute thermodynamic monodomain equilibrium states and their properties for ferroelectric single crystals and thin films based on the Landau-Ginzburg-Devonshire (LGD) Theory. Utilizing symbolic manipulation with the SymPy Library, the governing equations along with appropriate boundary conditions are solved for speedy minimization of the free energy of a crystal. Utilizing the popular Differential Evolution algorithm, with appropriate hybridization, multiple phase diagrams, such as the pressure-temperature phase diagram for bulk single crystals and the common strain-temperature phase diagram for monodomain thin-film systems can be readily generated. Furthermore, a variety of material properties of stable ferroelectric phases, including dielectric, piezoelectric, and electrocaloric properties, can simultaneously be calculated. Validation studies are presented for both thin-film and single crystal systems to test the effectiveness and capability of the open-source program.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Privacy-Preserving Knowledge Transfer with Bootstrap Aggregation of Teacher Ensembles

There is a need to transfer knowledge among institutions and organizations to save effort in annotation and labeling or in enhancing task performance. However, knowledge transfer is difficult because of restrictions that are in place to ensure data security and privacy. Institutions are not allowed to exchange data or perform any activity that may expose personal information. With the leverage of a differential privacy algorithm in a high-performance computing environment, we propose a new training protocol, Bootstrap Aggregation of Teacher Ensembles (BATE), which is applicable to various types of machine learning models. The BATE algorithm is based on and provides enhancements to the PATE algorithm, maintaining competitive task performance scores on complex datasets with underrepresented class labels.We conducted a proof-of-the-concept study of the information extraction from cancer pathology report data from four cancer registries and performed comparisons between four scenarios: no collaboration, no privacy-preserving collaboration, the PATE algorithm, and the proposed BATE algorithm. The results showed that the BATE algorithm maintained competitive macro-averaged F1 scores, demonstrating that the suggested algorithm is an effective yet privacy-preserving method for machine learning and deep learning solutions.

Yoon, Hong-Jun↗
DOE OSTI2024

An ion specific continuum model on ionic surfactant's binary phase diagram in aqueous solution

Here, a continuum aggregation model is proposed to account for specific ion effects, enabling accurate phase diagrams calculations for the micellar, cylindrical and lamellar aggregates of sodium/potassium carboxylate surfactants in aqueous solution across a range of temperatures. Three groups of concentrations at distinctive temperatures are fitted to build empirical temperature dependence given the limited availability of relevant experimental measurements. The specific ion effects are manifested in the aggregates' surface tension as well as in the distributions of counter-ions' concentrations in the vicinity of the aggregates. The aggregates' geometric sizes are well-reproduced. The differential evolution algorithm is applied to address boundary conditions of the electrostatic potential, aggregate size optimization as well as the equilibrium of monomers transferring between the aggregate and aqueous region.

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

Machine learning without a processor: Emergent learning in a nonlinear analog network

Standard deep learning algorithms require differentiating large nonlinear networks, a process that is slow and power-hungry. Electronic contrastive local learning networks (CLLNs) offer potentially fast, efficient, and fault-tolerant hardware for analog machine learning, but existing implementations are linear, severely limiting their capabilities. These systems differ significantly from artificial neural networks as well as the brain, so the feasibility and utility of incorporating nonlinear elements have not been explored. Here, we introduce a nonlinear CLLN—an analog electronic network made of self-adjusting nonlinear resistive elements based on transistors. We demonstrate that the system learns tasks unachievable in linear systems, including XOR (exclusive or) and nonlinear regression, without a computer. We find our decentralized system reduces modes of training error in order (mean, slope, curvature), similar to spectral bias in artificial neural networks. The circuitry is robust to damage, retrainable in seconds, and performs learned tasks in microseconds while dissipating only picojoules of energy across each transistor. This suggests enormous potential for fast, low-power computing in edge systems like sensors, robotic controllers, and medical devices, as well as manufacturability at scale for performing and studying emergent learning.

Science & Technology - Other Topics↗
DOE OSTI2020

Thermoeconomic cost optimization of superconducting magnets for proton therapy gantries

A compact gantry delivering 70-220 MeV protons with fixed field in the superconducting magnets could reduce the cost and improve the adoption of proton therapy. While a number of magnet and cryogenics designs have been proposed, the combined capital and operating costs of state-of-the-art superconducting materials have not been analyzed. In response, we develop a thermoeconomic model of a multi-stage, conduction cooled gantry lattice and analyze the cryocooler operating cost, cryocooler capital cost and conductor capital cost for Nb-Ti, Nb 3 Sn, REBCO and Bi-2223 over a continuous range of magnet temperatures, and a differential evolution algorithm is used to identify the optimal combination of thermal intercept temperatures. Although Nb3Sn yields the lowest Net Present Value (NPV) of $111.7k at a magnet temperature of 9.4 K, the optimized Bi-2223 design at 12.8 K approaches the realm of commercial feasibility by offering improved thermal stability and forgoing the need for costly conductor heat treatment and magnet quench training. Furthermore, it was found that Nb3Sn was more cost effective than Nb-Ti and that REBCO was not economically viable for the parameters of this investigation. Overall, the thermoeconomic model developed herein can optimize conductor choices, magnet temperatures and thermal staging which has value for any conduction-cooled superconducting magnet.

BSCCO↗
DOE OSTI2022

Real-Time Drilling Optimization System for Improved Overall Rate of Penetration and Reduced Cost Per Foot in Geothermal Drilling

The key to success in geothermal drilling is economic feasibility, and a major cost in the development of geothermal resources is the actual drilling of the wells. In this project, a real-time drilling optimization system for geothermal drilling was developed. The system couples three individual components while drilling. The first component is a drill stem vibration analysis model, the second is Mechanical Specific Energy (MSE) analyses, and the third is a detailed PDC Rate of Penetration (ROP) drill bit model for optimum RPM and WOB combinations. The benefit of the coupled system is that the range of WOB and RPM could be selected to avoid drill stem vibrations. Secondly, MSE is used as an efficiency measure and the detailed PDC drill bit model ensures the drill bit does not endure temperatures that exceed the temperature at which the PDC cutters experience accelerated wear. The new detailed PDC bit model is based on rock/bit interaction that physically tracks the PDC cutter wear flats as the bit drills ahead giving the capability to calculate the temperature being generated underneath the worn cutters to better advise on operational parameters to avoid accelerated cutter wear and failure and to ensure that operational parameters are applied so that overall ROP is maximized. By combining the drill stem vibrations and the detailed PDC bit cutter wear and “safe” non-accelerated cutter wear temperature and optimum ranges of operating parameters, it results in higher ROP and lower cost drilling. Single cutter PDC testing performed in different lithologies at Sandia was utilized to verify the PDC cutter forces and depth of cut for new and worn cutters. Based on single cutter PDC temperature modeling, verification using single cutter data from the testing done by National Oilwell Varco (NOV) was performed. Sandia’s Hard-Rock Drilling Facility (HRDF) was utilized to test different drill bit configurations with different cutter designs and wear status with different induced modes of vibration to obtain the critical bit RPM/WOB ranges resulting in ineffective drilling and low ROP. The collected test data were further used to verify and calibrate the full hole PDC ROP model that was developed based on single cutter interaction data. A full coupled drill stem vibration model was formulated and verified with geothermal field data from the Chocolate Mountain Aerial Gunnery Range (CMAGR). A graphical user interface (GUI) was developed using Tkinter library in the computer programming language Python, which integrates all the developed models in one system. The developed system consists mainly of the PDC ROP model, PDC bit wear model, PDC cutter temperature model, Mechanical Specific Energy (MSE) model, and drillstring vibration model integrated into one system. The developed system can be used for both, post well analysis and real-time optimization using different criteria such as ROP maximization or MSE minimization. The software uses Differential Evolution Algorithm (DEA) to find optimum values for operational parameters based on last foot drilled while avoiding the drillstring vibration and cutter temperature critical operating parameters.

15 GEOTHERMAL ENERGY↗
DOE OSTI2022

Estimate of the Mass and Radial Profile of the Orphan–Chenab Stream's Dwarf-galaxy Progenitor Using MilkyWay@home

We fit the mass and radial profile of the Orphan–Chenab Stream's (OCS) dwarf-galaxy progenitor by using turnoff stars in the Sloan Digital Sky Survey and the Dark Energy Camera to constrain N-body simulations of the OCS progenitor falling into the Milky Way on the 1.5 PetaFLOPS MilkyWay@home distributed supercomputer. We infer the internal structure of the OCS's progenitor under the assumption that it was a spherically symmetric dwarf galaxy composed of a stellar system embedded in an extended dark matter halo. We optimize the evolution time, the baryonic and dark matter scale radii, and the baryonic and dark matter masses of the progenitor using a differential evolution algorithm. The likelihood score for each set of parameters is determined by comparing the simulated tidal stream to the angular distribution of OCS stars observed in the sky. We fit the total mass of the OCS's progenitor to (2.0 ± 0.3) × 10 7 M ⊙ with a mass-to-light ratio of γ = 73.5 ± 10.6 and (1.1 ± 0.2) × 10 6 M ⊙ within 300 pc of its center. Within the progenitor's half-light radius, we estimate a total mass of (4.0 ± 1.0) × 10 5 M ⊙ . We also fit the current sky position of the progenitor's remnant to be (α, δ) = ((166.0 ± 0.9)°, (–11.1 ± 2.5)°) and show that it is gravitationally unbound at the present time. The measured progenitor mass is on the low end of previous measurements and, if confirmed, lowers the mass range of ultrafaint dwarf galaxies. Our optimization assumes a fixed Milky Way potential, OCS orbit, and radial profile for the progenitor, ignoring the impact of the Large Magellanic Cloud.

79 ASTRONOMY AND ASTROPHYSICS↗