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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Polymer Chain Diffusion in All-Polymer Nanocomposites: Confinement vs Chain Acceleration

All-polymer nanocomposites, in which soft, polymer-based nanoparticles are dispersed in the polymer matrix, have received great interest lately due to their potential use in a range of applications, including drug delivery and self-healing materials. However, the impact of this new class of nanoparticles on the dynamics of a linear polymer matrix in an all-polymer nanocomposite is still largely unknown. In this work, we report that the addition of polystyrene soft nanoparticles accelerates the diffusion of high molecular weight linear PS chains over a range of nanoparticle loadings. Our results show that at nanoparticle loadings below 1%, the diffusion of the linear matrix increases, presumably via a constraint release mechanism. At loadings above 1%, the increase in diffusion is mitigated by confinement effects of the nanoparticles. Thus, the response of these all-polymer nanocomposites is dominated by the balance of entropic confinement of the chain, which slows diffusion and a constraint release mechanism that speeds up the diffusion. However, the diffusion of the linear chain in the all-polymer nanocomposite is faster than that of the same chain in the melt at all loadings, diverging from the behavior of most nanocomposites with hard, impenetrable nanoparticles. Thus, the mechanism that accelerates the chain diffusion dominates in these systems. This behavior is unusual and fundamentally different than what has been reported for nanocomposites with hard inorganic nanoparticles, indicating that new perspectives are needed for these materials where the control of loading can either accelerate or decelerate the dynamics of the matrix in a distinctive manner.

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

Bayesian Optimization Framework for Imperfect Data or Models

Conventional Bayesian optimization methods implicitly assume that the data and model being optimized are “perfect.” This assumption leads to inaccurate posterior probability distribution functions (PDFs) when applied to “imperfect” data or models. The new Bayesian optimization framework presented in this report provides a way to parameterize the effect of imperfections usually encountered in a prior PDF of generalized data or a model on the posterior PDF. The effects of imperfections are parameterized by a set of constraints imposed on the posterior expectation values of deviations between the data and the model and on their covariance matrix elements. A particular set of values for these constraints conveys an evaluator’s best estimate of the effect of imperfections on the corresponding posterior expectation values. When a prior PDF of generalized data is assumed to be normal, an expression for a posterior PDF satisfying an arbitrary set of constraints is derived analytically for linear models. An analogous iterative algorithm is given for nonlinear models. The corresponding posterior PDF should be used to estimate any posterior expectation values in the presence of imperfections parameterized by that set of constraints. A posterior PDF of a conventional Bayesian optimization method is recovered analytically when all evaluator-specified constraints are set to zero (i.e., in the absence of any imperfections). The analytical expressions derived in this report for normal PDFs and linear models were verified numerically by a Metropolis–Hastings Monte Carlo method. The methods presented herein could be applied to any kind of data or models, including differential cross-section data or integral benchmark experiments.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

Interstellar circular polarization and the dielectric nature of dust grains

The implications of the observed relationship between the wavelength dependence of interstellar circular and linear polarization were reexamined. Mie theory calculations for grains with various optical constants demonstrate that any population of grains which matches the observed wavelength dependence of linear polarization also yields the correct cross-over wavelength of circular polarization. The coincidence of the peak wavelength of linear polarization and the cross-over of circular polarization is therefore independent of the optical constants of the grains and cannot be used as a critical constraint on grain properties. The observed relationship instead reflects a more fundamental connection between linear and circular polarization which was derived from the Kramers-Kronig relations by Shapiro (1975). Numerical results fully support Shapiro's conclusions and demonstrate that the apparent upper limit on the visual absorptivity of polarizing grains deduced from earlier Mie theory calculations (Martin, 1972) was spurious and resulted from a violation of the Kramers-Kronig relations in the assumed optical constants of the particles. The Kramers-Kronig interpretation of circular polarization can be used to place constraints on linear polarization outside the wavelength range in which it was observed. This approach was used to show that the peak observed in the visual is likely to be the only significant feature in the linear polarization curve, which therefore appears to be well approximated at all wavelengths by the Serkowski formula. A synthesis of available laboratory data was used to analyze the properties of dielectric core-mantel grains as the source of visual extinction and polarization.

