SEARCH · Engineering Papers

Results for “Convex approximation”

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 127 records · Page 7

All sources NASA NTRS DOE OSTI

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 ↗

DOE OSTI2021

Solving the Dynamics-Aware Economic Dispatch Problem with the Koopman Operator

The dynamics-aware economic dispatch (DED) problem embeds low-level generator dynamics and operational constraints to enable near real-time scheduling of generation units in a power network. DED produces a more dynamic supervisory control policy than traditional economic dispatch (T-ED) that reduces overall generation costs. However, in contrast to T-ED, DED is a nonlinear, non-convex optimization problem that is computationally prohibitive to solve. We introduce a machine learning-based operator-theoretic approach for solving the DED problem efficiently. Specifically, we develop a novel discrete-time Koopman Operator (KO) formulation that embeds domain information into the structure of the KO to learn high-fidelity approximations of the generator dynamics. Using the KO approximation, the DED problem can be reformulated as a computationally tractable linear program (abbreviated DED-KO). We demonstrate the high solution quality and computational-time savings of the DED-KO model over the original DED formulation on a 9-bus test system.

King, Ethan↗

DOE OSTI2023

An adaptive moments-based interface reconstruction using intersection of the cell with one half-plane, two half-planes and a circle

We present a new adaptive moment-of-fluid (A-MOF) interface reconstruction method. It uses the zeroth, first, and second moments of the fragment of material inside a cell of the mesh to construct a shape that approximates the respective material fragment. The new method requires information about the material moments only for the cell under consideration. The adaptive method chooses between shapes obtained by the intersection of the cell with one half-plane, two half-planes, or a circle. The A-MOF method allows to exactly reproduce several convex shapes: corners, filaments, and their concave cell-complements; as well as pieces of the circles and its cell-compliments. Interface reconstruction is formulated as a local (for each cell), non-linear, equality constrained optimization problem, which does not require additional communication and allows for an efficient parallel implementation. In conclusion, we present an extensive set of test problems, both for interface reconstruction on a single cell, and for reconstruction of a variety of shapes on the entire mesh.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

Assessing the Optimality of LinDist3Flow for Optimal Tap Selection of Step Voltage Regulators in Unbalanced Distribution Networks

The adoption of distributed energy resources such as photovoltaics (PVs) has increased dramatically during the previous decade. The increased penetration of PVs into distribution networks (DNs) can cause voltage fluctuations that have to be mitigated. One of the key utility assets employed to this end are step-voltage regulators (SVRs). It is desirable to include tap selection of SVRs in optimal power flow (OPF) routines, a task that turns out to be challenging because the resultant OPF problem is nonconvex with added complexities stemming from accurate SVR modeling. While several convex relaxations based on semi-definite programming (SDP) have been presented in the literature for optimal tap selection, SDP based schemes do not scale well and are challenging to implement in large-scale planning or operational frameworks. This paper deals with the optimal tap selection (OPTS) problem for wye-connected SVRs using linear approximations of power flow equations. Specifically, the LinDist3Flow model is adopted and the effective SVR ratio is assumed to be continuous- enabling the formulation of a problem called LinDist3Flow-OPTS, which amounts to a linear program. The scalability and optimality gap of LinDist3Flow-OPTS are evaluated with respect to existing SDP-based and nonlinear programming techniques for optimal tap selection in three standard feeders, namely, the IEEE 13-bus, 123-bus, and 8500-node DNs. For all DNs considered, LinDist3Flow-OPTS achieves an optimality gap of approximately 1% or less while significantly lowering the computational burden.

linear approximations↗

DOE OSTI2022

Assessing the Optimality of LinDist3Flow for Optimal Tap Selection of Step Voltage Regulators in Unbalanced Distribution Networks: Preprint

