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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 505 records · Page 28

All sources NASA NTRS DOE OSTI

NASA NTRS1993

Layout optimization with algebraic multigrid methods

Finding the optimal position for the individual cells (also called functional modules) on the chip surface is an important and difficult step in the design of integrated circuits. This paper deals with the problem of relative placement, that is the minimization of a quadratic functional with a large, sparse, positive definite system matrix. The basic optimization problem must be augmented by constraints to inhibit solutions where cells overlap. Besides classical iterative methods, based on conjugate gradients (CG), we show that algebraic multigrid methods (AMG) provide an interesting alternative. For moderately sized examples with about 10000 cells, AMG is already competitive with CG and is expected to be superior for larger problems. Besides the classical 'multiplicative' AMG algorithm where the levels are visited sequentially, we propose an 'additive' variant of AMG where levels may be treated in parallel and that is suitable as a preconditioner in the CG algorithm.

Regler, Hans↗

NASA NTRSDate not supplied

Aerothermal Shape Optimization of Actively-Cooled Battery Packs using Conjugate Heat Transfer

Thermal management for battery is important for electric aircraft because battery temperature is critically important to vehicle safety, and it also has direct impact on the efficiency of the battery system. Because ambient air is a readily available resource for aircraft, this paper considers an active cooling concept with forced convection of ambient air through the battery pack. Conjugate heat transfer analysis is used to solve the coupled aero-thermal problem, which consists of a finite-volume computational fluid dynamics solver for the fluid domain, and a conduction heat transfer solver for the solid domain. A mixed Neumann and Dirichlet boundary condition is developed for the fluid-solid interface, which allows the solid domain to completely submerge in the fluid domain. A gradient-based optimization method is adopted, and the discrete adjoint approach implemented in DAFoam is used to efficiently compute the gradients. The aero-thermal coupling for primal analysis and gradient computation is handled using the OpenMDAO-based MPhys framework. A constant heat source is prescribed for the battery cells, and the battery shape (design variable) is optimized to minimize cooling pump power and battery weight (composite objective function) while keeping the battery temperature below a threshold (constraint). The optimized design achieves a 44.6% and 1.5% reduction in the cooling pump power and battery weight, respectively, and the maximal temperature constraint is satisfied. This work has the potential to reduce battery-pack weight, improve performance, and reduce the weight of thermal management systems for electric vertical take-off and landing aircraft.

thermal management↗

NASA NTRSDate not supplied

Aerothermal Shape Optimization of Actively-Cooled Battery Packs Using Conjugate Heat Transfer

heat transfer↗

NASA NTRS1995

Experiments in Neural-Network Control of a Free-Flying Space Robot

Four important generic issues are identified and addressed in some depth in this thesis as part of the development of an adaptive neural network based control system for an experimental free flying space robot prototype. The first issue concerns the importance of true system level design of the control system. A new hybrid strategy is developed here, in depth, for the beneficial integration of neural networks into the total control system. A second important issue in neural network control concerns incorporating a priori knowledge into the neural network. In many applications, it is possible to get a reasonably accurate controller using conventional means. If this prior information is used purposefully to provide a starting point for the optimizing capabilities of the neural network, it can provide much faster initial learning. In a step towards addressing this issue, a new generic Fully Connected Architecture (FCA) is developed for use with backpropagation. A third issue is that neural networks are commonly trained using a gradient based optimization method such as backpropagation; but many real world systems have Discrete Valued Functions (DVFs) that do not permit gradient based optimization. One example is the on-off thrusters that are common on spacecraft. A new technique is developed here that now extends backpropagation learning for use with DVFs. The fourth issue is that the speed of adaptation is often a limiting factor in the implementation of a neural network control system. This issue has been strongly resolved in the research by drawing on the above new contributions.

NEURAL NETS↗

NASA NTRS2004

Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method

Adjoint solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape optimization. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (geometric parameters that control the shape). More recently, emerging adjoint applications focus on the analysis problem, where the adjoint solution is used to drive mesh adaptation, as well as to provide estimates of functional error bounds and corrections. The attractive feature of this approach is that the mesh-adaptation procedure targets a specific functional, thereby localizing the mesh refinement and reducing computational cost. Our focus is on the development of adjoint-based optimization techniques for a Cartesian method with embedded boundaries.12 In contrast t o implementations on structured and unstructured grids, Cartesian methods decouple the surface discretization from the volume mesh. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin et developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation. Central to automated shape optimization algorithms is the issue of geometry modeling and control. The need to optimize complex, "real-life" geometry provides a strong incentive for the use of parametric-CAD systems within the optimization procedure. In previous work, we presented an effective optimization framework that incorporates a direct-CAD interface. In this work, we enhance the capabilities of this framework with efficient gradient computations using the discrete adjoint method. We present details of the adjoint numerical implementation, which reuses the domain decomposition, multigrid, and time-marching schemes of the flow solver. Furthermore, we explain and demonstrate the use of CAD in conjunction with the Cartesian adjoint approach. The final paper will contain a number of complex geometry, industrially relevant examples with many design variables to demonstrate the effectiveness of the adjoint method on Cartesian meshes.

