Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Point Optimization”

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

11-th order of accuracy for numerical solution of 3-D Poisson equation with irregular interfaces on unfitted Cartesian meshes

For the first time the optimal local truncation error method (OLTEM) with 125-point stencils and unfitted Cartesian meshes has been developed in the general 3-D case for the Poisson equation for heterogeneous materials with smooth irregular interfaces. The 125-point stencils equations that are similar to those for quadratic finite elements are used for OLTEM. The interface conditions for OLTEM are imposed as constraints at a small number of interface points and do not require the introduction of additional unknowns, i.e., the sparse structure of global discrete equations of OLTEM is the same for homogeneous and heterogeneous materials. The stencils coefficients of OLTEM are calculated by the minimization of the local truncation error of the stencil equations. These derivations include the use of the Poisson equation for the relationship between the different spatial derivatives. Such a procedure provides the maximum possible accuracy of the discrete equations of OLTEM. In contrast to known numerical techniques with quadratic elements and third order of accuracy on conforming and unfitted meshes, OLTEM with the 125-point stencils provides 11-th order of accuracy, i.e., an extremely large increase in accuracy by 8 orders for similar stencils. The numerical results show that OLTEM yields much more accurate results than high-order finite elements with much wider stencils. The increased numerical accuracy of OLTEM leads to an extremely large increase in computational efficiency. Additionally, a new post-processing procedure with the 125-point stencil has been developed for the calculation of the spatial derivatives of the primary function. The post-processing procedure includes the minimization of the local truncation error and the use of the Poisson equation. It is demonstrated that the use of the partial differential equation (PDE) for the 125-point stencils improves the accuracy of the spatial derivatives by 6 orders compared to post-processing without the use of PDE as in existing numerical techniques. At an accuracy of 0.1% for the spatial derivatives, OLTEM reduces the number of degrees of freedom by 900 - 4∙10 6 times compared to quadratic finite elements. The developed post-processing procedure can be easily extended to unstructured meshes and can be independently used with existing post-processing techniques (e.g., with finite elements).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

POINT: Partially Observable Imitation Network for Traffic Signal Control

Smart traffic signals bring together transportation infrastructure and advance technologies to improve the mobility and efficiency of urban transportation network. Adaptive traffic signal control studies can be categorized into modeling-based approaches and learning-based approaches. In order to take advantages of these two systems, this study developed an offline-online combined Partial Observable Imitation Network for Traffic signal control (POINT). In the offline system, the traffic signal timing optimization problem was formulated as a Mixed Integer Nonlinear Programming (MINLP) given complete traffic information, i.e., second-by-second speeds and locations of all vehicles. Furthermore, the objective of MINLP is to minimize total travel delays considering individual vehicle trajectories under Connected Vehicle (CV) environment. The calculated optimal solutions under various traffic conditions were considered as the ”expert” decisions. In the online system, an imitation neural network model was developed to learn the ”expert” signal plans generated from offline system. Given partial observable traffic conditions in real time, e.g., the aggregate-level of traffic volume, the POINT model can compute the signal timing parameters in the online system. The numerical results demonstrated that the proposed method outperformed other state-of-the-art signal control method under high and unbalanced traffic demand levels in terms of reducing travel delays and queue length.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery↗
DOE OSTI2022

Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods

We explore novel approaches for solving nonlinear optimization problems with unrelaxable bound constraints, which must be satisfied before the objective function can be evaluated. Our method reformulates the unrelaxable bound-constrained problem as an unconstrained optimization problem that is amenable to existing unconstrained optimization methods. The reformulation relies on a domain warping to form a merit function; the choice of the warping determines the level of exactness with which the unconstrained problem can be used to find solutions to the bound-constrained problem, as well as key properties of the unconstrained formulation such as smoothness. We develop theory when the domain warping is a multioutput sigmoidal warping, and we explore the practical elements of applying unconstrained optimization methods to the formulation. Here, we develop an algorithm that exploits the structure of the sigmoidal warping to guarantee that unconstrained optimization algorithms applied to the merit function will find a stationary point to the desired tolerance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Thermal power plant upgrade via a rotating detonation combustor and retrofitted turbine with optimized endwalls