Chlewicki, Grzegorz↗
NASA NTRS2011

Linear Quadratic Tracking Design for a Generic Transport Aircraft with Structural Load Constraints

When designing control laws for systems with constraints added to the tracking performance, control allocation methods can be utilized. Control allocations methods are used when there are more command inputs than controlled variables. Constraints that require allocators are such task as; surface saturation limits, structural load limits, drag reduction constraints or actuator failures. Most transport aircraft have many actuated surfaces compared to the three controlled variables (such as angle of attack, roll rate & angle of side slip). To distribute the control effort among the redundant set of actuators a fixed mixer approach can be utilized or online control allocation techniques. The benefit of an online allocator is that constraints can be considered in the design whereas the fixed mixer cannot. However, an online control allocator mixer has a disadvantage of not guaranteeing a surface schedule, which can then produce ill defined loads on the aircraft. The load uncertainty and complexity has prevented some controller designs from using advanced allocation techniques. This paper considers actuator redundancy management for a class of over actuated systems with real-time structural load limits using linear quadratic tracking applied to the generic transport model. A roll maneuver example of an artificial load limit constraint is shown and compared to the same no load limitation maneuver.

Burken, John J.↗
DOE OSTI2022

Stringent σ8 constraints from small-scale galaxy clustering using a hybrid MCMC + emulator framework

ABSTRACT We present a novel simulation-based hybrid emulator approach that maximally derives cosmological and Halo Occupation Distribution (HOD) information from non-linear galaxy clustering, with sufficient precision for DESI Year 1 (Y1) analysis. Our hybrid approach first samples the HOD space on a fixed cosmological simulation grid to constrain the high-likelihood region of cosmology + HOD parameter space, and then constructs the emulator within this constrained region. This approach significantly reduces the parameter volume emulated over, thus achieving much smaller emulator errors with fixed number of training points. We demonstrate that this combined with state-of-the-art simulations result in tight emulator errors comparable to expected DESI Y1 LRG sample variance. We leverage the new abacussummit simulations and apply our hybrid approach to CMASS non-linear galaxy clustering data. We infer constraints on σ8 = 0.762 ± 0.024 and fσ8(zeff = 0.52) = 0.444 ± 0.016, the tightest among contemporary galaxy clustering studies. We also demonstrate that our fσ8 constraint is robust against secondary biases and other HOD model choices, a critical first step towards showcasing the robust cosmology information accessible in non-linear scales. We speculate that the additional statistical power of DESI Y1 should tighten the growth rate constraints by at least another 50–60 ${{\ \rm per\ cent}}$, significantly elucidating any potential tension with Planck. We also address the ‘lensing is low’ tension, which we find to be in the same direction as a potential tension in fσ8. We show that the combined effect of a lower fσ8 and environment-based bias accounts for approximately $50{{\ \rm per\ cent}}$ of the discrepancy.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Frequency Nadir Constrained Unit Commitment for High Renewable Penetration Island Power Systems

The process of energy decarbonization in island power systems is accelerated due to the swift integration of inverter-based renewable energy resources (IBRs). The unique features of such systems, including rapid frequency changes resulting from potential generation outages or imbalances due to the unpredictability of renewable power, pose a significant challenge in maintaining the frequency nadir without external support. This paper presents a unit commitment (UC) model with data-driven frequency nadir constraints, including either frequency nadir or minimum inertia requirements, helping to limit frequency deviations after significant generator outages. The constraints are formulated using a linear regression model that takes advantage of real-world, year-long generation scheduling and dynamic simulation data. The efficacy of the proposed UC model is verified through a year-long simulation in an actual island power system using historical weather data. The alternative minimum inertia constraint, derived from actual system operation assumptions, is also evaluated. Findings demonstrate that the proposed frequency nadir constraint notably improves the system's frequency nadir under high photovoltaic (PV) penetration levels, albeit with a slight increase in generation costs, when compared to the alternative minimum inertia constraint.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Frequency-Nadir-Constrained Unit Commitment for Low-Inertia, High-IBR Island Power Systems [Slides]

