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 811 records · Page 45
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Elastic Flow Modeling for Hydropower Digital Twins

This report details the elastic, unsteady, one-dimensional flow equations that are used to model flow through a penstock in a hydropower facility. The elastic flow model is accurate even in cases of fast transients, long penstock length, and high gravitation head. The compressibility of the water and elasticity of the pipe walls are explicitly accounted for in the developed models so that the water hammer phenomena can be accurately captured. The elastic flow model is coupled to a mechanistic turbine model to resolve the dynamic feedbacks between the elastic water column and the turbine rotation rate. A finite volume method is employed to solve the governing equations, and the method is shown to have low numerical diffusion in sharp gradient phenomena, such as those encountered when simulating water hammer. The method is applied to single dimensional linear advection benchmark problem and numerical results are compared with analytic results. This is followed on by an application to a full hydropower system with a coupled turbine. The elastic flow model results are compared against an inelastic model.

13 HYDRO ENERGY↗
NASA NTRS2005

Real-Time Principal-Component Analysis

A recently written computer program implements dominant-element-based gradient descent and dynamic initial learning rate (DOGEDYN), which was described in Method of Real-Time Principal-Component Analysis (NPO-40034) NASA Tech Briefs, Vol. 29, No. 1 (January 2005), page 59. To recapitulate: DOGEDYN is a method of sequential principal-component analysis (PCA) suitable for such applications as data compression and extraction of features from sets of data. In DOGEDYN, input data are represented as a sequence of vectors acquired at sampling times. The learning algorithm in DOGEDYN involves sequential extraction of principal vectors by means of a gradient descent in which only the dominant element is used at each iteration. Each iteration includes updating of elements of a weight matrix by amounts proportional to a dynamic initial learning rate chosen to increase the rate of convergence by compensating for the energy lost through the previous extraction of principal components. In comparison with a prior method of gradient-descent-based sequential PCA, DOGEDYN involves less computation and offers a greater rate of learning convergence. The sequential DOGEDYN computations require less memory than would parallel computations for the same purpose. The DOGEDYN software can be executed on a personal computer.

Duong, Vu↗
DOE OSTI2023

Yet another parameter-free shape optimization method

The use of node coordinates as design variables in shape optimization offers a larger design space than computer-aided design (CAD)-based shape parameterizations. It also allows for the optimization of legacy designs, i.e., a finite element mesh from an existing design can be readily optimized to meet new performance requirements without involving a CAD model. However, it is well known that the node coordinate parameterization method is fraught with numerical difficulties, which makes it impractical to use. This has led to several of “parameter-free” shape optimization methods that seek the advantages and avoid the pitfalls of the naïve node coordinate parameterization method. These methods come in two main varieties: sensitivity filtering (or gradient smoothing) and consistent filtering. The latter is analogous to the density filter method used in topology optimization (TO). In this work, we use the PDE filter from TO and energy-based filters to implement consistent shape optimization filtering schemes easily and efficiently. Numerical experiments demonstrate that consistent methods are more robust than sensitivity filtering methods.

42 ENGINEERING↗
DOE OSTI2025

Chelation ion chromatography as an automated, and cost-effective analytical technique for REE determination: method development and applications

Rare earth elements (REEs), as critical minerals, have important uses in modern energy and technologies, yet are vulnerable to potential supply chain disruptions. To establish domestic REE supply chain, efficient REE detection methods for resource characterization and mineral processing will be needed to accelerate innovations for domestic REE recovery. This study developed a rapid, novel, and cost-effective for REE detection method using ion chromatography (IC) for aqueous samples. Various REE-targeted eluent gradients and post-column agent compositions were tested on the chelation ion chromatography (CIC) with UV-vis detector for optimal separation and quantification of REEs within approximately 20 min. The single-channel pump to deliver the post-column solution to UV-vis detector was replaced with a 4-channel gradient pump, to increase operation and maintenance efficiencies. After method optimization, resulting calibration curves for more than ten REEs achieved high coefficients of determination (R2>0.999) and low relatively standard deviations (below 3.24%), demonstrating sub-ppm level detection limits (0.0897 to 0.1149 mg/L). The reliability of the CIC method was validated through comparison with inductively coupled plasma mass spectrometry (ICP-MS), showing strong agreement in REE recovery from certified standards. The impact of metal ions and salts on REE recovery using CIC was also systematically investigated. CIC consistently exhibited reliable performance in the presence of salt solutions such as NaCl and Na₂SO₄ (up to 10,000 mg/L). Our study also found the presence of high concentrations of Al ions (at 10,000 mg/L) significantly influenced REE determination, and elevated concentrations of Ca ions affected the recovery of specific REEs, including La, Ce, and Pr. The CIC method was further tested on REE-containing eluents from solvent extraction tests out of fly ash leachates. REE detection from these real processing fluids were reported to achieve 90% to 100% recovery rate from our IC method, compared to ICP-MS results. This study underscores the potential of CIC as a reliable and efficient alternative for REE determination in complex matrices. It also highlights the importance of minimizing select interfering metal ions in solutions to ensure accurate results. The REE CIC method presents a promising, low-maintenance, salt-tolerant, and cost-effective alternative to traditional analytical methods for REE analysis.

