Search NASA⌕ Search

SEARCH · Search NASA

Results for “inequality”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Maximum mass of objects that constitute unseen disk material

It is suggested that the mass of the individual unseen 'disk things' which furnish unseen mass satisfies an inequality that is based on the demonstrated existence of a large number of wide binary stars in the Galaxy whose projected separations are as large as 0.1 pc. Since these binaries are weakly bound, with orbital velocities of 0.3 km/sec and periods of the order of 1 million years, they can be disrupted by passing stars or other pointlike objects. This implies that the mass of the unseen disk objects, which provide about half the local mass density, must be less than 2 solar masses.

Bahcall, J. N.↗
NASA NTRS1985

Optimal impulsive manoeuvres and aerodynamic braking

A method developed for obtaining solutions to the aerodynamic braking problem, using impulses in the exoatmospheric phases is discussed. The solution combines primer vector theory and the results of a suboptimal atmospheric guidance program. For a specified initial and final orbit, the solution determines: (1) the minimum impulsive cost using a maximum of four impulses, (2) the optimal atmospheric entry and exit-state vectors subject to equality and inequality constraints, and (3) the optimal coast times. Numerical solutions which illustrate the characteristics of the solution are presented.

Jezewski, D. J.↗
NASA NTRS1986

The expanded LaGrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrainted optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗
NASA NTRS1985

Large scale structural synthesis

A general purpose optimization program is coupled to a large scale finite element program to provide an efficient tool for structural synthesis. The resulting interface program may be used to design structures for minimum weight, subject to constraints on stress, displacement, and vibration frequencies. A variety of state-of-the-art techniques are employed, including design variable linking, constraint deletion, reciprocal variables, and formal approximations. The capability is demonstrated with the design of a gear housing using 30 design variables and over 5000 nonlinear inequality constraints. The finite element model consists of over 1600 elements and 7000 displacement degrees of freedom. The design required six detailed finite element analyses and approximately one hour on a Cray-1s supercomputer. It is concluded that structures of practical size and complexity can be efficiently designed using numerical optimization.

Vanderplaats, G. N.↗
NASA NTRS1985

Design of suboptimal regulators for nonlinear systems

An optimal feedback control law is preferred for the regulation of a deterministic nonlinear system. In this paper, a practical, iterative design method leading to a sequence of suboptimal control laws with successively improved performance is presented. The design method requires the determination of an upper bound to the performance of each successive control law. This is obtained by solving a partial differential inequality by means of a linear programming technique. Robustness properties and the application of the design method to the control of a robot manipulator arm are also presented.

Balaram, J.↗
NASA NTRS1984

The ADS general-purpose optimization program

The mathematical statement of the general nonlinear optimization problem is given as follows: find the vector of design variables, X, that will minimize f(X) subject to G sub J (x) + or - 0 j=1,m H sub K hk(X) = 0 k=1,l X Lower I approx less than X sub I approx. less than X U over I i = 1,N. The vector of design variables, X, includes all those variables which may be changed by the ADS program in order to arrive at the optimum design. The objective function F(X) to be minimized may be weight, cost or some other performance measure. If the objective is to be maximized, this is accomplished by minimizing -F(X). The inequality constraints include limits on stress, deformation, aeroelastic response or controllability, as examples, and may be nonlinear implicit functions of the design variables, X. The equality constraints h sub k(X) represent conditions that must be satisfied precisely for the design to be acceptable. Equality constraints are not fully operational in version 1.0 of the ADS program, although they are available in the Augmented Lagrange Multiplier method. The side constraints given by the last equation are used to directly limit the region of search for the optimum. The ADS program will never consider a design which is not within these limits.

Vanderplaats, G. N.↗
NASA NTRS1986

Existence of the time optimal control for robotic manipulators

Using Filipov's Theorem, it is shown that the conditions oif nonfinite escape of trajectories, reachability, and convexity of the dynamics over all admissible controls are needed for the existence of a time optimal solution for the robotic equation. With a lower bound for the finite-escape time established using a Liapunov approach, and an upper bound for the time to reach the target established using the exact linearization idea, a single inequality is found which is closely related to the coriolis and the centrifugal terms, the absence of which implies that the domain of existence of the optimal solution can be made arbitrarily large with a large torque constraint. As the work space is finite, this is essentially a global result in practical situations.

