SEARCH · Engineering Papers

Results for “Convex functions”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 217 records · Page 12

All sources NASA NTRS DOE OSTI

DOE OSTI2020

HPC-enabled computation of demand models at scale

The purpose of this project is to examine the energy impact of urban-scale traffic for the Los Angeles Basin by developing and implementing a scalable traffic assignment model. An energy optimization function will be posed and when integrated into the optimization code for travel assignment it can be mathematically proven to converge. The energy optimization function can then be compared to the typical travel time optimization that is traditionally used in traffic assignment models. The analysis will begin with static traffic assignment models with the routing for all origin and destinations computed in parallel on high performance computing facilities. Convergence of the numerical methods rely on the solution of convex programs (or extensions of these). This step will mostly consist of demonstrating the ability to parallelize the Frank Wolfe algorithm on various platforms.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2020

HPC4Mobilty w/ UCB

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

NASA NTRS2014

Using Concurrent Cardiovascular Information to Augment Survival Time Data from Orthostatic Tilt Tests

Orthostatic Intolerance (OI) is the propensity to develop symptoms of fainting during upright standing. OI is associated with changes in heart rate, blood pressure and other measures of cardiac function. Problem: NASA astronauts have shown increased susceptibility to OI on return from space missions. Current methods for counteracting OI in astronauts include fluid loading and the use of compression garments. Multivariate trajectory spread is greater as OI increases. Pairwise comparisons at the same time within subjects allows incorporation of pass/fail outcomes. Path length, convex hull area, and covariance matrix determinant do well as statistics to summarize this spread Missing data problems Time series analysis need many more time points per OTT session treatment of trend? how incorporate survival information?

Feiveson, Alan H.↗

DOE OSTI2025

A method for bounding high-order finite element functions: Applications to mesh validity and bounds-preserving limiters

We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be used to locally bound any combination of these basis functions. This approach can be applied to any element/basis type at any approximation order, can provide local (i.e., subcell) extremum bounds to a desired level of accuracy, and can be evaluated efficiently on-the-fly in simulations. Furthermore, we show that this approach generally yields more accurate bounds in comparison to traditional methods based on convex hull properties (e.g., Bernstein polynomials). Furthermore, the efficacy of this technique is shown in applications such as mesh validity checks and optimization for high-order curved meshes, where positivity of the element Jacobian determinant can be ensured throughout the entire element, and continuously bounds-preserving limiters for hyperbolic systems, which can enforce maximum principle bounds across the entire solution polynomial.

Bounding box↗

DOE OSTI2020

Application of Koopman operator for model-based control of fracture propagation and proppant transport in hydraulic fracturing operation

This work explores the application of the recently developed Koopman operator approach for model identification and feedback control of a hydraulic fracturing process. Controlling fracture propagation and proppant transport with precision is a challenge due in large part to the difficulty of constructing approximate models that accurately capture the characteristic moving boundary and highly-coupled dynamics exhibited by the process. Koopman operator theory is particularly attractive here as it offers a way to explicitly construct linear representations for even highly nonlinear dynamics. The method is data-driven and relies on lifting the states to an infinite-dimensional space of functions called observables where the dynamics are governed by a linear Koopman operator. Here this work considers two problems: (a) fracture geometry control, and (b) proppant concentration control. In both cases, an approximate linear model of the corresponding dynamics is constructed and used to design a model predictive controller (MPC). The manuscript shows that in the case of highly nonlinear dynamics, as observed in the proppant concentration, use of canonical functions in the observable basis fails. In such cases, a priori system knowledge can be leveraged to choose the required basis. The numerical experiments demonstrate that the Koopman linear model shows excellent agreement with the real system and successfully achieves the desired target values maximizing the oil and gas productivity. Additionally, due to its linear structure, the Koopman models allow convex MPC formulations that avoid any issues associated with nonlinear optimization.

42 ENGINEERING↗

DOE OSTI2026

Machine-learning guided search for phonon-mediated superconductivity in boron and carbon compounds

We present a workflow that iteratively combines ab-initio calculations with a machine-learning (ML) guided search for superconducting compounds with both dynamical stability and instability from imaginary phonon modes, the latter of which have been largely overlooked in previous studies. Electron-phonon coupling (EPC) properties and critical temperature (T c ) of 417 boron, carbon, and borocarbide compounds have been calculated with density functional perturbation theory (DFPT) and isotropic Eliashberg approximation. Our study addresses T c convergence of Brillouin zone sampling with an ansatz test, stabilizing imaginary phonon modes for significant EPC contributions, and comparing the performance of two ML models, especially when including compounds of dynamical instability. We predict a few promising superconducting compounds with formation energy just above the ground state convex hull, such as Ca 5 B 3 N 6 (35 K), TaNbC 2 (28.4 K), Nb 3 B 3 C (16.4 K), Y 2 B 3 C 2 (4.0 K), Pd 3 CaB (7.0 K), MoRuB 2 (15.6 K), RuVB 2 (15.0 K), RuSc 3 C 4 (6.6 K) among others.

