Search NASA⌕ Search

SEARCH · Search NASA

Results for “Polynomial 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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Finite elements based on consistently assumed stresses and displacements

Finite element stiffness matrices are derived using an extended Hellinger-Reissner principle in which internal displacements are added to serve as Lagrange multipliers to introduce the equilibrium constraint in each element. In a consistent formulation the assumed stresses are initially unconstrained and complete polynomials and the total displacements are also complete such that the corresponding strains are complete in the same order as the stresses. Several examples indicate that resulting properties for elements constructed by this consistent formulation are ideal and are less sensitive to distortions of element geometries. The method has been used to find the optimal stress terms for plane elements, 3-D solids, axisymmetric solids, and plate bending elements.

Pian, T. H. H.↗
NASA NTRS2023

On Hermite Interpolation using Bernstein Polynomials for Trajectory Generation

This work presents a solution to the two-point Hermite interpolation problem using Bernstein polynomials. The Hermite interpolation problem is of particular interest in aerospace applications where boundary conditions for trajectories often specify derivative constraints. In the examples shown, a trajectory will be generated between an initial condition and a final condition. For example, a trajectory is generated that connects an aircraft’s current position and velocity with a point on the runway at a desired landing velocity. The numerical stability of the proposed algorithms is analyzed empirically.

Bezier curves↗
NASA NTRS2010

Analytic Development of a Reference Profile for the First Entry in a Skip Atmospheric Entry

This note shows that a feasible reference drag profile for the first entry portion of a skip entry can be generated as a polynomial expression of the velocity. The coefficients of that polynomial are found through the resolution of a system composed of m + 1 equations, where m is the degree of the drag polynomial. It has been shown that a minimum of five equations (m = 4) are required to establish the range and the initial and final conditions on velocity and flight path angle. It has been shown that at least one constraint on the trajectory can be imposed through the addition of one extra equation in the system, which must be accompanied by the increase in the degree of the drag polynomial. In order to simplify the resolution of the system of equations, the drag was considered as being a probability density function of the velocity, with the velocity as a distribution function of the drag. Combining this notion with the introduction of empirically derived constants, it has been shown that the system of equations required to generate the drag profile can be successfully reduced to a system of linear algebraic equations. For completeness, the resulting drag profiles have been flown using the feedback linearization method of differential geometric control as a guidance law with the error dynamics of a second order homogeneous equation in the form of a damped oscillator. Satisfactory results were achieved when the gains in the error dynamics were changed at a certain point along the trajectory that is dependent on the velocity and the curvature of the drag as a function of the velocity. Future work should study the capacity to update the drag profile in flight when dispersions are introduced. Also, future studies should attempt to link the first entry, as presented and controlled in this note, with a more standard control concept for the second entry, such as the Apollo entry guidance, to try to assess the overall skip entry performance. A guidance law that includes an integral feedback term, as is the case in the actual Space Shuttle entry guidance and as is proposed in Ref 29, could be tried in future studies to assess whether its use results in an improvement of the tracking performance, and to evaluate the design needs when determining the control gains.

Garcia-Llama, Eduardo↗
NASA NTRS1991

l1-optimal control of multivariable systems with output norm constraints

This paper considers the l1-optimal control problem for general rational plants. It is shown that, for plants with no poles or zeros on the unit circle, an optimal compensator exists and that the resulting closed loop transfer function is polynomial whenever there are at least as many controls as regulated outputs and at least as many measurements as exogeneous inputs. Exactly or approximately, optimal rational compensators can be obtained by solving a sequence of finite linear programs for the coefficients of a polynomial closed-loop transfer function. No assumptions on plant poles or zeros are required to obtain at least approximately optimal compensators. It is shown that constrained problems in which a set of outputs is regulated subject to l(infinity)-norm constraints on another set of outputs can be solved using a slight modification of the same algorithm.

Mcdonald, J. S.↗
NASA NTRS1986

Venus radar mapper attitude reference quaternion

