Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “gradient methods”

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 181 records · Page 10

Computational alternatives to obtain time optimal jet engine control

Two computational methods to determine an open loop time optimal control sequence for a simple single spool turbojet engine are described by a set of nonlinear differential equations. Both methods are modifications of widely accepted algorithms which can solve fixed time unconstrained optimal control problems with a free right end. Constrained problems to be considered have fixed right ends and free time. Dynamic programming is defined on a standard problem and it yields a successive approximation solution to the time optimal problem of interest. A feedback control law is obtained and it is then used to determine the corresponding open loop control sequence. The Fletcher-Reeves conjugate gradient method has been selected for adaptation to solve a nonlinear optimal control problem with state variable and control constraints.

Basso, R. J.↗

Calculation of optimum airfoils using direct solutions of the Navier-Stokes equations

A method has been developed which calculates the optimum airfoil shape at a specified operating condition. The Reynolds-averaged Navier-Stokes equations with a turbulence model are used as the governing equations for the fluid flow, and are explicitly introduced into the optimization analysis as constraint equations. The locations of all grid points which define the surface of the airfoil are design variables, eliminating the need for shape functions to describe changes in the airfoil geometry. A generalized reduced-gradient method is used to find the optimum airfoil shape. The use of a direct solution technique (Newton's method) to solve the Navier-Stokes equations allows for the efficient solution of the problem. This paper describes the optimization method and presents sample results.

Felker, Fort F.↗

Robust Optimal Adaptive Control Method with Large Adaptive Gain

In the presence of large uncertainties, a control system needs to be able to adapt rapidly to regain performance. Fast adaptation is referred to the implementation of adaptive control with a large adaptive gain to reduce the tracking error rapidly. However, a large adaptive gain can lead to high-frequency oscillations which can adversely affect robustness of an adaptive control law. A new adaptive control modification is presented that can achieve robust adaptation with a large adaptive gain without incurring high-frequency oscillations as with the standard model-reference adaptive control. The modification is based on the minimization of the Y2 norm of the tracking error, which is formulated as an optimal control problem. The optimality condition is used to derive the modification using the gradient method. The optimal control modification results in a stable adaptation and allows a large adaptive gain to be used for better tracking while providing sufficient stability robustness. Simulations were conducted for a damaged generic transport aircraft with both standard adaptive control and the adaptive optimal control modification technique. The results demonstrate the effectiveness of the proposed modification in tracking a reference model while maintaining a sufficient time delay margin.

Nguyen, Nhan T.↗

Protein crystal growth in low gravity

This Final Technical Report for NASA Grant NAG8-774 covers the period from April 27, 1989 through December 31, 1992. It covers five main topics: fluid flow studies, the influence of growth conditions on the morphology of isocitrate lyase crystals, control of nucleation, the growth of lysozyme by the temperature gradient method and graphoepitaxy of protein crystals. The section on fluid flow discusses the limits of detectability in the Schlieren imaging of fluid flows around protein crystals. The isocitrate lyase study compares crystals grown terrestrially under a variety of conditions with those grown in space. The controlling factor governing the morphology of the crystals is the supersaturation. The lack of flow in the interface between the drop and the atmosphere in microgravity causes protein precipitation in the boundary layer and a lowering of the supersaturation in the drop. This lowered supersaturation leads to improved crystal morphology. Preliminary experiments with lysozyme indicated that localized temperature gradients could be used to nucleate crystals in a controlled manner. An apparatus (thermonucleator) was designed to study the controlled nucleation of protein crystals. This apparatus has been used to nucleate crystals of materials with both normal (ice-water, Rochelle salt and lysozyme) and retrograde (horse serum albumin and alpha chymotrypsinogen A) solubility. These studies have lead to the design of an new apparatus that small and more compatible with use in microgravity. Lysozyme crystals were grown by transporting nutrient from a source (lysozyme powder) to the crystal in a temperature gradient. The influence of path length and cross section on the growth rate was demonstrated. This technique can be combined with the thermonucleator to control both nucleation and growth. Graphoepitaxy utilizes a patterned substrate to orient growing crystals. In this study, silicon substrates with 10 micron grooves were used to grow crystals of catalase, lysozyme and canavalin. In all cases, the crystals grew oriented to the substrate. The supersaturation needed for nucleation and growth was lower on the patterned substrates. In some cases, isolated, large crystals were grown.

Feigelson, Robert S.↗

An Optimal Control Modification to Model-Reference Adaptive Control for Fast Adaptation

This paper presents a method that can achieve fast adaptation for a class of model-reference adaptive control. It is well-known that standard model-reference adaptive control exhibits high-gain control behaviors when a large adaptive gain is used to achieve fast adaptation in order to reduce tracking error rapidly. High gain control creates high-frequency oscillations that can excite unmodeled dynamics and can lead to instability. The fast adaptation approach is based on the minimization of the squares of the tracking error, which is formulated as an optimal control problem. The necessary condition of optimality is used to derive an adaptive law using the gradient method. This adaptive law is shown to result in uniform boundedness of the tracking error by means of the Lyapunov s direct method. Furthermore, this adaptive law allows a large adaptive gain to be used without causing undesired high-gain control effects. The method is shown to be more robust than standard model-reference adaptive control. Simulations demonstrate the effectiveness of the proposed method.

Nguyen, Nhan T.↗

Adaptive Activation Functions Accelerate Convergence in Deep and Physics-informed Neural Networks

We employ adaptive activation functions for regression in deep and physics-informed neural networks (PINNs) to approximate smooth and discontinuous functions as well as solutions of linear and nonlinear partial differential equations. In particular, we solve the nonlinear Klein-Gordon equation, which has smooth solutions, the nonlinear Burgers equation, which can admit high gradient solutions, and the Helmholtz equation. We introduce a scalable hyper-parameter in the activation function, which can be optimized to achieve best performance of the network as it changes dynamically the topology of the loss function involved in the optimization process. The adaptive activation function has better learning capabilities than the traditional one (fixed activation) as it improves greatly the convergence rate, especially at early training, as well as the solution accuracy. To better understand the learning process, we plot the neural network solution in the frequency domain to examine how the network captures successively different frequency bands present in the solution. We consider both forward problems, where the approximate solutions are obtained, as well as inverse problems, where parameters involved in the governing equation are identified. Our simulation results show that the proposed method is a very simple and effective approach to increase the efficiency, robustness and accuracy of the neural network approximation of nonlinear functions as well as solutions of partial differential equations, especially for forward problems. We theoretically prove that in the proposed method, gradient descent algorithms are not attracted to suboptimal critical points or local minima.

machine leaning, Bad minima, Inverse problems, Phy↗

Identification and Quantification of Beta-Emitters in Waste Packages by Segmented Gamma-Scanning - 20114

A commonly applied method for the non-destructive characterization of the radioactive inventory of waste packages (e.g. 200-l drums) is segmented gamma-scanning. The gamma-emitting inventory is identified via their characteristic lines in the measured spectra. The corresponding net peak areas allow for quantification applying appropriate models. The identification and quantification of beta-emitters present in the waste package require further evaluation. While some of them emit gamma-rays, too, which can be used for identification and quantification, pure beta-emitters contribute to the gamma-spectra only by their Bremsstrahlung-spectra. {sup 32}P, {sup 90}Sr and {sup 90}Y are typical representatives of these isotopes. A method is developed for identification and quantification of these pure beta-emitters in radioactive waste packages. Origin of the procedure is the evaluation of the measured gamma-spectrum. After the identification of all lines present in the spectrum (characteristic gamma-lines, single- and double-escape-lines, X-ray-lines, annihilation peak etc.) this information is used together with calibration data of the detection system and further a-priori information like matrix composition, cross-section data from databases etc. to simulate the spectra without the Bremsstrahlung-components by an appropriate method. This may be Monte Carlo simulations or, like in our case, a computer code taking into account mathematical descriptions of the physical effects like photo effect, (multiple) Compton scattering, backscattering etc. and the attenuation effects of the waste matrix. In any case, the resulting spectrum must simulate the real spectrum without its Bremsstrahlung-component as good as possible. Subtracting the simulated from the measured spectrum then results in the Bremsstrahlung-components caused by the beta-emitters. Prior to evaluation, a set of Bremsstrahlung-spectra is calculated and stored for different beta-emitters in different matrices using the Bethe-Heitler equation. This data set can be extended for new conditions, if necessary, and is allocated in a data base for future application. Applying a non-linear optimization using the generalized reduced gradient method for comparing the calculated with the derived Bremsstrahlung-spectra results in the identification of the beta-emitter and a factor, which is proportional to its activity. The proportionality is determined by previous calibration measurements. The application of the method is demonstrated by measurements on a 200-l mock-up drum and a real waste package. (authors)

07 ISOTOPE AND RADIATION SOURCES↗

Development and Application of a Tool for Optimizing Composite Matrix Viscoplastic Material Parameters

This document describes a recently developed analysis tool that enhances the resident capabilities of the Micromechanics Analysis Code with the Generalized Method of Cells (MAC/GMC) and its application. MAC/GMC is a composite material and laminate analysis software package developed at NASA Glenn Research Center. The primary focus of the current effort is to provide a graphical user interface (GUI) capability that helps users optimize highly nonlinear viscoplastic constitutive law parameters by fitting experimentally observed/measured stress-strain responses under various thermo-mechanical conditions for braided composites. The tool has been developed utilizing the MATrix LABoratory (MATLAB) (The Mathworks, Inc., Natick, MA) programming language. Illustrative examples shown are for a specific braided composite system wherein the matrix viscoplastic behavior is represented by a constitutive law described by seven parameters. The tool is general enough to fit any number of experimentally observed stress-strain responses of the material. The number of parameters to be optimized, as well as the importance given to each stress-strain response, are user choice. Three different optimization algorithms are included: (1) Optimization based on gradient method, (2) Genetic algorithm (GA) based optimization and (3) Particle Swarm Optimization (PSO). The user can mix and match the three algorithms. For example, one can start optimization with either 2 or 3 and then use the optimized solution to further fine tune with approach 1. The secondary focus of this paper is to demonstrate the application of this tool to optimize/calibrate parameters for a nonlinear viscoplastic matrix to predict stress-strain curves (for constituent and composite levels) at different rates, temperatures and/or loading conditions utilizing the Generalized Method of Cells. After preliminary validation of the tool through comparison with experimental results, a detailed virtual parametric study is presented wherein the combined effects of temperature and loading rate on the predicted response of a braided composite is investigated.

thermo-mechanical; MATLAB; GUI-Based Too↗

Inverse point source location with the Helmholtz equation on a bounded domain

The problem of recovering acoustic sources, more specifically monopoles, from point-wise measurements of the corresponding acoustic pressure at a limited number of frequencies is addressed. To this purpose, a family of sparse optimization problems in measure space in combination with the Helmholtz equation on a bounded domain is considered in this study. A weighted norm with unbounded weight near the observation points is incorporated into the formulation. Optimality conditions and conditions for recovery in the small noise case are discussed, which motivates concrete choices of the weight. The numerical realization is based on an accelerated conditional gradient method in measure space and a finite element discretization.

97 MATHEMATICS AND COMPUTING↗

Stochasticity and robustness in spiking neural networks

Despite drawing inspiration from biological systems which are inherently noisy and variable, artificial neural networks have been shown to require precise weights to carry out the task which they are trained to accomplish. This creates a challenge when adapting these artificial networks to specialized execution platforms which may encode weights in a manner which restricts their accuracy and/or precision.Reflecting back on the non-idealities which are observed in biological systems, we investigated the effect these properties have on the robustness of spiking neural networks under perturbations to weights. First, we examined techniques extant in conventional neural networks which resemble noisy processes, and postulated they may produce similar beneficial effects in spiking neural networks. Second, we evolved a set of spiking neural networks utilizing biological non-idealities to solve a pole-balancing task, and estimated their robustness. We showed it is higher in networks using noisy neurons, and demonstrated that one of these networks can perform well under the variance expected when a hafnium-oxide based resistive memory is used to encode synaptic weights. Lastly, we trained a series of networks using a surrogate gradient method on the MNIST classification task. We confirmed that these networks demonstrate similar trends in robustness to the evolved networks. We discuss these results and argue that they display empirical evidence supporting the role of noise as a regularizer which can increase network robustness.

97 MATHEMATICS AND COMPUTING↗

A machine learning framework for accurate and robust analysis of radiation detector pulses

The microscopic properties of atomic nuclei are used to study various scientific questions. They are essential for understanding the fundamental forces of nature and the chemical evolution of the universe. Detecting decay radiation from radioactive nuclei makes it possible to probe these fundamental nuclear properties. Detector waveform traces may contain additional information about the radiation. Generally, advanced signal processing techniques are needed to extract this additional information, often involving fitting the waveform with model response functions using non-linear least-squares optimization with second-order gradient methods. While this is a powerful technique, it is also computationally expensive, leading to slow processing time, which scales with the volume of data. To address this problem, we have developed a machine learning (ML) approach that infers the characteristics of traces from a model detector response function. In particular, we are interested in classifying whether a single recorded trace consists of one or two pulse constituents and estimating the pulse parameters. Furthermore, our proposed ML method can precisely extract the pulses’ parameters, such as energy and timing information, and accurately classify the pulse multiplicity of a trace. Unlike non-learning-based approaches, our ML approach uses neural networks that are significantly faster at inference, as they do not require any optimization during this stage.

Curve fitting↗

Perspective on Many-Body Methods for Molecular Polaritonic Systems

Recent advances in strong light–matter interactions have revealed a wealth of new physical phenomena in molecules embedded in optical cavities, including modified chemical reactivity, altered excitation spectra, and novel quantum correlations. To describe these effects from first-principles, the field of ab initio quantum electrodynamics (QED) has emerged as a compelling extension of quantum chemistry that treats electronic and photonic degrees of freedom on equal footing. In this Perspective, we review the growing landscape of many-body QED methods, including Hartree–Fock, density functional theory (QEDFT), time-dependent DFT (QED-TDDFT), configuration interaction (QED-CI), complete active space (QED-CASSCF), coupled cluster (QED-CC), quantum Monte Carlo (QED-QMC), and density matrix renormalization group (QED-DMRG), highlighting recent developments and implementations. We further explore real-time methods, gradient and Hessian formalisms, and the integration of nonadiabatic nuclear dynamics. Applications range from benchmark simulations of polaritonic chemistry to quantum simulations on emerging quantum hardware. We conclude by outlining future directions for theory development and interdisciplinary efforts at the interface of quantum chemistry, condensed matter, and quantum optics.

36 MATERIALS SCIENCE↗

High-Quality SnSe 2 Single Crystals: Electronic and Thermoelectric Properties

In this work, high-quality SnSe 2 single crystals were successfully synthesized using a temperature gradient method. N-type characteristics and strong anisotropic transport properties of SnSe 2 single crystals were exhibited between the ab plane and the c-axis. At 673 K, the power factor (PF) value along the ab plane is 3.43 μW cm -1 K -2 , while it is 0.92 μW cm -1 K -2 along the c-axis. The ratio between thermal conductivities along the ab plane (κ ab ) and c-axis (κ c ) is on the order of 7.6 at 300 K, while this value is about 5.6 at 673 K. The thermoelectric figure of merit (ZT) in the c-axis (0.15) is higher than that (0.1) along the ab plane, according to the ultralow out-of-plane thermal conductivity. The electronic band structure results, which were examined by angle-resolved photoemission spectroscopy (ARPES) predicted the potential of improving the thermoelectric performance of SnSe 2 single crystals by electron doping.

36 MATERIALS SCIENCE↗

Learning in continuous action space for developing high dimensional potential energy models

Reinforcement learning (RL) approaches that combine a tree search with deep learning have found remarkable success in searching exorbitantly large, albeit discrete action spaces, as in chess, Shogi and Go. Many real-world materials discovery and design applications, however, involve multi-dimensional search problems and learning domains that have continuous action spaces. Exploring high-dimensional potential energy models of materials is an example. Traditionally, these searches are time consuming (often several years for a single bulk system) and driven by human intuition and/or expertise and more recently by global/local optimization searches that have issues with convergence and/or do not scale well with the search dimensionality. Here, in a departure from discrete action and other gradient-based approaches, we introduce a RL strategy based on decision trees that incorporates modified rewards for improved exploration, efficient sampling during playouts and a “window scaling scheme" for enhanced exploitation, to enable efficient and scalable search for continuous action space problems. Using high-dimensional artificial landscapes and control RL problems, we successfully benchmark our approach against popular global optimization schemes and state of the art policy gradient methods, respectively. We demonstrate its efficacy to parameterize potential models (physics based and high-dimensional neural networks) for 54 different elemental systems across the periodic table as well as alloys. We analyze error trends across different elements in the latent space and trace their origin to elemental structural diversity and the smoothness of the element energy surface. Broadly, our RL strategy will be applicable to many other physical science problems involving search over continuous action spaces.

36 MATERIALS SCIENCE↗

Light in the dark forest. Part I. An efficient optimal estimator for 3D Lyman-alpha forest power spectrum

The highly anisotropic nature of the Lyman-alpha (Lyα) forest data introduces a complex survey window function that complicates the measurement of the three-dimensional power spectrum ( P 3D ). In this paper, we present the first fully optimal estimator for P 3D , which exactly deconvolves the survey window function and marginalizes contaminated modes that distort the power spectrum. Our approach adapts optimal estimator techniques developed for the 2D cosmic microwave background data to the 3D case. To achieve computational feasibility, we employ the conjugate gradient method and implement the P 3 M formalism to handle large-scale and small-scale operations separately and efficiently. We validate our estimator using Monte Carlo mocks and Gaussian simulations, demonstrating its accuracy and computational efficiency. We confirm that mode marginalization eliminates distortions arising from quasar continuum errors and delivers robust power spectrum estimation, though it also inflates errors at large scales. This first implementation works in the flat-sky case; we discuss the remaining steps needed to generalize it to the curved-sky case. This formalism offers a foundation for the Lyα forest P 3D measurements and a new path toward cosmological constraints from the Lyα forest data.

Lyman alpha forest↗

Efficient quantum circuits based on the quantum natural gradient

Efficient preparation of arbitrary entangled quantum states is crucial for quantum computation. This is particularly important for noisy intermediate-scale quantum simulators relying on variational hybrid quantum-classical algorithms. To that end, we propose symmetry-conserving modified quantum approximate optimization algorithm (SCom-QAOA) circuits. The depths of these circuits depend not only on the desired fidelity to the target state but also on the amount of entanglement the state contains. The parameters of the SCom-QAOA circuits are optimized using the quantum natural gradient method based on the Fubini-Study metric. The SCom-QAOA circuit transforms an unentangled state into a ground state of a gapped one-dimensional Hamiltonian with a circuit depth that depends not on the system size but rather on the finite correlation length. In contrast, the circuit depth grows proportionally to the system size for preparing low-lying states of critical one-dimensional systems. Even in the latter case, SCom-QAOA circuits with depth less than the system size were sufficient to generate states with fidelity in excess of 99%, which is relevant for near-term applications. The proposed scheme enlarges the set of the initial states accessible for variational quantum algorithms and widens the scope of investigation of nonequilibrium phenomena in quantum simulators. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Deploying Traffic Smoothing Cruise Controllers Learned from Trajectory Data

Autonomous vehicle-based traffic smoothing con- trollers are often not transferred to real-world use due to challenges in calibrating many-agent traffic simulators. We show a pipeline to sidestep such calibration issues by collecting trajectory data and learning controllers directly from trajectory data that are then deployed zero-shot onto the highway. We construct a dataset of 772.3 kilometers of recorded drives on the I-24. We then construct a simple simulator using the recorded drives as the lead vehicle in front of a simulated platoon consisting of one autonomous vehicle and five human followers. Using policy-gradient methods with an asymmetric critic to learn the controller, we show that we are able to improve average MPG by 11% in simulation on congested trajectories. We deploy this controller to a mixed platoon of 4 autonomous Toyota RAV-4’s and 7 human drivers in a validation experiment and demonstrate that the expected time-gap of the controller is maintained in the real world test. Finally, we release the driving dataset [1], the simulator, and the trained controller at https://github.com/nathanlct/trajectory-training-icra.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A High-Throughput Solver for Marginalized Graph Kernels on GPU

Here, we present the design and optimization of a solver for efficient and high-throughput computation of the marginalized graph kernel on General Purpose GPUs. The graph kernel is computed using the conjugate gradient method to solve a generalized Laplacian of the tensor product between a pair of graphs. To cope with the large gap between the instruction throughput and the memory bandwidth of the GPUs, our solver forms the graph tensor product on-the-fly without storing it in memory. This is achieved by using threads in a warp cooperatively to stream the adjacency and edge label matrices of individual graphs by small square matrix blocks called tiles, which are then staged in registers and the shared memory for later reuse. Warps across a thread block can further share tiles via the shared memory to increase data reuse. We exploit the sparsity of the graphs hierarchically by storing only non-empty tiles using a coordinate format and nonzero elements within each tile using bitmaps. We propose a new partition-based reordering algorithm for aggregating nonzero elements of the graphs into fewer but denser tiles to further exploit sparsity. We carry out extensive theoretical analyses on the graph tensor product primitives for tiles of various density and evaluate their performance on synthetic and real-world datasets. Our solver delivers three to four orders of magnitude speedup over existing CPU-based solvers such as GraKeL and GraphKernels. The capability of the solver enables kernel-based learning tasks at unprecedented scales.

97 MATHEMATICS AND COMPUTING↗