Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear constraints”

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

Semidefinite programming algorithm for the quantum mechanical bootstrap

Here, we present a semidefinite programming algorithm to find eigenvalues of Schrödinger operators within the bootstrap approach to quantum mechanics. The bootstrap approach involves two ingredients: a nonlinear set of constraints on the variables (expectation values of operators in an energy eigenstate), plus positivity constraints (unitarity) that need to be satisfied. By fixing the energy we linearize all the constraints and show that the feasibility problem can be presented as an optimization problem for the variables that are not fixed by the constraints and one additional slack variable that measures the failure of positivity. To illustrate the method we are able to obtain high-precision, sharp bounds on eigenenergies for arbitrary confining polynomial potentials in one dimension.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1979

Combined strength and aeroelastic wing synthesis via constraint approximation

A numerical optimization program using constraint approximations for preliminary sizing of wing structural design parameters to satisfy simultaneous strength and aeroelastic requirements is described. The effects of wing flexibility on loads and flutter are included. The iterative procedure approximates wing internal load distributions and flutter response in generating design constraints. Though a linear Taylor series approximation to the variation of flutter speed is made, constraints in general are formulated as nonlinear and solved in a minimum weight problem using a feasible directions search. The technique is demonstrated for the determination of the optimal ply orientations and for simultaneous sizing for strength and flutter with simple constraint approximations.

Mullen, J., Jr.↗
NASA NTRS1981

Structural design with stress and displacement constraints

DESAPI program synthesizes linear elastic structures under static loads. Its design objective is finding element sizes that minimize total weight without changing layout structure. Primary constraints are upper limits on stresses and displacements prescribed as yield and loacl instability criteria. Program is written in FORTRAN IV for batch execution and is implemented on IBM 360 computer.

Kiusalaas, J.↗
DOE OSTI2024

Cosmological Constraints from Combining Photometric Galaxy Surveys and Gravitational Wave Observatories

Spatial variations in survey properties due to selection effects generate substantial systematic errors in large-scale structure measurements in optical galaxy surveys on very large scales. On such scales, the statistical sensitivity of optical surveys is also limited by their finite sky coverage. By contrast, gravitational wave (GW) sources appear to be relatively free of these issues, provided the angular sensitivity of GW experiments can be accurately characterized. We quantify the expected cosmological information gain from combining the forecast LSST 3$\times$2pt analysis (combination of three 2-point correlations of galaxy density and weak lensing shear fields) with the large-scale auto-correlation of GW sources from proposed next-generation GW experiments. We find that in $\Lambda$CDM and $w$CDM models, there is no significant improvement in cosmological constraints from combining GW with LSST 3$\times$2pt over LSST alone, due to the large shot noise for the former; however, this combination does enable a $\sim6\%$ constraint on the linear galaxy bias of GW sources. More interestingly, the optical-GW data combination provides tight constraints on models with primordial non-Gaussianity (PNG), due to the predicted scale-dependent bias in PNG models on large scales. Assuming that the largest angular scales that LSST will probe are comparable to those in Stage III surveys ($\ell_{\rm min}\sim50$), the inclusion of next-generation GW measurements could improve constraints on the PNG parameter $f_{\rm NL}$ by up to a factor of $\simeq6.6$ compared to LSST alone, yielding $\sigma(f_{\rm NL})=8.5$. These results assume the expected capability of a network of Einstein Telescope-like GW observatories, with a detection rate of $10^6$ events/year. We investigate the sensitivity of our results to different assumptions about future GW detectors as well as different LSST analysis choices.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1982

A formulation of rotor-airframe coupling for design analysis of vibrations of helicopter airframes

A linear formulation of rotor airframe coupling intended for vibration analysis in airframe structural design is presented. The airframe is represented by a finite element analysis model; the rotor is represented by a general set of linear differential equations with periodic coefficients; and the connections between the rotor and airframe are specified through general linear equations of constraint. Coupling equations are applied to the rotor and airframe equations to produce one set of linear differential equations governing vibrations of the combined rotor airframe system. These equations are solved by the harmonic balance method for the system steady state vibrations. A feature of the solution process is the representation of the airframe in terms of forced responses calculated at the rotor harmonics of interest. A method based on matrix partitioning is worked out for quick recalculations of vibrations in design studies when only relatively few airframe members are varied. All relations are presented in forms suitable for direct computer implementation.

