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 145 records · Page 8

Robust cosmological inference from non-linear scales with k -th nearest neighbour statistics

ABSTRACT We present the methodology for deriving accurate and reliable cosmological constraints from non-linear scales ($\lt 50\, h^{-1}$ Mpc) with k-th nearest neighbour (kNN) statistics. We detail our methods for choosing robust minimum scale cuts and validating galaxy–halo connection models. Using cross-validation, we identify the galaxy–halo model that ensures both good fits and unbiased predictions across diverse summary statistics. We demonstrate that we can model kNNs effectively down to transverse scales of $r_{\rm p}\sim 3\, h^{-1}$ Mpc and achieve precise and unbiased constraints on the matter density and clustering amplitude, leading to a 2 per cent constraint on σ8. Our simulation-based model pipeline is resilient to varied model systematics, spanning simulation codes, halo finding, and cosmology priors. We demonstrate the effectiveness of this approach through an application to the Beyond-2p mock challenge. We propose further explorations to test more complex galaxy–halo connection models and tackle potential observational systematics.

79 ASTRONOMY AND ASTROPHYSICS↗

Approximating a linear multiplicative objective in watershed management optimization

Implementing management practices in a cost-efficient manner is critical for regional efforts to reduce the amount of pollutants entering the Chesapeake Bay. We study the problem of selecting a subset of practices that minimizes pollutant load—subject to budgetary and environmental constraints—as simulated in a widely used regulatory watershed model. Mimicking the computation of pollutant load in the regulatory model, we formulate this problem as a continuous optimization model with a linear multiplicative objective function and linear constraints. To lay the groundwork for incorporating additional stakeholder requirements in the future, especially those that would require integer variables, we present and study a continuous linear optimization model that approximates the nonlinear model. The linear model, which requires an exponential number of variables, arises naturally as an alternative model for the same underlying physical process. We examine the theoretical behavior of these optimization models and investigate restrictions of the linear model to handle its large number of variables. Through extensive computational tests on real and randomly generated instances, we demonstrate that the linear model and its restrictions provide optimal solutions close to those of the nonlinear model in practice, despite poor approximation properties in the worst case. We conclude that the linear model—together with our approach to handling its large number of variables—provides a viable framework from which to extend the optimization model to better meet the needs of the Chesapeake Bay watershed management stakeholders.

54 ENVIRONMENTAL SCIENCES↗

On Expected Value Strong Controllability

The Probabilistic Simple Temporal Network (PSTN) generalizes Simple Temporal Networks with Uncertainty (STNUs) by introducing probability distributions over the timing of uncontrollable timepoints. PSTNs are controllable if there is a strategy to execute the controllable timepoints while bounding the risk of violating any constraint to a small value. If this risk bound can't be satisfied, PSTNs are not considered controllable. We introduce the Expected Value Probabilistic SimpleTemporal Network (EPSTN), which extends PSTNs by including a benefit to the satisfaction of temporal constraints. We study the problem of Expected Value Strong Controllability (EvSC) of EPSTNs, which seeks a schedule maximizing the expected value of satisfied constraints. We solve the EvSC problem by extending a previously developed linear program, combined with search over constraints to violate at execution time. We describe conditions under which the solution to this linear program is the maximum expected value schedule. We then show how to search for constraints to discard, using the linear program at the core of the search. While the general problem is shown to be exponential, we conclude by providing several methods to bound the complexity of search.

Planning↗

A survey of nonlinear robust optimization

Robust optimization (RO) has attracted great attention from the optimization community over the past decade. RO is dedicated to solving optimization problems subject to uncertainty: design constraints must be satisfied for all the values of the uncertain parameters within a given uncertainty set. Uncertainty sets may be modeled as deterministic sets (boxes, polyhedra, ellipsoids), in which case the RO problem may be reformulated via worst-case analysis, or as families of distributions. The challenge of RO is to reformulate or approximate robust constraints so that the uncertain optimization problem is transformed into a tractable deterministic optimization problem. Most reformulation methods assume linearity of the robust constraints or uncertainty sets of favorable shape, which represents only a fraction of real-world applications. This survey addresses nonlinear RO and includes problem formulations and applications, solution approaches, and available software with code samples.

