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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Magnetism and finite-temperature effects in UZr 2 : A density functional theory analysis

The structure and the thermophysical properties of d-UZr 2 are investigated using 0 K density functional theory and ab initio molecular dynamics (AIMD). Modeling the true paramagnetic state of this intermetallic compound has been challenging using first-principles calculations. For the first time, we find that the generalized gradient approximation method without applying an on-site Coulomb interaction term (Hubbard U) can result in a ground state that is antiferromagnetic (AFM). We believe that this weak AFM ground state is the closest to the real paramagnetic state. We found that structure optimization at finite temperatures using AIMD is necessary to achieve this ground state instead of the non-magnetic and ferromagnetic states previously reported in the literature. Our findings indicate that applying the Hubbard U on uranium f-orbitals in this metallic system is unnecessary and not recommended, as it leads to a large overestimation of the volume and introduces an unphysical strong spin polarization. Finally, our approach results in atomic volume, thermal expansion, and heat capacities that have strong agreement with experiments.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Distributed and communication-efficient solutions to linear equations with special sparse structure

In this paper we report two distributed and communication-efficient algorithms based on the multi-agent system are proposed to solve a system of linear equations with the Laplacian sparse system matrix. One algorithm is based on the gradient descent method in optimization. In this algorithm, the agents only share partial information instead of all of their collective state vectors to save significant communication. The other algorithm is obtained by approximating Newton’s method for a faster convergence rate. Although it requires twice as much communication as the first one, it is still communication-efficient given the low dimension of the information shared among agents. The convergence at a linear rate is proved for both algorithms, and a comprehensive comparison of their convergence rate, communication burden, and computation costs is also performed. The proposed algorithms can be applied to various systems to solve those problems that can be modeled as a system of linear equations with a Laplacian sparse system matrix. Simulation results with the electric power system illustrate their effectiveness.

42 ENGINEERING↗
DOE OSTI2020

Diffusivity and Structure of Room Temperature Ionic Liquid in Various Organic Solvents

Room-temperature ionic liquids (RTILs) hold promise for applications in electric double layer capacitors (EDLCs), owing to a much wider potential window, lower vapor pressure, and better thermal and chemical stabilities compared to conventional aqueous and organic electrolytes. However, because the low diffusivity of ions in neat RTILs negates the EDLCs’ advantage of high power density, the ionic liquids are often used in mixture with organic solvents. In this study, we measured the diffusivity of cations and anions in RTIL, 1-butyl-3-methylimidazolium bis(trifluoromethylsulfonyl) ([BMIM + ][TFSI – ]), mixed with 10 organic solvents, by using the pulsed-field gradient NMR method. The ion diffusivity was found to follow that of neat solvents and in most studied solvents showed an excellent agreement with the predicted values reported in the recent molecular dynamics (MD) study [Thompson, M. W.; J. Phys. Chem. B 2019, 123, 1340-1347]. In two solvents consisting of long-chain molecules, however, the MD simulations predictions slightly underestimated the ionic diffusivities. The degree of ion dissociation was also estimated for each solvent by comparing the ionic conductivity with the molar conductivity derived from the diffusion measurements. The degree of ion dissociation and the hydrodynamic radius of ions suggest that the ions are coordinated by ~1 solvent molecule. Finally, the scarcity of solvent–ion interactions explains the fact that the diffusivity of ions in the mixture significantly depends on the viscosity of the solvent.

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

A Comparison of Linear Solvers for Resolving Flow in Three-Dimensional Discrete Fracture Networks

We compare various methods for resolving steady flow within three-dimensional discrete fracture networks, including direct methods, Krylov subspace methods with and without preconditioning, and multi-grid methods. We compared the performance of the methods based on compute times and scaling of the solution as a function of the number of grid nodes and log-variance of the hydraulic aperture. The methods are applied to three test cases: (a) variable density of networks with a truncated power-law distribution of fracture lengths, (b) a fixed network composed of monodisperse fracture sizes but varied permeability/aperture heterogeneity, (c) and a network based on field site in Nevada, US. We chose these cases to allow us to study the impact of the mesh size and flow properties, as well as to demonstrate our conclusions on a large-scale, realistic problem (more than 40 million mesh nodes). A direct solution using Cholesky factorization outperformed other methods for every example but was closely followed in performance by some algebraic multigrid (AMG) preconditioned Krylov subspace methods. Among the Krylov methods, conjugate gradients (CG) with an AMG preconditioner performs the best. Generally, Cholesky factorization is recommended, but CG with an AMG preconditioner may be suitable for very large problems beyond 40 million nodes where the entire linear system cannot reside in memory.