The adoption of distributed energy resources such as photovoltaics (PVs) has increased dramatically during the previous decade. The increased penetration of PVs into distribution networks (DNs) can cause voltage fluctuations that have to be mitigated. One of the key utility assets employed to this end are step-voltage regulators (SVRs). It is desirable to include tap selection of SVRs in optimal power flow (OPF) routines, a task that turns out to be challenging because the resultant OPF problem is nonconvex with added complexities stemming from accurate SVR modeling. While several convex relaxations based on semi-definite programming (SDP) have been presented in the literature for optimal tap selection, SDP based schemes do not scale well and are challenging to implement in large-scale planning or operational frameworks. This paper deals with the optimal tap selection (OPTS) problem for wye-connected SVRs using linear approximations of power flow equations. Specifically, the LinDist3Flow model is adopted and the effective SVR ratio is assumed to be continuous–enabling the formulation of a problem called LinDist3Flow-OPTS, which amounts to a linear program. The scalability and optimality gap of LinDist3Flow-OPTS are evaluated with respect to existing SDP-based and nonlinear programming techniques for optimal tap selection in three standard feeders, namely, the IEEE 13-bus, 123-bus, and 8500-node DNs. For all DNs considered, LinDist3Flow-OPTS achieves an optimality gap of approximately 1% or less while significantly lowering the computational burden.

linear approximations↗

DOE OSTI2020

Formulation and solution approach for calibrating activity-based travel demand model-system via microsimulation

This study addresses the problem of calibrating utility-maximizing nested logit activity-based travel demand model-systems. After estimation, it is common practice to use aggregate measurements to calibrate the estimated model-system’s parameters prior to their application in transportation planning, policy making, and operations. However, calibration of activity-based model-systems has received much less attention. Existing calibration approaches are myopic heuristics in the sense that they do not consider the fundamental inter-dependencies among choice-models and do not have a systematic way to adjust model parameters. Also, other purely simulation-based approaches do not perform well in large-scale applications. In this study, we focus on utility-maximizing nested logit activity-based model-systems and calibrating aggregate statistics such as activity shares, mode shares, time-dependent & mode-specific OD flows, and time-dependent & mode-specific sensor counts. We formulate the calibration problem as a simulation-based optimization problem and propose a stochastic gradient-based solution procedure to solve it. The solution procedure relies on microsimulation to calculate expectations of the aggregate statistics of interest to the calibration problem. Additionally, we derive approximate analytical expressions for the gradient of the objective function —that are evaluated through microsimulation on mini-batches of the population. The proposed solution procedure is sensitive to the fundamental structure of the activity-based model-system and is non-myopic in considering the dependencies across its model components. The formulated optimization problem is non-convex, highly nonlinear, and potentially has multiple-minima. Lastly, we show —through a real-world application— that the proposed solution procedure outperforms other state-of-the-art purely simulation-based optimization approaches in terms of computational efficiency, stability, and convergence. We also compare various gradient-based solution algorithms to determine the best algorithm to update the parameters. This work has the potential to facilitate wider and easier application of activity-based model-systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Stochastic Approximation for Multi-period Simulation Optimization with Streaming Input Data

We consider a continuous-valued simulation optimization (SO) problem, where a simulator is built to optimize an expected performance measure of a real-world system while parameters of the simulator are estimated from streaming data collected periodically from the system. At each period, a new batch of data is combined with the cumulative data and the parameters are re-estimated with higher precision. The system requires the decision variable to be selected in all periods. Therefore, it is sensible for the decision-maker to update the decision variable at each period by solving a more precise SO problem with the updated parameter estimate to reduce the performance loss with respect to the target system. We define this decision-making process as the multi-period SO problem and introduce a multi-period stochastic approximation (SA) framework that generates a sequence of solutions. Two algorithms are proposed: Re-start SA (ReSA) reinitializes the stepsize sequence in each period, whereas Warm-start SA (WaSA) carefully tunes the stepsizes, taking both fewer and shorter gradient-descent steps in later periods as parameter estimates become increasingly more precise. We show that under suitable strong convexity and regularity conditions, ReSA and WaSA achieve the best possible convergence rate in expected sub-optimality either when an unbiased or a simultaneous perturbation gradient estimator is employed, while WaSA accrues significantly lower computational cost as the number of periods increases. In addition, we present the regularized ReSA, which obviates the need to know the strong convexity constant and achieves the same convergence rate at the expense of additional computation.

Computer Science↗

NASA NTRS2002

Development of MLPG and LBIE Methods for Nonlinear Problems of Fracture

