SEARCH · Engineering Papers

Results for “POLYNOMIAL”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 685 records · Page 38

All sources NASA NTRS DOE OSTI

NASA NTRS1988

Robust control with structured perturbations

Two important problems in the area of control systems design and analysis are discussed. The first is the robust stability using characteristic polynomial, which is treated first in characteristic polynomial coefficient space with respect to perturbations in the coefficients of the characteristic polynomial, and then for a control system containing perturbed parameters in the transfer function description of the plant. In coefficient space, a simple expression is first given for the l(sup 2) stability margin for both monic and non-monic cases. Following this, a method is extended to reveal much larger stability region. This result has been extended to the parameter space so that one can determine the stability margin, in terms of ranges of parameter variations, of the closed loop system when the nominal stabilizing controller is given. The stability margin can be enlarged by a choice of better stabilizing controller. The second problem describes the lower order stabilization problem, the motivation of the problem is as follows. Even though the wide range of stabilizing controller design methodologies is available in both the state space and transfer function domains, all of these methods produce unnecessarily high order controllers. In practice, the stabilization is only one of many requirements to be satisfied. Therefore, if the order of a stabilizing controller is excessively high, one can normally expect to have a even higher order controller on the completion of design such as inclusion of dynamic response requirements, etc. Therefore, it is reasonable to have a lowest possible order stabilizing controller first and then adjust the controller to meet additional requirements. The algorithm for designing a lower order stabilizing controller is given. The algorithm does not necessarily produce the minimum order controller; however, the algorithm is theoretically logical and some simulation results show that the algorithm works in general.

Keel, Leehyun↗

NASA NTRS1989

An adaptive data-smoothing routine

An adaptive noise reduction algorithm that can be implemented on a microcomputer is developed. Smoothing polynomials are used where the polynomial coefficients are chosen such that the mean-square-error between the noisy and smoothed data is minimized. This approach is equivalent to the implementation of a low-pass finite impulse response filter. The noise reduction depends on the order of the smoothing polynomial. A whiteness test on the error sequence is incorporated to search for the optimal smoothing. Expansion coefficients may be computed via the fast Fourier transform, and the resulting smoothing process is the equivalent of the implementation of an adaptive ideal low-pass filter. Results are obtained for an analytical signal with added white Gaussian noise. The routine may be applied to any smooth signal with additive random noise.

Taylor, Clayborne D.↗

NASA NTRS1990

Least-Squares Curve-Fitting Program

Least Squares Curve Fitting program, AKLSQF, easily and efficiently computes polynomial providing least-squares best fit to uniformly spaced data. Enables user to specify tolerable least-squares error in fit or degree of polynomial. AKLSQF returns polynomial and actual least-squares-fit error incurred in operation. Data supplied to routine either by direct keyboard entry or via file. Written for an IBM PC X/AT or compatible using Microsoft's Quick Basic compiler.

Kantak, Anil V.↗

NASA NTRS1989

Robustness analysis for real parametric uncertainty

Some key results in the literature in the area of robustness analysis for linear feedback systems with structured model uncertainty are reviewed. Some new results are given. Model uncertainty is described as a combination of real uncertain parameters and norm bounded unmodeled dynamics. Here the focus is on the case of parametric uncertainty. An elementary and unified derivation of the celebrated theorem of Kharitonov and the Edge Theorem is presented. Next, an algorithmic approach for robustness analysis in the cases of multilinear and polynomic parametric uncertainty (i.e., the closed loop characteristic polynomial depends multilinearly and polynomially respectively on the parameters) is given. The latter cases are most important from practical considerations. Some novel modifications in this algorithm which result in a procedure of polynomial time behavior in the number of uncertain parameters is outlined. Finally, it is shown how the more general problem of robustness analysis for combined parametric and dynamic (i.e., unmodeled dynamics) uncertainty can be reduced to the case of polynomic parametric uncertainty, and thus be solved by means of the algorithm.

Sideris, Athanasios↗

NASA NTRS1989

Kharitonov's theorem: Generalizations and algorithms