detection of rare earth elements (REE)↗
NASA NTRS1993

Experimental and numerical study of a turbulent boundary layer with pressure gradients

Results are presented of an experimental and numerical study of a turbulent boundary layer with pressure gradients conducted using the recent 'fringe method' with its numerical advantages and good inflow quality. After an inflow transient good agreement is observed; the differences, of up to 13 percent, are discussed. Moderate deviations from the law of the wall are found in the velocity profiles of the simulation. They are fully correlated with the pressure gradient, are in fair quantitative agreement with the experimental results of Nagano et al. (1992), and are roughly the opposite of uncorrected mixing-length-model predictions. Large deviations from the wall scaling are observed for other quantities, notably for the turbulence dissipation rate. The a(1) structure parameter drops mildly in the upper layer with adverse pressure gradient.

Spalart, Philippe R.↗
DOE OSTI2023

Fast model-based scenario optimization in NSTX-U enabled by analytic gradient computation

Model-based optimization offers a systematic approach to advanced scenario planning. In this case, the feedforward-control inputs (actuator trajectories) that are needed to attain and sustain a desired scenario are obtained by solving a nonlinear constrained optimization problem. This class of problems generally minimize a cost function that measures the difference between desired and actual plasma states. Several numerical optimization algorithms, such as sequential quadratic programming, require repeated calculation of the cost function gradients with respect to the input trajectories. Calculating these gradients numerically can be computationally intensive, increasing the time needed to solve the feedforward-control optimization problem. Here, this work introduces a method to analytically calculate these cost function gradients from the current profile evolution model. This can significantly reduce the computational time and allow for fast feedforward-control optimization, which would eventually enable optimal scenario planning between discharges. The performance of the feedforward optimizer with analytical gradients is compared to a traditional optimization algorithm based on numerical gradients for different NSTX-U scenarios. The plasma dynamics in the optimization algorithm are simulated using the Control Oriented Transport SIMulator (COTSIM). Results of the work show that analytical gradients consistently reduce the computation time while achieving trajectories that are comparable to those obtained by traditional optimization algorithms based on numerical gradients.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Quantitative Separation of Unknown Organic–Metal Complexes by Liquid Chromatography–Inductively Coupled Plasma-Mass Spectrometry

Dissolved organic matter (DOM) is widely recognized to control the solubility and reactivity of trace metals in the environment. However, the mechanisms that govern metal-DOM complexation remain elusive, primarily due to the analytical challenge of fractionating and quantifying metal–organic species within the complex mixture of organic compounds that comprise DOM. Here, we describe a quantitative method for fractionation and element-specific detection of organic–metal complexes using liquid chromatography with online inductively coupled plasma mass spectrometry (LC–ICP-MS). The method implements a post-column compensation gradient to stabilize ICP–MS elemental response across the LC solvent gradient, thereby overcoming a major barrier to achieving quantitative accuracy with LC–ICP-MS. With external calibration and internal standard correction, the method yields concentrations of organic–metal complexes that were consistently within 6% of their true values, regardless of the complex’s elution time. We used the method to evaluate the effects of four stationary phases (C18, phenyl, amide, and pentafluoroylphenyl propyl) on the recovery and separation of environmentally relevant trace metals (Mn, Fe, Co, Ni, Cu, Zn, Cd, and Pb) in Suwannee River Fulvic Acid and Suwannee River Natural Organic Matter. The C18, amide, and phenyl phases generally yielded optimal metal recoveries (>75% for all metals except Pb), with the phenyl phase separating polar species to a greater extent than C18 or amide. We also fractionated organic-bound Fe, Cu, and Ni in oxidized and reduced soils, revealing divergent metal-DOM speciation across soil redox environments. Finally, by enabling quantitative fractionation of DOM-bound metals, our method offers a means for advancing a mechanistic understanding of metal–organic complexation throughout the environment.

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

Robust wind farm layout optimization