Over the past decade, pressure gain combustion research has promised over 10 percentage-points of increase in power plant thermal efficiency. Alas, to realize such potential gain, one must effectively couple the turbine with the detonation combustor, whose exhaust conditions differ substantially from current state of the art gas turbines. This paper presents a modeling approach that enables a superior thermodynamic cycle with a rotating detonation combustor and a retrofitted gas turbine by including a diffuser downstream of the combustor and by contouring the turbine endwall, while preserving the airfoil geometry. We propose a multi-step optimization strategy, parametrizing the endwall geometry with a few control points, without altering the airfoil geometry, and with the stage turbine efficiency as objective function. In a first step the turbine performance is assessed with steady inlet conditions by solving the steady three-dimensional Reynolds-Averaged Navier-Stokes equations. In a second step, the inlet conditions are unsteady, as predicted from a detonation combustor and a diffuser, and three-dimensional full unsteady simulations are performed with an unsteady Reynolds-Averaged Navier-Stokes solver. By altering the vane endwall, the steady optimization yielded an efficiency increase of 12% relative to the baseline, while the unsteady optimization resulted in 21% increase compared to the datum turbine. Finally, a full engine analysis demonstrated the superiority of pressure gain combustion which included a realistic thermodynamic cycle of the combustor, the diffuser and the optimized turbine components.

42 ENGINEERING↗
DOE OSTI2021

Spectral properties of three-dimensional Anderson model

The three-dimensional Anderson model represents a paradigmatic model to understand the Anderson localization transition. In this work we first review some key results obtained for this model in the past 50 years, and then study its properties from the perspective of modern numerical approaches. Our main focus is on the quantitative comparison between the level sensitivity statistics and the level statistics. While the former studies the sensitivity of Hamiltonian eigenlevels upon inserting a magnetic flux, the latter studies the properties of unperturbed eigenlevels. We define two versions of dimensionless conductance, the first corresponding to the width of the level curvature distribution relative to the mean level spacing, and the second corresponding to the ratio of the Heisenberg time and the Thouless time obtained from the spectral form factor. We show that both conductances look remarkably similar around the localization transition, in particular, they predict a nearly identical critical point consistent with other well-established measures of the transition. We then study some further properties of those quantities: for level curvatures, we discuss particular similarities and differences between the width of the level curvature distribution and the characteristic energy studied by Edwards and Thouless (1972) in their pioneering work, in which the hopping at one lattice edge is changed from periodic to antiperiodic boundary conditions. In the context of the spectral form factor, we show that at the critical point it enters a broad time-independent regime, in which its value is consistent with the level compressibility obtained from the level variance. Finally, we test the scaling solution of the average level spacing ratio in the crossover regime using the cost function minimization approach introduced recently in Šuntajs et al. (2020). The latter approach seeks for the optimal scaling solution in the vicinity of the crossing point, while at the same time it allows for the crossing point to drift due to finite-size corrections. We find that the extracted transition point and the scaling coefficient agree with those from the literature to high numerical accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Sequential linear integer programming for integer optimal control with total variation regularization

We propose a trust-region method that solves a sequence of linear integer programs to tackle integer optimal control problems regularized with a total variation penalty. The total variation penalty implies that the considered integer control problems admit minimizers. We introduce a local optimality concept for the problem, which arises from the infinite-dimensional perspective. In the case of a one-dimensional domain of the control function, we prove convergence of the iterates produced by our algorithm to points that satisfy first-order stationarity conditions for local optimality. We demonstrate the theoretical findings on a computational example.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

PyCDFT: A Python package for constrained density functional theory

In this paper, we present PyCDFT, a Python package to compute diabatic states using constrained density functional theory (CDFT). PyCDFT provides an object-oriented, customizable implementation of CDFT, and allows for both single-point self-consistent-field calculations and geometry optimizations. PyCDFT is designed to interface with existing density functional theory (DFT) codes to perform CDFT calculations where constraint potentials are added to the Kohn–Sham Hamiltonian. Here, we demonstrate the use of PyCDFT by performing calculations with a massively parallel first-principles molecular dynamics code, Qbox, and we benchmark its accuracy by computing the electronic coupling between diabatic states for a set of organic molecules. We show that PyCDFT yields results in agreement with existing implementations and is a robust and flexible package for performing CDFT calculations. The program is available at https://dx.doi.org/10.5281/zenodo.3821097.

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

Optimal electric-distribution-grid planning considering the demand-side flexibility of thermal building systems for a test case in Singapore

The planning of district-scale electric grids, i.e., distribution grids, has traditionally relied on finding the most cost-effective design such that they are able to supply the peak loads in a district. With the advent of electric demand side flexibility (DSF), there is the opportunity to reshape peak loads such that the investment cost of the electric grid decreases in exchange for a minor increase in the operation cost. This paper formulates an optimal planning approach for the electric grid at the district scale, which incorporates the DSF from thermal building systems, e.g., heating ventilation and air-conditioning (HVAC) systems. The problem is formulated as a mixed-integer linear program (MILP) and aims at minimizing the investment cost for the grid along with the operation cost of the flexible loads. This is subjected to the fixed electricity demand and thermal comfort constraints of building occupants. To this end, linear models for the thermal comfort in the buildings and the power flow in electric grid are considered. The approach is tested on a district planning test case based in Singapore, where the results show up to 30.9 % reductions in investment cost and up to 3.7 % reduction in total annualized cost. Urban planning authorities, developers and utility companies can all benefit from the presented approach to make optimized investment decisions. For building operators, the results point to the need of adopting their control systems for DSF.