Kvaternik, R. G.↗
DOE OSTI2024

Constraining primordial non-Gaussianity from DESI quasar targets and Planck CMB lensing

We detect the cross-correlation between 2.7 million DESI quasar targets across 14,700 deg 2 (180 quasars deg -2 ) and Planck 2018 CMB lensing at ~30σ. We use the cross-correlation on very large scales to constrain local primordial non-Gaussianity via the scale dependence of quasar bias. The DESI quasar targets lie at an effective redshift of 1.51 and are separated into four imaging regions of varying depth and image quality. We select quasar targets from Legacy Survey DR9 imaging, apply additional flux and photometric redshift cuts to improve the purity and reduce the fraction of unclassified redshifts, and use early DESI spectroscopy of 194,000 quasar targets to determine their redshift distribution and stellar contamination fraction (2.6%). Due to significant excess large-scale power in the quasar autocorrelation, we apply weights to mitigate contamination from imaging systematics such as depth, extinction, and stellar density. We use realistic contaminated mocks to determine the greatest number of systematic modes that we can fit, before we are biased by overfitting and spuriously remove real power. We find that linear regression with one to seven imaging templates removed per region accurately recovers the input cross-power, f NL and linear bias. As in previous analyses, our fNL constraint depends on the linear primordial non-Gaussianity bias parameter, b Φ = 2(b - p)δ c assuming universality of the halo mass function. We measure f NL = -26 +45 -40 with p = 1.6 (f NL = -18 +29 -27 with p = 1.0), and find that this result is robust under several systematics tests. Future spectroscopic quasar cross-correlations with Planck lensing can tighten the f NL constraints by a factor of 2 if they can remove the excess power on large scales in the quasar auto power spectrum.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Connected Traffic Signal Coordination Optimization Framework through Network-Wide Adaptive Linear Quadratic Regulator–Based Control Strategy

Traffic congestion in metropolitan areas causes several significant challenges, such as longer travel times, decreased productivity, increased fuel consumption and vehicle emissions, and even severe injuries during crashes. Traffic signal control is a management approach to reduce traffic congestion and allocate the appropriate right of way for safety and mobility efficiency, both in temporal and spatial domains. Here, this study proposes a network-wide adaptive signal control coordination optimization framework based on the linear quadratic regulator algorithm. The traffic flow conditions driven by signal control inputs are formulated based on their network-wide state-space representation. After modeling traffic control regulation constraints, an adaptive linear quadratic regulator algorithm is designed to maximize the network-wide total throughput under the current conditions. Optimal signal control split time durations for multiple intersections in the network are derived by solving the algebraic Riccati equation. Furthermore, the recursive least square parameter estimation method is employed to quantify dynamic traffic condition changes. To verify the effectiveness of this proposed signal control framework, both simulation and real-world experimental tests are conducted for multiple intersections in downtown Chattanooga, Tennessee, United States. In preparation for real-world experimental tests, pipelines for real-time data processing implementation and historical traffic flow data analysis are conducted. The test results demonstrate that the proposed control framework achieves a decrease in travel time by up to 19.4%, total time spent (TTS) by up to 11.9%, and relative queue balance (RQB) by up to 15.6%. The research findings indicate that the proposed signal control framework can be generalized to handle large scale signal control optimization network-wide.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Multi-Energy Microgrid Planning Considering Heat Flow Dynamics

In this paper, we present a multi-energy microgrid optimal planning method, considering the intra-hour dynamics of the heating system as constraints of the energy dispatch, and consequently of the sizing of the Combined Heat and Power units. The fixed-mass flow rate method and finite difference technique are applied to linearize the dynamic constraints. Moreover, to determine the values of the mass flow rates, a critical scenario representing the slowest heat dynamic process is put forward. Finally, a realistic microgrid case study is presented to illustrate the effect of considering the heat flow dynamics in the overall solution.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1992

Symbolic discrete event system specification