The truly meshless local Petrov-Galerkin (MLPG) method holds a great promise in solving boundary value problems, using a local symmetric weak form as a natural approach. In the present paper, in the context of MLPG and the meshless interpolation of a moving least squares (MLS) type, a method which uses primary and secondary nodes in the domain and on the global boundary is introduced, in order to improve the accuracy of solution. The secondary nodes can be placed at any location where one needs to obtain a better resolution. The sub-domains for the shape functions in the MLS approximation are defined only from the primary nodes, and the secondary nodes use the same sub-domains. The shape functions based on the MLS approximation, in an integration domain, have a single type of a rational function, which reduces the difficulty of numerical integration to evaluate the weak form. The present method is very useful in an adaptive calculation, because the secondary nodes can be easily added and/or moved without an additional mesh. The essential boundary conditions can be imposed exactly, and non-convex boundaries can be treated without special techniques. Several numerical examples are presented to illustrate the performance of the present method.

Atluri, Satya N.↗

DOE OSTI2025

A machine learning approach to quantify degradation of nuclear fuels and the effects of fission products

Nuclear fuel performance is critically dependent on understanding the evolution of fuel properties under operational conditions, a complex challenge driven by chemical changes and substantial radiation damage during fission. Traditionally, property evolution has been determined via empirical data collected following irradiation. However, these empirical correlations are limited in their applicability beyond the specific conditions in which they were obtained. This study explores a novel approach to address this challenge by applying materials informatics to develop a machine learning random forest (ML-RF) model that captures the effects of fission products on fuel compounds. The model predicts formation enthalpy (ΔH f ) by leveraging extensive quantum materials property data and correlating it with material descriptors such as composition, atomic and site features, and crystal lattice properties. This ML-RF model enables rapid interpolation across the compositional and structural spaces covered by the training data, thus supporting high-throughput screening and energetic ranking of candidate phases. The model demonstrates the ability to predict ΔH f with a mean absolute error (MAE) of approximately 0.1 to 0.2 eV/atom across a wide range of compounds, including key nuclear fuel systems (U-O, U-N, U-C, U-Si, and U-Mo). For example, it was used to assess shifts in stoichiometry for UO 2 (O/M) and UN (N/M) fuels, revealing their distinct tendencies in chemical potential variation and enabling preliminary convex hull analyses. Furthermore, the model provides insights into how individual fission products affect fuel properties. Results indicate that larger fission products (e.g., Nd, Pu, Ce) have a more pronounced impact on UO 2 , while lighter ones (e.g., Zr) strongly influence UN. Here, the model developed in this work can be used to support the Accelerated Fuel Qualification approach by facilitating preliminary evaluations prior to extensive materials modeling and experimentation. To this end, the trained model has been made available to the fuel community to support ongoing fuel development efforts.

Accelerated fuel qualification↗

DOE OSTI2023

Projective embedding of dynamical systems: Uniform mean field equations

Herein we study embeddings of continuous dynamical systems in larger dimensions via projector operators. We call this technique PEDS, projective embedding of dynamical systems, as the stable fixed point of the original system dynamics are recovered via projection from the higher dimensional space. In this paper we provide a general definition and prove that for a particular type of rank-1 projector operator, the uniform mean field projector, the equations of motion become a mean field approximation of the dynamical system. While in general the embedding depends on a specified variable ordering, the same is not true for the uniform mean field projector. We prove a variety of results on the relationship between the spectrum of the Jacobian for fixed points in the original and in the embedded system. Direct applications of PEDS can be non-convex optimization and machine learning.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1992

Data reduction using cubic rational B-splines

A geometric method is proposed for fitting rational cubic B-spline curves to data that represent smooth curves including intersection or silhouette lines. The algorithm is based on the convex hull and the variation diminishing properties of Bezier/B-spline curves. The algorithm has the following structure: it tries to fit one Bezier segment to the entire data set and if it is impossible it subdivides the data set and reconsiders the subset. After accepting the subset the algorithm tries to find the longest run of points within a tolerance and then approximates this set with a Bezier cubic segment. The algorithm uses this procedure repeatedly to the rest of the data points until all points are fitted. It is concluded that the algorithm delivers fitting curves which approximate the data with high accuracy even in cases with large tolerances.

Chou, Jin J.↗

DOE OSTI2024

A streamline coordinate analysis of a turbulent boundary layer subject to pressure gradients and curvature on the windward side of a bump

