Search NASA⌕ Search

SEARCH · Search NASA

Results for “Polynomials”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS2001

Accuracy Assessment of Response Surface Approximations for Supersonic Turbine Design

There is a growing trend to employ CFD tools to supply the necessary information for design optimization of fluid dynamics components/systems. Such results are prone to uncertainties due to reasons including discretization. errors, incomplete convergence of computational procedures, and errors associated with physical models such as turbulence closures. Based on this type of information, gradient-based optimization algorithms often suffer from the noisy calculations, which can seriously compromise the outcome. Similar problems arise from the experimental measurements. Global optimization techniques, such as those based on the response surface (RS) concept are becoming popular in part because they can overcome some of these barriers. However, there are also fundamental issues related to such global optimization technique such as RS. For example, in high dimensional design spaces, typically only a small number of function evaluations are available due to computational and experimental costs. On the other hand, complex features of the design variables do not allow one to model the global characteristics of the design space with simple quadratic polynomials. Consequently a main challenge is to reduce the size of the region where we fit the RS, or make it more accurate in the regions where the optimum is likely to reside. Response Surface techniques using either polynomials or and Neural Network (NN) methods offer designers alternatives to conduct design optimization. The RS technique employs statistical and numerical techniques to establish the relationship between design variables and objective/constraint functions, typically using polynomials. In this study, we aim at addressing issues related to the following questions: (1) How to identify outliers associated with a given RS representation and improve the RS model via appropriate treatments? (2) How to focus on selected design data so that RS can give better performance in regions critical to design optimization? (3) How to combine NN and polynomial techniques for improving the accuracy of the RS model?

Papila, Nilay↗
NASA NTRS1995

A 3D High-Order Unstructured Finite-Volume Algorithm for Solving Maxwell's Equations

A three-dimensional finite-volume algorithm based on arbitrary basis functions for time-dependent problems on general unstructured grids is developed. The method is applied to the time-domain Maxwell equations. Discrete unknowns are volume integrals or cell averages of the electric and magnetic field variables. Spatial terms are converted to surface integrals using the Gauss curl theorem. Polynomial basis functions are introduced in constructing local representations of the fields and evaluating the volume and surface integrals. Electric and magnetic fields are approximated by linear combinations of these basis functions. Unlike other unstructured formulations used in Computational Fluid Dynamics, the new formulation actually does not reconstruct the field variables at each time step. Instead, the spatial terms are calculated in terms of unknowns by precomputing weights at the beginning of the computation as functions of cell geometry and basis functions to retain efficiency. Since no assumption is made for cell geometry, this new formulation is suitable for arbitrarily defined grids, either smooth or unsmooth. However, to facilitate the volume and surface integrations, arbitrary polyhedral cells with polygonal faces are used in constructing grids. Both centered and upwind schemes are formulated. It is shown that conventional schemes (second order in Cartesian grids) are equivalent to the new schemes using first degree polynomials as the basis functions and the midpoint quadrature for the integrations. In the new formulation, higher orders of accuracy are achieved by using higher degree polynomial basis functions. Furthermore, all the surface and volume integrations are carried out exactly. Several model electromagnetic scattering problems are calculated and compared with analytical solutions. Examples are given for cases based on 0th to 3rd degree polynomial basis functions. In all calculations, a centered scheme is applied in the interior, while an upwind matching scheme is employed at material interfaces and the Engquist-Majda non-reflecting boundary condition is implemented at the numerical outer boundaries. The staggered leapfrog scheme and the Runge-Kutta methods are utilized for the time integration. Excellent agreements are found between the numerical and analytical solutions.

Liu, Yen↗
NASA NTRS1961

A Method for Obtaining the Nonlinear Aerodynamic Stability Characteristics of Bodies of Revolution from Free-Flight Tests

A method is presented for obtaining the nonlinear aerodynamic stability characteristics of bodies of revolution from free-flight test.s The necessary conditions for the application of this method are: (1) that the roll rate and damping encountered in a single cycle of oscillation be small, and (2) that the resulting motion be reasonably planar. Four approximations to the nonlinear restoring moment are considered and solutions are obtained in closed form: 1. A single-term polynomial in an arbitrary power of the angle of attack. 2. A two-term polynomial having linear and cubic terms. 3. A three-term polynomial having linear, quadratic, and cubic terms. 4. A three-term polynomial having linear, quadratic, and cubic terms. An iteration procedure is formulated to allow the use of each of these approximations for obtaining the aerodynamic coefficients of bodies of revolution from free-flight test data. It is found that although the equations that are solved pertain strictly to planar motion, the solutions are applicable to motions that deviate to a fairly large degree from planar motion.