58 GEOSCIENCES↗
DOE OSTI2022

Scalable and accurate multi-GPU-based image reconstruction of large-scale ptychography data

Abstract While the advances in synchrotron light sources, together with the development of focusing optics and detectors, allow nanoscale ptychographic imaging of materials and biological specimens, the corresponding experiments can yield terabyte-scale volumes of data that can impose a heavy burden on the computing platform. Although graphics processing units (GPUs) provide high performance for such large-scale ptychography datasets, a single GPU is typically insufficient for analysis and reconstruction. Several works have considered leveraging multiple GPUs to accelerate the ptychographic reconstruction. However, most of these works utilize only the Message Passing Interface to handle the communications between GPUs. This approach poses inefficiency for a hardware configuration that has multiple GPUs in a single node, especially while reconstructing a single large projection, since it provides no optimizations to handle the heterogeneous GPU interconnections containing both low-speed (e.g., PCIe) and high-speed links (e.g., NVLink). In this paper, we provide an optimized intranode multi-GPU implementation that can efficiently solve large-scale ptychographic reconstruction problems. We focus on the maximum likelihood reconstruction problem using a conjugate gradient (CG) method for the solution and propose a novel hybrid parallelization model to address the performance bottlenecks in the CG solver. Accordingly, we have developed a tool, called PtyGer ( Pty chographic G PU(multipl e )-based r econstruction), implementing our hybrid parallelization model design. A comprehensive evaluation verifies that PtyGer can fully preserve the original algorithm’s accuracy while achieving outstanding intranode GPU scalability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Low responsiveness of machine learning models to critical or deteriorating health conditions

Machine learning (ML) based mortality prediction models can be immensely useful in intensive care units. Such a model should generate warnings to alert physicians when a patient’s condition rapidly deteriorates, or their vitals are in highly abnormal ranges. Before clinical deployment, it is important to comprehensively assess a model’s ability to recognize critical patient conditions. We develop multiple medical ML testing approaches, including a gradient ascent method and neural activation map. We systematically assess these machine learning models’ ability to respond to serious medical conditions using additional test cases, some of which are time series. Guided by medical doctors, our evaluation involves multiple machine learning models, resampling techniques, and four datasets for two clinical prediction tasks. We identify serious deficiencies in the models’ responsiveness, with the models being unable to recognize severely impaired medical conditions or rapidly deteriorating health. For in-hospital mortality prediction, the models tested using our synthesized cases fail to recognize 66% of the injuries. In some instances, the models fail to generate adequate mortality risk scores for all test cases. Our study identifies similar kinds of deficiencies in the responsiveness of 5-year breast and lung cancer prediction models. Using generated test cases, we find that statistical machine-learning models trained solely from patient data are grossly insufficient and have many dangerous blind spots. Most of the ML models tested fail to respond adequately to critically ill patients. How to incorporate medical knowledge into clinical machine learning models is an important future research direction.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

Multiple-carrier-lifetime model for carrier dynamics in InGaN/GaN LEDs with a non-uniform carrier distribution

Here we introduce a multiple-carrier-lifetime model (MCLM) for light-emitting diodes (LEDs) with non-uniform carrier distribution, such as in multiple-quantum-well (MQW) structures. By employing the MCLM, we successfully explain the modulation response of V-pit engineered MQW LEDs, which exhibit an S 21 roll-off slower than –20 dB/decade. Using the proposed model and employing a gradient descent method, we extract effective recombination and escape lifetimes by averaging the carrier behavior across the quantum wells. Our results reveal slower effective carrier recombination and escape in MQW LEDs compared with LEDs emitting from a single QW, indicating the advantages of lower carrier density achieved through V-pit engineering. Notably, the effective carrier recombination time is more than one order of magnitude lower than the effective escape lifetime, suggesting that most carriers in the quantum wells recombine, while the escape process remains weak. To ensure the reliability and robustness of the MCLM, we subject it to a comprehensive threefold validation process. This work confirms the positive impact of spreading carriers into several quantum wells through V-pit engineering. In addition, the MCLM is applicable to other LEDs with a non-uniform carrier distribution, such as micro-LEDs with significant surface recombination and non-uniform lateral carrier profiles.

42 ENGINEERING↗
DOE OSTI2022

A rotationally invariant approach based on Gutzwiller wave function for correlated electron systems