Nemec, Marian↗

DOE OSTI2020

A Stochastic Gradient Descent Approach for Stochastic Optimal Control

In this work, we introduce a stochastic gradient descent approach to solve the stochastic optimal control problem through stochastic maximum principle. The motivation that drives our method is the gradient of the cost functional in the stochastic optimal control problem is under expectation, and numerical calculation of such an expectation requires fully computation of a system of forward backward stochastic differential equations, which is computationally expensive. By evaluating the expectation with single-sample representation as suggested by the stochastic gradient descent type optimisation, we could save computational efforts in solving FBSDEs and only focus on the optimisation task which aims to determine the optimal control process.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1988

Domain decomposition methods for the parallel computation of reacting flows

Domain decomposition is a natural route to parallel computing for partial differential equation solvers. Subdomains of which the original domain of definition is comprised are assigned to independent processors at the price of periodic coordination between processors to compute global parameters and maintain the requisite degree of continuity of the solution at the subdomain interfaces. In the domain-decomposed solution of steady multidimensional systems of PDEs by finite difference methods using a pseudo-transient version of Newton iteration, the only portion of the computation which generally stands in the way of efficient parallelization is the solution of the large, sparse linear systems arising at each Newton step. For some Jacobian matrices drawn from an actual two-dimensional reacting flow problem, comparisons are made between relaxation-based linear solvers and also preconditioned iterative methods of Conjugate Gradient and Chebyshev type, focusing attention on both iteration count and global inner product count. The generalized minimum residual method with block-ILU preconditioning is judged the best serial method among those considered, and parallel numerical experiments on the Encore Multimax demonstrate for it approximately 10-fold speedup on 16 processors.

Keyes, David E.↗

DOE OSTI2023

Say where you sample: Increasing site selection transparency in urban ecology

Urban ecological studies have the potential to extend our understanding of socio-ecological systems beyond that of an individual city or region. Cross-comparative empirical work and synthesis are imperative to develop a general urban ecological theory. This can be achieved only if studies are replicable and generalizable. Transparency in methods reporting facilitates generalizability and replicability by documenting the decisions scientists make during the various steps of research design; this is particularly true for sampling design and selection because of their impact on both internal and external validity and the potential to unintentionally introduce bias. Three interdependent aspects of sample design are study sample selection (e.g., specific organisms, soils, or water), sample specification (measurement of specific variable of interest), and site selection (locations sampled). Of these, documentation of site selection—the where component of sample design—is underrepresented in the urban ecology literature. Using a stratified random sample of 158 papers from 12 major urban ecology journals, we investigated how researchers selected study sites in urban ecosystems and evaluated whether their site selection methods were transparent. We extracted data from these papers using a 50-question, theory-based questionnaire and a multiple-reviewer approach. Our sample represented almost 45 years of urban ecology research across 40 different countries. We found that more than 80% of the papers read were not transparent in their site selection methodology. We do not believe site selection methods are replicable for 70% of the papers read. Key weaknesses include incomplete descriptions of populations and sampling frames, urban gradients, sample selection methods, and property access. Low transparency in reporting the where methodology limits urban ecologists’ ability to assess the internal and external validity of studies’ findings and to replicate published studies; it also limits the generalizability of existing studies. The challenges of low transparency are particularly relevant in urban ecology, a field where standard protocols for site selection and delineation are still being developed. These limitations interfere with the fields’ ability to build theory and inform policy. We conclude by offering a set of recommendations to increase transparency, replicability, and generalizability.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2025

CONCURRENT, CONDENSED STEIN VARIATIONAL GRADIENT DESCENT FOR UNCERTAINTY QUANTIFICATION OF NEURAL NETWORKS