Kirk, Donn B.↗
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 NTRS2012

Algorithm for Compressing Time-Series Data

An algorithm based on Chebyshev polynomials effects lossy compression of time-series data or other one-dimensional data streams (e.g., spectral data) that are arranged in blocks for sequential transmission. The algorithm was developed for use in transmitting data from spacecraft scientific instruments to Earth stations. In spite of its lossy nature, the algorithm preserves the information needed for scientific analysis. The algorithm is computationally simple, yet compresses data streams by factors much greater than two. The algorithm is not restricted to spacecraft or scientific uses: it is applicable to time-series data in general. The algorithm can also be applied to general multidimensional data that have been converted to time-series data, a typical example being image data acquired by raster scanning. However, unlike most prior image-data-compression algorithms, this algorithm neither depends on nor exploits the two-dimensional spatial correlations that are generally present in images. In order to understand the essence of this compression algorithm, it is necessary to understand that the net effect of this algorithm and the associated decompression algorithm is to approximate the original stream of data as a sequence of finite series of Chebyshev polynomials. For the purpose of this algorithm, a block of data or interval of time for which a Chebyshev polynomial series is fitted to the original data is denoted a fitting interval. Chebyshev approximation has two properties that make it particularly effective for compressing serial data streams with minimal loss of scientific information: The errors associated with a Chebyshev approximation are nearly uniformly distributed over the fitting interval (this is known in the art as the "equal error property"); and the maximum deviations of the fitted Chebyshev polynomial from the original data have the smallest possible values (this is known in the art as the "min-max property").

Hawkins, S. Edward, III↗
NASA NTRS2019

Principal Component Analysis of Up-The-Ramp Sampled Infrared Array Data

We describe the results of principal component analysis (PCA) of up-the-ramp sampled infrared (IR) array data from the Hubble Space Telescope wide field camera 3 (WFC3 IR), James Webb Space Telescope NIRSpec, and prototype Wide Field Infrared Survey Telescope’s wide field instrument detectors. These systems use, respectively, Teledyne H1R, H2RG, and H4RG-10 near-IR detector arrays with a variety of IR array controllers. The PCA shows that the Legendre polynomials approximate the principal components of these systems (i.e., they roughly diagonalize the covariance matrix). In contrast to the monomial basis that is widely used for polynomial fitting and linearization today, the Legendre polynomials are an orthonormal basis. They provide a quantifiable, compact, and (nearly) linearly uncorrelated representation of the information content of the data. By fitting a few Legendre polynomials, nearly all of the meaningful information in representative WFC3 astronomical datacubes can be condensed from 15 up-the-ramp samples down to 6 compressible Legendre coefficients per pixel. The higher order coefficients contain time domain information that is lost when one projects up-the-ramp sampled datacubes onto two-dimensional images by fitting a straight line, even if the data are linearized before fitting the line. Going forward, we believe that this time domain information is potentially important for disentangling the various nonlinearities that can affect IR array observations, i.e., inherent pixel nonlinearity, persistence, burn in, brighter-fatter effect, (potentially) nonlinear interpixel capacitance, and perhaps others.

Rauscher, Bernard J.↗
NASA NTRS2001

Distribution functions of probabilistic automata

Each probabilistic automaton M over an alphabet A defines a probability measure Prob sub(M) on the set of all finite and infinite words over A. We can identify a k letter alphabet A with the set {0, 1,..., k-1}, and, hence, we can consider every finite or infinite word w over A as a radix k expansion of a real number X(w) in the interval [0, 1]. This makes X(w) a random variable and the distribution function of M is defined as usual: F(x) := Prob sub(M) { w: X(w) < x }. Utilizing the fixed-point semantics (denotational semantics), extended to probabilistic computations, we investigate the distribution functions of probabilistic automata in detail. Automata with continuous distribution functions are characterized. By a new, and much more easier method, it is shown that the distribution function F(x) is an analytic function if it is a polynomial. Finally, answering a question posed by D. Knuth and A. Yao, we show that a polynomial distribution function F(x) on [0, 1] can be generated by a prob abilistic automaton iff all the roots of F'(x) = 0 in this interval, if any, are rational numbers. For this, we define two dynamical systems on the set of polynomial distributions and study attracting fixed points of random composition of these two systems.