Polynomial functions of time are used to specify the components of the quaternion which represents the nominal attitude of the Venus Radar mapper spacecraft during mapping. The following constraints must be satisfied in order to obtain acceptable synthetic array radar data: the nominal attitude function must have a large dynamic range, the sensor orientation must be known very accurately, the attitude reference function must use as little memory as possible, and the spacecraft must operate autonomously. Fitting polynomials to the components of the desired quaternion function is a straightforward method for providing a very dynamic nominal attitude using a minimum amount of on-board computer resources. Although the attitude from the polynomials may not be exactly the one requested by the radar designers, the polynomial coefficients are known, so they do not contribute to the attitude uncertainty. Frequent coefficient updates are not required, so the spacecraft can operate autonomously.

Lyons, D. T.↗
NASA NTRS1995

Analytic Sensitivity and Approximation of Skin Buckling Constraints in Wing-Shape Synthesis

Explicit expressions for terms of the stiffness and geometric stiffness matrices are derived for the buckling analysis of trapezoidal fiber composite wing skin panels. The formulation is based on Ritz analysis using simple polynomials, and leads to explicit expressions for the analytic sensitivities of the stiffness and geometric stiffness matrices with respect to layer thickness, fiber directions, and panel shape. Integration with wing box analysis using either the equivalent plate approach or the finite element method, makes it possible to obtain sensitivities of panel buckling constraints with respect to wing planform shape or locations of internal ribs and spars. The analytic sensitivities are used to construct approximations of panel buckling constraints for integrated wing/panel design synthesis.

Livne, Eli↗
NASA NTRS1976

A triangular element based on generalized potential energy concepts

Stiffness equations are formulated for a doubly-curved triangular thin shell finite element. The strain energy component of the potential energy is first expressed in terms of displacements and displacement gradients with the aid of consistent deep shell strain-displacement equations. The element in-plane and normal displacement fields are approximated by complete cubic polynomials. These functions do not satisfy the interelement displacement admissibility conditions. Satisfaction is forced by the imposition of constraint conditions on the interelement boundaries; the constraints represent the modification of the potential energy. Some numerical results for a pinched cylinder, a cylindrical sphere, and a pinched sphere are examined.

Thomas, G. R.↗
NASA NTRS1988

A hybrid-stress finite element for linear anisotropic elasticity

Standard assumed displacement finite elements with anisotropic material properties perform poorly in complex stress fields such as combined bending and shear and combined bending and torsion. A set of three dimensional hybrid-stress brick elements were developed with fully anisotropic material properties. Both eight-node and twenty-node bricks were developed based on the symmetry group theory of Punch and Atluri. An eight-node brick was also developed using complete polynomials and stress basis functions and reducing the order of the resulting stress parameter matrix by applying equilibrium constraints and stress compatibility constraints. Here the stress compatibility constraints must be formulated assuming anisotropic material properties. The performance of these elements was examined in numerical examples covering a broad range of stress distributions. The stress predictions show significant improvement over the assumed displacement elements but the calculation time is increased.

Fly, Gerald W.↗
NASA NTRS1991

Analysis of IRAS solar system dust data

Data in the Infrared Astronomical Satellite (IRAS) Zodiacal History File were analyzed to extract dust band locations and peak brightness measurements from approximately 1,000 individual IRAS scans. The study had three goals. One was to show that the prominent solar system dust bands are associated with Hirayama asteroid families and thus that collisions between asteroids account for a significant fraction of the particles in the zodiacal cloud. Recent work suggests that while the Hirayama families are a major source of the dust in the bands, there may also be contributions from two or three smaller, more recently recognized asteroid families. A second goal was to show that there is evidence in the IRAS dust data for the transport of particles from asteroid belt to the Earth by Poynting-Robertson light drag and thus account for the fact that asteroid particles are collected in the Earth's stratosphere. Results of the study will confirm the location of the dust bands within the inner asteroid belt, and show conclusively that the material seen by IRAS is now spread over a wide range of distances from the sun. The third goal was to construct a model of the background zodiacal cloud that satisfies the proper dynamical constraints. Figures are provided to show the scans processed to remove zodiacal background and Galactic signals, and the resulting polynomial fits to the 25 micron scan. The latter provided objective estimates of band widths, peak locations, and peak fluxes. Modelling and analysis of the resulting band data has been presented at several conferences and is the subject of a number of forthcoming papers.

