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
NASA NTRS1987

Decentralized control of large-scale systems: Fixed modes, sensitivity and parametric robustness

The problem of stabilization/pole placement under structural constraints of large scale linear systems is discussed. The existence of a solution to this problem is expressed in terms of fixed modes. The aim is to provide a bibliographic survey of the available results concerning the fixed modes (characterization, elimination, control structure selection to avoid them, control design in their absence) and to present the author's contribution to this problem which can be summarized by the use of the mode sensitivity concept to detect or to avoid them, the use of vibrational control to stabilize them, and the addition of parametric robustness considerations to design an optimal decentralized robust control.

Tarras, A.↗
NASA NTRS1989

Determination of design and operation parameters for upper atmospheric research instrumentation to yield optimum resolution with deconvolution, appendix 4

The power spectrum for a stationary random process can be defined with the Wiener-Khintchine Theorem, which says that the power spectrum and the auto correlation function are a Fourier transform pair. To implement this theorem for signals that are discrete and of finite length we can use the Blackman-Tukey method. Blackman and Tukey (1958) show that a function w(tau), called a lag window, can be applied to the auto correlation estimates to obtain power spectrum estimates that are statistically stable. The Fourier transform of w(r) is called a spectral window. Typical choices for spectral windows show a distinct trade-off between the main lobe width and side lobe strength. A new idea for designing windows by taking linear combinations of the standard windows to produce hybrid windows was introduced by Smith (1985). We implement Smith's idea to obtain spectral windows with narrow main lobes and smaller (compared with typical windows) near side lobes. One of the main contributions of this thesis is that we show that Smith's problem is equivalent to a Quadratic Programming (QP) problem with linear equality and inequality constraints. A computer program was written to produce hybrid windows by setting up and solving the QP problem. We also developed and solved two variations of the original problem. The two variations involved changing the inequality constraints in both cases from non negativity on the combination coefficients to non negativity on the hybrid lag window itself. For the second variation, the window functions used to construct the hybrid window were changed to a frequency-variable set of truncated cosinusoids. A series of tests was run with the three computer programs to investigate the behavior of the hybrid spectral and lag windows. Emphasis was put on obtaining spectral windows with both relatively narrow main lobes and the lowest possible (for these algorithms) near side lobes. Some success was achieved for this goal. A 10 dB peak side lobe reduction over the rectangular spectral window without significant main lobe broadening was achieved. Also, average side lobe levels of -117 dB were reached at a cost of doubling the main lobe width (at the -3 dB point).

Ioup, George E.↗
NASA NTRS1990

Rapid design of aerospace vehicle

This document presents in viewgraph form techniques for the optimal design of aerospace vehicles which take into account vehicle shape, aerodynamic performance, and weight minimization. Methods include multilevel optimization with linear decomposition, multi-constraint optimization, global sensitivity matrix, and calculation of sensitivity derivatives using both first and second order derivatives. The effects of including flexibility in the optimization is discussed.

Abdi, Frank↗
NASA NTRS1997

Tectonic Processes on Planets and Satellites

The final report is comprised of 7 journal articles that were completed during the reporting period. Topics covered include:(1) photogeologic analysis of the Magellan stereo view of six coronae; (2) the ancient age of Maxwell Montes; (3) timescale of regional plains emplacement on Venus; (4) remote and local stresses and calderas on Mars; (5) lunar linear rilles; (6) stratigraphical constraints on the duration of tessera formation on Venus; and (7) the use of magnetic signatures in identifying shallow intrusions on the Moon.

Head, J. W.↗
NASA NTRS2010

Synthesis of Greedy Algorithms Using Dominance Relations

Greedy algorithms exploit problem structure and constraints to achieve linear-time performance. Yet there is still no completely satisfactory way of constructing greedy algorithms. For example, the Greedy Algorithm of Edmonds depends upon translating a problem into an algebraic structure called a matroid, but the existence of such a translation can be as hard to determine as the existence of a greedy algorithm itself. An alternative characterization of greedy algorithms is in terms of dominance relations, a well-known algorithmic technique used to prune search spaces. We demonstrate a process by which dominance relations can be methodically derived for a number of greedy algorithms, including activity selection, and prefix-free codes. By incorporating our approach into an existing framework for algorithm synthesis, we demonstrate that it could be the basis for an effective engineering method for greedy algorithms. We also compare our approach with other characterizations of greedy algorithms.

Nedunuri, Srinivas↗
NASA NTRS2005

Quadratic Programming for Allocating Control Effort