In 1978, the Russian mathematician V. Kharitonov published a remarkably simple necessary and sufficient condition in order that a rectangular parallelpiped of polynomials be a stable set. Here, stable is taken to mean that the polynomials have no roots in the closed right-half of the complex plane. The possibility of generalizing this result was studied by numerous authors. A set, Q, of polynomials is given and a necessary and sufficient condition that the set be stable is sought. Perhaps the most general result is due to Barmish who takes for Q a polytope and proceeds to construct a complicated nonlinear function, H, of the points in Q. With the notion of stability which was adopted, Barmish asks that the boundary of the closed right-half plane be swept, that the set G is considered = to (j(omega)(bar) - infinity is less than omega is less than infinity) and for each j(omega)(sigma)G, require H(delta) is greater than 0. Barmish's scheme has the merit that it describes a true generalization of Kharitonov's theorem. On the other hand, even when Q is a polyhedron, the definition of H requires that one do an optimization over the entire set of vertices, and then a subsequent optimization over an auxiliary parameter. In the present work, only the case where Q is a polyhedron is considered and the standard definition of stability described, is used. There are straightforward generalizations of the method to the case of discrete stability or to cases where certain root positions are deemed desirable. The cases where Q is non-polyhedral are less certain as candidates for the method. Essentially, a method of geometric programming was applied to the problem of finding maximum and minimum angular displacements of points in the Nyquist locus (Q(j x omega)(bar) - infinity is less than omega is less than infinity). There is an obvious connection with the boundary sweeping requirement of Barmish.

Rublein, George↗

NASA NTRS1989

An adaptive pseudospectral method for discontinuous problems

The accuracy of adaptively chosen, mapped polynomial approximations is studied for functions with steep gradients or discontinuities. It is shown that, for steep gradient functions, one can obtain spectral accuracy in the original coordinate system by using polynomial approximations in a transformed coordinate system with substantially fewer collocation points than are necessary using polynomial expansion directly in the original, physical, coordinate system. It is also shown that one can avoid the usual Gibbs oscillation associated with steep gradient solutions of hyperbolic pde's by approximation in suitably chosen coordinate systems. Continuous, high gradient solutions are computed with spectral accuracy (as measured in the physical coordinate system). Discontinuous solutions associated with nonlinear hyperbolic equations can be accurately computed by using an artificial viscosity chosen to smooth out the solution in the mapped, computational domain. Thus, shocks can be effectively resolved on a scale that is subgrid to the resolution available with collocation only in the physical domain. Examples with Fourier and Chebyshev collocation are given.

Augenbaum, J. M.↗

NASA NTRS1990

Mappings and accuracy for Chebyshev pseudo-spectral approximations

The effect of mappings on the approximation, by Chebyshev collocation, of functions which exhibit localized regions of rapid variation is studied. A general strategy is introduced whereby mappings are adaptively constructed which map specified classes of rapidly varying functions into low order polynomials which can be accurately approximated by Chebyshev polynomial expansions. A particular family of mappings constructed in this way is tested on a variety of rapidly varying functions similar to those occurring in approximations. It is shown that the mapped function can be approximated much more accurately by Chebyshev polynomial approximations than in physical space or where mappings constructed from other strategies are employed.

Bayliss, Alvin↗

NASA NTRS1992

Mappings and accuracy for Chebyshev pseudo-spectral approximations

Bayliss, Alvin↗

NASA NTRS1993

Robust algebraic image enhancement for intelligent control systems

Robust vision capability for intelligent control systems has been an elusive goal in image processing. The computationally intensive techniques a necessary for conventional image processing make real-time applications, such as object tracking and collision avoidance difficult. In order to endow an intelligent control system with the needed vision robustness, an adequate image enhancement subsystem capable of compensating for the wide variety of real-world degradations, must exist between the image capturing and the object recognition subsystems. This enhancement stage must be adaptive and must operate with consistency in the presence of both statistical and shape-based noise. To deal with this problem, we have developed an innovative algebraic approach which provides a sound mathematical framework for image representation and manipulation. Our image model provides a natural platform from which to pursue dynamic scene analysis, and its incorporation into a vision system would serve as the front-end to an intelligent control system. We have developed a unique polynomial representation of gray level imagery and applied this representation to develop polynomial operators on complex gray level scenes. This approach is highly advantageous since polynomials can be manipulated very easily, and are readily understood, thus providing a very convenient environment for image processing. Our model presents a highly structured and compact algebraic representation of grey-level images which can be viewed as fuzzy sets.