Dermott, S. F.↗
NASA NTRS2009

Computing Bounds on Resource Levels for Flexible Plans

A new algorithm efficiently computes the tightest exact bound on the levels of resources induced by a flexible activity plan (see figure). Tightness of bounds is extremely important for computations involved in planning because tight bounds can save potentially exponential amounts of search (through early backtracking and detection of solutions), relative to looser bounds. The bound computed by the new algorithm, denoted the resource-level envelope, constitutes the measure of maximum and minimum consumption of resources at any time for all fixed-time schedules in the flexible plan. At each time, the envelope guarantees that there are two fixed-time instantiations one that produces the minimum level and one that produces the maximum level. Therefore, the resource-level envelope is the tightest possible resource-level bound for a flexible plan because any tighter bound would exclude the contribution of at least one fixed-time schedule. If the resource- level envelope can be computed efficiently, one could substitute looser bounds that are currently used in the inner cores of constraint-posting scheduling algorithms, with the potential for great improvements in performance. What is needed to reduce the cost of computation is an algorithm, the measure of complexity of which is no greater than a low-degree polynomial in N (where N is the number of activities). The new algorithm satisfies this need. In this algorithm, the computation of resource-level envelopes is based on a novel combination of (1) the theory of shortest paths in the temporal-constraint network for the flexible plan and (2) the theory of maximum flows for a flow network derived from the temporal and resource constraints. The measure of asymptotic complexity of the algorithm is O(N O(maxflow(N)), where O(x) denotes an amount of computing time or a number of arithmetic operations proportional to a number of the order of x and O(maxflow(N)) is the measure of complexity (and thus of cost) of a maximumflow algorithm applied to an auxiliary flow network of 2N nodes. The algorithm is believed to be efficient in practice; experimental analysis shows the practical cost of maxflow to be as low as O(N1.5). The algorithm could be enhanced following at least two approaches. In the first approach, incremental subalgorithms for the computation of the envelope could be developed. By use of temporal scanning of the events in the temporal network, it may be possible to significantly reduce the size of the networks on which it is necessary to run the maximum-flow subalgorithm, thereby significantly reducing the time required for envelope calculation. In the second approach, the practical effectiveness of resource envelopes in the inner loops of search algorithms could be tested for multi-capacity resource scheduling. This testing would include inner-loop backtracking and termination tests and variable and value-ordering heuristics that exploit the properties of resource envelopes more directly.

Muscvettola, Nicola↗
NASA NTRS2003

Aerodynamic Design Using Neural Networks

The design of aerodynamic components of aircraft, such as wings or engines, involves a process of obtaining the most optimal component shape that can deliver the desired level of component performance, subject to various constraints, e.g., total weight or cost, that the component must satisfy. Aerodynamic design can thus be formulated as an optimization problem that involves the minimization of an objective function subject to constraints. A new aerodynamic design optimization procedure based on neural networks and response surface methodology (RSM) incorporates the advantages of both traditional RSM and neural networks. The procedure uses a strategy, denoted parameter-based partitioning of the design space, to construct a sequence of response surfaces based on both neural networks and polynomial fits to traverse the design space in search of the optimal solution. Some desirable characteristics of the new design optimization procedure include the ability to handle a variety of design objectives, easily impose constraints, and incorporate design guidelines and rules of thumb. It provides an infrastructure for variable fidelity analysis and reduces the cost of computation by using less-expensive, lower fidelity simulations in the early stages of the design evolution. The initial or starting design can be far from optimal. The procedure is easy and economical to use in large-dimensional design space and can be used to perform design tradeoff studies rapidly. Designs involving multiple disciplines can also be optimized. Some practical applications of the design procedure that have demonstrated some of its capabilities include the inverse design of an optimal turbine airfoil starting from a generic shape and the redesign of transonic turbines to improve their unsteady aerodynamic characteristics.

Rai, Man Mohan↗
NASA NTRS1996

Multi Objective Controller Design for Linear System via Optimal Interpolation

We propose a methodology for the design of a controller which satisfies a set of closed-loop objectives simultaneously. The set of objectives consists of: (1) pole placement, (2) decoupled command tracking of step inputs at steady-state, and (3) minimization of step response transients with respect to envelope specifications. We first obtain a characterization of all controllers placing the closed-loop poles in a prescribed region of the complex plane. In this characterization, the free parameter matrix Q(s) is to be determined to attain objectives (2) and (3). Objective (2) is expressed as determining a Pareto optimal solution to a vector valued optimization problem. The solution of this problem is obtained by transforming it to a scalar convex optimization problem. This solution determines Q(O) and the remaining freedom in choosing Q(s) is used to satisfy objective (3). We write Q(s) = (l/v(s))bar-Q(s) for a prescribed polynomial v(s). Bar-Q(s) is a polynomial matrix which is arbitrary except that Q(O) and the order of bar-Q(s) are fixed. Obeying these constraints bar-Q(s) is now to be 'shaped' to minimize the step response characteristics of specific input/output pairs according to the maximum envelope violations. This problem is expressed as a vector valued optimization problem using the concept of Pareto optimality. We then investigate a scalar optimization problem associated with this vector valued problem and show that it is convex. The organization of the report is as follows. The next section includes some definitions and preliminary lemmas. We then give the problem statement which is followed by a section including a detailed development of the design procedure. We then consider an aircraft control example. The last section gives some concluding remarks. The Appendix includes the proofs of technical lemmas, printouts of computer programs, and figures.

Ozbay, Hitay↗
NASA NTRS1990

Optimal aeroassisted orbital transfer with plane change using collocation and nonlinear programming

The fuel optimal control problem arising in the non-planar orbital transfer employing aeroassisted technology is addressed. The mission involves the transfer from high energy orbit (HEO) to low energy orbit (LEO) with orbital plane change. The basic strategy here is to employ a combination of propulsive maneuvers in space and aerodynamic maneuvers in the atmosphere. The basic sequence of events for the aeroassisted HEO to LEO transfer consists of three phases. In the first phase, the orbital transfer begins with a deorbit impulse at HEO which injects the vehicle into an elliptic transfer orbit with perigee inside the atmosphere. In the second phase, the vehicle is optimally controlled by lift and bank angle modulations to perform the desired orbital plane change and to satisfy heating constraints. Because of the energy loss during the turn, an impulse is required to initiate the third phase to boost the vehicle back to the desired LEO orbital altitude. The third impulse is then used to circularize the orbit at LEO. The problem is solved by a direct optimization technique which uses piecewise polynomial representation for the state and control variables and collocation to satisfy the differential equations. This technique converts the optimal control problem into a nonlinear programming problem which is solved numerically. Solutions were obtained for cases with and without heat constraints and for cases of different orbital inclination changes. The method appears to be more powerful and robust than other optimization methods. In addition, the method can handle complex dynamical constraints.

Shi, Yun. Y.↗
NASA NTRS1981

The design of an ultra-low sidelobe offset-fed 1.22m antenna for use in the broadcasting satellite service

A feed design and reflector geometry were determined for an ultra low sidelobe offset fed 1.22 meter antenna suitable for use in the 12 GHz broadcasting satellite service. Arbitrary constraints used to evaluate the relative merits of the feed horns and range of f/D geometries are: minimum efficiency of 55 percent, -30 dB first sidelobe level (relative to on axis gain), a 0 dBi plateau beyond the near in sidelobe region, and a Chebyshev polynomial based envelope (borrowed from filter theory) for the region from the -3 dB beamwidth points to the 0 dBi plateau region. This envelope is extremely stringent but the results of this research effort indicate that two steps of corrugated feed and a cluster array of small 1 lambda horns do meet the constraints. A set of performance specifications and a mechanical design suitable for a consumer oriented market in the broadcasting satellite service was developed. Costs for production quantities of 10,000 units/yr. are estimated to be around $150.

Janky, J. M.↗
NASA NTRS1995

Statistically generated weighted curve fit of residual functions for modal analysis of structures

A statistically generated weighting function for a second-order polynomial curve fit of residual functions has been developed. The residual flexibility test method, from which a residual function is generated, is a procedure for modal testing large structures in an external constraint-free environment to measure the effects of higher order modes and interface stiffness. This test method is applicable to structures with distinct degree-of-freedom interfaces to other system components. A theoretical residual function in the displacement/force domain has the characteristics of a relatively flat line in the lower frequencies and a slight upward curvature in the higher frequency range. In the test residual function, the above-mentioned characteristics can be seen in the data, but due to the present limitations in the modal parameter evaluation (natural frequencies and mode shapes) of test data, the residual function has regions of ragged data. A second order polynomial curve fit is required to obtain the residual flexibility term. A weighting function of the data is generated by examining the variances between neighboring data points. From a weighted second-order polynomial curve fit, an accurate residual flexibility value can be obtained. The residual flexibility value and free-free modes from testing are used to improve a mathematical model of the structure. The residual flexibility modal test method is applied to a straight beam with a trunnion appendage and a space shuttle payload pallet simulator.

Bookout, P. S.↗
NASA NTRS1972

A fast numerical method for determining the optimum SNR of an array subject to a Q factor constraint.

The problem of finding the optimum current excitations for a point-detector array which extracts a signal from background noise using the criterion of maximizing the SNR subject to a constraint on the supergain ratio (or Q factor) has recently been solved. The formulation reduced the problem to one of solving for the roots of a polynomial whose coefficients are, in general, complex. We demonstrate that by making a certain transformation, it becomes possible to employ a state variable technique which changes the problem into one of finding the eigenvalues of a real matrix which is considerably faster to do.

Winkler, L. P.↗
NASA NTRS2005

Constraint-based Temporal Reasoning with Preferences

Often we need to work in scenarios where events happen over time and preferences are associated to event distances and durations. Soft temporal constraints allow one to describe in a natural way problems arising in such scenarios. In general, solving soft temporal problems require exponential time in the worst case, but there are interesting subclasses of problems which are polynomially solvable. In this paper we identify one of such subclasses giving tractability results. Moreover, we describe two solvers for this class of soft temporal problems, and we show some experimental results. The random generator used to build the problems on which tests are performed is also described. We also compare the two solvers highlighting the tradeoff between performance and robustness. Sometimes, however, temporal local preferences are difficult to set, and it may be easier instead to associate preferences to some complete solutions of the problem. To model everything in a uniform way via local preferences only, and also to take advantage of the existing constraint solvers which exploit only local preferences, we show that machine learning techniques can be useful in this respect. In particular, we present a learning module based on a gradient descent technique which induces local temporal preferences from global ones. We also show the behavior of the learning module on randomly-generated examples.

Khatib, Lina↗
NASA NTRS2009

A Finite Element Theory for Predicting the Attenuation of Extended-Reacting Liners

A non-modal finite element theory for predicting the attenuation of an extended-reacting liner containing a porous facesheet and located in a no-flow duct is presented. The mathematical approach is to solve separate wave equations in the liner and duct airway and to couple these two solutions by invoking kinematic constraints at the facesheet that are consistent with a continuum theory of fluid motion. Given the liner intrinsic properties, a weak Galerkin finite element formulation with cubic polynomial basis functions is used as the basis for generating a discrete system of acoustic equations that are solved to obtain the coupled acoustic field. A state-of-the-art, asymmetric, parallel, sparse equation solver is implemented that allows tens of thousands of grid points to be analyzed. A grid refinement study is presented to show that the predicted attenuation converges. Excellent comparison of the numerically predicted attenuation to that of a mode theory (using a Haynes 25 metal foam liner) is used to validate the computational approach. Simulations are also presented for fifteen porous plate, extended-reacting liners. The construction of some of the porous plate liners suggest that they should behave as resonant liners while the construction of others suggest that they should behave as broadband attenuators. In each case the finite element theory is observed to predict the proper attenuation trend.

Watson, W. R.↗