Denotational semantics↗
NASA NTRS1975

Necessary and sufficient conditions for the complete controllability and observability of systems in series using the coprime factorization of a rational matrix

The series connection of two linear time-invariant systems that have minimal state space system descriptions is considered. From these descriptions, strict-system-equivalent polynomial matrix system descriptions in the manner of Rosenbrock are derived. They are based on the factorization of the transfer matrix of the subsystems as a ratio of two right or left coprime polynomial matrices. They give rise to a simple polynomial matrix system description of the tandem connection. Theorem 1 states that for the complete controllability and observability of the state space system description of the series connection, it is necessary and sufficient that certain 'denominator' and 'numerator' groups are coprime. Consequences for feedback systems are drawn in Corollary 1. The role of pole-zero cancellations is explained by Lemma 3 and Corollaires 2 and 3.

Callier, F. M.↗
NASA NTRS1975

A formulation consideration for orthogonal collocation procedures

Numerical instabilities often arise in the use of high-ordered collocation approximations for numerically solving parabolic partial differential equations. These problems may be reduced by formulations involving evaluation of collocation polynomials rather than combination of the polynomials into a power series. As an illustration, two formulations using shifted Legendre polynomials of order 26 and less are compared.

Lashmet, P. K.↗
NASA NTRS1977

Correction factors for on-line microprobe analysis of multielement alloy systems

An on-line correction technique was developed for the conversion of electron probe X-ray intensities into concentrations of emitting elements. This technique consisted of off-line calculation and representation of binary interaction data which were read into an on-line minicomputer to calculate variable correction coefficients. These coefficients were used to correct the X-ray data without significantly increasing computer core requirements. The binary interaction data were obtained by running Colby's MAGIC 4 program in the reverse mode. The data for each binary interaction were represented by polynomial coefficients obtained by least-squares fitting a third-order polynomial. Polynomial coefficients were generated for most of the common binary interactions at different accelerating potentials and are included. Results are presented for the analyses of several alloy standards to demonstrate the applicability of this correction procedure.

Unnam, J.↗
NASA NTRS1979

Failure analysis of composite laminates with free edges

Linear elastic stress distributions obtained from a refined finite element mesh are used in conjunction with the tensor polynomial failure criterion to predict the initiation of failure in symmetric, finite-width graphite-epoxy laminates under tensile loading. Results are presented for a wide variety of laminates including: (+ and - theta)s angle-ply; cross-ply (0/90)s and (90/0)s; and quasi-isotropic (90/0/+ and - 45)s and (+ and -45/0/90)s. It is shown that the elastic stress distributions generally compare favorably with other published results, but also indicate improved satisfaction of the stress-free boundary conditions and indicate some differences in the singular behavior of selected stress components at the free edge. The tensor polynomial failure criterion is used to predict the location and mode of first failure. Examination of the individual terms of the polynomial indicates different modes of failure depending upon the laminate configuration.

Herakovich, C. T.↗
NASA NTRS1982

Tensile stress-strain behavior of graphite/epoxy laminates

The tensile stress-strain behavior of a variety of graphite/epoxy laminates was examined. Longitudinal and transverse specimens from eleven different layups were monotonically loaded in tension to failure. Ultimate strength, ultimate strain, and strss-strain curves wee obtained from four replicate tests in each case. Polynominal equations were fitted by the method of least squares to the stress-strain data to determine average curves. Values of Young's modulus and Poisson's ratio, derived from polynomial coefficients, were compared with laminate analysis results. While the polynomials appeared to accurately fit the stress-strain data in most cases, the use of polynomial coefficients to calculate elastic moduli appeared to be of questionable value in cases involving sharp changes in the slope of the stress-strain data or extensive scatter.

Garber, D. P.↗
NASA NTRS1982

Processing MAGSAT data for comparison with geoid anomalies

A digital data library of MAGSAT data consisting of 1,615,636 measurements from the quiet data set, is geographically sorted, and allows rapid analysis and processing of all the quiet magnetic data about any selected location. Because this library of MAGSAT data is compatible with existing gravity and geoid data library processing and display system software, correlations between MAGSAT, surface gravity, GEOS-3 radar altimeter geoid and bathymetric data sets can be conveniently detected and analyzed. Polynomial trends from each half-orbit were removed as an effective way of estimating and removing ring current effects following estimation of the core field contribution. It was found that a third order polynomial is the lowest polynomial order that appears to provide the best consistency of residual anomalies between coincident orbits.