Wake interactions in wind farms cause losses in annual energy production (AEP) on the order of 10%. Wind farm designers optimize the layout of the farm to mitigate wake losses, especially in the dominant site-specific wind directions. As wind turbines and wind farms grow in scale, optimization becomes more complex. Offshore wind farms regularly comprise more than 100 wind turbines and are characterized by complex boundaries due to shipping lanes, neighboring wind farms, and other constraints. Layout optimization methods are broadly split between gradient-based and gradient-free approaches. Gradient-based approaches can converge quickly and perform well for smaller, academic problems but are often sensitive to initial conditions and tuning parameters and require expert knowledge to use. On the other hand, gradient-free approaches can be more robust to problem complexities. We present a robust layout optimization approach based on a random search algorithm. The algorithm is intended for those who are not optimization experts and has few tuning parameters that need specification to achieve satisfactory results. Unlike off-the-shelf methods, which use generally available, non-domain-specific optimization routines that accept as inputs an optimization function and constraint definitions, this approach takes advantage of the relative computational costs of the different evaluations by evaluating cheaper computations first (boundary and minimum distance constraints) and running expensive AEP evaluations only if all other checks pass. Moreover, an outer genetic algorithm allows multiple solutions to evolve in parallel, enabling rapid solution development on high-performance computers. We discuss the relative ease of selecting necessary tuning parameters and demonstrate the efficacy of the genetic random search on a complex layout problem consisting of placing 70 turbines in a nonconvex and unconnected boundary region.

17 WIND ENERGY↗
DOE OSTI2022

Wavefront shaping with a Hadamard basis for scattering soil imaging

Here, soil is a scattering medium that inhibits imaging of plant-microbial-mineral interactions that are essential to plant health and soil carbon sequestration. However, optical imaging in the complex medium of soil has been stymied by the seemingly intractable problems of scattering and contrast. Here, we develop a wavefront shaping method based on adaptive stochastic parallel gradient descent optimization with a Hadamard basis to focus light through soil mineral samples. Our approach allows a sparse representation of the wavefront with reduced dimensionality for the optimization. We further divide the used Hadamard basis set into subsets and optimize a certain subset at once. Simulation and experimental optimization results demonstrate our method has an approximately seven times higher convergence rate and overall better performance compared to that with optimizing all pixels at once. The proposed method can benefit other high-dimensional optimization problems in adaptive optics and wavefront shaping.

47 OTHER INSTRUMENTATION↗
NASA NTRS1985

Variational assimilation of VAS data into a mesoscale model Assimilation method and sensitivity experiments

The assimilation of temperature and moisture gradient information from the Visible IR Spin-Scan Radiometer's Atmospheric Sounder (VAS) into a mesoscale model is presently undertaken by means of a variational method and followed by tests of the sensitivity of both diabatic and adiabatic versions of the model to VAS data assimilations for the case of July 20-21, 1981. The synoptic scale effects of the assimilation of VAS data are noted to be negligible; the greatest impact was instead on mesoscale forecasts of convective instability patterns. The additional assimilation of relative humidity gradients did not significantly change the patterns of the forecast instabilities. The greatest improvements from assimilation resulted from the resolution of the strong mesoscale temperature gradients by the asynoptic VAS data.

Cram, J. M.↗
NASA NTRS1996

Theoretical Basis for Finite Difference Extrapolation of Sonic Boom Signatures

Calculation of sonic boom signatures for aircraft has traditionally followed the methods of Whitham' and Walkden. The wave disturbance generated by the vehicle is obtained by area rule linearized supersonic flow methods, which yield a locally axisymmetric asymptotic solution. This solution is acoustic in nature, i.e., first order in disturbance quantities, and corresponds to ray acoustics. Cumulative nonlinear distortion of the signature is incorporated by using this solution to adjust propagation speed to first order, thus yielding a solution second order in disturbance quantities. The effects of atmospheric gradients are treated by Blokhintzov's method of geometrical acoustics. Both nonlinear signature evolution and ray tracing are applied as if the pressure field very close to the vehicle were actually that given by the source term (the 'F-function') of the asymptotic linearized flow solution. The viewpoint is thus that the flow solution exists at a small radius near the vehicle, and may be treated as an input to an extrapolation procedure consisting of ray tracing and nonlinear aging. The F-function is often regarded as a representation of a near-field pressure signature, and it is common for computational implementations to treat it interchangeably with the pressure signature. There is a 'matching radius' between the source function and the subsequent propagation extrapolation. This viewpoint has been supported by wind tunnel tests of simple models, and very typically yields correct results for actual flight vehicles. The assumption that the F-function and near-field signature are interchangeable is generally not correct. The flowfield of a vehicle which is not axisymmetric contains crossflow components which are very significant at small radii and less so at larger distances. From an acoustical viewpoint, the crossflow is equivalent to source diffraction portions of the wave field. Use of the F-function as a near field signature effectively assumes that the diminution of the crossflow/diffraction component may be applied all at once at the matching radius noted above. This approximation, though not rigorously validated, is responsible for the usual correct far-field results. On the other hand, if an actual near-field signature (either from wind tunnel or CFD data) is used at a starting point rather than one based on th effective source distribution, the predicted far-field signature is generally wrong.