The process of energy decarbonization in island power systems is accelerated due to the swift integration of inverter-based renewable energy resources (IBRs). The unique features of such systems, including rapid frequency changes resulting from potential generation outages or imbalances due to the unpredictability of renewable power, pose a significant challenge in maintaining the frequency nadir without external support. This paper presents a unit commitment (UC) model with data-driven frequency nadir constraints, including either frequency nadir or minimum inertia requirements, helping to limit frequency deviations after significant generator outages. The constraints are formulated using a linear regression model that takes advantage of real-world, year-long generation scheduling and dynamic simulation data. The efficacy of the proposed UC model is verified through a year-long simulation in an actual island power system using historical weather data. The alternative minimum inertia constraint, derived from actual system operation assumptions, is also evaluated. Findings demonstrate that the proposed frequency nadir constraint notably improves the system's frequency nadir under high photovoltaic (PV) penetration levels, albeit with a slight increase in generation costs, when compared to the alternative minimum inertia constraint.

14 SOLAR ENERGY↗
DOE OSTI2020

Combining Emergent Constraints for Climate Sensitivity

A method is proposed for combining information from several emergent constraints into a probabilistic estimate for a climate sensitivity proxy Y such as equilibrium climate sensitivity (ECS). The method is based on fitting a multivariate Gaussian PDF for Y and the emergent constraints using an ensemble of global climate models (GCMs); it can be viewed as a form of multiple linear regression of Y on the constraints. The method accounts for uncertainties in sampling this multidimensional PDF with a small number of models, for observational uncertainties in the constraints, and for overconfidence about the correlation of the constraints with the climate sensitivity. Its general form (Method C) accounts for correlations between the constraints. Method C becomes less robust when some constraints are too strongly related to each other; this can be mitigated using regularization approaches such as ridge regression. An illuminating special case, Method U, neglects any correlations between constraints except through their mutual relationship to the climate proxy; it is more robust to small GCM sample size and is appealingly interpretable. These methods are applied to ECS and the climate feedback parameter using a previously published set of 11 possible emergent constraints derived from climate models in the Coupled Model Intercomparison Project (CMIP). The ±2σ posterior range of ECS for Method C with no overconfidence adjustment is 4.3 ± 0.7 K. For Method U with a large overconfidence adjustment, it is 4.0 ± 1.3 K. This study adds confidence to past findings that most constraints predict higher climate sensitivity than the CMIP mean.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1974

A motion-constraint logic for moving-base simulators based on variable filter parameters

A motion-constraint logic for moving-base simulators has been developed that is a modification to the linear second-order filters generally employed in conventional constraints. In the modified constraint logic, the filter parameters are not constant but vary with the instantaneous motion-base position to increase the constraint as the system approaches the positional limits. With the modified constraint logic, accelerations larger than originally expected are limited while conventional linear filters would result in automatic shutdown of the motion base. In addition, the modified washout logic has frequency-response characteristics that are an improvement over conventional linear filters with braking for low-frequency pilot inputs. During simulated landing approaches of an externally blown flap short take-off and landing (STOL) transport using decoupled longitudinal controls, the pilots were unable to detect much difference between the modified constraint logic and the logic based on linear filters with braking.

Miller, G. K., Jr.↗
DOE OSTI2021

A solution framework for linear PDE-constrained mixed-integer problems

Abstract We present a general numerical solution method for control problems with state variables defined by a linear PDE over a finite set of binary or continuous control variables. We show empirically that a naive approach that applies a numerical discretization scheme to the PDEs to derive constraints for a mixed-integer linear program (MILP) leads to systems that are too large to be solved with state-of-the-art solvers for MILPs, especially if we desire an accurate approximation of the state variables. Our framework comprises two techniques to mitigate the rise of computation times with increasing discretization level: First, the linear system is solved for a basis of the control space in a preprocessing step. Second, certain constraints are just imposed on demand via the IBM ILOG CPLEX feature of a lazy constraint callback. These techniques are compared with an approach where the relations obtained by the discretization of the continuous constraints are directly included in the MILP. We demonstrate our approach on two examples: modeling of the spread of wildfire and the mitigation of water contamination. In both examples the computational results demonstrate that the solution time is significantly reduced by our methods. In particular, the dependence of the computation time on the size of the spatial discretization of the PDE is significantly reduced.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1971

