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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Measurement of Seebeck coefficient using a large thermal gradient

The integral method of measuring the Seebeck voltage, V(T), has been applied to short rod-shaped samples. In the present method, one end of the sample is held at a fixed temperature and the other end is automatically varied through a temperature T range of interest, up to a maximum temperature of 1000 C. The Seebeck coefficient is then obtained from the slope of the V(T) vs T curve. The method offers simplicity of sample handling and minimal operator involvement.

Wood, C.↗
NASA NTRSDate not supplied

Extending an Economical Third-Order Inviscid Nodal-Gradient Cell-Centered Finite-Volume Method to Mixed-Element Grids

In this paper, we extend an economical third-order nodal-gradient cell-centered finite-volume method, originally developed for tetrahedral grids, to mixed-element grids. It is shown that the efficient quadratic interpolation formula essential to eliminating second derivatives from a third-order accurate discretization can be easily extended to an arbitrary cell type. For the surface flux integration, we consider a split-face approach, where a quadrilateral face is split into two triangles, and the third-order method for tetrahedra is directly applied. Also, we derive a second-derivative-free, high-order, volume quadrature formula for an arbitrary cell. Numerical results are presented for accuracy verification and applications with three-dimensional nontetrahedral grids.

Computational Fluid Dynamics↗
DOE OSTI2024

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Friction stir gradient alloying: A high-throughput method to explore the influence of V in enabling HCP to BCC transformation in a γ-FCC dominated high entropy alloy

The compositional possibilities in high entropy alloys (HEAs) is very vast and effective strategies are needed to establish potential alloy chemistries. In this study, friction stir gradient alloying (FSGA), a recently-introduced high-throughput (HT) technique incorporating compositional and microstructural gradients, was used to explore the possibility of introducing a bcc transformation domain in γ-fcc dominated TRIP HEA Fe 38.5 Mn 20 Cr 15 Co 20 Si 5 Cu 1.5 (at.%) by vanadium addition. FSGA has accelerated the process of attaining the composition-microstructure library and the results suggest that vanadium addition of ~1 at.% results in nucleation of α-bcc. Additionally, this is the first observation of ε-hcp to α-bcc transformation in a TRIP HEA and supports the Olson-Cohen model of martensitic transformation (γ-fcc → ε-hcp → α-bcc). ε-hcp is nucleated with a pyramidal orientation by the formation of planar faults on the {111} close-packed planes of γ-fcc, and α-bcc is nucleated in the vicinity of ε-hcp along the {111} γ-fcc trace. There are indications for the formation of basal orientated ε-hcp from intersecting ε-hcp planes orientated for the pyramidal slip. Thus, the study shows the nucleation and growth of the α-bcc phase attributed to the dual effects of chemistry and strain and potential co-existence of all the three phases.

36 MATERIALS SCIENCE↗
NASA NTRSDate not supplied

Comparison of Two Approaches to Constructing Second- and Third-Order Nodal-Gradient Cell-Centered Finite-Volume Methods for Mixed-Element Grids

In this paper, we introduce a third-order nodal-gradient cell-centered finite volume scheme applicable to mixed-element grids based on a single numerical flux per face. Previously, we considered a split-quadrilateral-face approach, where we split each quadrilateral face of a non-tetrahedral cell into two triangles and then apply second- and third-order schemes designed for tetrahedral grids. This approach is relatively simple to implement but expensive because it requires two numerical flux evaluations per quadrilateral face. In this study, we consider another approach, where the surface flux quadrature is performed with a single numerical flux per face with flux corrections. It requires a 3×3 correction matrix to be stored at each face but is more economical than the split-quadrilateral-face approach. The two approaches are compared for three-dimensional flows on irregular hexahedral grids, and their relative merits are discussed.

Third-order scheme↗
NASA NTRS1998

Scaling up the Single Transducer Thickness-Independent Ultrasonic Imaging Method for Accurate Characterization of Microstructural Gradients in Monolithic and Composite Tubular Structures

Ultrasonic velocity/time-of-flight imaging that uses back surface reflections to gauge volumetric material quality is highly suited for quantitative characterization of microstructural gradients including those due to pore fraction, density, fiber fraction, and chemical composition variations. However, a weakness of conventional pulse-echo ultrasonic velocity/time-of-flight imaging is that the image shows the effects of thickness as well as microstructural variations unless the part is uniformly thick. This limits this imaging method's usefulness in practical applications. Prior studies have described a pulse-echo time-of-flight-based ultrasonic imaging method that requires using a single transducer in combination with a reflector plate placed behind samples that eliminates the effect of thickness variation in the image. In those studies, this method was successful at isolating ultrasonic variations due to material microstructure in plate-like samples of silicon nitride, metal matrix composite, and polymer matrix composite. In this study, the method is engineered for inspection of more complex-shaped structures-those having (hollow) tubular/curved geometry. The experimental inspection technique and results are described as applied to (1) monolithic mullite ceramic and polymer matrix composite 'proof-of-concept' tubular structures that contain machined patches of various depths and (2) as-manufactured monolithic silicon nitride ceramic and silicon carbide/silicon carbide composite tubular structures that might be used in 'real world' applications.

Roth, Don J.↗
NASA NTRS1987

Solving Finite-Element Problems on a Concurrent Processor

By use of "conjugate gradients" technique, concurrent efficiency greater than 90 percent. Algorithm applies method of conjugate gradients to iterative solution of finite-element problems on concurrent processor. With algorithm, iteration rates nearly proportional to number of processors. For sufficiently large problems, fraction of proportional speedup achieved, called concurrent efficiency, exceeds 90 percent. Results indicate future application of this and related algorithms to large finite-element problems depend primarily upon applicability of iteratiave techniques, not upon issues of concurrency or efficiency.

Lyzenga, G. A.↗
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↗
NASA NTRS1976

A turbulence model for nonequilibrium adverse pressure gradient flows

This paper presents a method for calculating compressible adverse pressure gradient boundary layers by using an algebraic eddy viscosity turbulence model that has been modified for variable pressure gradient and turbulence memory effects. The pressure gradient corrections are based on previous incompressible data correlations. Several methods for including the effects of turbulence memory are evaluated. A new lag model, which gives good agreement with available experimental data, is developed. Finally, a correlation is developed for the lag length parameter employed in the model as a function of the known experimental flow variables.

Horstman, C. C.↗
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↗
NASA NTRS1984

Separation of cells from the rat anterior pituitary gland

Data concerned with analyzing the cellular organization of the rat anterior pituitary gland are examined. The preparation of the cell suspensions and the methods used to separate pituitary cell types are described. Particular emphasis is given to velocity sedimentation at unit gravity, density gradient centrifugation, affinity methods, fluorescence activated cell sorting, and density gradient and continuous-flow electrophoresis. The difficulties encountered when attempting to compare data from different pituitary cell separation studies are discussed, and results from various experiments are presented. The functional capabilities of the separated cell populations can be tested in various culture systems.

Hymer, W. C.↗
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↗