In this work, we propose a Stein variational gradient descent (SVGD) method to concurrently sparsify, train, and provide uncertainty quantification (UQ) of a complexly parameterized model, such as a neural network (NN). It employs a graph reconciliation and condensation process to reduce complexity and increase similarity in the Stein ensemble of parameterizations. Therefore, the proposed concurrent, condensed SVGD (ccSVGD) method can provide UQ on parameters, not just outputs. Furthermore, the parameter reduction speeds up the convergence of the Stein gradient descent as it reduces the combinatorial complexity by aligning and differentiating the sensitivity to parameters. These properties are demonstrated with an illustrative example and an application to a mechanical response representation problem in solid mechanics.

42 ENGINEERING↗

NASA NTRS1990

Extensions of algebraic image operators: An approach to model-based vision

Researchers extend their previous research on a highly structured and compact algebraic representation of grey-level images which can be viewed as fuzzy sets. Addition and multiplication are defined for the set of all grey-level images, which can then be described as polynomials of two variables. Utilizing this new algebraic structure, researchers devised an innovative, efficient edge detection scheme. An accurate method for deriving gradient component information from this edge detector is presented. Based upon this new edge detection system researchers developed a robust method for linear feature extraction by combining the techniques of a Hough transform and a line follower. The major advantage of this feature extractor is its general, object-independent nature. Target attributes, such as line segment lengths, intersections, angles of intersection, and endpoints are derived by the feature extraction algorithm and employed during model matching. The algebraic operators are global operations which are easily reconfigured to operate on any size or shape region. This provides a natural platform from which to pursue dynamic scene analysis. A method for optimizing the linear feature extractor which capitalizes on the spatially reconfiguration nature of the edge detector/gradient component operator is discussed.

Lerner, Bao-Ting↗

NASA NTRS2003

Optimization Based Efficiencies in First Order Reliability Analysis

This paper develops a method for updating the gradient vector of the limit state function in reliability analysis using Broyden's rank one updating technique. In problems that use commercial code as a black box, the gradient calculations are usually done using a finite difference approach, which becomes very expensive for large system models. The proposed method replaces the finite difference gradient calculations in a standard first order reliability method (FORM) with Broyden's Quasi-Newton technique. The resulting algorithm of Broyden updates within a FORM framework (BFORM) is used to run several example problems, and the results compared to standard FORM results. It is found that BFORM typically requires fewer functional evaluations that FORM to converge to the same answer.

Peck, Jeffrey A.↗

DOE OSTI2023

An exploration of machine learning models for the determination of reaction coordinates associated with conformational transitions

Determining collective variables (CVs) for conformational transitions is crucial to understanding their dynamics and targeting them in enhanced sampling simulations. Often, CVs are proposed based on intuition or prior knowledge of a system. However, the problem of systematically determining a proper reaction coordinate (RC) for a specific process in terms of a set of putative CVs can be achieved using committor analysis (CA). Identifying essential degrees of freedom that govern such transitions using CA remains elusive because of the high dimensionality of the conformational space. Various schemes exist to leverage the power of machine learning (ML) to extract an RC from CA. Here, we extend these studies and compare the ability of 17 different ML schemes to identify accurate RCs associated with conformational transitions. We tested these methods on an alanine dipeptide in vacuum and on a sarcosine dipeptoid in an implicit solvent. Our comparison revealed that the light gradient boosting machine method outperforms other methods. In order to extract key features from the models, we employed Shapley Additive exPlanations analysis and compared its interpretation with the “feature importance” approach. For the alanine dipeptide, our methodology identifies ϕ and θ dihedrals as essential degrees of freedom in the C7ax to C7eq transition. For the sarcosine dipeptoid system, the dihedrals ψ and ω are the most important for the cisαD to transαD transition. We further argue that analysis of the full dynamical pathway, and not just endpoint states, is essential for identifying key degrees of freedom governing transitions.

Chemistry↗

DOE OSTI2025

Single-shot in-line x-ray phase-contrast imaging of void-shockwave interactions in fusion energy materials