A stochastic constrained optimization technique and its application to detector array processing.

A stochastic projected gradient algorithm is proposed which can be used for finding a constrained optimum point for a concave or convex objective function subject to nonlinear constraints which form a connected region even when only a noisy estimate of the objective function is available. For a constraint described by a single linear equation, convergence to the constrained optimum value is proved, and the rate of convergence of the algorithm to the constrained optimum value is determined. The algorithm is applied to the nonlinear problem of obtaining automatically an array of detectors which forms a beam in a desired direction in space in the presence of interfering noise so as to maximize the SNR subject to a constraint on the super-gain ratio.

Winkler, L. P.↗
NASA NTRS1972

Adaptive nonlinear optimization of the signal-to-noise ratio of an array subject to a constraint.

Investigation of a stochastic projected gradient algorithm which can be used to find a constrained optimum point for a concave or convex objective function subject to nonlinear constraints. When the constraint consists of only one linear equation, convergence to the constrained optimum value is proven, and bounds are obtained for the rate of convergence of the algorithm to the constrained optimum value. This algorithm is then applied to the nonlinear problem of automatically making an array of detectors form a beam in a desired direction in space when unknown interfering noise is present so as to maximize the signal-to-noise ratio subject to a constraint on the supergain ratio.

Winkler, L. P.↗
DOE OSTI2025

Atacama Cosmology Telescope DR6 and DESI: Structure growth measurements from the cross-correlation of DESI legacy imaging galaxies and CMB lensing from ACT DR6 and 𝑃⁢𝑙⁢𝑎⁢𝑛⁢𝑐⁢𝑘 PR4

We measure the growth of cosmic density fluctuations on large scales and across the redshift range 0.3 < 𝑧 < 0.8 through galaxy clustering and the cross-correlation of the ACT data release 6 cosmic microwave background (CMB) lensing map and galaxies from the Dark Energy Spectroscopic Instrument Legacy Survey, using three galaxy samples spanning the redshifts of 0.3 ≲ 𝑧 ≲ 0.45, 0.45 ≲ 𝑧 ≲ 0.6, 0.6 ≲ 𝑧 ≲ 0.8. We adopt a scale cut where nonlinear effects are negligible, so that the cosmological constraints are derived from the linear regime. We determine the amplitude of matter fluctuations over all three redshift bins using Atacama Cosmology Telescope (ACT) data alone to be 𝑆 8 ≡ 𝜎 8 ⁢(Ω 𝑚 /0.3) 0.5 =0.772 ± 0.040 in a joint analysis combining the three redshift bins and ACT lensing alone. Using a combination of ACT and Planck data we obtain 𝑆 8 = 0.765 ± 0.032. The lowest redshift bin used is the least constraining and exhibits a ∼2⁢𝜎 tension with the other redshift bins; thus we also report constraints excluding the first redshift bin, giving 𝑆 8 = 0.785 ± 0.033 for the combination of ACT and Planck. This result is in excellent agreement at the 0.3⁢𝜎 level with measurements from galaxy lensing, but is 1.8⁢𝜎 lower than predictions based on Planck primary CMB data. Understanding whether this hint of discrepancy in the growth of structure at low redshifts arises from a fluctuation, from systematics in data, or from new physics is a high priority for forthcoming CMB lensing and galaxy cross-correlation analyses.

cosmic microwave background↗
DOE OSTI2025

Atacama Cosmology Telescope DR6 and DESI: Structure growth measurements from the cross-correlation of DESI legacy imaging galaxies and CMB lensing from ACT DR6 and P l a n c k PR4