Extending discrete event modeling formalisms to facilitate greater symbol manipulation capabilities is important to further their use in intelligent control and design of high autonomy systems. An extension to the DEVS formalism that facilitates symbolic expression of event times by extending the time base from the real numbers to the field of linear polynomials over the reals is defined. A simulation algorithm is developed to generate the branching trajectories resulting from the underlying nondeterminism. To efficiently manage symbolic constraints, a consistency checking algorithm for linear polynomial constraints based on feasibility checking algorithms borrowed from linear programming has been developed. The extended formalism offers a convenient means to conduct multiple, simultaneous explorations of model behaviors. Examples of application are given with concentration on fault model analysis.

Zeigler, Bernard P.↗
NASA NTRS1988

A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes

A lower bound on the minimum free Euclidean distance of trellis-coded modulation (TCM) is derived that guarantees the existence of good TCM codes of any complexity. The bound is used to compare trellis codes combined with phase-shift keying, pulse amplitude modulation, and quadrature amplitude-shift keying modulation. This random coding bound is the first lower bound on the free distance of trellis codes, is tighter than any upper bound for large constraint lengths, and predicts the asymptotic performance of TCM when the complexity of the code becomes large. The bound can be used with any code rate and any modulation scheme and shows that the free distance increases linearly with the constraint length for large values of the constraint length.

Rouanne, Marc↗
DOE OSTI2025

Preserving nonlinear constraints in variational flow filtering data assimilation

Data assimilation aims to estimate the states of a dynamical system by optimally combining sparse and noisy observations of the physical system with uncertain forecasts produced by a computational model. The states of many dynamical systems of interest obey nonlinear physical constraints, and the corresponding dynamics is confined to a certain sub-manifold of the state space. Standard data assimilation techniques applied to such systems yield posterior states lying outside the manifold, violating the physical constraints. This work focuses on particle flow filters which use stochastic differential equations to evolve state samples from a prior distribution to samples from an observation-informed posterior distribution. The variational Fokker-Planck (VFP)—a generic particle flow filtering framework—is extended to incorporate non-linear, equality state constraints in the analysis. To this end, two algorithmic approaches that modify the VFP stochastic differential equation are discussed: (i) VFPSTAB, to inexactly preserve constraints with the addition of a stabilizing drift term, and (ii) VFPDAE, to exactly preserve constraints by treating the VFP dynamics as a stochastic differential-algebraic equation (SDAE). Additionally, an implicit-explicit time integrator is developed to evolve the VFPDAE dynamics. The strength of the proposed approach for constraint preservation in data assimilation is demonstrated on three test problems: the double pendulum, Korteweg-de-Vries, and the incompressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Risk-Constrained Reinforcement Learning for Inverter-Dominated Power System Controls

Here, this paper develops a risk-aware controller for grid-forming inverters (GFMs) to minimize large frequency oscillations in GFM inverter-dominated power systems. To tackle the high variability from loads/renewables, we incorporate a mean-variance risk constraint into the classical linear quadratic regulator (LQR) formulation for this problem. The risk constraint aims to bound the time-averaged cost of state variability and thus can improve the worst-case performance for large disturbances. The resulting risk-constrained LQR problem is solved through the dual reformulation to a minimax problem, by using a reinforcement learning (RL) method termed as stochastic gradient-descent with max-oracle (SGDmax). In particular, the zero-order policy gradient (ZOPG) approach is used to simplify the gradient estimation using simulated system trajectories. Numerical tests conducted on the IEEE 68-bus system have validated the convergence of our proposed SGDmax for GFM model and corroborate the effectiveness of the risk constraint in improving the worst-case performance while reducing the variability of the overall control cost.

Frequency control↗
DOE OSTI2022

On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming

Interior point methods (IPMs) are a common approach for solving linear programs (LPs) with strong theoretical guarantees and solid empirical performance. The time complexity of these methods is dominated by the cost of solving a linear system of equations at each iteration. In common applications of linear programming, particularly in machine learning and scientific computing, the size of this linear system can become prohibitively large, requiring the use of iterative solvers, which provide an approximate solution to the linear system. However, approximately solving the linear system at each iteration of an IPM invalidates the theoretical guarantees of common IPM analyses. To remedy this, we theoretically and empirically analyze (slightly modified) predictor-corrector IPMs when using approximate linear solvers: our approach guarantees that, when certain conditions are satisfied, the number of IPM iterations does not increase and that the final solution remains feasible. We also provide practical instantiations of approximate linear solvers that satisfy these conditions for special classes of constraint matrices using randomized linear algebra.