Plotkin, Kenneth J.↗
NASA NTRS1986

The design of multirate digital control systems

The successive loop closures synthesis method is the only method for multirate (MR) synthesis in common use. A new method for MR synthesis is introduced which requires a gradient-search solution to a constrained optimization problem. Some advantages of this method are that the control laws for all control loops are synthesized simultaneously, taking full advantage of all cross-coupling effects, and that simple, low-order compensator structures are easily accomodated. The algorithm and associated computer program for solving the constrained optimization problem are described. The successive loop closures , optimal control, and constrained optimization synthesis methods are applied to two example design problems. A series of compensator pairs are synthesized for each example problem. The succesive loop closure, optimal control, and constrained optimization synthesis methods are compared, in the context of the two design problems.

Berg, M. C.↗
NASA NTRS2004

Relaxation and Preconditioning for High Order Discontinuous Galerkin Methods with Applications to Aeroacoustics and High Speed Flows

This project is about the investigation of the development of the discontinuous Galerkin finite element methods, for general geometry and triangulations, for solving convection dominated problems, with applications to aeroacoustics. Other related issues in high order WENO finite difference and finite volume methods have also been investigated. methods are two classes of high order, high resolution methods suitable for convection dominated simulations with possible discontinuous or sharp gradient solutions. In [18], we first review these two classes of methods, pointing out their similarities and differences in algorithm formulation, theoretical properties, implementation issues, applicability, and relative advantages. We then present some quantitative comparisons of the third order finite volume WENO methods and discontinuous Galerkin methods for a series of test problems to assess their relative merits in accuracy and CPU timing. In [3], we review the development of the Runge-Kutta discontinuous Galerkin (RKDG) methods for non-linear convection-dominated problems. These robust and accurate methods have made their way into the main stream of computational fluid dynamics and are quickly finding use in a wide variety of applications. They combine a special class of Runge-Kutta time discretizations, that allows the method to be non-linearly stable regardless of its accuracy, with a finite element space discretization by discontinuous approximations, that incorporates the ideas of numerical fluxes and slope limiters coined during the remarkable development of the high-resolution finite difference and finite volume schemes. The resulting RKDG methods are stable, high-order accurate, and highly parallelizable schemes that can easily handle complicated geometries and boundary conditions. We review the theoretical and algorithmic aspects of these methods and show several applications including nonlinear conservation laws, the compressible and incompressible Navier-Stokes equations, and Hamilton-Jacobi-like equations.

Shu, Chi-Wang↗
DOE OSTI2021

PDG: A Composite Method Based on the Resolution of the Identity

The Gaussian-3 (G3) composite approach for thermochemical properties is revisited in light of the enhanced computational efficiency and reduced memory costs by applying the resolution-of-the-identity (RI) approximation for two-electron repulsion integrals (ERIs) to the computationally demanding component methods in the G3 model: the energy and gradient computations via the second-order Møller–Plesset perturbation theory (MP2) and the energy computations using the coupled-cluster singles–doubles method augmented with noniterative triples corrections [CCSD(T)]. Efficient implementation of the RI-based methods is achieved by employing a hybrid distributed/shared memory model based on MPI and OpenMP. The new variant of the G3 composite approach based on the RI approximation is termed the RI-G3 scheme, or alternatively the PDG method. The accuracy of the new RI-G3/PDG scheme is compared to the “standard” G3 composite approach that employs the memory-expensive four-center ERIs in the MP2 and CCSD(T) calculations. Taking the computation of the heats of formation of the closed-shell molecules in the G3/99 test set as a test case, it is demonstrated that the RI approximation introduces negligible changes to the mean absolute errors relative to the standard G3 model (less than 0.1 kcal/mol), while the standard deviations remain unaltered. Furthermore, the efficiency and memory requirements for the RI-MP2 and RI-CCSD(T) methods are compared to the standard MP2 and CCSD(T) approaches, respectively. The hybrid MPI/OpenMP-based RI-MP2 energy plus gradient computation is found to attain a 7.5× speedup over the standard MP2 calculations. For the most demanding CCSD(T) calculations, the application of the RI approximation is found to nearly halve the memory demand, confer about a 4–5× speedup for the CCSD iterations, and reduce the computational time for the compute-intensive triples correction step by several hours.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1989