Here, we introduce a rotationally invariant approach combined with the Gutzwiller conjugate gradient minimization method to study correlated electron systems. In the approach, the Gutzwiller projector is parametrized based on the number of electrons occupying the onsite orbitals instead of the onsite configurations. The approach efficiently groups the onsite orbitals according to their symmetry and greatly reduces the computational complexity, which yields a speedup of $20 \sim 50 \times $ in the minimal basis energy calculation of dimers. The computationally efficient approach promotes more accurate calculations beyond the minimal basis that is inapplicable in the original approach. A large-basis energy calculation of F 2 demonstrates favorable agreements with standard quantum-chemical calculations Bytautas et al (2007 J. Chem. Phys. 127 164317).

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Fast, differentiable, and extensible big bang nucleosynthesis package

Here, we introduce light isotope nucleosynthesis with JAX (LINX), a new differentiable public big bang nucleosynthesis code designed for fast parameter estimation. By leveraging JAX, LINX achieves both speed and differentiability, enabling the use of Bayesian inference, including gradient-based methods. We discuss the formalism used in LINX for rapid primordial elemental abundance predictions and give examples of how LINX can be used. When combined with differentiable cosmic microwave background power spectrum emulators, LINX can be used for joint cosmic microwave background and big bang nucleosynthesis analyses without requiring extensive computational resources, including on personal hardware.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Stochastic noise can be helpful for variational quantum algorithms

Saddle points constitute a crucial challenge for first-order gradient descent algorithms. In notions of classical machine learning, they are avoided, for example, by means of stochastic gradient descent methods. In this work, we provide evidence that the saddle-points problem can be naturally avoided in variational quantum algorithms by exploiting the presence of stochasticity. We prove convergence guarantees and present practical examples in numerical simulations and on quantum hardware. We argue that the natural stochasticity of variational algorithms can be beneficial for avoiding strict saddle points, i.e., those saddle points with at least one negative Hessian eigenvalue. This insight that some levels of shot noise could help is expected to add a new perspective to notions of near-term variational quantum algorithms. Published by the American Physical Society 2025

Liu, Junyu↗
DOE OSTI2021

Nucleon-pair coupling scheme in Elliott's SU(3) model

Elliott's SU(3) model is at the basis of the shell-model description of rotational motion in atomic nuclei. Here we demonstrate that SU(3) symmetry can be realized in a truncated shell-model space if constructed in terms of a sufficient number of collective S, D, G,...pairs (i.e., with angular momentum zero, two, four,...) and if the structure of the pairs is optimally determined either by a conjugate-gradient minimization method or from a Hartree-Fock intrinsic state. We illustrate the procedure for six protons and six neutrons in the pf (sdg) shell and exactly reproduce the level energies and electric quadrupole properties of the ground-state rotational band with SDG (SDGI) pairs. The SD-pair approximation without significant renormalization, on the other hand, cannot describe the full SU(3) collectivity. A mapping from Elliott's fermionic SU(3) model to systems with s, d, g,... bosons provides insight into the existence of a decoupled collective subspace in terms of S, D, G,... pairs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Embedded training of neural-network subgrid-scale turbulence models

We report that the weights of a deep neural-network model are optimized in conjunction with the governing flow equations to provide a model for subgrid-scale stresses in a temporally developing plane turbulent jet at Reynolds number Re 0 = 6000 . The objective function for training is first based on the instantaneous filtered velocity fields from a corresponding direct numerical simulation, and the training is by a stochastic gradient descent method, which uses the adjoint Navier-Stokes equations to provide the end-to-end sensitivities of the model weights to the velocity fields. In-sample and out-of-sample testing on multiple dual-jet configurations show that its required mesh density in each coordinate direction for prediction of mean flow, Reynolds stresses, and spectra is half that needed by the dynamic Smagorinsky model for comparable accuracy. The same neural-network model trained directly to match filtered subgrid-scale stresses, without the constraint of being embedded within the flow equations during the training, fails to provide a qualitatively correct prediction. The coupled formulation is generalized to train based only on mean-flow and Reynolds stresses, which are more readily available in experiments. The mean-flow training provides a robust model, which is important, though a somewhat less accurate prediction for the same coarse meshes, as might be anticipated due to the reduced information available for training in this case. The anticipated advantage of the formulation is that the inclusion of resolved physics in the training increases its capacity to extrapolate. This is assessed for the case of passive scalar transport, for which it outperforms established models due to improved mixing predictions.

42 ENGINEERING↗
DOE OSTI2024

Time-Varying Feedback Optimization for Quadratic Programs with Heterogeneous Gradient Step Sizes

Online feedback-based optimization has become a promising framework for real-time optimization and control of complex engineering systems. This tutorial paper surveys the recent advances in the field as well as provides novel convergence results for primal-dual online algorithms with heterogeneous step sizes for different elements of the gradient. The analysis is performed for quadratic programs and the approach is illustrated on applications for adaptive step-size and model-free online algorithms, in the context of optimal control of modern power systems.

