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

Optimal landing of a helicopter in autorotation

The landing of a helicopter in autorotation is formulated as a nonlinear optimal control problem. A unique feature in the present formulation is the addition of path inequality constraints on both the control and the state vectors. The control variable inequality constraint is a reflection of the limitation on the rotor thrust coefficient. The state-variable inequality constraint is an upper bound on the vertical sink-rate of the helicopter during descent. Optimal trajectories are calculated for entry conditions well within the height-velocity (H-V) restriction curve, with the helicopter initially in hover or in forward flight. The optimal solutions exhibited control techniques similar to those used by helicopter pilots in actual autorotational landings. The study indicates that, subject to pilot acceptability, a substantial reduction could be made in the H-V restriction zone using optimal control techniques.

Lee, A. Y.↗
NASA NTRS1989

Simple proof of the concavity of the entropy power with respect to Gaussian noise

A very simple proof of M. H. Costa's result that the entropy power of Xt = X + N (O, tI) is concave in t, is derived as an immediate consequence of an inequality concerning Fisher information. This relationship between Fisher information and entropy is found to be useful for proving the central limit theorem. Thus, one who seeks new entropy inequalities should try first to find new inequalities about Fisher information, or at least to exploit the existing ones in new ways.

Dembo, Amir↗
NASA NTRS2021

Sequential Wald Test Employing a Constrained Filter Bank: Application to Spacecraft Conjunctions

A binary Wald sequential probability ratio test that uses the residuals of norm-inequality-constrained Kalman filters for its likelihood ratio may be employed for a class of compound hypothesis tests on non-stationary systems. The hypotheses concern an inequality constraint on the norm of some elements of the system state. Each of two filters minimizes the summed-squares of its estimation errors subject to one or the other direction of the inequality constraint. This solution is motivated by the problem of satellite conjunction assessment, wherein the constraint concerns the close approach distance between two space objects. The outcome of the test can inform decisions concerning risk mitigation maneuvers.

J. Russell Carpenter↗
NASA NTRS1972

Computational work and time on finite machines.

Measures of the computational work and computational delay required by machines to compute functions are given. Exchange inequalities are developed for random access, tape, and drum machines to show that product inequalities between storage and time, number of drum tracks and time, number of bits in an address and time, etc., must be satisfied to compute finite functions on bounded machines.

Savage, J. E.↗
NASA NTRS1973

Function space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs

Two existing function space algorithms, Davidon and projected gradient, are modified so that they may handle directly control variable inequality constraints. A third quasi-Newton type algorithm developed by C. G. Broyden is extended to optimal control problems. The Broyden algorithm is further modified so that it also may handle directly control variable inequality constraints. These methods along with a pure gradient and two conjugate gradient algorithms are simulated on three relatively simple yet representative bounded control problems, two of which have singular subarcs. Overall the Broyden algorithm was found to be superior. The most notable result of the study was the clear superiority of the Broyden and Davidon algorithms in producing a sharp interior control subarc.

Edge, E. R.↗
NASA NTRS1974

On the fractional weight of distinct binary n-tuples

It is shown that the fraction p of ones in the Mn positions of M distinct binary n-tuples satisfies a given inequality. This inequality, which simplifies the derivation of the distance property of the Justesen codes, is proved using an elegant information-theoretic argument due to Kriz.

Massey, J. L.↗
NASA NTRS1974

Steady state decoupling and design of linear multivariable systems

A constructive criterion for decoupling the steady states of linear multivariable systems is developed. The criterion consists of n(n-1) inequalities with the type numbers of the compensator transfer functions as the unknowns. These unknowns can be chosen to satisfy the inequalities and hence achieve a steady state decoupling scheme. It turns out that pure integrators in the loops play an important role. An extended root locus design method is then developed to take care of the stability and transient response. The overall procedure is applied to the compensation design for STOL C-8A aircraft in the approach mode.

Huang, J. Y.↗
NASA NTRS1974

Optimal rocket thrust profile shaping using third degree spline function interpolation

