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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Compositionally gradient nickel-rich cathode materials and methods for the manufacture thereof

The present invention relates to lithium rechargeable battery cathode materials. More specifically, the cathode materials are compositionally gradient nickel-rich cathode materials produced using single-source composite precursor materials containing inorganic and/or metalorganic salts of lithium, nickel, manganese, and cobalt. Methods and systems for manufacturing the cathode materials by a combined spray pyrolysis/fluidized bed process are also disclosed.

Kodenkandath, Thomas A.↗
DOE OSTI2022

Multi-variance replica exchange SGMCMC for inverse and forward problems via Bayesian PINN

Physics-informed neural network (PINN) has been successfully applied in solving a variety of nonlinear non-convex forward and inverse problems. However, the training is challenging because of the non-convex loss functions and the multiple optima in the Bayesian inverse problem. In this work, we propose a multi-variance replica exchange stochastic gradient Langevin dynamics method to tackle the challenge of the multiple local optima in the optimization and the challenge of the multiple modal posterior distribution in the inverse problem. Replica exchange methods are capable of escaping from the local traps and accelerating the convergence; two chains with different temperatures are designed where the low temperature chain aims for the local convergence, and the target of the high temperature chain is to travel globally and explore the whole loss function entropy landscape. However, it may not be efficient to solve mathematical inversion problems by using the vanilla replica method directly since the method doubles the computational cost in evaluating the forward solvers (likelihood functions) in the two chains. To address this issue, we propose to make different assumptions on the energy function estimation and this facilities one to use solvers of different fidelities in the likelihood function evaluation. More precisely, one can use a solver with low fidelity in the high temperature chain while using a solver with high fidelity in the low temperature chain. Our proposed method significantly lowers the computational cost in the high temperature chain, meanwhile preserving the accuracy and converging very fast. Here we give an unbiased estimate of the swapping rate and give an estimation of the discretization error of the scheme. To verify our idea, we design and solve four inverse problems which have multiple modes. The proposed method is also employed to train the Bayesian PINN to solve the forward and inverse problems; faster and more accurate convergence has been observed when compared to the stochastic gradient Langevin dynamics (SGLD) method and vanilla replica exchange methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Laplacian Smoothing Stochastic Gradient Markov Chain Monte Carlo

As an important Markov chain Monte Carlo (MCMC) method, the stochastic gradient Langevin dynamics (SGLD) algorithm has achieved great success in Bayesian learning and posterior sampling. Furthermore, SGLD typically suffers from a slow convergence rate due to its large variance caused by the stochastic gradient. In order to alleviate these drawbacks, we leverage the recently developed Laplacian smoothing technique and propose a Laplacian smoothing stochastic gradient Langevin dynamics (LS-SGLD) algorithm. We prove that for sampling from both log-concave and non-log-concave densities, LS-SGLD achieves strictly smaller discretization error in 2-Wasserstein distance, although its mixing rate can be slightly slower. Experiments on both synthetic and real datasets verify our theoretical results and demonstrate the superior performance of LS-SGLD on different machine learning tasks including posterior sampling, Bayesian logistic regression, and training Bayesian convolutional neural networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A learned closure method applied to phase mixing in a turbulent gradient-driven gyrokinetic system in simple geometry

We present a new method for formulating closures that learn from kinetic simulation data. We apply this method to phase mixing in a simple gyrokinetic turbulent system – temperature-gradient-driven turbulence in an unsheared slab. The closure, called the learned multi-mode (LMM) closure, is constructed by, first, extracting an optimal basis from a nonlinear kinetic simulation using singular value decomposition. Subsequent nonlinear fluid simulations are projected onto this basis and the results are used to formulate the closure. We compare the closure with other closures schemes over a broad range of the relevant two-dimensional parameter space (collisionality and gradient drive). We find that the turbulent kinetic system produces phase-mixing rates much lower than the linear expectations, which the LMM closure is capable of capturing. We also compare radial heat fluxes. A Hammett–Perkins closure, generalized to include collisional effects, is quite successful throughout the parameter space, producing ${\sim }14\,\%$ root-mean-square (r.m.s.) error. The LMM closure is also very effective: when trained at three (two) points (in a 35 point parameter grid), the LMM closure produces $8\,\%$ ( $12\,\%$ ) r.m.s. errors. The LMM procedure can be readily generalized to other closure problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

A deterministic gradient-based approach to avoid saddle points

Abstract Loss functions with a large number of saddle points are one of the major obstacles for training modern machine learning (ML) models efficiently. First-order methods such as gradient descent (GD) are usually the methods of choice for training ML models. However, these methods converge to saddle points for certain choices of initial guesses. In this paper, we propose a modification of the recently proposed Laplacian smoothing gradient descent (LSGD) [Osher et al., arXiv:1806.06317 ], called modified LSGD (mLSGD), and demonstrate its potential to avoid saddle points without sacrificing the convergence rate. Our analysis is based on the attraction region, formed by all starting points for which the considered numerical scheme converges to a saddle point. We investigate the attraction region’s dimension both analytically and numerically. For a canonical class of quadratic functions, we show that the dimension of the attraction region for mLSGD is $\lfloor (n-1)/2\rfloor$ , and hence it is significantly smaller than that of GD whose dimension is $n-1$ .