97 MATHEMATICS AND COMPUTING↗

Structural Design With Stress and Buckling Constraints

DESAP 2 synthesizes linear-elastic structures under static loads. Objective is to find element sizes (cross-sectional areas, plate thicknesses, and the like) that minimize total structural weight without changing layout of structure. Weight is minimized for given layout subject to prescribed contstraints.

Kiusalaas, J.↗

Automatic planning concept - An analysis of optimum scheduling

Study considers resource costs, mission constraints, and experiment results as linear functions, insofar as possible, in an effort to develop optimum scheduling by the use of linear programming. It involves a mathematical approach in which a number of constraints are considered operative.

Rebelein, P. R.↗

Optimizing design and dispatch of a renewable energy system with combined heat and power

We embellish a mixed-integer program that prescribes a set of renewable energy, conventional generation, and storage technologies to procure, along with a corresponding dispatch strategy. Specifically, we add combined heat and power to this set. The model minimizes fixed and operational costs less incentives for the use of various technologies, subject to a series of component interoperability and system-wide constraints. The resulting mixed-integer linear program contains hundreds of thousands of variables and constraints. We demonstrate how to efficiently formulate and solve the corresponding instances such that we produce near-optimal solutions in minutes. A previous rendition of the model required hours of solution time for the same instances.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Structural optimization with dynamic behavior constraints

The minimum weight optimum design of damped linearly elastic structural systems subjected to periodic loading with behavior constraints on maximum deflections and side constraints on design variables is addressed. Attention is focused on the two major impediments to an optimal solution: (1) the time parametric nature of the behavior constraints; and (2) the severe nonconvexity of the design space. A solution method based on upper bound approximations for the behavior constraints and an innovative mathematical programming scheme for seeking the optimal frequency subspace is set forth. Numerical results for several test problems illustrate the effectiveness of the method reported.

Mills-Curran, W. C.↗

A Comparative Study of Randomized Constraint Solvers for Random-Symbolic Testing

The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compare the effectiveness of a symbolic solver (CVC3), a random solver, three hybrid solvers (i.e., mix of random and symbolic), and two heuristic search solvers. We evaluate the solvers on two benchmarks: one consisting of manually generated constraints and another generated with a concolic execution of 8 subjects. In addition to fully decidable constraints, the benchmarks include constraints with non-linear integer arithmetic, integer modulo and division, bitwise arithmetic, and floating-point arithmetic. As expected symbolic solving (in particular, CVC3) subsumes the other solvers for the concolic execution of subjects that only generate decidable constraints. For the remaining subjects the solvers are complementary.

Takaki, Mitsuo↗

Recovery Simulator and Analysis Formulation: Mathematical Framework for Enhanced Resilience and Resource Allocation

This report introduces recovery simulator and analysis (RSA), a framework aimed at enhancing the resilience of electrical grids post-disruption. The RSA model leverages an optimization problem formulation that focuses on maximizing the load served (or optionally customers served) through a coordinated and cooptimized recovery of non-black start generation, transmission lines, feeders and substations subject to labor budget constraints. By integrating advanced linear programming techniques, the simulator selects efficient reocovery pathways, optimizing both short-term and long-term grid recovery strategies. The mathematical framework guides decision-making through a comprehensive evaluation of potential recovery actions, factoring in the trade-offs between labor constraints and load (or optionally customer) restoration efficacy. This enables grid operators to simulate diverse outage scenarios and delineate optimal recovery pathways, thereby prioritizing critical repair tasks and ensuring resource allocation is both economical and effective. The intended use case of RSA is to allow planners to explore many recovery scenarios quickly and determine assets most critical across a wide range of scenarios, and therefore strong candidates for hardening or additional investment. RSA might also be used in an operational setting, following a single event, for exploring efficient recovery pathways.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Effects of geometric nonlinearities on the response of optimized box beam structures

The present minimum-mass designs for a two-spar rectangular box beam were derived on the basis of linear-buckling FEM analysis constraints. In order to ascertain the effects of any geometric nonlinearities on these designs, each was subjected to a geometrically nonlinear FEM analysis. In all cases, the structure collapses below the design load, and does so in a mode which differs from that of linear theory. This discrepancy is attributable to such nonlinear panel-interaction mechanisms as rib-crusing loads. The optimized design is highly sensitive to crushing loads, relative to the nonoptimal design.