Troitzsch, Sebastian↗
DOE OSTI2022

Forward and inverse modeling of fault transmissibility in subsurface flows

Characterizing physical properties of faults, such as their transmissibility, is crucial for performing predictive numerical simulation of subsurface flows, such as those encountered in petroleum engineering and remediation of subsurface contamination. Here, this paper provides a complete investigation of the inverse problem for fault transmissibility in subsurface flow models, under appropriate assumptions on fault structure. In particular, the following aspects are considered: 1) fault modeling and well-posedness of the forward problem; 2) finite element (FEM) discretizations of the forward problem and their rigorous a priori convergence analysis; 3) Well-posedness of the Bayesian inverse problem, FEM discretization of the infinite dimensional Bayesian inverse formulation, and its rigorous a priori analysis. Moreover, computation of the maximum a posteriori (MAP) point via fast inexact Newton-conjugate gradient optimization and a Laplace approximation of the Bayesian posterior are also presented. Numerical results illustrate the use of the proposed fault model in forward and inverse problems for subsurface flows in two dimensional domains with multiple faults.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

From electronic structure to model application of key reactions for gasoline/alcohol combustion: Hydrogen-atom abstraction by $CH_3O\dot{O}$ radicals

Hydrogen atom abstraction by methyl peroxy ($CH_3O\dot{O}$) radicals can play an important role in gasoline/ethanol interacting chemistry for fuels that produce high concentrations of methyl radicals. Detailed kinetic reactions for hydrogen atom abstraction by $CH_3O\dot{O}$ radicals from the components of FGF-LLNL (a gasoline surrogate) including cyclopentane, toluene, 1-hexene, n -heptane, and isooctane have been systematically studied in this work. Here, the M06-2X/6-311 ++ G(d,p) level of theory was used to obtain the optimized structure and vibrational frequency for all stationary points and the low-frequency torsional modes. The 1-D hindered rotor treatment for low-frequency torsional modes was treated at M06-2X/6-31G level of theory. The UCCSD(T)-F12a/cc-pVDZ-F12 and QCISD(T)/CBS level of theory were used to calculate single point energies for all species. High pressure limiting rate constants for all hydrogen atom abstraction channels were performed using conventional transition state theory with unsymmetric tunneling corrections. Individual rate constants are reported in the temperature range from 298.15 to 2000 K. Our computed results show that the abstraction of allylic hydrogen atoms from 1-hexene is the fastest at low temperatures. When the temperature increases, the hydrogen atom abstraction reaction channel at the primary alkyl site gradually becomes dominant. Thermodynamics properties for all stable species and high-pressure limiting rate constants for each reaction pathway obtained in this work were incorporated into the latest gasoline surrogate/ethanol model to investigate the influence of the rate constants calculated here on model predicted ignition delay times.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2023

Variational actor-critic algorithms,

We introduce a class of variational actor-critic algorithms based on a variational formulation over both the value function and the policy. The objective function of the variational formulation consists of two parts: one for maximizing the value function and the other for minimizing the Bellman residual. Besides the vanilla gradient descent with both the value function and the policy updates, we propose two variants, the clipping method and the flipping method, in order to speed up the convergence. We also prove that, when the prefactor of the Bellman residual is sufficiently large, the fixed point of the algorithm is close to the optimal policy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

TwoFold: Highly accurate structure and affinity prediction for protein-ligand complexes from sequences

We describe our development of ab initio protein-ligand binding pose prediction models based on transformers and binding affinity prediction models based on the neural tangent kernel (NTK). Folding both protein and ligand, the TwoFold models achieve efficient and quality predictions matching state-of-the-art implementations while additionally reconstructing protein structures. In conclusion, solving NTK models points to a new use case for highly optimized linear solver benchmarking codes on HPC.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

A Multistage Stochastic Transmission Expansion Algorithm for Wide-Area Planning under Uncertainty