Mathematics↗
DOE OSTI2023

Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization

Here, we consider unconstrained stochastic optimization problems with no available gradient information. Such problems arise in settings from derivative-free simulation optimization to reinforcement learning. We propose an adaptive sampling quasi-Newton method where we estimate the gradients using finite differences of stochastic function evaluations within a common random number framework. We develop modified versions of a norm test and an inner product quasi-Newton test to control the sample sizes used in the stochastic approximations and provide global convergence results to the neighborhood of a locally optimal solution. We present numerical experiments on simulation optimization problems to illustrate the performance of the proposed algorithm. When compared with classical zeroth-order stochastic gradient methods, we observe that our strategies of adapting the sample sizes significantly improve performance in terms of the number of stochastic function evaluations required.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Finding wombling boundaries in LHC data with Voronoi and Delaunay tessellations

We address the problem of finding a wombling boundary in point data generated by a general Poisson point process, a specific example of which is an LHC event sample distributed in the phase space of a final state signature, with the wombling boundary created by some new physics. We discuss the use of Voronoi and Delaunay tessellations of the point data for estimating the local gradients and investigate methods for sharpening the boundaries by reducing the statistical noise. The outcome from traditional wombling algorithms is a set of boundary cell candidates with relatively large gradients, whose spatial properties must then be scrutinized in order to construct the boundary and evaluate its significance. Here we propose an alternative approach where we simultaneously form and evaluate the significance of all possible boundaries in terms of the total gradient flux. We illustrate our method with several toy examples of both straight and curved boundaries with varying amounts of signal present in the data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Influence of Wetting on Viscous Fingering Via 2D Lattice Boltzmann Simulations

We present simulations of two-phase flow using the Rothman and Keller colour gradient Lattice Boltzmann method to study viscous fingering when a “red fluid” invades a porous model initially filled with a “blue” fluid with different viscosity. We conducted eleven suites of 81 numerical experiments totalling 891 simulations, where each suite had a different random realization of the porous model and spanned viscosity ratios in the range $$M\in [0.01,100]$$ M ϵ [ 0.01 , 100 ] and wetting angles in the range $$\theta _w\in [180^\circ ,0^\circ ]$$ θ w ϵ [ 180 ° , 0 ° ] to allow us to study the effect of these parameters on the fluid-displacement morphology and saturation at breakthrough (sweep). Although sweep often increased with wettability, this was not always so and the sweep phase space landscape, defined as the difference in saturation at a given wetting angle relative to saturation for the non-wetting case, had hills, ridges and valleys. At low viscosity ratios, flow at breakthrough is localized through narrow fingers that span the model. After breakthrough, the flow field continues to evolve and the saturation continues to increase albeit at a reduced rate, and eventually exceeds 90% for both non-wetting and wetting cases. The existence of a complicated sweep phase space at breakthrough, and continued post-breakthrough evolution suggests the hydrodynamics and sweep is a complicated function of wetting angle, viscosity ratio and time, which has major potential implications to Enhanced Oil Recovery by water flooding, and hence, on estimates of global oil reserves. Validation of these results via experiments is required to ensure they translate to field studies.

Engineering↗
DOE OSTI2026

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Method and apparatus for temperature-gradient aware data-placement for 3D stacked DRAMs

A system including a stack of two or more layers of volatile memory, such as layers of a 3D stacked DRAM memory, places data in the stack based on a temperature or a refresh rate. When a threshold is exceeded, data are moved from a first region to a second region in the stack, the second region having one or both of a second temperature lower than a first temperature of the first region or a second refresh rate lower than a first refresh rate of the first region.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Evaluating methods to reduce duration of near-threshold fatigue crack growth rate measurements for low-alloy steels in hydrogen gas

Measurement of the near-threshold fatigue crack growth rate (da/dN) vs. stress-intensity factor range (∆K) relationship in hydrogen gas is essential for maximizing the calculated design fatigue life of high-pressure hydrogen storage vessels. However, such measurements are rarely performed, since the low cyclic loading frequencies applied in standard practice lead to prohibitively protracted test durations. The objective of this study was to demonstrate two means for reducing test durations when measuring near-threshold da/dN vs. ΔK relationships under decreasing ΔK for low-alloy pressure vessel steels in hydrogen gas: 1) imposing steeper K-gradients relative to the recommended limits in standards such as ASTM E647, and 2) increasing cyclic loading frequency relative to typical values applied during fatigue crack growth testing of low-alloy steels in hydrogen gas. Recognizing that steeper K-gradients could amplify loading-history effects, test methods employing this approach were designed to mitigate such effects by either maintaining constant K max or gradually increasing the K-gradient as the threshold was approached. Although the varying K-gradient method was vulnerable to loading-history effects in the form of plasticity-induced crack closure, particularly at lower stress ratio (R) and higher starting K max values, these effects could be compensated by applying the adjusted compliance ratio (ACR) method. Here, it was demonstrated that steeper K-gradients in concert with increased cyclic loading frequency reduced the duration of near-threshold fatigue crack growth tests in hydrogen gas by more than 99% relative to standard practices.