Nepal, Niraj K. [Ames Laboratory (AMES), Ames, IA ↗

NASA NTRS1991

Collision detection for spacecraft proximity operations

A new collision detection algorithm has been developed for use when two spacecraft are operating in the same vicinity. The two spacecraft are modeled as unions of convex polyhedra, where the resulting polyhedron many be either convex or nonconvex. The relative motion of the two spacecraft is assumed to be such that one vehicle is moving with constant linear and angular velocity with respect to the other. Contacts between the vertices, faces, and edges of the polyhedra representing the two spacecraft are shown to occur when the value of one or more of a set of functions is zero. The collision detection algorithm is then formulated as a search for the zeros (roots) of these functions. Special properties of the functions for the assumed relative trajectory are exploited to expedite the zero search. The new algorithm is the first algorithm that can solve the collision detection problem exactly for relative motion with constant angular velocity. This is a significant improvement over models of rotational motion used in previous collision detection algorithms.

Vaughan, Robin M.↗

DOE OSTI2022

Effect of disorder on thermodynamic instability of binary Rare-earth – Nickel – Palladium compounds

In this work, we have investigated the thermodynamic stability of disordered rare-earth phases SmX 2 and Sm 10 X 21 (X=Ni, Pd) using machine-learning based analytical descriptor and first-principles density functional theory methods. The absence of Laves phase compounds in R-Pd binary systems is a longstanding problem of rare earth science: even though Ni and Pd belong to the same group of the periodic table and have similar electronic structure, the Pd compound crystallizes in a monoclinic (C2/m) phase with 10:21 stoichiometry, i.e., Sm 10 Pd 21 , while the Ni compound adopts a cubic Laves phase (MgCu 2 ) structure. To understand this contrasting phase stability, we performed thermodynamic convex hull analysis of Sm x Ni 1-x and Sm x Pd 1-x binary systems, which is experimentally validated using powder X-ray diffraction (PXRD) analyzes of polycrystalline Sm(Ni x Pd 1-x ) 2 samples with x=0, 0.5, and 1. A detailed electronic-structure (band-structure, charge density, and Fermi-surface) analysis of the differences between SmNi 2 /SmPd 2 and Sm 10 Ni 21 /Sm 10 Pd 21 compounds provides the quantum mechanical origin of the unfavorable mixing of Pd with Ni in cubic Laves phase. We show that the stability of Sm-Pd in 10:21 stoichiometry arises from improved intra-/inter-layer 5d-4d bonding compared to the 1:2 stoichiometry. Our work emphasizes the importance of ab-initio methods and computationally inexpensive analytical descriptors for the detailed analysis of thermodynamic and electronic properties of hard-to-prepare rare-earth compounds.

36 MATERIALS SCIENCE↗

DOE OSTI2022

Cyber-Resilient Frequency Control of Power Grids with Energy Storage Systems

The integration of synchronous generators and energy storage systems operated through communication networks introduces new challenges and vulnerabilities to the electric grid, where cyber attacks can corrupt sensor measurements or control inputs and interrupt functions such as frequency regulation. This paper proposes a defense methodology for the design of resilient operating constraints imposed on each generation and storage unit in order to prevent any attack sequence from driving the system's frequency to unsafe conditions. The resilient operating constraints are found by using ellipsoidal approximations of the reachable set of the power system, leading to a convex optimization problem with linear matrix inequalities. Numerical results in a single-area power system with synchronous generation and energy storage demonstrate how the resilient constraints provide security guarantees against any type of attack affecting frequency measurements or controller setpoints.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1993

A Reynolds stress model for near-wall turbulence

The paper formulates a tensorially consistent near-wall second-order closure model. Redistributive terms in the Reynolds stress equations are modeled by an elliptic relaxation equation in order to represent strongly nonhomogeneous effects produced by the presence of walls; this replaces the quasi-homogeneous algebraic models that are usually employed, and avoids the need for ad hoc damping functions. The model is solved for channel flow and boundary layers with zero and adverse pressure gradients. Good predictions of Reynolds stress components, mean flow, skin friction, and displacement thickness are obtained in various comparisons to experimental and direct numerical simulation data. The model is also applied to a boundary layer flowing along a wall with a 90-deg, constant-radius, convex bend.

Durbin, P. A.↗

DOE OSTI2021

Distributed ADMM Using Private Blockchain for Power Flow Optimization in Distribution Network With Coupled and Mixed-Integer Constraints

The optimization problem for scheduling distributed energy resources (DERs) and battery energy storage systems (BESS) integrated with the power grid is important to minimize energy consumption from conventional sources in response to demand. Conventionally this optimization problem is solved in a centralized manner, limiting the size of the problem that can be solved and creating a high communication overhead because all the data is transferred to the central controller. These limitations are addressed by the proposed distributed consensus-based alternating direction method of multiplier (DC-ADMM) optimization algorithm, which decomposes the optimization problem into subproblems with private cost function and constraints. The distribution feeder is partitioned into low coupling subnetworks/regions, which solves the private subproblem locally and exchanges information with the neighboring regions to reach consensus. The relaxation strategy is employed for mixed-integer and coupled constraints introduced in the optimal power flow (OPF) problem by stationary and transportable BESS because DC-ADMM convergence is only guaranteed for strict convex problems. The information exchange and synchronization between subnetworks/regions are vital for distributed optimization. In this work, both of these aspects are addressed by the blockchain. The smart contract deployed on the blockchain network acts as a mediator for secure data exchange and synchronization in distributed computation. The blockchain-based distributed optimization problem’s effectiveness is tested for a 0.5-MW laboratory microgrid for one hour ahead and day-ahead for the IEEE 123-bus and EPRI J1 test feeders, and results are compared with a centralized solution.

25 ENERGY STORAGE↗

NASA NTRS1993

A UGO/EUTD Solution for the Scattering and Diffraction from Cubic Polynomial Strips

A uniform geometrical optics (UGO) and an extended uniform geometrical theory of diffraction (EUTD) solution is developed for the scattering and diffraction from perfectly conducting cubic polynomial strips. The new solution overcomes the difficulties of the classic GO/UTD solution near caustics and composite shadow boundaries. The approach for constructing the UGO/EUTD solution is based on a spatial domain physical optics (PO) radiation integral representation for the scattered field which is then reduced using a uniform asymptotic procedure. New uniform reflection, zero-curvature diffraction, and edge diffraction coefficients are derived and involve the ordinary and incomplete Airy integrals as canonical functions. Higher order effects such as double edge diffraction, edge-excited creeping waves, and whispering gallery modes are not examined in this work. The UGO/EUTD solution is very efficient and provides useful physical insight into the various scattering and diffraction processes. It is also universal in nature and can be used to effectively describe the scattered fields from flat, strictly concave or convex, and concave-convex boundaries containing edges. Its accuracy is confirmed via comparison with some reference moment method (MM) results.

Constantinides, Evagoras D.↗

NASA NTRS1986

Theoretical analysis of segmented Wolter/LSM X-ray telescope systems

The Segmented Wolter I/LSM X-ray Telescope, which consists of a Wolter I Telescope with a tilted, off-axis convex spherical Layered Synthetic Microstructure (LSM) optics placed near the primary focus to accommodate multiple off-axis detectors, has been analyzed. The Skylab ATM Experiment S056 Wolter I telescope and the Stanford/MSFC nested Wolter-Schwarzschild x-ray telescope have been considered as the primary optics. A ray trace analysis has been performed to calculate the RMS blur circle radius, point spread function (PSF), the meridional and sagittal line functions (LST), and the full width half maximum (PWHM) of the PSF to study the spatial resolution of the system. The effects on resolution of defocussing the image plane, tilting and decentrating of the multilayer (LSM) optics have also been investigated to give the mounting and alignment tolerances of the LSM optic. Comparison has been made between the performance of the segmented Wolter/LSM optical system and that of the Spectral Slicing X-ray Telescope (SSXRT) systems.

Shealy, D. L.↗

NASA NTRS1987

Collision detection for spacecraft proximity operations

Collision Detection for Spacecraft Proximity Operations This thesis describes the development of a new collision detection algorithm to be used when two spacecraft are operating in the same vicinity. The two spacecraft are modelled as unions of convex polyhedra, where the polyhedron resulting from the union may be either convex or nonconvex. The relative motion of the two spacecraft is assumed to be such that one vehicle is moving with constant linear and angular velocity with respect to the other. The algorithm determines if a collision is possible and, if so, predicts the time when the collision will take place. The theoretical basis for the new collision detection algorithm is the C-function formulation of the configuration space approach recently introduced by researchers in robotics. Three different types of C-functions are defined that model the contacts between the vertices, edges, and faces of the polyhedra representing the two spacecraft. These C-functions are used to formulate three "collision" conditions. The first of these conditions limits the points representing potential collisions to the zeros of the C-functions. The new algorithm is fundamentally a search for the smallest zero of any C-function that satisfies the second and third collision conditions. The C-functions are shown to be transcendental functions of time for the assumed trajectory of the moving spacecraft. The zeros of these functions cannot be expressed in dosed form. Therefore, numerical search procedures are developed to find aLl of the zeros of a C-function in specified bounded intervals of time. These bounded intervals of time are found by examining the second and third collision conditions. The capabilities of the new algorithm are demonstrated for several example cases. These include examples of collisions determined by zeros of each of the three different types of C-functions. In addition to predicting the time of first contact of the polyhedra, the algorithm identifies the features of the two polyhedra that are touching at this time. The new collision detection algorithm is the first such algorithm that is capable of solving the collision detection problem exactly for the case where the moving object has constant linear and angular velocities. This is a significant improvement on previous collision detection algorithms described in the literature. In particular, the ability to handle constant angular velocity represents a more realistic type of rotational motion than those which have been used in other algorithms.

Robin M Vaughan↗

NASA NTRS1988

Advances in dual algorithms and convex approximation methods

A new algorithm for solving the duals of separable convex optimization problems is presented. The algorithm is based on an active set strategy in conjunction with a variable metric method. This first order algorithm is more reliable than Newton's method used in DUAL-2 because it does not break down when the Hessian matrix becomes singular or nearly singular. A perturbation technique is introduced in order to remove the nondifferentiability of the dual function which arises when linear constraints are present in the approximate problem.

Smaoui, H.↗

DOE OSTI2020

A Nonlocal-Gradient Descent Method for Inverse Design in Nanophotonics

Local-gradient-based optimization approaches lack nonlocal exploration abilityrequired for escaping from local minima when searching non-convex landscapes.A directional Gaussian smoothing (DGS) approach was recently proposed in [29]and used to define a truly nonlocal gradient, referred to as the DGS gradient, inorder to enable nonlocal exploration in high-dimensional black-box optimization.Promising results show that replacing the traditional local gradient with the nonlocalDGS gradient can significantly improve the performance of gradient-based methodsin optimizing highly multi-modal loss functions. However, the current DGS methodis designed for unbounded and uncontrained optimization problems, making itinapplicable to real-world engineering optimization problems where the tuningparameters are often bounded and the loss function is usually constrained byphysical processes. In this work, we propose to extend to the DGS approachto the constrained inverse design framework in order to find better optima ofmulti-modal loss functions. A series of adaptive strategies for smoothing radiusand learning rate updating are developed to improve the computational efficiencyand robustness. Our methodology is demonstrated by an example of designing ananoscale wavelength demultiplexer, and shows superior performance compared tothe state-of-the-art approaches. By incorporating volume constraints, the optimizeddesign achieves an equivalently high performance but significantly reduces theamount of material usage.

Bi, Sirui↗

DOE OSTI2022

A Non-Cooperative Game-Based Distributed Beam Scheduling Framework for 5G Millimeter-Wave Cellular Networks

Here, this paper studies the problem of distributed beam scheduling for 5G millimeter-Wave (mm-Wave) cellular networks where base stations (BSs) belonging to different operators share the same spectrum without centralized coordination among them. Our goal is to design efficient distributed scheduling algorithms to maximize the network utility, which is a function of the achieved throughput by the user equipment (UEs), subject to the average and instantaneous power consumption constraints of the BSs. We propose a Media Access Control (MAC) and a power allocation/adaptation mechanism utilizing the Lyapunov stochastic optimization framework and non-cooperative games. In particular, we first decompose the original utility maximization problem into two sub-optimization problems for each time frame, which are a convex optimization problem and a non-convex optimization problem, respectively. By formulating the distributed scheduling problem as a non-cooperative game where each BS is a player attempting to optimize its own utility, we provide a distributed solution to the non-convex sub-optimization problem via finding the Nash Equilibrium (NE) of the game whose weights are determined optimally by the Lyapunov optimization framework. Finally, we conduct simulation under various network settings to show the effectiveness of the proposed game-based beam scheduling algorithm in comparison to that of several reference schemes.

42 ENGINEERING↗

NASA NTRSDate not supplied

Interval Predictor Models for Robust System Identification

This paper proposes a framework for the identification and uncertainty quantification of plant models according to multivariable data. The only restriction imposed upon such models is for their outputs to depend continuously on their parameters. An Interval Predictor Model (IPM) prescribes the parameters of a computational model as a path-connected set thereby making each predicted output an interval-valued function of its inputs. The formulation proposed seeks the parameter set for which the predicted outputs tightly enclose the data. This set, which is modeled as a semi-algebraic set of low-degree polynomials, enables the characterization of possibly strong parameter dependencies commonly found in practice. This uncertainty characterization makes the resulting plant model amenable to robust control approaches using polynomial optimization. Furthermore, we use non-convex scenario theory to assess the reliability of the resulting IPM. This assessment yields a distribution-free upper bound on the probability that future data will fall outside the predicted intervals.

interval↗