Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Gradient information”

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 37 records · Page 2

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↗

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗

Estimate of Geothermal Energy Resource in Major U.S. Sedimentary Basins (Presentation)

This study estimates the magnitude of geothermal energy from fifteen major known US sedimentary basins and ranks these basins relative to their potential. Because most sedimentary basins have been explored for oil and gas, well logs, temperatures at depth, and reservoir properties are known. This reduces exploration risk and allows development of geologic exploration models for each basin as wellas a relative assessment of geologic risk elements for each play. The total available thermal resource for each basin was estimated using the volumetric heat-in-place method originally proposed by Muffler (USGS). Total sedimentary thickness maps, stratigraphic columns, cross sections, and temperature gradient Information were gathered for each basin from published articles, USGS reports, andstate geological survey reports. When published data was insufficient, thermal gradients and reservoir properties were derived from oil and gas well logs obtained on oil and gas commission websites. Basin stratigraphy, structural history, and groundwater circulation patterns were studied in order to develop a model that estimates resource size and temperature distribution, and to qualitativelyassess reservoir productivity.

15 GEOTHERMAL ENERGY↗

Single-contact tunneling thermometry

A single-contact tunneling thermometry circuit includes a tunnel junction formed between two objects. Junction temperature gradient information is determined based on a mathematical relationship between a target alternating voltage applied across the junction and the junction temperature gradient. Total voltage measured across the junction indicates the magnitude of the target alternating voltage. A thermal gradient is induced across the junction. A reference thermovoltage is measured when zero alternating voltage is applied across the junction. An increasing alternating voltage is applied while measuring a thermovoltage component and a DC rectification voltage component created by the applied alternating voltage. The target alternating voltage is reached when the thermovoltage is nullified or doubled by the DC rectification voltage depending on the sign of the reference thermovoltage. Thermoelectric current and current measurements may be utilized in place of the thermovoltage and voltage measurements. The system may be automated with a feedback loop.

42 ENGINEERING↗

A non-intrusive parallel-in-time adjoint solver with the XBraid library