Fatigue threshold↗
DOE OSTI2023

Analytic gradients for relativistic exact-two-component equation-of-motion coupled-cluster singles and doubles method

A first implementation of analytic gradients for spinor-based relativistic equation-of-motion coupled-cluster singles and doubles method using an exact two-component Hamiltonian augmented with atomic mean-field spin–orbit integrals is reported. To demonstrate its applicability, we present calculations of equilibrium structures and harmonic vibrational frequencies for the electronic ground and excited states of the radium mono-amide molecule (RaNH 2 ) and the radium mono-methoxide molecule (RaOCH 3 ). Spin–orbit coupling is shown to quench Jahn–Teller effects in the first excited state of RaOCH 3 , resulting in a C 3v equilibrium structure. Furthermore, the calculations also show that the radium atoms in these molecules serve as efficient optical cycling centers.

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

Physicochemical and Performance Characterization of Six Commercial Organic Solvent Nanofiltration Membranes

This work introduces a novel, gradient-free metamaterial design method based on Gaussian process regression to represent the density field of a unit cell. The dimension of the design space is determined by the covariance matrix dimension in the Gaussian process regression. We propose compressing this matrix using an autoencoder, enabling the decoder to generate the density field and effectively reduce the originally large design space to a lower-dimensional subspace. In this compressed space, we employ an active learning method, Bayesian Adaptive Direct Search (BADS), for efficient exploration of the design space. We demonstrate that for simple 2D designs aimed at maximizing unit cell stiffness, our method yields results comparable to those of standard topology optimization. Furthermore, we extend our approach to various mechanical problems, from linear elasticity to hyperelastic large deformation and elasto-plasticity under finite deformation, to 3D metamaterial design. This illustrates the method’s versatility and effectiveness across a range of applications.

Wu, Haoran↗
DOE OSTI2020

A Generalized Stress Inversion Approach With Application to Residual Stress Estimation

In this work develop a generalized stress inversion technique (or the generalized inversion method) capable of recovering stresses in linear elastic bodies subjected to arbitrary cuts. Specifically, given a set of displacement measurements found experimentally from digital image correlation (DIC), we formulate a stress estimation inverse problem as a partial differential equation-constrained optimization problem. We use gradient-based optimization methods, and we accordingly derive the necessary gradient and Hessian information in a matrix-free form to allow for parallel, large-scale operations. By using a combination of finite elements, DIC, and a matrix-free optimization framework, the generalized inversion method can be used on any arbitrary geometry, provided that the DIC camera can view a sufficient part of the surface. We present numerical simulations and experiments, and we demonstrate that the generalized inversion method can be applied to estimate residual stress.

42 ENGINEERING↗
DOE OSTI2022

Vertical gradient freeze growth of detector grade CdZnTeSe single crystals

Here, we report the growth of detector grade Cd 0.9 Zn 0.1 Te 0.97 Se 0.03 (CZTS) single crystals, a recently discovered quaternary semiconductor for room temperature radiation detection, by a vertical gradient freeze (VGF) method. VGF is a comparatively low-temperature growth method and avoids relative motion between the heater and the ampoule containing the precursor materials which minimizes any thermal drift or temperature fluctuations. As a result, CZTS single crystals with superior charge transport properties has been obtained. Growth of detector-grade CZTS single crystals using VGF method has not been reported yet. X-ray spectroscopy based elemental analysis showed that the grown crystals demonstrated the desired stoichiometry required for high resolution radiation detection. Planar detectors fabricated by deposition of gold contacts (~0.07 cm 2 ) demonstrated high bulk resistivity ~10 10 Ω-cm and a very low leakage current density of 2.8 × 10 –8 A/cm 2 at a bias of 100 V when measured at room temperature. The detectors showed excellent radiation response with 100 % charge collection efficiency when exposed to 5486 keV alpha particles. The electron mobility-lifetime (μτ) product was measured to be 3 × 10 –3 cm 2 /V using a single polarity Hecht analysis which is at par with the recently reported values measured in CZTS grown using conventional Bridgman or travelling heater method. The electron mobility has been calculated to be 964 cm 2 V –1 s –1 using a time-of-flight (TOF) method, a substantial improvement over that obtained from conventionally grown CZTS single crystals.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Binary Optimal Control of Single-Flux-Quantum Pulse Sequences

We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences for single flux quanta (SFQ) control of a quantum computer. The pulse sequences are optimized with the goal of realizing unitary gate transformations. Each pulse has a fixed amplitude and duration. Here we model this process as an binary optimal control problem, constrained by Schrödinger’s equation, where the binary variables indicate whether each pulse is on or off. We introduce a first-order trust-region method, which takes advantage of a relaxed gradient to determine an optimal pulse sequence that minimizes the gate infidelity, while also suppressing leakage to higher energy levels. The proposed algorithm has a computational complexity of O(p log(p)), where p is the number of pulses in the sequence. We present numerical results for the H and X gates, where the optimized pulse sequences give gate fidelity’s better than 99.9%, in ≈ 25 trust-region iterations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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↗
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↗