Lerner, Bao-Ting↗

NASA NTRS1992

Stability margins for multilinear interval systems by way of phase conditions: A unified approach

A simple way of checking the stability with respect to an arbitrary stability region of a family of polynomials containing a vector of parameters varying within prescribed intervals is discussed. It is assumed that the parameters appear affine multilinearly in the characteristic polynomial coefficients. The condition proposed is simply to check the phase difference of the vertex polynomials. This test based on the mapping theorem significantly reduces computational complexity. Mathematical proofs are omitted. The results can be used to determine various stability margins of control systems containing interconnected interval subsystems. These include the gain, phase, time-delay, H(sup infinity), and nonlinear sector bounded stability margins of multilinear interval systems.

Keel, L. H.↗

NASA NTRS1993

Exploiting structure: Introduction and motivation

Research activities performed during the period of 29 June 1993 through 31 Aug. 1993 are summarized. The Robust Stability of Systems where transfer function or characteristic polynomial are multilinear affine functions of parameters of interest in two directions, Algorithmic and Theoretical, was developed. In the algorithmic direction, a new approach that reduces the computational burden of checking the robust stability of the system with multilinear uncertainty is found. This technique is called 'Stability by linear process.' In fact, the 'Stability by linear process' described gives an algorithm. In analysis, we obtained a robustness criterion for the family of polynomials with coefficients of multilinear affine function in the coefficient space and obtained the result for the robust stability of diamond families of polynomials with complex coefficients also. We obtained the limited results for SPR design and we provide a framework for solving ACS. Finally, copies of the outline of our results are provided in the appendix. Also, there is an administration issue in the appendix.

Xu, Zhong Ling↗

NASA NTRS1993

Rational trigonometric approximations using Fourier series partial sums

A class of approximations (S(sub N,M)) to a periodic function f which uses the ideas of Pade, or rational function, approximations based on the Fourier series representation of f, rather than on the Taylor series representation of f, is introduced and studied. Each approximation S(sub N,M) is the quotient of a trigonometric polynomial of degree N and a trigonometric polynomial of degree M. The coefficients in these polynomials are determined by requiring that an appropriate number of the Fourier coefficients of S(sub N,M) agree with those of f. Explicit expressions are derived for these coefficients in terms of the Fourier coefficients of f. It is proven that these 'Fourier-Pade' approximations converge point-wise to (f(x(exp +))+f(x(exp -)))/2 more rapidly (in some cases by a factor of 1/k(exp 2M)) than the Fourier series partial sums on which they are based. The approximations are illustrated by several examples and an application to the solution of an initial, boundary value problem for the simple heat equation is presented.

Geer, James F.↗

NASA NTRS1994

Some rules for polydimensional squeezing

The review of the following results is presented: For mixed state light of N-mode electromagnetic field described by Wigner function which has generic Gaussian form, the photon distribution function is obtained and expressed explicitly in terms of Hermite polynomials of 2N-variables. The momenta of this distribution are calculated and expressed as functions of matrix invariants of the dispersion matrix. The role of new uncertainty relation depending on photon state mixing parameter is elucidated. New sum rules for Hermite polynomials of several variables are found. The photon statistics of polymode even and odd coherent light and squeezed polymode Schroedinger cat light is given explicitly. Photon distribution for polymode squeezed number states expressed in terms of multivariable Hermite polynomials is discussed.

Manko, Vladimir I.↗

NASA NTRS1994

An Efficient Spectral Method for Ordinary Differential Equations with Rational Function Coefficients

We present some relations that allow the efficient approximate inversion of linear differential operators with rational function coefficients. We employ expansions in terms of a large class of orthogonal polynomial families, including all the classical orthogonal polynomials. These families obey a simple three-term recurrence relation for differentiation, which implies that on an appropriately restricted domain the differentiation operator has a unique banded inverse. The inverse is an integration operator for the family, and it is simply the tridiagonal coefficient matrix for the recurrence. Since in these families convolution operators (i.e. matrix representations of multiplication by a function) are banded for polynomials, we are able to obtain a banded representation for linear differential operators with rational coefficients. This leads to a method of solution of initial or boundary value problems that, besides having an operation count that scales linearly with the order of truncation N, is computationally well conditioned. Among the applications considered is the use of rational maps for the resolution of sharp interior layers.