We measure the growth of cosmic density fluctuations on large scales and across the redshift range 0.3 < z < 0.8 through galaxy clustering and the cross-correlation of the ACT data release 6 cosmic microwave background (CMB) lensing map and galaxies from the Dark Energy Spectroscopic Instrument Legacy Survey, using three galaxy samples spanning the redshifts of 0.3 ≲ z ≲ 0.45 , 0.45 ≲ z ≲ 0.6 , 0.6 ≲ z ≲ 0.8 . We adopt a scale cut where nonlinear effects are negligible, so that the cosmological constraints are derived from the linear regime. We determine the amplitude of matter fluctuations over all three redshift bins using Atacama Cosmology Telescope (ACT) data alone to be S 8 ≡ σ 8 ( Ω m / 0.3 ) 0.5 = 0.772 ± 0.040 in a joint analysis combining the three redshift bins and ACT lensing alone. Using a combination of ACT and Planck data we obtain S 8 = 0.765 ± 0.032 . The lowest redshift bin used is the least constraining and exhibits a ∼ 2 σ tension with the other redshift bins; thus we also report constraints excluding the first redshift bin, giving S 8 = 0.785 ± 0.033 for the combination of ACT and Planck. This result is in excellent agreement at the 0.3 σ level with measurements from galaxy lensing, but is 1.8 σ lower than predictions based on Planck primary CMB data. Understanding whether this hint of discrepancy in the growth of structure at low redshifts arises from a fluctuation, from systematics in data, or from new physics is a high priority for forthcoming CMB lensing and galaxy cross-correlation analyses.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1985

Sensor/Actuator Selection for the Constrained Variance Control Problem

The problem of designing a linear controller for systems subject to inequality variance constraints is considered. A quadratic penalty function approach is used to yield a linear controller. Both the weights in the quadratic penalty function and the locations of sensors and actuators are selected by successive approximations to obtain an optimal design which satisfies the input/output variance constraints. The method is applied to NASA's 64 meter Hoop-Column Space Antenna for satellite communications. In addition the solution for the control law, the main feature of these results is the systematic determination of actuator design requirements which allow the given input/output performance constraints to be satisfied.

Delorenzo, M. L.↗
NASA NTRS2009

A Method for Scheduling Air Traffic with Uncertain En Route Capacity Constraints

A method for scheduling ground delay and airborne holding for flights scheduled to fly through airspace with uncertain capacity constraints is presented. The method iteratively solves linear programs for departure rates and airborne holding as new probabilistic information about future airspace constraints becomes available. The objective function is the expected value of the weighted sum of ground and airborne delay. In order to limit operationally costly changes to departure rates, they are updated only when such an update would lead to a significant cost reduction. Simulation results show a 13% cost reduction over a rough approximation of current practices. Comparison between the proposed as needed replanning method and a similar method that uses fixed frequency replanning shows a typical cost reduction of 1% to 2%, and even up to a 20% cost reduction in some cases.

Arneson, Heather↗
DOE OSTI2022

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part I: the Linear Setting

Fully implicit Runge--Kutta (IRK) methods have many desirable properties as time integration schemes in terms of accuracy and stability, but high-order IRK methods are not commonly used in practice with numerical PDEs due to the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic preconditioning framework for solving the systems of equations that arise from IRK methods applied to linear numerical PDEs (without algebraic constraints). Additionally, this framework also naturally applies to discontinuous Galerkin discretizations in time. Under quite general assumptions on the spatial discretization that yield stable time integration, the preconditioned operator is proven to have condition number bounded by a small, order-one constant, independent of the spatial mesh and time-step size, and with only weak dependence on number of stages/polynomial order; for example, the preconditioned operator for 10th-order Gauss IRK has condition number less than two, independent of the spatial discretization and time step. The new method can be used with arbitrary existing preconditioners for backward Euler-type time-stepping schemes and is amenable to the use of three-term recursion Krylov methods when the underlying spatial discretization is symmetric. The new method is demonstrated to be effective on various high-order finite-difference and finite element discretizations of linear parabolic and hyperbolic problems, demonstrating fast, scalable solution of up to 10th-order accuracy. The new method consistently outperforms existing block preconditioning approaches, and in several cases, the new method can achieve 4th-order accuracy using Gauss integration with roughly half the number of preconditioner applications and wallclock time as required using standard diagonally IRK methods.

97 MATHEMATICS AND COMPUTING↗