The overall objective for this project was to develop and demonstrate a set of methods for solving the transmission investment problem for a large network considering many possible scenarios of future conditions and multiple decision points when investments can be made. Project sub-objectives achieved this goal through a succession of extending the methods to apply to problems with increasing complexity or additional features, including the number of decision points, whether generation and transmission are co-optimized, and whether AC or DC power flow is used. A transmission model was developed for the Western Electric Coordinating Council (WECC) region, the high-voltage transmission system that serves the western third of the continental U.S. Using a dataset provided by WECC and by researchers from John Hopkins University, we have validated and demonstrated the model and used it to compare the new method for solving multi-stage stochastic transmission planning to several state-of-the-art techniques. The project has resulted in several key outcomes and achievements: The covariance-based method for choosing a small set of hours to represent short-term variability has superior performance in terms of accuracy to existing methods, including K-means clustering and Importance Sampling; The combined partitioning method for long-term uncertainty with the nested clustering approach for choosing representative hours for each long-term group has superior accuracy for equivalent computational effort compared with existing methods; Using the partitioning/clustering method combined with Sample Average Approximation provides both statistical bounds on the quality of the solution and at the same time, a complete investment plan for all contingencies in the full uncertainty set; no existing methods can provide both at the same time; The method is demonstrated to work well for choosing both transmission and generation investments; A variant on the method allows for both scenario selection and simultaneous correction for the error from the DC power flow approximation to provide a tractable method for AC power flow-based transmission planning under uncertainty; The method applied to the WECC case study demonstrates the additional value to the system operator and the consumer of identifying flexible investment options in the near-term decisions. In particular, the case study exhibits significant option value in postponing some transmission additions that appear useful but in some long-term system states create new congestion problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Multi-mechanistic Strategies for Novel Solid Electrolytes with Superior Properties

Despite a wide range of solid electrolyte phases, most of them only exist at high temperatures. The challenge is to tailor the chemical compositions of solid electrolyte materials that yield high ionic conductivities and low activation energies at ambient temperature. This is crucial for the development of all-solid-state batteries that are both powerful and safe. Here, we report our recent works to meet this challenge by utilizing multiple mechanistic principles and clusters as the building blocks. We show that the atomic-level interactions that govern the fast-ion conduction can be optimized by incorporating polyanion dynamics, non-stoichiometry, point defects and strong ionic correlations. Specifically, two case studies of Li/Na solid electrolytes will be covered, including lithium solid electrolytes (SE) with record-high ionic conductivities at room temperature (over 100 mS/cm) and sodium SE with record-low activation energies (< 0.1 eV).

Fang, Hong↗
DOE OSTI2026

Single-Phase to Split-Phase Inverters with Advanced Grid Support Functions for Grid-Interactive Applications

This work presents a cost-effective single-phase to split-phase inverter with a reduced switch count, achieving grid interactive performance while maintaining operational efficiency. The proposed system integrates an Andronov-Hopf oscillator based secondary controller, which inherently embeds a nonlinear resistive droop architecture, ensuring rapid dynamic response. A Lyapunov energy function-based primary control enhances transient stability and regulation, while an internal model-based point of common coupling voltage estimation enables cost optimization without additional sensors. Equipped with advanced grid support functionalities, the inverter facilitates seamless distribution system operation with enhanced robustness. The effectiveness of the proposed architecture and control strategy is validated through MATLAB/Simulink and PLECS simulations, demonstrating its feasibility for high-performance grid-supportive applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Opportunities for Bright Beam Generation at the Argonne Wakefield Accelerator (AWA)

Bright electron beams have played a critical role in many recent advances in accelerator technology. Producing bright beams via photo-emission is ultimately limited by the mean transverse energy (MTE), which is determined by the photocathode. This paper discusses the opportunity to generate bright electron beams using an upgraded version of the Argonne Wakefield Accelerator (AWA) photo-injector. The focus of this study is to examine the optimal configurations of the AWA photo-injector to produce 100 pC with a ∼100 nm transverse emittance (corresponding to a 5D brightness B5≥1015 A·m−2). The numerical optimization of the AWA photo-injector operating point, including realistic electromagnetic field maps, is presented for the different types of photocathodes under consideration.

Frame, Emily↗
DOE OSTI2025

LUNA: LUT-Based Neural Architecture for Fast and Low-Cost Qubit Readout

Qubit readout is a critical operation in quantum computing systems, which maps the analog response of qubits into discrete classical states. Deep neural networks (DNNs) have recently emerged as a promising solution to improve readout accuracy . Prior hardware implementations of DNN-based readout are resource-intensive and suffer from high inference latency, limiting their practical use in low-latency decoding and quantum error correction (QEC) loops. This paper proposes LUNA, a fast and efficient superconducting qubit readout accelerator that combines low-cost integrator-based preprocessing with Look-Up Table (LUT) based neural networks for classification. The architecture uses simple integrators for dimensionality reduction with minimal hardware overhead, and employs LogicNets (DNNs synthesized into LUT logic) to drastically reduce resource usage while enabling ultra-low-latency inference. We integrate this with a differential evolution based exploration and optimization framework to identify high-quality design points. Our results show up to a 10.95x reduction in area and 30% lower latency with little to no loss in fidelity compared to the state-of-the-art. LUNA enables scalable, low-footprint, and high-speed qubit readout, supporting the development of larger and more reliable quantum computing systems.

Farooq, M. A. [Arizona State U., Tempe]↗