Dexter, Gregory↗
DOE OSTI2024

Flattening of the EFT-hedron: supersymmetric positivity bounds and the search for string theory

We examine universal positivity constraints on 2 → 2 scattering in 4d planar N = 4 supersymmetric Yang-Mills theory with higher-derivative corrections. We present numerical evidence that the convex region of allowed Wilson coefficients (the “EFT-hedron”) flattens completely along about one-third of its dimensions when an increasing number of constraints on the spectral density from crossing-symmetry are included. Our analysis relies on the formulation of the positivity constraints as a linear optimization problem, which we implement using two numerical solvers, SDPB and CPLEX. Motivated by the flattening, we propose a novel partially resummed low-energy expansion of the 2 → 2 amplitude. As part of the analysis, we provide additional evidence in favor of the conjecture [1] that the Veneziano amplitude is the only amplitude compatible with both S-matrix bootstrap constraints and string monodromy.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1993

A comparison of two multi-variable integrator windup protection schemes

Two methods are examined for limit and integrator wind-up protection for multi-input, multi-output linear controllers subject to actuator constraints. The methods begin with an existing linear controller that satisfies the specifications for the nominal, small perturbation, linear model of the plant. The controllers are formulated to include an additional contribution to the state derivative calculations. The first method to be examined is the multi-variable version of the single-input, single-output, high gain, Conventional Anti-Windup (CAW) scheme. Except for the actuator limits, the CAW scheme is linear. The second scheme to be examined, denoted the Modified Anti-Windup (MAW) scheme, uses a scalar to modify the magnitude of the controller output vector while maintaining the vector direction. The calculation of the scalar modifier is a nonlinear function of the controller outputs and the actuator limits. In both cases the constrained actuator is tracked. These two integrator windup protection methods are demonstrated on a turbofan engine control system with five measurements, four control variables, and four actuators. The closed-loop responses of the two schemes are compared and contrasted during limit operation. The issue of maintaining the direction of the controller output vector using the Modified Anti-Windup scheme is discussed and the advantages and disadvantages of both of the IWP methods are presented.

Mattern, Duane↗
NASA NTRS2024

Intrastep, Stage-Value Predictors for Diagonally-Implicit Runge-Kutta Methods

To better identify the necessary attributes of good stage-value predictors (SVPs), numerous SVPs are designed for an existing: ESDIRK4(3)7L[2]SA [26] and a new: ESDIRK4(3)8L[2]SA scheme.1 Both are stifflyaccurate, stage-order two, explicit, singly-diagonally implicit Runge–Kutta (ESDIRK) schemes. Tradeoffs are studied in the parameter spaces enforcing the constraints on accuracy, linear stability, nonlinear stability and coefficient size to determine which objectives correlate with effective predictors. The SVPs are tested on three challenging external aerodynamics problems [107 − 108 degrees of freedom (DoFs)], each with a different level of stiffness. The problems include two 3D airfoils simulations and one canonical turbulence simulation. All simulations use the compressible Navier-Stokes equations (CNSE). An entropy stable spectral collocation formulation is used for discretizing the spatial terms in the equations. Simulations are performed at a wide variety of temporal error tolerances. Problems that are sufficiently stiff (e.g., lax temporal error tolerances) benefit from SVPs designed with second-order accuracy and stability properties: A-stability, and L-stability, rather than high accuracy constraints. Simulations with modest stiffness (e.g., strict error tolerances) are better suited for SVPs designed using high accuracy constraints. Designing SVPs with enhanced stability properties is tedious but worthwhile. Simulation times are reduced with optimal SVPs by as much as 100% on some stages, with combined stepwise improvements of between 50 − 100% for both methods. A comparative study is performed with the two aforementioned methods as well as four other ESDIRKs. The newly designed ESDIRK4(3)8L[2]SA with γ ≈ 1/10, proves to be the most efficient of the six tested ESDIRK schemes simulating the CNSE.

Diagonally-Implicit Runge-Kutta↗