gradient methods↗
DOE OSTI2025

Learning with Adaptive Conservativeness for Distributionally Robust Optimization: Incentive Design for Voltage Regulation

Information asymmetry between the Distribution System Operator (DSO) and Distributed Energy Resource Aggregators (DERAs) obstructs designing effective incentives for voltage regulation. To capture this effect, we employ a Stackelberg game-theoretic framework, where the DSO seeks to overcome the information asymmetry and refine its incentive strategies by learning from DERA behavior over multiple iterations. We introduce a model-based online learning algorithm for the DSO, aimed at inferring the relationship between incentives and DERA responses. Given the uncertain nature of these responses, we also propose a distributionally robust incentive design model to control the probability of voltage regulation failure and then reformulate it into a convex problem. This model allows the DSO to periodically revise distribution assumptions on uncertain parameters in the decision model of the DERA. Finally, we present a gradient-based method that permits the DSO to adaptively modify its conservativeness level, measured by the size of a Wasserstein metric-based ambiguity set, according to historical voltage regulation performance. The effectiveness of our proposed method is demonstrated through numerical experiments.

adaptation models↗
DOE OSTI2023

An Iterative Bidirectional Gradient Boosting Algorithm for CVR Baseline Estimation

This paper presents a novel iterative, bidirectional, gradient boosting (bidirectional-GB) algorithm for estimating the baseline of the Conservation Voltage Reduction (CVR) program. We define the CVR baseline as the load profile during the CVR period if the substation voltage is not lowered. The proposed algorithm consists of two key steps: selection of similar days and iterative bidirectional-GB training. In the first step, preand post-event temperature profiles of the targeted CVR day are used to select similar days from historical non-CVR days. In the second step, the pre-event and post-event similar days are used to train two GBMs iteratively: a forward-GBM and a backwardGBM. After each iteration, the two generated CVR baselines are reconciled and only the first and the last points on the reconciled baseline are kept. The iteration repeats until all CVR baseline points are generated. We tested two gradient boosting methods (i.e., GBM and LighGBM) with two data resolutions (i.e., 15and 30-minute). The results demonstrate that both the accuracy and performance of the algorithm are satisfactory.

Lee, Han Pyo↗
DOE OSTI2023

Optimization of Distribution Feeder Topology: A Differential Programming Learning Approach

This paper presents a gradient based method for optimizing distribution feeder network topology under load un- certainty. We recast the optimal network reconfiguration problem as a learning problem where edge weights of a graph are learned to produce an optimized spanning tree for a distribution network. Using recent methods published on differentiable programming, we provide a data driven method for learning these weights. We test our method on 100 variations of an IEEE 15-bus test system. Our results show that our method outperforms more traditional mathematical programming-based approaches.

differentiable programming↗
DOE OSTI2022

Accelerating Noisy VQE Optimization with Gaussian Processes

Hybrid variational quantum algorithms, which combine a classical optimizer with evaluations on a quantum chip, are the most promising candidates to show quantum advantage on current noisy, intermediate-scale quantum (NISQ) devices. The classical optimizer is required to perform well in the presence of noise in the objective function evaluations, or else it becomes the weakest link in the algorithm. We introduce the use of Gaussian Processes (GP) as surrogate models to reduce the impact of noise and to provide high quality seeds to escape local minima, whether real or noise-induced. We build this as a framework on top of local optimizations, for which we choose Implicit Filtering (ImFil) in this study. ImFil is a state-of-the-art, gradient-free method, which in comparative studies has been shown to outperform on noisy VQE problems. The result is a new method: "GP+ImFil". We show that when noise is present, the GP+ImFil approach finds results closer to the true global minimum in fewer evaluations than standalone ImFil, and that it works particularly well for larger dimensional problems. Using GP to seed local searches in a multi-modal landscape shows mixed results: although it is capable of improving on ImFil standalone, it does not do so consistently and would only be preferred over other, more exhaustive, multistart methods if resources are constrained.

Muller, Juliane↗
DOE OSTI2020

Multi-Level Optimal Power Flow Solver in Large Distribution Networks

Solving optimal power flow (OPF) problems for large distribution networks incurs high computational complexity. We consider a large multi-phase distribution network of tree topology with a deep penetration of active devices. We divide the network into collaborating areas featuring subtree topology and subareas featuring subsubtree topology. We design a multilevel implementation of the primal-dual gradient algorithm to solve the voltage regulation OPF problems while preserving nodal voltage information and topological information within areas and subareas. Numerical results on a 4,521-node system verify that the proposed algorithm can significantly improve the computational speed without compromising any optimality.

41 EE - Solar Energy Technologies Office (EE-4S)↗