Direct numerical simulation (DNS) of a turbulent boundary layer over the Gaussian (Boeing) bump is performed. This boundary layer exhibits a series of adverse and favourable pressure gradients and convex and concave curvature effects before separating. These effects on turbulent boundary layers are characterised and compared with a lower-Reynolds-number flow over the same geometry. The momentum budgets are analysed in the streamline-aligned coordinate system upstream of the separation region. These momentum budgets allow the simplification of equations to facilitate an integral analysis. Integral-analysis-based approximations for Reynolds stresses in the inner and outer regions of the boundary layer are also formulated. The shear and wall-normal Reynolds stress profiles normalised by these approximations exhibit a better collapse compared with friction velocity and Zagarola–Smits normalisations in the strong favourable pressure gradient region and in the mild adverse pressure region that precedes it in this flow. Simplification of these Reynolds stress approximations along with results from the DNS are used to obtain semi-empirical approximations that are able to provide stress closure in terms of wall solution fields for the turbulent boundary layer under consideration.

42 ENGINEERING↗

DOE OSTI2021

An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods

A framework is proposed for solving general convex quadratic programs (CQPs) from an infeasible starting point by invoking an existing feasible-start algorithm tailored for inequality-constrained CQPs. The central tool is an exact penalty function scheme equipped with a penalty-parameter updating rule. The feasible-start algorithm merely has to satisfy certain general requirements, and so is the updating rule. Under mild assumptions, the framework is proved to converge on CQPs with both inequality and equality constraints and, at a negligible additional cost per iteration, produces an infeasibility certificate, together with a feasible point for an (approximately) ℓ 1 -least relaxed feasible problem, when the given problem does not have a feasible solution. The framework is applied to a feasible-start constraint-reduced interior-point algorithm previously proved to be highly performant on problems with many more inequality constraints than variables (“imbalanced”). Numerical comparison with popular codes (OSQP, qpOASES, MOSEK) is reported on both randomly generated problems and support-vector machine classifier training problems. The results show that the former typically outperforms the latter on imbalanced problems. Finally, application of the proposed infeasible-start framework to other feasible-start algorithms is briefly considered, and is tested on a simplex iteration.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Real-time dispatch optimization for concentrating solar power with thermal energy storage

Concentrating solar power (CSP) plants present a promising path towards utility-scale renewable energy. The power tower, or central receiver, configuration can achieve higher operating temperatures than other forms of CSP, and, like all forms of CSP, naturally pairs with comparatively inexpensive thermal energy storage, which allows CSP plants to dispatch electricity according to market price incentives and outside the hours of solar resource availability. Currently, CSP plants commonly include a steam Rankine power cycle and several heat exchange components to generate high-pressure steam using stored thermal energy. The efficiency of the steam Rankine cycle depends on the temperature of the plant's operating fluid, and so is a main concern of plant operators. However, the variable nature of the solar resource and the conservatism with which the receiver is operated prevent perfect control over the receiver outlet temperature. Therefore, during periods of solar variability, collection occurs at lower-than-design temperature. To support operator decisions in a real-time setting, we develop a revenue-maximizing non-convex mixed-integer, quadradically-constrained program which determines a dispatch schedule with sub-hourly time fidelity and considers temperature-dependent power cycle efficiency. The exact nonlinear formulation proves intractable for real-time decision support. Here we present exact and inexact techniques to improve problem tractability that include a hybrid nonlinear and linear formulation. Our approach admits solutions within approximately 3% of optimality, on average, within a five-minute time limit, demonstrating its usability for decision support in a real-time setting.

14 SOLAR ENERGY↗

DOE OSTI2020

The second-generation Shifted Boundary Method and its numerical analysis

Recently, the Shifted Boundary Method (SBM) was proposed within the class of unfitted (or immersed, or embedded) finite element methods. By reformulating the original boundary value problem over a surrogate (approximate) computational domain, the SBM avoids integration over cut cells and the associated problematic issues regarding numerical stability and matrix conditioning. Accuracy is maintained by modifying the original boundary conditions using Taylor expansions. Hence the name of the method, that shifts the location and values of the boundary conditions. In this article, we present enhanced variational SBM formulations for the Poisson and Stokes problems with improved flexibility and robustness. These simplified variational forms allow to relax some of the assumptions required by the mathematical proofs of stability and convergence of earlier implementations. First, we show that these new SBM implementations can be proved asymptotically stable and convergent even without the rather restrictive assumption that the inner product between the normals to the true and surrogate boundaries is positive. Second, we show that it is not necessary to introduce a stabilization term involving the tangential derivatives of the solution at Dirichlet boundaries, therefore avoiding the calibration of an additional stabilization parameter. Finally, we prove enhanced L 2 -estimates without the cumbersome assumption – of earlier proofs – that the surrogate domain is convex. Instead we rely on a conventional assumption that the boundary of the true domain is smooth, which can also be replaced by requiring convexity of the true domain. The aforementioned improvements open the way to a more general and efficient implementation of the Shifted Boundary Method, particularly in complex three-dimensional geometries. We complement these theoretical developments with numerical experiments in two and three dimensions.