Optimal solid-rocket thrust profiles for the parallel-burn, solid-rocket-assisted space shuttle are investigated. Solid-rocket thrust profiles are simulated by using third-degree spline functions, with the values of the thrust ordinates defined as parameters. The profiles are optimized parametrically, using the Davidon-Fletcher-Powell penalty function method, by minimizing propellant weight subject to state and control inequality constraints and to terminal boundary conditions. This study shows that optimizing a control variable parametrically by using third-degree spline function interpolation allows the control to be shaped so that inequality constraints are strictly adhered to and all corners are eliminated. The absence of corners, which is realistic in nature, makes this method attractive from the viewpoint of solid rocket grain design.

Johnson, I. L.↗
NASA NTRS1976

Function-space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs

Two existing function-space quasi-Newton algorithms, the Davidon algorithm and the projected gradient algorithm, are modified so that they may handle directly control-variable inequality constraints. A third quasi-Newton-type algorithm, developed by Broyden, is extended to optimal control problems. The Broyden algorithm is further modified so that it may handle directly control-variable inequality constraints. From a computational viewpoint, dyadic operator implementation of quasi-Newton methods is shown to be superior to the integral kernel representation. The quasi-Newton methods, along with the steepest descent method and two conjugate gradient algorithms, are simulated on three relatively simple (yet representative) bounded control problems, two of which possess singular subarcs. Overall, the Broyden algorithm was found to be superior. The most notable result of the simulations was the clear superiority of the Broyden and Davidon algorithms in producing a sharp singular control subarc.

Edge, E. R.↗
NASA NTRS1979

Generalization of the Manley-Rowe relations for non-periodic signals constrained in bandwidth with finite energy

General relations for the energy spectral densities of nonperiodic signals constrained in bandwidth in nonlinear reactances are derived. It is assumed that the charge-voltage characteristics of the reactances are polynomials. In addition certain conditions for the frequency bands of the signals must be met. By contrast with the Manley-Rowe relations integrals with respect to frequency appear instead of the ratios power over frequency. The integrands are energy spectral densities divided by frequency. For parametric devices inequalities can be derived for the ratios of the energy levels in the different circuits and the limiting frequencies of the energy spectral densities. With these inequalities it is possible to determine limits for the energy levels.

Proksch, P.↗
NASA NTRS1979

The condition of a finite Markov chain and perturbation bounds for the limiting probabilities

The inequalities bounding the relative error the norm of w- w squiggly/the norm of w are exhibited by a very simple function of E and A. Let T denote the transition matrix of an ergodic chain, C, and let A = I - T. Let E be a perturbation matrix such that T squiggly = T - E is also the transition matrix of an ergodic chain, C squiggly. Let w and w squiggly denote the limiting probability (row) vectors for C and C squiggly. The inequality is the best one possible. This bound can be significant in the numerical determination of the limiting probabilities for an ergodic chain. In addition to presenting a sharp bound for the norm of w-w squiggly/the norm of w an explicit expression for w squiggly will be derived in which w squiggly is given as a function of E, A, w and some other related terms.

Meyer, C. D., Jr.↗
NASA NTRS1981

Optimal air-breathing launch vehicle design

A generalized two-point boundary problem methodology, similar to techniques used in deterministic optimal control studies, is applied to the design and flight analysis of a two-stage air-breathing launch vehicle. Simultaneous consideration is given to configuration and trajectory by treating geometry, dynamic discontinuities, and time-dependent flight variables all as controls to be optimized with respect to a single mathematical performance measure. While minimizing fuel consumption, inequality constraints are applied to dynamic pressure and specific force. The optimal system fuel consumption and staging Mach number are found to vary little with changes in the inequality constraints due to substantial geometry and trajectory adjustments. Staging, from an air-breathing first stage to a rocket-powered second stage, consistently occurs near Mach 3.5. The dynamic pressure bound has its most pronounced effects on vehicle geometry, particularly the air-breathing propulsion inlet area, and on the first-stage altitude profile. The specific force has its greatest influence on the second-stage thrust history.

Hattis, P. D.↗
NASA NTRS1981

Detection of amblyopia utilizing generated retinal reflexes

Investigation confirmed that GRR images can be consistently obtained and that these images contain information required to detect the optical inequality of one eye compared to the fellow eye. Digital analyses, electro-optical analyses, and trained observers were used to evaluate the GRR images. Two and three dimensional plots were made from the digital analyses results. These plotted data greatly enhanced the GRR image content, and it was possible for nontrained observers to correctly identify normal vs abnormal ocular status by viewing the plots. Based upon the criteria of detecting equality or inequality of ocular status of a person's eyes, the trained observer correctly identified the ocular status of 90% of the 232 persons who participated in this program.