A computer program calculates an optimal allocation of control effort in a system that includes redundant control actuators. The program implements an iterative (but otherwise single-stage) algorithm of the quadratic-programming type. In general, in the quadratic-programming problem, one seeks the values of a set of variables that minimize a quadratic cost function, subject to a set of linear equality and inequality constraints. In this program, the cost function combines control effort (typically quantified in terms of energy or fuel consumed) and control residuals (differences between commanded and sensed values of variables to be controlled). In comparison with prior control-allocation software, this program offers approximately equal accuracy but much greater computational efficiency. In addition, this program offers flexibility, robustness to actuation failures, and a capability for selective enforcement of control requirements. The computational efficiency of this program makes it suitable for such complex, real-time applications as controlling redundant aircraft actuators or redundant spacecraft thrusters. The program is written in the C language for execution in a UNIX operating system.

Singh, Gurkirpal↗
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.↗
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.↗
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.↗
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↗
NASA NTRS1994

A class of the van Leer-type transport schemes and its application to the moisture transport in a general circulation model

A generalized form of the second-order van Leer transport scheme is derived. Several constraints to the implied subgrid linear distribution are discussed. A very simple positive-definite scheme can be derived directly from the generalized form. A monotonic version of the scheme is applied to the Goddard Laboratory for Atmospheres (GLA) general circulation model (GCM) for the moisture transport calculations, replacing the original fourth-order center-differencing scheme. Comparisons with the original scheme are made in idealized tests as well as in a summer climate simulation using the full GLA GCM. A distinct advantage of the monotonic transport scheme is its ability to transport sharp gradients without producing spurious oscillations and unphysical negative mixing ratio. Within the context of low-resolution climate simulations, the aforementioned characteristics are demonstrated to be very beneficial in regions where cumulus convection is active. The model-produced precipitation pattern using the new transport scheme is more coherently organized both in time and in space, and correlates better with observations. The side effect of the filling algorithm used in conjunction with the original scheme is also discussed, in the context of idealized tests. The major weakness of the proposed transport scheme with a local monotonic constraint is its substantial implicit diffusion at low resolution. Alternative constraints are discussed to counter this problem.

Lin, Shian-Jiann↗
NASA NTRS2009

Regression Model Optimization for the Analysis of Experimental Data

A candidate math model search algorithm was developed at Ames Research Center that determines a recommended math model for the multivariate regression analysis of experimental data. The search algorithm is applicable to classical regression analysis problems as well as wind tunnel strain gage balance calibration analysis applications. The algorithm compares the predictive capability of different regression models using the standard deviation of the PRESS residuals of the responses as a search metric. This search metric is minimized during the search. Singular value decomposition is used during the search to reject math models that lead to a singular solution of the regression analysis problem. Two threshold dependent constraints are also applied. The first constraint rejects math models with insignificant terms. The second constraint rejects math models with near-linear dependencies between terms. The math term hierarchy rule may also be applied as an optional constraint during or after the candidate math model search. The final term selection of the recommended math model depends on the regressor and response values of the data set, the user s function class combination choice, the user s constraint selections, and the result of the search metric minimization. A frequently used regression analysis example from the literature is used to illustrate the application of the search algorithm to experimental data.

Ulbrich, N.↗
NASA NTRSDate not supplied

Flutter-Constrained Optimization with the Linearized Frequency-Domain Approach

Due to the high computational cost associated with unsteady aeroelastic analysis, state-of-the-art aeroelastic optimizations based on computational fluid dynamics typically ignore critical constraints like flutter and aeroelastic gust response. The linearized frequency-domain method offers an approach for adding high-fidelity flutter constraints to multidisciplinary optimizations at relatively low cost compared to other unsteady computational fluid dynamics methods. In recent work, sensitivities have been implemented for the linearized frequency-domain method in FUN3D. In this work, the linearized frequency-domain method and associated sensitivities are applied to gradient-based aeroelastic optimization with flutter constraints based on computational fluid dynamics. An overview of the flutter constraint formulation and implementation is provided, and then two optimization problems are presented. The first optimization increases the flutter speed of a pitch and plunge airfoil at transonic conditions using the minimal amount of geometric changes. The second optimization minimizes the mass of the AGARD 445.6 wing subject to a flutter constraint.

Aeroelasticity↗
NASA NTRSDate not supplied

Flutter-Constrained Optimization with the Linearized Frequency-Domain Approach

Due to the high computational cost associated with unsteady aeroelastic analysis, state-of-the-art aeroelastic optimizations based on computational fluid dynamics typically ignore critical constraints like flutter and aeroelastic gust response. The linearized frequency-domain method offers an approach for adding high-fidelity flutter constraints to multidisciplinary optimizations at relatively low cost compared to other unsteady computational fluid dynamics methods. In recent work, sensitivities have been implemented for the linearized frequency-domain method in FUN3D. In this work, the linearized frequency-domain method and associated sensitivities are applied to gradient-based aeroelastic optimization with flutter constraints based on computational fluid dynamics. An overview of the flutter constraint formulation and implementation is provided, and then two optimization problems are presented. The first optimization increases the flutter speed of a pitch and plunge airfoil at transonic conditions using the minimal amount of geometric changes. The second optimization minimizes the mass of the AGARD 445.6 wing subject to a flutter constraint.

Aeroelasticity↗