42 ENGINEERING↗

NASA NTRS1993

Emplacement of multiple flow units on very shallow slopes, east Kawelu Planitia flow field, Venus

Lobate flows with variable radar brightness occur at several locations on Venus. Here we present preliminary mapping results for a lava flow field on the eastern side of Kawelu Planitia, centered at approximately 41 deg N, 251 deg E. Numerous individual flows of varying brightness can be traced for up to 400 km at this location. Megallan image F-MIDRP.40N251;1 contains two major flow complexes as well as a distinct minor flow field associated with a volcanic dome. The southern flow field (unit F) changes from radar dark to radar bright in a convex arc from west to east. The flow path is diverted by a ridge system (unit B) and associated N-S faulted zone (unit A) evident in the Magellan altimetry data. The 130-km-long radar-bright flow field located at 41.5 deg N and 249-250 deg E is comprised of a narrow, channeled flow (unit E) overlying an intermediate brightness flow (unit D), all of which appears to emanate from a solitary dome at 249 deg E. The southern lobe of unit E disappears under a broad leveed channel (41.3 deg N, 250.1 deg E) in unit 5, only to reappear south of the unit 5 boundary. The source of this largest flow field is not evident, but could be associated with the region of small domes west of the F-MIDRP image (centered at 41 deg N, 246 deg E). Another possible source is the fractured area south of unit C. The flow complex is clearly a conglomeration of many flow episodes, not necessarily from a single source.

Helgerud, Michael B.↗

DOE OSTI2020

Dynamic clay microstructures emerge via ion complexation waves

Clays control carbon, water and nutrient transport in the lithosphere, promote cloud formation5 and lubricate fault slip through interactions among hydrated mineral interfaces. Clay mineral properties are difficult to model because their structures are disordered, curved and dynamic. Consequently, interactions at the clay mineral-aqueous interface have been approximated using electric double layer models based on single crystals of mica and atomistic simulations. We discover that waves of complexation dipoles at dynamically curving interfaces create an emergent long-range force that drives exfoliation and restacking over time- and length-scales that are not captured in existing models. Curvature delocalizes electrostatic interactions in ways that fundamentally differ from planar surfaces, altering the ratio of ions bound to the convex and concave sides of a layer. Multiple-scattering reconstruction of low-dose energy-filtered cryo electron tomography enabled direct imaging of ion complexes and electrolyte distributions at hydrated and curved mineral interfaces with {\aa}ngstrom resolution over micron length scales. Layers exfoliate and restack abruptly and repeatedly over timescales that depend strongly on the counterion identity, demonstrating that the strong coupling between elastic, electrostatic and hydration forces in clays promote collective reorganization previously thought to be a feature only of active matter.

Whittaker, Michael L↗

NASA NTRS1985

Numerical Estimation of the Curvature of Biological Surfaces

Many biological systems may profitably be studied as surface phenomena. A model consisting of isotropic growth of a curved surface from a flat sheet is assumed. With such a model, the Gaussian curvature of the final surface determines whether growth rate of the surface is subharmonic or superharmonic. These properties correspond to notions of convexity and concavity, and thus to local excess growth and local deficiency of growth. In biological models where the major factors controlling surface growth are intrinsic to the surface, researchers thus gained from geometrical study information on the differential growth undergone by the surface. These ideas were applied to an analysis of the folding of the cerebral cortex, a geometrically rather complex surface growth. A numerical surface curvature technique based on an approximation to the Dupin indicatrix of the surface was developed. A metric for comparing curvature estimates is introduced, and considerable numerical testing indicated the reliability of this technique.

Todd, P. H.↗