Ragon, S.↗

Linear Approximation to Optimal Control Allocation for Rocket Nozzles with Elliptical Constraints

In this paper we present a straightforward technique for assessing and realizing the maximum control moment effectiveness for a launch vehicle with multiple constrained rocket nozzles, where elliptical deflection limits in gimbal axes are expressed as an ensemble of independent quadratic constraints. A direct method of determining an approximating ellipsoid that inscribes the set of attainable angular accelerations is derived. In the case of a parameterized linear generalized inverse, the geometry of the attainable set is computationally expensive to obtain but can be approximated to a high degree of accuracy with the proposed method. A linear inverse can then be optimized to maximize the volume of the true attainable set by maximizing the volume of the approximating ellipsoid. The use of a linear inverse does not preclude the use of linear methods for stability analysis and control design, preferred in practice for assessing the stability characteristics of the inertial and servoelastic coupling appearing in large boosters. The present techniques are demonstrated via application to the control allocation scheme for a concept heavy-lift launch vehicle.

Orr, Jeb S.↗

Cosmological constraints from H ii starburst galaxy, quasar angular size, and other measurements

ABSTRACT We compare the constraints from two (2019 and 2021) compilations of H ii starburst galaxy (H iiG) data and test the model independence of quasar (QSO) angular size data using six spatially flat and non-flat cosmological models. We find that the new 2021 compilation of H iiG data generally provides tighter constraints and prefers lower values of cosmological parameters than those from the 2019 H iiG data. QSO data by themselves give relatively model-independent constraints on the characteristic linear size, lm, of the QSOs within the sample. We also use Hubble parameter [H(z)], baryon acoustic oscillation (BAO), Pantheon Type Ia supernova (SN Ia) apparent magnitude (SN-Pantheon), and DES-3 yr binned SN Ia apparent magnitude (SN-DES) measurements to perform joint analyses with H iiG and QSO angular size data, since their constraints are not mutually inconsistent within the six cosmological models we study. A joint analysis of H(z), BAO, SN-Pantheon, SN-DES, QSO, and the newest compilation of H iiG data provides almost model-independent summary estimates of the Hubble constant, $H_0=69.7\pm 1.2\ \rm {km\,s^{-1}\,Mpc^{-1}}$, the non-relativistic matter density parameter, $\Omega _{\rm m_0}=0.293\pm 0.021$, and lm = 10.93 ± 0.25 pc.

79 ASTRONOMY AND ASTROPHYSICS↗

A flexible gyro-fluid system of equations

Gyro-fluid equations are velocity space moments of the gyrokinetic equations. Special gyro-Landau-fluid closures have been developed that include the damping due to kinetic resonances by fitting to the collisionless local plasma response functions. This damping allows for accurate linear eigenmodes to be computed with a relatively low number of velocity space moments compared to the number of velocity quadrature points in gyrokinetic codes. However, none of the published gyro-Landau-fluid closure schemes considers the Onsager symmetries of the resulting quasi-linear fluxes as a constraint. Onsager symmetry guarantees that the matrix of diffusivities is positive definite, an important property for the numerical stability of a transport solver. A two-parameter real closure for improving the accuracy of low-resolution gyro-fluid equations, which preserves the Onsager symmetry and allows higher velocity space moments, is presented in this paper. The new linear gyro-fluid system (GFS) is used to extend the TGLF quasi-linear transport model so that it can compute the energy and momentum fluxes due to parallel magnetic fluctuations, completing the transport matrix. The GFS equations do not use a bounce average approximation. The GFS equations are fully electromagnetic with general flux surface magnetic geometry, pitch angle scattering for electron collisions, and subsonic equilibrium toroidal rotation. Using GFS eigenmodes in the quasi-linear TGLF model will be shown to yield a more accurate match to fluxes computed by CGYRO turbulence simulations. In conclusion, prospects for future applications of a quasi-linear theory to new plasma transport regimes and magnetic confinement devices in addition to tokamaks are opened by the flexibility of the GFS eigensolver.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Variations on the Davenport Gyroscope Calibration Algorithm