Wen, J.↗
NASA NTRS1987

Proof of quasi-adaptivity for the m-measurement feedback class of stochastic control policies

Bounds on expected performance are established which show that the m-measurement feedback (mM) policy for nonlinear stochastic control performs as well or better than the open-loop optimal control policy, and thus is quasi-adaptive in the sense of Witenhausen (1966). The chain of performance inequalities indicate a tendency for the mM policy performance to improve with increasing m. It is suggested that the present analytical method, based on the construction of artificial control sequences denoted as utility controls, can be used to establish performance bounds on other well-known policies, avoiding the extensive Monte Carlo simulations necessary in comparing stochastic control policies.

Bayard, David S.↗
NASA NTRS1988

Nonlinear Analysis Of Rotor Dynamics

Study explores analytical consequences of nonlinear Jeffcott equations of rotor dynamics. Section 1: Summary of previous studies. Section 2: Jeffcott Equations. Section 3: Proves two theorems that provide inequalities on coefficients of differential equations and magnitude of forcing function in absence of side force. Section 4: Numerical investigation of multiple-forcing-function problem by introducing both side force and mass imbalance. Section 5: Examples of numberical solutions of complex generalized Jeffcott equation with two forcing functions of different frequencies f1 and f2. Section 6: Boundedness and stability of solutions.Section 7: Concludes report reviewing analytical results and significance.

Day, William B.↗
NASA NTRS1987

Comparing hard and soft prior bounds in geophysical inverse problems

In linear inversion of a finite-dimensional data vector y to estimate a finite-dimensional prediction vector z, prior information about X sub E is essential if y is to supply useful limits for z. The one exception occurs when all the prediction functionals are linear combinations of the data functionals. Two forms of prior information are compared: a soft bound on X sub E is a probability distribution p sub x on X which describeds the observer's opinion about where X sub E is likely to be in X; a hard bound on X sub E is an inequality Q sub x(X sub E, X sub E) is equal to or less than 1, where Q sub x is a positive definite quadratic form on X. A hard bound Q sub x can be softened to many different probability distributions p sub x, but all these p sub x's carry much new information about X sub E which is absent from Q sub x, and some information which contradicts Q sub x. Both stochastic inversion (SI) and Bayesian inference (BI) estimate z from y and a soft prior bound p sub x. If that probability distribution was obtained by softening a hard prior bound Q sub x, rather than by objective statistical inference independent of y, then p sub x contains so much unsupported new information absent from Q sub x that conclusions about z obtained with SI or BI would seen to be suspect.

Backus, George E.↗
NASA NTRS1988

A method for designing robust multivariable feedback systems

A new methodology is developed for the synthesis of linear, time-invariant (LTI) controllers for multivariable LTI systems. The aim is to achieve stability and performance robustness of the feedback system in the presence of multiple unstructured uncertainty blocks; i.e., to satisfy a frequency-domain inequality in terms of the structured singular value. The design technique is referred to as the Causality Recovery Methodology (CRM). Starting with an initial (nominally) stabilizing compensator, the CRM produces a closed-loop system whose performance-robustness is at least as good as, and hopefully superior to, that of the original design. The robustness improvement is obtained by solving an infinite-dimensional, convex optimization program. A finite-dimensional implementation of the CRM was developed, and it was applied to a multivariate design example.

Milich, David Albert↗
NASA NTRS1988

A methodology for the synthesis of robust feedback systems

A new methodology is developed for the synthesis of linear, time-variant (LTI) controllers for multivariable LTI systems. The resulting closed-loop system is nominally stable and exhibits a known level of performance. In addition, robustness of the feedback system is guaranteed, i.e., stability and performance are retained in the presence of multiple unstructured uncertainty blocks located at various points in the feedback loop. The design technique is referred to as the Causality Recovery Methodology (CRM). The CRM relies on the Youla parameterization of all stabilizing compensators to ensure nominal stability of the feedback system. A frequency-domain inequality in terms of the structured singular value mu defines the robustness specification. The optimal compensator, with respect to the mu condition, is shown to be noncausal in general. The aim of the CRM is to find a stable, causal transfer function matrix that approximates the robustness characteristics of the optimal solution. The CRM, via a series of infinite-dimensional convex programs, produces a closed-loop system whose performance robustness is at least as good as that of any initial design. The algorithm is approximated by a finite dimensional process for the purposes of implementation. Two numerical examples confirm the potential viability of the CRM concept; however, the robustness improvement comes at the expense of increased computational burden and compensator complexity.

