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 145 records · Page 8

Multiple zeros of polynomials

Analysis of four iterative methods for approximating zeros of polynomial expressions using digital computer

Wood, C. A.↗

Computation of solar wind parameters from the OGO-5 plasma spectrometer data using Hermite polynomials

The method used to calculate the velocity, temperature, and density of the solar wind plasma is presented from spectra obtained by attitude-stabilized plasma detectors on the earth satellite OGO 5. The method, which used expansions in terms of Hermite polynomials, is very inexpensive to implement on an electronic computer compared to the least-squares and other iterative methods often used for similar problems.

Neugebauer, M.↗

Polynomial filter estimation of range and range rate for terminal rendezvous

A study was made of a polynomial filter for computing range rate information from CSM VHF range data. The filter's performance during the terminal phase of the rendezvous is discussed. Two modifications of the filter were also made and tested. A manual terminal rendezvous was simulated and desired accuracies were achieved for vehicles on an intercept trajectory, except for short periods following each braking maneuver when the estimated range rate was initially in error by the magnitude of the burn.

Philips, R.↗

Polynomial smoothing of DRVID data

Charged particle calibrations based on differenced range versus integrated Doppler (DRVID) are smoothed and fitted with a polynomial prior to its application in the orbit determination process. A description is given of the results of the tests performed on the computer program performing these calculations to determine its characteristics and to evaluate the acceptability of its computations. This program, called MEDIA, is described.

Leavitt, R. K.↗

Evaluation of fatigue-crack growth rates by polynomial curve fitting

Fundamental characterization of the constant-amplitude fatigue crack propagation is achieved by an analysis of the rate of change of crack length with change in number of applied loading cycles, defining the rate values such that they are consistent with the basic assumption of smoothness and continuity in the fatigue crack growth process. The technique used to satisfy the analytical conditions and minimize the effects of local material anomalies and experimental errors is that of fitting a smooth curve to the entire set of basic data by least square regression. This yields a well-behaved function relating the number of cycles to the crack length. By taking the first derivative of the function, the crack growth rate is obtained for each point. The class of curve fitting functions used in the analysis is the polynomial of degree n.

Davies, K. B.↗

Method of Characteristics Calculations and Computer Code for Materials with Arbitrary Equations of State and Using Orthogonal Polynomial Least Square Surface Fits

A numerical scheme using the method of characteristics to calculate the flow properties and pressures behind decaying shock waves for materials under hypervelocity impact is developed. Time-consuming double interpolation subroutines are replaced by a technique based on orthogonal polynomial least square surface fits. Typical calculated results are given and compared with the double interpolation results. The complete computer program is included.

Chang, T. S.↗

Experimental evaluation of the tensor polynomial failure criterion for the design of composite structures

The experimental measures and techniques are described which are used to obtain the strength tensor components, including cubic terms. Based on a considerable number of biaxial pressure tests together with specimens subjected to a constant torque and internal pressure, a modified form of the plane stress tensor polynomial failure equation was obtained that was capable of predicting ultimate strength results well. Preliminary data were obtained to determine the effect of varying post cure times and ambient temperatures (-80 F to 250 F) on the change in two tensor strength terms, F sub 2 and F sub 22. Other laminate configurations yield corresponding variations for the remaining strength parameters.

Tennyson, R. C.↗

An algebraic approach to image de-smearing: Symmetries of polynomials and their zeros

Frequently a photograph received from a spacecraft will be smeared by some process, e.g., by camera motion. Algebraically such smearing can be represented as p = sigma f, where sigma is the true picture, p is the received picture, and f is the smearing function. (p, sigma, and f are polynomials in two variables x and y.) Thus, in principle, sigma can be recovered by multiplying p by 1/f. However, there are problems involved in computing 1/f. Some of these problems are investigated.

Johnson, D. L.↗

Separating and turbulent boundary layer calculations using polynomial interpretation

Higher order numerical methods derived from polynomial spline interpolation or Hermitian differencing are applied to a separating laminar boundary layer, i.e., the Howarth problem, and the turbulent flat plate boundary layer flow. Preliminary results are presented. It is found that accuracy equal to that of conventional second order accurate finite difference methods is achieved with many fewer mesh points and with reduced computer storage and time requirements.

Rubin, S. G.↗

On the equivalence of polynomial GCD and squarefree factorization problems

It is shown that a closer reexamination of Yun's 1976 paper reveals the reducibility of SQFR to GCD. The natural question that follows is whether GCD is reducible to SQFR. That is answered affirmatively and the derivation actually suggests an algorithm for computing GCD's when input polynomials are already represented by their SQFR form.

Yun, D. Y. Y.↗

Least squares polynomial fits and their accuracy

Equations are presented which attempt to fit least squares polynomials to tables of date. It is concluded that much data are needed to reduce the measurement error standard deviation by a significant amount, however at certain points great accuracy is attained.

Lear, W. M.↗

A computer program to find the kernel of a polynomial operator

This paper presents a FORTRAN program written to solve for the kernel of a matrix of polynomials with real coefficients. It is an implementation of Sain's free modular algorithm for solving the minimal design problem of linear multivariable systems. The structure of the program is discussed, together with some features as they relate to questions of implementing the above method. An example of the use of the program to solve a design problem is included.

Gejji, R. R.↗