Kerr, J. H.↗
NASA NTRS1982

Design of supercritical swept wings

Computational fluid dynamics are used to discuss problems inherent to transonic three-dimensional flow past supercritical swept wings. The formulation for a boundary value problem for the flow past the wing is provided, including consideration of weak shock waves and the use of parabolic coordinates. A swept wing code is developed which requires a mesh of 152 x 10 x 12 points and 200 time cycles. A formula for wave drag is calculated, based on the idea that the conservation form of the momentum equation becomes an entropy inequality measuring the drag, expressible in terms of a small-disturbance equation for a potential function in two dimensions. The entropy inequality has been incorporated in a two-dimensional code for the analysis of transonic flow over airfoils. A method of artificial viscosity is explored for optimum pressure distributions with design, and involves a free boundary problem considering speed over only a portion of the wing.

Garabedian, P.↗
NASA NTRS1983

A robust Feasible Directions algorithm for design synthesis

A nonlinear optimization algorithm is developed which combines the best features of the Method of Feasible Directions and the Generalized Reduced Gradient Method. This algorithm utilizes the direction-finding sub-problem from the Method of Feasible Directions to find a search direction which is equivalent to that of the Generalized Reduced Gradient Method, but does not require the addition of a large number of slack variables associated with inequality constraints. This method provides a core-efficient algorithm for the solution of optimization problems with a large number of inequality constraints. Further optimization efficiency is derived by introducing the concept of infrequent gradient calculations. In addition, it is found that the sensitivity of the optimum design to changes in the problem parameters can be obtained using this method without the need for second derivatives or Lagrange multipliers. A numerical example is given in order to demonstrate the efficiency of the algorithm and the sensitivity analysis.

Vanderplaats, G. N.↗
NASA NTRS1983

High resolution schemes and the entropy condition

A systematic procedure for constructing semidiscrete, second order accurate, variation diminishing, five point band width, approximations to scalar conservation laws, is presented. These schemes are constructed to also satisfy a single discrete entropy inequality. Thus, in the convex flux case, convergence is proven to be the unique physically correct solution. For hyperbolic systems of conservation laws, this construction is used formally to extend the first author's first order accurate scheme, and show (under some minor technical hypotheses) that limit solutions satisfy an entropy inequality. Results concerning discrete shocks, a maximum principle, and maximal order of accuracy are obtained. Numerical applications are also presented.

Osher, S.↗
NASA NTRS1984

Entropy condition satisfying approximations for the full potential equations of transonic flow

A class of conservative difference approximations for the steady full potential equation was presented. They are, in general, easier to program than the usual density biasing algorithms, and in fact, differ only slightly from them. Rigorous proof indicated that these new schemes satisfied a new discrete entropy inequality, which ruled out expansion shocks, and that they have sharp, steady, discrete shocks. A key tool in the analysis is the construction of a new entropy inequality for the full potential equation itself. Results of some numerical experiments using the new schemes are presented.

Osher, S.↗
NASA NTRS1984

A Simple Algorithm for the Metric Traveling Salesman Problem

An algorithm was designed for a wire list net sort problem. A branch and bound algorithm for the metric traveling salesman problem is presented for this. The algorithm is a best bound first recursive descent where the bound is based on the triangle inequality. The bounded subsets are defined by the relative order of the first K of the N cities (i.e., a K city subtour). When K equals N, the bound is the length of the tour. The algorithm is implemented as a one page subroutine written in the C programming language for the VAX 11/750. Average execution times for randomly selected planar points using the Euclidean metric are 0.01, 0.05, 0.42, and 3.13 seconds for ten, fifteen, twenty, and twenty-five cities, respectively. Maximum execution times for a hundred cases are less than eleven times the averages. The speed of the algorithms is due to an initial ordering algorithm that is a N squared operation. The algorithm also solves the related problem where the tour does not return to the starting city and the starting and/or ending cities may be specified. It is possible to extend the algorithm to solve a nonsymmetric problem satisfying the triangle inequality.

Grimm, M. J.↗