Milich, David Albert↗
NASA NTRS1988

Optimal penetration landing trajectories in the presence of windshear

The present consideration of optimal windshear-penetration flight trajectories in a vertical plane gives attention to the cases of either mere angle-of-attack control, with predetermined power setting, or both angle-of-attack and power setting controls. Inequality constraints are imposed on the angle-of-attack, the power setting, and their time derivatives. The performance index being minimized measures flight trajectory deviation from a nominal trajectory. Time is free, absolute path inclination at touchdown is specified, and touchdown velocity and distance are subject to upper and lower bounds. Three power settings are investigated.

Miele, A.↗
NASA NTRS1988

Asteroid shapes from radar echo spectra - A new theoretical approach

Asteroid shape determinations are presently made by means of a novel technique based on the geometric relation between spectral edge frequencies and the shape of a rotating, rigid radar target. By employing the echo spectra obtained at many rotational phases, the asteroid's convex polar silhouette hull is obtained; noise content is treated as a problem in weighted-least-squares optimization, subject to inequality constraints. The performance of this estimation method is assessed in a series of simulated data giving attention to spectral noise propagation into hull error; sensitivity to echo strength and spectral resolution are also evaluated.

Ostro, Steven J.↗
NASA NTRS1988

Multi-time-step integration using nodal partitioning

An algorithm is presented which integrates different groups of nodes of a finite element mesh with different time steps and different integrators. Since the nodal groups are updated independently no unsymmetric systems need be solved. Stability is demonstrated by showing that an energy norm of the solution decreases after every update if the time step is less than a given critical value. The element eigenvalue inequality theorem is used to give the critical time step in terms of element eigenvalues.

Smolinski, P.↗
NASA NTRS1988

The expanded Lagrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrained optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗
NASA NTRS1988

Digital active control law synthesis for aeroservoelastic systems

This paper presents a formulation for synthesis of digital active control laws for aeroservoelastic systems, which are typically modeled by large order equations in order to accurately represent the rigid and flexible body modes, unsteady aerodynamic forces, actuator dynamics, and gust spectra. The control law is expected to satisfy multiple design requirements on the dynamic loads, responses, actuator deflection and rate limitations, as well as maintain certain stability margins, yet should be simple enough to be implemented by an onboard digital microprocessor. The synthesis procedure minimizes a linear quadratic Gaussian type cost function, by updating selected free parameters of the control law, while satisfying a set of inequality constraints on the design loads, responses and stability margins. A stable classical control law or an estimator based full or reduced order control law can be used as an initial design starting point. The gradients of the cost function and the constraints, with respect to the digital control law design variables are derived analytically, to facilitate rapid convergence. Selected design responses can be treated as constraints instead of lumping them into the cost function, in order to satisfy individual root-mean-square load and response limitations. Constraints are also imposed on the minimum singular value requirements for stability robustness improvement.

Mukhopadhyay, Vivekananda↗
NASA NTRS1987

Constrained optimization techniques for active control of aeroelastic response

Active control of aeroelastic response is a complex problem in which the designer usually tries to satisfy many design criteria which are often conflicting in nature. To further complicate the design problem, the state space equations describing this type of control problem are usually of high order, involving a large number of states to represent the flexible structure and unsteady aerodynamics. Control laws based on the standard Linear - Quadratic - Gaussian method are of the same high order as the aeroelastic plant and may be difficult to implement in the flight computer. To overcome this disadvantage a new approach was developed for designing low-order optimized robust control laws. In this approach, a nonlinear programming algorithm is used to search for the values of control law design variables that minimize a performance index while satisfying several inequality constraints that describe the design criteria on the stability robustness and responses. The method is applied to a gust load alleviation problem and a stability robustness improvement problem of a drone aircraft.

Mukhopadhyay, Vivekananda↗