Bowin, C. O.↗
NASA NTRS1983

Geometric accuracy of LANDSAT-4 MSS image data

Analyses of the LANDSAT-4 MSS image data of North Georgia provided by the EDC in CCT-p formats reveal that errors of approximately + or - 30 m in the raw data can be reduced to about + or - 55 m based on rectification procedures involving the use of 20 to 30 well-distributed GCPs and 2nd or 3rd degree polynomial equations. Higher order polynomials do not appear to improve the rectification accuracy. A subscene area of 256 x 256 pixels was rectified with a 1st degree polynomial to yield an RMSE sub xy value of + or - 40 m, indicating that USGS 1:24,000 scale quadrangle-sized areas of LANDSAT-4 data can be fitted to a map base with relatively few control points and simple equations. The errors in the rectification process are caused by the spatial resolution of the MSS data, by errors in the maps and GCP digitizing process, and by displacements caused by terrain relief. Overall, due to the improved pointing and attitude control of the spacecraft, the geometric quality of the LANDSAT-4 MSS data appears much improved over that of LANDSATS -1, -2 and -3.

Welch, R.↗
NASA NTRS1985

Simplified Convolution Codes

Simple recursive algorithm efficiently calculates minimum-weight error vectors using Diophantine equations. Recursive algorithm uses general solution of polynomial linear Diophantine equation to determine minimum-weight error polynomial vector in equation in polynomial space.

Truong, T. K.↗
NASA NTRS1984

Optimum Cyclic Redundancy Codes for Noisier Channels

Binary cyclic redundancy codes for feedback communication over noisy digital links are considered. The standard 16 bit American Data and Computer Communication Protocol (ADCCP) polynomial is designed for digital links which already have a low input bit error probability. For file transfer between personal computers over telephone circuits, the quality of resulting digital circuit may be much lower. The 3 byte (24 bit) and 4 byte (32 bit) polynomials are considered. Generator polynomials of a certain class have minimum weight and yet achieve the bound on minimum distance for arbitrary codes. Particular choices for 24 bit and 32 bit redundancies are exhibited: of weight and distance 6 in the 24-bit case; and weight 10 and distance 8 in the 32-bit case.

Merkey, P.↗
NASA NTRS1984

Geometric Accuracy of LANDSAT-4 MSS Image Data

Analyses of the LANDSAT-4 MSS image data of North Georgia provided by the EDC in CTT-p formats reveal that errors of approximately + or - 30 m in the raw data can be reduced to about + or - 55 m based on rectification procedures involving the use of 20 to 30 well-distributed GCPs and 2nd or 3rd degree polynomial equations. Higher order polynomials do not appear to improve the rectification accuracy. A subscene area of 256 by 256 pixels was rectified with a 1st degree polynomial to yield an RMSE sub xy value of + or - 40 m, indicating that USGS 1:24,000 scale quadrangle-sized areas of LANDSAT-4 data can be fitted to a map base with relatively few control points and simple equations. The errors in the rectification process are caused by the spatial resolution of the MSS data, by errors in the maps and GCP digitizing process, and by displacements caused by terrain relief. Overall, due to the improved pointing and attitude control of the spacecraft, the geometric quality of the LANDSAT-4 MSS data appears much improved over that of LANDSAT-1, -2 AND -3.

Welch, R.↗
NASA NTRS1984

Exponential-fitted methods for integrating stiff systems of ordinary differential equations: Applications to homogeneous gas-phase chemical kinetics

Conventional algorithms for the numerical integration of ordinary differential equations (ODEs) are based on the use of polynomial functions as interpolants. However, the exact solutions of stiff ODEs behave like decaying exponential functions, which are poorly approximated by polynomials. An obvious choice of interpolant are the exponential functions themselves, or their low-order diagonal Pade (rational function) approximants. A number of explicit, A-stable, integration algorithms were derived from the use of a three-parameter exponential function as interpolant, and their relationship to low-order, polynomial-based and rational-function-based implicit and explicit methods were shown by examining their low-order diagonal Pade approximants. A robust implicit formula was derived by exponential fitting the trapezoidal rule. Application of these algorithms to integration of the ODEs governing homogenous, gas-phase chemical kinetics was demonstrated in a developmental code CREK1D, which compares favorably with the Gear-Hindmarsh code LSODE in spite of the use of a primitive stepsize control strategy.

Pratt, D. T.↗