A combined finite element and boundary integral formulation for solution via CGFFT of 2-dimensional scattering problems

A new technique is presented for computing the scattering by 2-D structures of arbitrary composition. The proposed solution approach combines the usual finite element method with the boundary integral equation to formulate a discrete system. This is subsequently solved via the conjugate gradient (CG) algorithm. A particular characteristic of the method is the use of rectangular boundaries to enclose the scatterer. Several of the resulting boundary integrals are therefore convolutions and may be evaluated via the fast Fourier transform (FFT) in the implementation of the CG algorithm. The solution approach offers the principle advantage of having O(N) memory demand and employs a 1-D FFT versus a 2-D FFT as required with a traditional implementation of the CGFFT algorithm. The speed of the proposed solution method is compared with that of the traditional CGFFT algorithm, and results for rectangular bodies are given and shown to be in excellent agreement with the moment method.

Collins, Jeffery D.↗
DOE OSTI2020

Ptychographic phase retrieval by proximal algorithms

We derive a set of ptychography phase-retrieval iterative engines based on proximal algorithms originally developed in convex optimization theory, and discuss their connections with existing ones. The use of proximal operator creates a simple frame work that allows us to incorporate the effect of noise from a maximum-likelihood (ML) principle. We focus on three particular algorithms, namely proximal minimization, alternating direction method of multiplier and accelerated proximal gradient (APG). We benchmark their performance with numerical simulations, and discuss their optimal conditions for convergence and accuracy. An experimental dataset is used to demonstrate their effectiveness as well, in which case an array of cubic Au nanoparticles with a size of 50 nm is imaged. We show that with the presence of Poisson noise, a dataset with photon counts up to 10 4 at one detector pixel already requires ML-based methods to achieve a stable convergence. Among the three algorithms derived in this work, APG method is reported first time for its application in ptychographic reconstruction and shows superior performance in terms of both accuracy and convergence rate with a noisy dataset.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Gradient-Based Novelty Detection Boosted by Self-Supervised Binary Classification

Novelty detection aims to automatically identify out-of-distribution (OOD) data, without any prior knowledge of them. It is a critical step in data monitoring, behavior analysis and other applications, helping enable continual learning in the field. Conventional methods of OOD detection perform multi-variate analysis on an ensemble of data or features, and usually resort to the supervision with OOD data to improve the accuracy. In reality, such supervision is impractical as one cannot anticipate the anomalous data. In this paper, we propose a novel, self-supervised approach that does not rely on any pre-defined OOD data: (1) The new method evaluates the Mahalanobis distance of the gradients between the in-distribution and OOD data. (2) It is assisted by a self-supervised binary classifier to guide the label selection to generate the gradients, and maximize the Mahalanobis distance. In the evaluation with multiple datasets, such as CIFAR-10, CIFAR-100, SVHN and TinyImageNet, the proposed approach consistently outperforms state-of-the-art supervised and unsupervised methods in the area under the receiver operating characteristic (AUROC) and area under the precision-recall curve (AUPR) metrics. We further demonstrate that this detector is able to accurately learn one OOD class in continual learning.

Sun, Jingbo↗
DOE OSTI2023

Protection Against Graph-Based False Data Injection Attacks on Power Systems

Graph signal processing (GSP) has emerged as a powerful tool for practical network applications, including power system monitoring. By representing power system voltages as smooth graph signals, recent research has focused on developing GSP-based methods for state estimation, attack detection, and topology identification. Included, efficient methods have been developed for detecting false data injection (FDI) attacks, which until now were perceived as non-smooth with respect to the graph Laplacian matrix. Consequently, these methods may not be effective against smooth FDI attacks. In this paper, we propose a graph FDI (GFDI) attack that minimizes the Laplacian-based graph total variation (TV) under practical constraints. In addition, we develop a low-complexity algorithm that solves the non-convex GDFI attack optimization problem using ell_1-norm relaxation, the projected gradient descent (PGD) algorithm, and the alternating direction method of multipliers (ADMM). We then propose a protection scheme that identifies the minimal set of measurements necessary to constrain the GFDI output to high graph TV, thereby enabling its detection by existing GSP-based detectors. Our numerical simulations on the IEEE-57 bus test case reveal the potential threat posed by well-designed GSP-based FDI attacks. Moreover, we demonstrate that integrating the proposed protection design with GSP-based detection can lead to significant hardware cost savings compared to previous designs of protection methods against FDI attacks.

Morgenstern, Gal↗