Coutsias, Evangelos A.↗

NASA NTRS1992

A new model for estimating total body water from bioelectrical resistance

Estimation of total body water (T) from bioelectrical resistance (R) is commonly done by stepwise regression models with height squared over R, H(exp 2)/R, age, sex, and weight (W). Polynomials of H(exp 2)/R have not been included in these models. We examined the validity of a model with third order polynomials and W. Methods: T was measured with oxygen-18 labled water in 27 subjects. R at 50 kHz was obtained from electrodes placed on the hand and foot while subjects were in the supine position. A stepwise regression equation was developed with 13 subjects (age 31.5 plus or minus 6.2 years, T 38.2 plus or minus 6.6 L, W 65.2 plus or minus 12.0 kg). Correlations, standard error of estimates and mean differences were computed between T and estimated T's from the new (N) model and other models. Evaluations were completed with the remaining 14 subjects (age 32.4 plus or minus 6.3 years, T 40.3 plus or minus 8 L, W 70.2 plus or minus 12.3 kg) and two of its subgroups (high and low) Results: A regression equation was developed from the model. The only significant mean difference was between T and one of the earlier models. Conclusion: Third order polynomials in regression models may increase the accuracy of estimating total body water. Evaluating the model with a larger population is needed.

Siconolfi, S. F.↗

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 NTRS1993

Sensitivity Analysis of the Static Aeroelastic Response of a Wing

A technique to obtain the sensitivity of the static aeroelastic response of a three dimensional wing model is designed and implemented. The formulation is quite general and accepts any aerodynamic and structural analysis capability. A program to combine the discipline level, or local, sensitivities into global sensitivity derivatives is developed. A variety of representations of the wing pressure field are developed and tested to determine the most accurate and efficient scheme for representing the field outside of the aerodynamic code. Chebyshev polynomials are used to globally fit the pressure field. This approach had some difficulties in representing local variations in the field, so a variety of local interpolation polynomial pressure representations are also implemented. These panel based representations use a constant pressure value, a bilinearly interpolated value. or a biquadraticallv interpolated value. The interpolation polynomial approaches do an excellent job of reducing the numerical problems of the global approach for comparable computational effort. Regardless of the pressure representation used. sensitivity and response results with excellent accuracy have been produced for large integrated quantities such as wing tip deflection and trim angle of attack. The sensitivities of such things as individual generalized displacements have been found with fair accuracy. In general, accuracy is found to be proportional to the relative size of the derivatives to the quantity itself.

Eldred, Lloyd B.↗

NASA NTRS1998

Optimization of Turbine Blade Design for Reusable Launch Vehicles

To facilitate design optimization of turbine blade shape for reusable launching vehicles, appropriate techniques need to be developed to process and estimate the characteristics of the design variables and the response of the output with respect to the variations of the design variables. The purpose of this report is to offer insight into developing appropriate techniques for supporting such design and optimization needs. Neural network and polynomial-based techniques are applied to process aerodynamic data obtained from computational simulations for flows around a two-dimensional airfoil and a generic three- dimensional wing/blade. For the two-dimensional airfoil, a two-layered radial-basis network is designed and trained. The performances of two different design functions for radial-basis networks, one based on the accuracy requirement, whereas the other one based on the limit on the network size. While the number of neurons needed to satisfactorily reproduce the information depends on the size of the data, the neural network technique is shown to be more accurate for large data set (up to 765 simulations have been used) than the polynomial-based response surface method. For the three-dimensional wing/blade case, smaller aerodynamic data sets (between 9 to 25 simulations) are considered, and both the neural network and the polynomial-based response surface techniques improve their performance as the data size increases. It is found while the relative performance of two different network types, a radial-basis network and a back-propagation network, depends on the number of input data, the number of iterations required for radial-basis network is less than that for the back-propagation network.

Shyy, Wei↗