This paper presents a number of variations on the Davenport algorithm for in-flight gyroscope recalibration, or first order initial calibration, specifically tailored for use with a minimum of satellite telemetry data. Central to one of the techniques described is the use of onboard integration of gyroscope data together with a detailed model of scheduled satellite slew profiles. Methods are presented for determining adjustments to either parameters for the standard linear model (i.e., a drift rate bias vector and/or a scale factor/alignment transformation matrix) or individual gyroscope scale parameters, both linear and nonlinear, in cases where the alignments are well known. The results of applying the methods in an analysis of the temporal evolution and nonlinear response of the gyroscopes installed on the Hubble Space Telescope following its first servicing mission are discussed. The two effects, when working coherently, have been found to result in slew errors of almost 1 arcsecond per degree. Procedures for selecting optimal operational gyroscope parameters subject to the constraint of using a linear model are discussed.

Welter, G.↗

Emulating galaxy and peculiar velocity clustering on non-linear scales

We explore the potential of cross-correlating galaxies and peculiar velocities on non-linear scales to enhance cosmological constraints. Leveraging the ABACUSSUMMIT simulation suite and the halo occupation distribution (HOD) formalism, we trained emulator models to describe the non-linear clustering of galaxies and velocities in redshift space. Our analysis demonstrates that combining galaxy and peculiar velocity clustering provides tighter constraints on both HOD and cosmological parameters, particularly on σ8 and w0. We further applied our models to realistic mock catalogues, reproducing the expected density and peculiar velocity errors of type-Ia supernovae, Tully-Fisher and fundamental plane measurements for the combined ZTF and DESI measurements. While systematic biases arise in the HOD parameters, the cosmological constraints remain unbiased, yielding a 3.8% precision measurement on fσ 8 compared to 4.7% when using galaxy clustering alone. We demonstrate that while combining tracers with realistic velocity measurements still yields an improvement, the gains are diminished, highlighting the need for further efforts to reduce velocity measurement uncertainties and correct observational systematics on small scales.

79 ASTRONOMY AND ASTROPHYSICS↗

Explicit model predictive control through robust optimization

A strategy that calculates an explicit state feedback policy to regulate constrained uncertain discrete‐time uncertain linear systems is presented. We consider uncertain processes, affected by box‐bounded multiplicative uncertainty as well as bounded additive uncertainty with linear state and inputs constraints. The proposed method includes (i) the calculation of a terminal set constraint and (ii) the robust reformulation of state constraints in the prediction horizon. These features allow the derivation of the desired policy by solving a single multiparametric quadratic programming problem that guarantees feasible operation in the presence of uncertainty. Additionally, we employ variable and constraint elimination approaches to enhance the computational performance of the strategy. We demonstrate the steps and benefits of these developments with a numerical example and a chemical engineering case study.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Derivative-based SINDy (DSINDy): Addressing the challenge of discovering governing equations from noisy data

Recent advances in the field of data-driven dynamics allow for the discovery of ODE systems using state measurements. One approach, known as Sparse Identification of Nonlinear Dynamics (SINDy), assumes the dynamics are sparse within a predetermined basis in the states and finds the expansion coefficients through linear regression with sparsity constraints. This approach requires an accurate estimation of the state time derivatives, which is not necessarily possible in the high-noise regime without additional constraints. We present an approach called Derivative-based SINDy (DSINDy) that combines two novel methods to improve ODE recovery at high-noise levels. First, we denoise the state variables by applying a projection operator that leverages the assumed basis for the system dynamics. Second, we use a second order cone program (SOCP) to find the derivative and governing equations simultaneously. We derive theoretical results for the projection-based denoising step, which allow us to estimate the values of hyperparameters used in the SOCP formulation. This underlying theory helps limit the number of required user-specified parameters. Finally, we present results demonstrating that our approach leads to improved system recovery for the Van der Pol oscillator, the Duffing oscillator, the Rössler attractor, and the Lorenz 96 model.

97 MATHEMATICS AND COMPUTING↗