Recent breakthroughs in nuclear fusion, specifically the report of reactions exceeding scientific breakeven at the National Ignition Facility (NIF), highlight the potential of inertial fusion energy (IFE) as a sustainable and virtually limitless energy source. However, further progress in IFE requires characterization of defects in ablator materials and how they affect fuel capsule compression. Voids within the ablator can degrade energy yield, but their impact on the density distribution has primarily been studied through simulations, with limited high-resolution experimental validation. To address this, we used the x-ray free-electron laser (XFEL) at the matter in extreme conditions (MECs) instrument at the Linac coherent light source (LCLS) to capture 2D x-ray phase-contrast (XPC) images of a void-bearing sample with a composition similar to inertial confinement fusion (ICF) ablators. By driving a compressive shockwave through the sample using MEC's long-pulse laser system, we analyzed how voids influence shockwave propagation and density distribution during compression. To quantify this impact, we extracted phase information using two phase retrieval algorithms. First, we applied the contrast transfer function (CTF) method, paired with Tikhonov regularization and a fast optimization approach to generate an initial phase estimate. We then refined the result using a projected gradient descent (PGD) method that works directly with the sample's refractive index. Comparing these results with radiation adaptive grid Eulerian (xRAGE) radiation hydrodynamic simulations enables identification of model validation needs or improvements. By calculating phase maps in situ, it becomes possible to reconstruct areal density maps, improving understanding of laser-capsule interactions and advancing IFE research.