In this paper, an adjoint solver for the multigrid-in-time software library XBraid is presented. XBraid provides a non-intrusive approach for simulating unsteady dynamics on multiple processors while parallelizing not only in space but also in the time domain (XBraid: Parallel multigrid in time, http://llnl.gov/casc/xbraid). It applies an iterative multigrid reduction in time algorithm to existing spatially parallel classical time propagators and computes the unsteady solution parallel in time. Techniques from Automatic Differentiation are used to develop a consistent discrete adjoint solver which provides sensitivity information of output quantities with respect to design parameter changes. The adjoint code runs backwards through the primal XBraid actions and accumulates gradient information parallel in time. It is highly non-intrusive as existing adjoint time propagators can easily be integrated through the adjoint interface. The adjoint code is validated on advection-dominated flow with periodic upstream boundary condition. We report it provides similar strong scaling results as the primal XBraid solver and offers great potential for speeding up the overall computational costs for sensitivity analysis using multiple processors.

97 MATHEMATICS AND COMPUTING↗

Parallel-in-Time Simulation of Lindblad's Equation

Constructing fast quantum logic gates is critical to building a scalable quantum computer. We consider a qudit, a quantum version of a bit that can take an arbitrary number of states, coupled with a cavity. In this project, we wish to force the qudit to reach the 0-state, for any possible initial state. The coupled system changes in time according to Lindblad’s equation, an ordinary differential equation on the density matrix of the quantum system. Lindblad’s equation contains some parameters that we can control, so-called control functions. We seek control functions which force the qudit to the 0-state within 2 microseconds, which is much faster than what is currently done in practice. The search method is gradient descent, a numerical optimization method that uses gradient information to iteratively improve the control parameters. My contribution to this project is an attempt to speed up the computation of the gradient. It currently takes about 40 seconds to compute the gradient which involves solving a set of ODEs sequentially. Current supercomputers have thousands of cores, but sequential computations can only make use of 1 core at a time. We wish to divide up the work better, so that we can use many more cores at once. To this end, we have implemented the Multigrid Reduction in Time (MGRIT) algorithm. We perform a systematic parameter search on how to best apply this algorithm. Results indicate a 25 percent speed up for solving Lindblad’s equation and determining how close the final state is the 0-state.

97 MATHEMATICS AND COMPUTING↗

Estimate of the Geothermal Energy Resource in the Major Sedimentary Basins in the United States (Presentation)

Because most sedimentary basins have been explored for oil and gas, well logs, temperatures at depth, and reservoir properties such as depth to basement and formation thickness are well known. The availability of this data reduces exploration risk and allows development of geologic exploration models for each basin. This study estimates the magnitude of recoverable geothermal energy from 15 major known U.S. sedimentary basins and ranks these basins relative to their potential. The total available thermal resource for each basin was estimated using the volumetric heat-in-place method originally proposed by (Muffler, 1979). A qualitative recovery factor was determined for each basin based on data on flow volume, hydrothermal recharge, and vertical and horizontal permeability. Total sedimentary thickness maps, stratigraphic columns, cross sections, and temperature gradient information was gathered for each basin from published articles, USGS reports, and state geological survey reports. When published data were insufficient, thermal gradients and reservoir properties were derived from oil and gas well logs obtained on oil and gas commission databases. Basin stratigraphy, structural history, and groundwater circulation patterns were studied in order to develop a model that estimates resource size, temperature distribution, and a probable quantitative recovery factor.

15 GEOTHERMAL ENERGY↗

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↗

Gradient-Enhanced Reliability Analysis of Transonic Aeroelastic Flutter

Reliability computation for transonic aeroelastic systems is a challenging task, given the complex physical mechanisms involved, and broader challenges associated with computing small probabilities of failure/flutter. This paper demonstrates the use of four different reliability estimation tools, with a particular focus on tools that can utilize gradient information: the derivative of flutter boundaries with respect to random parametric inputs. Results are shown for two test cases: the AGARD 445.6 case and the Common Research Model, and the strength and weaknesses of each UQ tool are compared in terms of cost and accuracy. Two of the UQ tools used here require gradients as part of a search process, but the other two are sample-based, and are able to leverage the existence of gradients for improved performance.

Bret K Stanford↗

Efficient Stochastic Inversion Using Adjoint Models and Kernel-PCA

Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even with gradient information provided. Moreover, the ‘nonlinear’ mapping from parameters to observables generally gives rise to non-Gaussian posteriors even with Gaussian priors, thus hampering the use of efficient inversion algorithms designed for models with Gaussian assumptions. In this work, we propose a novel Bayesian stochastic inversion methodology, characterized by a tight coupling between a gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel principal component analysis (KPCA). This approach addresses the ‘curse-of-dimensionality’ via KPCA to identify a low-dimensional feature space within the high-dimensional and nonlinearly correlated spatial random field. Moreover, non-Gaussian full posterior probability distribution functions are estimated via an efficient LMCMC method on both the projected low-dimensional feature space and the recovered high-dimensional parameter space. We demonstrate this computational framework by integrating and adapting recent developments such as data-driven statistics-on-manifolds constructions and reduction-through-projection techniques to solve inverse problems in linear elasticity.

97 MATHEMATICS AND COMPUTING↗

Gradient-based optimization of 3D MHD equilibria

Using recently developed adjoint methods for computing the shape derivatives of functions that depend on magnetohydrodynamic (MHD) equilibria (Antonsen et al. , J. Plasma Phys. , vol. 85, issue 2, 2019; Paul et al. , J. Plasma Phys. , vol. 86, issue 1, 2020), we present the first example of analytic gradient-based optimization of fixed-boundary stellarator equilibria. We take advantage of gradient information to optimize figures of merit of relevance for stellarator design, including the rotational transform, magnetic well and quasi-symmetry near the axis. With the application of the adjoint method, we reduce the number of equilibrium evaluations by the dimension of the optimization space ( ${\sim }50\text {--}500$ ) in comparison with a finite-difference gradient-based method. We discuss regularization objectives of relevance for fixed-boundary optimization, including a novel method that prevents self-intersection of the plasma boundary. We present several optimized equilibria, including a vacuum field with very low magnetic shear throughout the volume.

Physics↗

Efficient Stochastic Inversion Using Adjoint Models and Kernel-PCA

Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even when gradient information can be computed efficiently. Moreover, the ‘nonlinear’ mapping from parameters to observables generally gives rise to non-Gaussian posteriors even with Gaussian priors, thus hampering the use of efficient inversion algorithms designed for models with Gaussian assumptions. In this paper, we propose a novel Bayesian stochastic inversion methodology, which is characterized by a tight coupling between the gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel principal component analysis (KPCA). This approach addresses the ‘curse-of-dimensionality’ via KPCA to identify a low-dimensional feature space within the high-dimensional and nonlinearly correlated parameter space. In addition, non-Gaussian posterior distributions are estimated via an efficient LMCMC method on the projected low-dimensional feature space. We will demonstrate this computational framework by integrating and adapting our recent data-driven statistics-on-manifolds constructions and reduction-through-projection techniques to a linear elasticity model.

42 ENGINEERING↗

Dataset from: "Adjoint methods for quasisymmetry of vacuum fields on a surface"

Adjoint methods can speed up stellarator optimisation by providing gradient information more efficiently compared to finite-difference evaluations. Adjoint methods are herein applied to vacuum magnetic fields, with objective functions targeting quasisymmetry and a rotational transform value on a surface. To measure quasisymmetry, a novel way of evaluating approximate flux coordinates on a single flux surface without the assumption of a neighbourhood of flux surfaces is proposed. The shape gradients obtained from the adjoint formalism are evaluated numerically and verified against finite-difference evaluations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Efficient wind farm layout optimization with the FLOWERS AEP model and analytic gradients

Wind farm layout optimization (WFLO) studies often aim to maximize the annual energy production (AEP) of a wind farm by choosing an arrangement of turbines that minimizes wake interactions. One way to reduce the cost of WFLO studies is by using more computationally efficient AEP models. The cost of standard AEP modeling approaches, based on the numerical integration of low-fidelity engineering wake models, scales poorly with the number of simulated discrete wind conditions. A second way to reduce cost when using a gradient-based algorithm is to supply exact gradient information instead of finite-difference estimates. However, analytical functions for the derivatives of AEP with respect to turbine positions are not always available in the conventional modeling approach. FLOWERS is a computationally inexpensive, analytical model for wind farm AEP that is specifically developed for WFLO applications. In this paper, we analyze the performance of the FLOWERS AEP model with analytic gradients in a layout optimization study compared with a reference optimization framework across three wind farm case studies. We find that the FLOWERS-based approach reduces computation time by a factor of 50–4000 and improves optimal AEP by about 0.3% with less than half of the variability in AEP across instances with randomized initial conditions. We also find the optimal layouts to be insensitive to model parameter tuning, making FLOWERS-based layout optimization a streamlined, user-friendly approach.

17 WIND ENERGY↗

Adjoint methods for quasi-symmetry of vacuum fields on a surface

Adjoint methods can speed up stellarator optimisation by providing gradient information more efficiently compared with finite-difference evaluations. Adjoint methods are herein applied to vacuum magnetic fields, with objective functions targeting quasi-symmetry and a rotational transform value on a surface. Here to measure quasi-symmetry, a novel way of evaluating approximate flux coordinates on a single flux surface without the assumption of a neighbourhood of flux surfaces is proposed. The shape gradients obtained from the adjoint formalism are evaluated numerically and verified against finite-difference evaluations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Analysis of CDC Bioreactor Internal Thermal Measurements and Sample Coupon Temperatures

The Center for Disease Control and Prevention (CDC) bioreactor is an integral laboratory tool for the Environmental Control and Life Support Systems (ECLSS) biofilm formation and growth research program. Critical to this research is the need to adjust and maintain various surface temperatures of the coupons housed within the CDC Bioreactor. The purpose of this study was to provide quantitative temperature gradient information when the CDC Bioreactor was operating according to several process scenarios. Two primary process parameters were evaluated. For the first set of test parameters, the liquid level was maintained at 350 mL, with an inlet flowrate of 0.1 mL/min, 1 mL/min, 10 mL/min. The liquid was allowed to gravity drain out of the outlet spout. For the second set of test parameters, the liquid level within the reactor was maintained at 550 mL, with an inlet flow of 0.1 mL/min, 1 mL/min, 10 mL/min and draining intermittently controlled to 0.8 mL/min to maintain the 550 mL level. Due to the placement of the thermocouple in the reactor, a difference in temperature occurred between the coupon surfaces and target Bioreactor temperature when operated according to the first set of test parameters. When the reactor was operated according to the second set of parameters, which resulted in the thermocouple being submerged, the temperature gradient was eliminated. The results demonstrated minimal temperature gradient between the top and bottom coupon surfaces for coupons placed in a single rod within the CDC Bioreactor for both sets of test parameters evaluated. The collection of this information helped to explain previous ECLSS biofilm formation test runs, along with providing guidance on best operating practices for future ECLSS experiments. The placement of the thermocouple also helps to explain the challenge of achieving and maintaining bulk liquid temperatures when biofilm is grown according to the standardized test methods.

CDC Bioreactor↗

Analysis of CDC Bioreactor Internal Thermal Measurements and Sample Coupon Temperatures

The CDC Biofilm Reactor is an integral laboratory tool for the Environmental Control and Life Support Systems (ECLSS) biofilm formation and growth research program. Critical to this research is the need to adjust and maintain various surface temperatures of the coupons housed within the CDC Biofilm Reactor. The purpose of this study was to provide quantitative temperature gradient information when the CDC Biofilm Reactor was operating according to several process scenarios. Two primary process parameters were evaluated. For the first set of test parameters, the liquid level was maintained at 350 mL, with an inlet flowrate of 0.1 mL/min, 1 mL/min, 10 mL/min. The liquid was allowed to gravity drain out of the outlet spout. For the second set of test parameters, the liquid level within the reactor was maintained at 550 mL, with an inlet flow of 0.1 mL/min, 1 mL/min, 10 mL/min and draining intermittently controlled to 0.8 mL/min to maintain the 550 mL level. Due to the placement of the thermocouple in the reactor, a difference in temperature occurred between the coupon surfaces and target biofilm reactor temperature when operated according to the first set of test parameters. When the reactor was operated according to the second set of parameters, which resulted in the thermocouple being submerged, the temperature gradient was eliminated. The results demonstrated minimal temperature gradient between the top and bottom coupon surfaces for coupons placed in a single rod within the CDC Biofilm Reactor for both sets of test parameters evaluated. The collection of this information helped to explain previous ECLSS biofilm formation test runs, along with providing guidance on best operating practices for future ECLSS experiments. The placement of the thermocouple also helps to explain the challenge of achieving and maintaining bulk liquid temperatures when biofilm is grown according to the standardized test methods.

CDC Bioreactor↗

Multidisciplinary design optimization using genetic algorithms

Multidisciplinary design optimization (MDO) is an important step in the conceptual design and evaluation of launch vehicles since it can have a significant impact on performance and life cycle cost. The objective is to search the system design space to determine values of design variables that optimize the performance characteristic subject to system constraints. Gradient-based optimization routines have been used extensively for aerospace design optimization. However, one limitation of gradient based optimizers is their need for gradient information. Therefore, design problems which include discrete variables can not be studied. Such problems are common in launch vehicle design. For example, the number of engines and material choices must be integer values or assume only a few discrete values. In this study, genetic algorithms are investigated as an approach to MDO problems involving discrete variables and discontinuous domains. Optimization by genetic algorithms (GA) uses a search procedure which is fundamentally different from those gradient based methods. Genetic algorithms seek to find good solutions in an efficient and timely manner rather than finding the best solution. GA are designed to mimic evolutionary selection. A population of candidate designs is evaluated at each iteration, and each individual's probability of reproduction (existence in the next generation) depends on its fitness value (related to the value of the objective function). Progress toward the optimum is achieved by the crossover and mutation operations. GA is attractive since it uses only objective function values in the search process, so gradient calculations are avoided. Hence, GA are able to deal with discrete variables. Studies report success in the use of GA for aircraft design optimization studies, trajectory analysis, space structure design and control systems design. In these studies reliable convergence was achieved, but the number of function evaluations was large compared with efficient gradient methods. Applicaiton of GA is underway for a cost optimization study for a launch-vehicle fuel-tank and structural design of a wing. The strengths and limitations of GA for launch vehicle design optimization is studied.

Unal, Resit↗