Hodge, D. S. [Colorado State Univ., Fort Collins, ↗

NASA NTRSDate not supplied

Differential Equation Approximation Using Gradient-Boosted Quantile Regression

The operation of cyber-physical-human (CPH) systems is subject to various epistemic and aleatory uncertainties. Overall trustworthiness of CPH systems relies on the trustworthiness of its components and their interactions. It is important that computational models comprising the cyber component of CPH provide predictions accompanied by a measure of confidence in model outcomes. Uncertainty quantification (UQ) and propagation are especially important in safety critical CPH systems. Gradient-boosted trees is a modeling approach capable both of learning the dynamics of a system and performing UQ. In this paper, we devise a method for using gradient boosting to learn the dynamics of a second order differential equation and estimate uncertainty at the same time. We do this by creating a custom loss function that trains the model to approximate the second derivative of a noisy time series, and to penalize based on a parameter that corresponds to the desired quantile. The resulting gradient boosting model can simulate stochastic trajectories of the system given a single starting point, that is, it can estimate both the expected trajectory and its uncertainty. We show that the uncertainty estimation is well calibrated and that the model can learn the dynamics even in the presence of noise. We demonstrate the approach on a simple cartpole system.

Autonomous systems↗

NASA NTRS1998

Prediction of Transitional Flows in the Low Pressure Turbine

Current turbulence models tend to give too early and too short a length of flow transition to turbulence, and hence fail to predict flow separation induced by the adverse pressure gradients and streamline flow curvatures. Our discussion will focus on the development and validation of transition models. The baseline data for model comparisons are the T3 series, which include a range of free-stream turbulence intensity and cover zero-pressure gradient to aft-loaded turbine pressure gradient flows. The method will be based on the conditioned N-S equations and a transport equation for the intermittency factor. First, several of the most popular 2-equation models in predicting flow transition are examined: k-e [Launder-Sharina], k-w [Wilcox], Lien-Leschiziner and SST [Menter] models. All models fail to predict the onset and the length of transition, even for the simplest flat plate with zero-pressure gradient(T3A). Although the predicted onset position of transition can be varied by providing different inlet turbulent energy dissipation rates, the appropriate inlet conditions for turbulence quantities should be adjusted to match the decay of the free-stream turbulence. Arguably, one may adjust the low-Reynolds-number part of the model to predict transition. This approach has so far not been very successful. However, we have found that the low-Reynolds-number model of Launder and Sharma [1974], which is an improved version of Jones and Launder [1972] gave the best overall performance. The Launder and Sharma model was designed to capture flow re-laminarization (a reverse of flow transition), but tends to give rise to a too early and too fast transition in comparison with the physical transition. The three test cases were for flows with zero pressure gradient but with different free-stream turbulent intensities. The same can be said about the model when considering flows subject to pressure gradient(T3C1). To capture the effects of transition using existing turbulence models, one approach is to make use of the concept of the intermittency to predict the flow transition. It was originally based on the intermittency distribution of Narasimha [1957], and then gradually evolved into a transport equation for the intermittency factor. Gostelow and associates [1994,1995] have made some improvements to Narasimha's method in an attempt to account for both favorable and adverse pressure gradients. Their approach is based on a linear, explicit combination of laminar and turbulent solutions. This approach fails to predict the overshoot of the skin friction on a flat plate near the end of transition zone, even though the length of transition is well predicted. The major flaw of Gostelow's approach is that it assumes the non-turbulent part being the laminar solution and the turbulent part being the turbulent solution and they do not interact across the transitional region. The technique in condition averaging the flow equations in intermittent flows was first introduced by Libby [1975] and Dopazo [1977] and further refined by Dick and associates [1988, 1996]. This approach employs two sets of transport equations for the non-turbulent part and the other for the turbulent part. The advantage of this approach is that it allows the interaction of non-turbulent and turbulent velocities through the introduction of additional source terms in the continuity and momentum equations for the non-turbulent and turbulent velocities. However, the strong coupling of the two sets of equations has caused some numerical difficulties, which requires special attention. The prediction of the skin friction can be improved by this approach via the implicit coupling of non-turbulent and turbulent velocity flelds. Another improvement of the interrmittency model can be further made by allowing the intermittency to vary in the cross-stream direction. This is one step prior to testing any proposal for the transport equation for the intermittency factor. Instead of solving the transport equation for the intermittency factor, the distribution for the intermittency factor is prescribed by Klebanoff's empirical formula [1955]. The skin friction is very well predicted by this new modification, including the overshoot of the profile near the end of the transition zone. The outcome of this study is very encouraging since it indicates that the proper description of the intermittency distribution is the key to the success of the model prediction. This study will be used to guide us on the modelling of the intermittency transport equation.

Huang, George↗

DOE OSTI2025

Accelerating iterative ptychography with an integrated neural network

Electron ptychography is a powerful and versatile tool for high-resolution and dose-efficient imaging. Iterative reconstruction algorithms are powerful but also computationally expensive due to their relative complexity and the many hyperparameters that must be optimised. Gradient descent-based iterative ptychography is a popular method, but it may converge slowly when reconstructing low spatial frequencies. Here, in this work, we present a method for accelerating a gradient descent-based iterative reconstruction algorithm by training a neural network (NN) that is applied in the reconstruction loop. The NN works in Fourier space and selectively boosts low spatial frequencies, thus enabling faster convergence in a manner similar to accelerated gradient descent algorithms. We discuss the difficulties that arise when incorporating a NN into an iterative reconstruction algorithm and show how they can be overcome with iterative training. We apply our method to simulated and experimental data of gold nanoparticles on amorphous carbon and show that we can significantly speed up ptychographic reconstruction of the nanoparticles.

4DSTEM↗

DOE OSTI2021

An adjoint method for determining the sensitivity of island size to magnetic field variations

An adjoint method to calculate the gradient of island width in stellarators is presented and applied to a set of magnetic field configurations. The underlying method for calculation of the island width is that of Cary & Hanson ( Phys. Fluids B, vol. 3, issue 4, 1991, pp. 1006–1014) (with a minor modification), and requires that the residue of the island centre be small. Therefore, the gradient of the residue is calculated in addition. Both the island width and the gradient calculations are verified using an analytical magnetic field configuration introduced by Reiman & Greenside ( Comput. Phys. Commun. , vol. 43, issue 1, 1986, pp. 157–167). The method is also applied to the calculation of the shape gradient of the width of a magnetic island in a National Compact Stellarator Experiment (NCSX) vacuum configuration with respect to positions on a coil. A gradient-based optimization is applied to a magnetic field configuration studied by Hanson & Cary ( Phys. Fluids , vol. 27, issue 4, 1984, pp. 767–769) to minimize stochasticity by adding perturbations to a pair of helical coils. Although only vacuum magnetic fields and an analytical magnetic field model are considered in this work, the adjoint calculation of the island width gradient could also be applied to a magnetohydrodynamic (MHD) equilibrium if the derivative of the magnetic field, with respect to the equilibrium parameters, is known. Using the island width gradient calculation presented here, more general gradient-based optimization methods can be applied to design stellarators with small magnetic islands. Moreover, the sensitivity of the island size may itself be optimized to ensure that coil tolerances, with respect to island size, are kept as high as possible.

Physics↗

NASA NTRS2024

Clock Synchronization Characterization of the Washington DC Metropolitan Area Quantum Network (DC-QNet)

Quantum networking protocols relying on interference and precise time-of-flight measurements require high-precision clock synchronization. This study describes the design, implementation, and characterization of two optical time transfer methods in a metropolitan-scale quantum networking research testbed. With active electronic stabilization, sub-picosecond time deviation (TDEV) was achieved at integration times between 1 s and 10 5 s over 53 km of deployed fiber. Over the same integration periods, 10-picosecond level TDEV was observed using the White Rabbit-Precision Time Protocol (WR-PTP) over 128 km. Measurement methods are described to understand the sources of environmental fluctuations on clock synchronization towards the development of in-situ compensation methods. Path delay gradients, chromatic dispersion, polarization drift, and optical power variations all contributed to clock synchronization errors. The results from this study will inform future work in the development of link noise management methods essential for enabling experimental research in developing practical quantum networking protocols.

PIKTime↗