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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
NASA NTRS1974

Families of shift-register sequences with impulsive correlation properties

A study of the linear feedback shift registers corresponding to a subset of nonprimitive irreducible polynomials over GF(2) has uncovered a class of sequences with interesting structures and cyclic correlation properties. These families of sequences are made up of interleaved identical sequences which are from primitive irreducible polynomials. Furthermore, they have correlation functions which are two or three valued, being constant at zero or a small value throughout most of their length with the exception of a small number of impulses. Each interval between such impulses on the correlograms uniquely corresponds to (and thus uniquely identifies) the member sequence or sequences producing it. It is shown that these families of sequences have direct application as error-correcting codes.

Lee, J.-J.↗
NASA NTRS1975

Analysis of bonded joints

A refined elastic analysis of bonded joints which accounts for transverse shear deformation and transverse normal stress was developed to obtain the stresses and displacements in the adherends and in the bond. The displacements were expanded in terms of polynomials in the thicknesswise coordinate; the coefficients of these polynomials were functions of the axial coordinate. The stress distribution was obtained in terms of these coefficients by using strain-displacement and stress-strain relations. The governing differential equations were obtained by integrating the equations of equilibrium, and were solved. The boundary conditions (interface or support) were satisfied to complete the analysis. Single-lap, flush, and double-lap joints were analyzed, along with the effects of adhesive properties, plate thicknesses, material properties, and plate taper on maximum peel and shear stresses in the bond. The results obtained by using the thin-beam analysis available in the literature were compared with the results obtained by using the refined analysis. In general, thin-beam analysis yielded reasonably accurate results, but in certain cases the errors were high. Numerical investigations showed that the maximum peel and shear stresses in the bond can be reduced by (1) using a combination of flexible and stiff bonds, (2) using stiffer lap plates, and (3) tapering the plates.

Srinivas, S.↗
NASA NTRS1975

Analytical theory for artificial satellites

A theory for generating segmented ephemerides is discussed as a means for fast generation and simple retrieval of nominal orbit data. Over a succession of finite intervals of time, the orbit is represented by a best approximation expressed by Chebyshev polynomials. Storage of coefficients tables for Chebyshev polynomials is seen as a method to reduce data and decrease transmission costs. A general algorithm was constructed and computer programs were designed. The possibility of storing an ephemeris for a few days in the on-board computer, or in microprocessors attached to the data collectors is suggested.

Deprit, A.↗
NASA NTRS1975

Geometric analysis and restitution of digital multispectral scanner data arrays

An investigation was conducted to define causes of geometric defects within digital multispectral scanner (MSS) data arrays, to analyze the resulting geometric errors, and to investigate restitution methods to correct or reduce these errors. Geometric transformation relationships for scanned data, from which collinearity equations may be derived, served as the basis of parametric methods of analysis and restitution of MSS digital data arrays. The linearization of these collinearity equations is presented. Algorithms considered for use in analysis and restitution included the MSS collinearity equations, piecewise polynomials based on linearized collinearity equations, and nonparametric algorithms. A proposed system for geometric analysis and restitution of MSS digital data arrays was used to evaluate these algorithms, utilizing actual MSS data arrays. It was shown that collinearity equations and nonparametric algorithms both yield acceptable results, but nonparametric algorithms possess definite advantages in computational efficiency. Piecewise polynomials were found to yield inferior results.

Baker, J. R.↗
NASA NTRS1975

Spline function approximation techniques for image geometric distortion representation

Least squares approximation techniques were developed for use in computer aided correction of spatial image distortions for registration of multitemporal remote sensor imagery. Polynomials were first used to define image distortion over the entire two dimensional image space. Spline functions were then investigated to determine if the combination of lower order polynomials could approximate a higher order distortion with less computational difficulty. Algorithms for generating approximating functions were developed and applied to the description of image distortion in aircraft multispectral scanner imagery. Other applications of the techniques were suggested for earth resources data processing areas other than geometric distortion representation.

Anuta, P. E.↗
NASA NTRS1975

Programs for computing abscissas and weights for classical and nonclassical Gaussian quadrature formulas

Computer programs for computing Gaussian quadrature abscissas and weights are described. For the classical case the programs use Laguerre iteration to compute abscissas as zeros of orthogonal polynomials. The polynomials are evaluated from known recursion coefficients. The nonclassical case is handled similarly except that the recursion coefficients are computed by numerical integration. A sample problem, with input and output, is presented to illustrate the use of the programs. It computes the quadrature abscissas and weights associated with the weight function over the interval (0,1) for quadrature orders from 16 to 96 in increments of 8.

Desmarais, R. N.↗
NASA NTRS1975

Compression of ephemerides

An algorithm is proposed for generating sequences of Chebyshev series which are the best approximations of an astronomical ephemeris in the sense of Chebyshev over large intervals of time. The criterion for a polynomial approximation of a function to be the best polynomial approximation of the function is that the error function present certain rippling characteristics as described by Remez (1957). General features of the program in PL/1 are described.

Deprit, A.↗
NASA NTRS1975

The non-uniform transformation strain problem for an anisotropic ellipsoidal inclusion

The problem of an anisotropic ellipsoidal inclusion which undergoes a stress-free transformation strain (in the sense of J. D. Eshelby) is considered, and the following theorem is proved: if an ellipsoidal region in an infinite anisotropic linear elastic medium undergoes, in the absence of its surroundings, a stress-free transformation strain which is a polynomial of degree M in given position coordinates, then the final stress and strain state in the transformed inclusion, when constrained by its surroundings, is also a polynomial of degree M in those position coordinates.

Asaro, R. J.↗
NASA NTRS1975

Air motion determination by tracking humidity patterns in isentropic layers

Determining air motions by tracking humidity patterns in isentropic layers was investigated. Upper-air rawinsonde data from the NSSL network and from the AVE-II pilot experiment were used to simulate temperature and humidity profile data that will eventually be available from geosynchronous satellites. Polynomial surfaces that move with time were fitted to the mixing-ratio values of the different isentropic layers. The velocity components of the polynomial surfaces are part of the coefficients that are determined in order to give an optimum fitting of the data. In the mid-troposphere, the derived humidity motions were in good agreement with the winds measured by rawinsondes so long as there were few or no clouds and the lapse rate was relatively stable. In the lower troposphere, the humidity motions were unreliable primarily because of nonadiabatic processes and unstable lapse rates. In the upper troposphere, the humidity amounts were too low to be measured with sufficient accuracy to give reliable results. However, it appears that humidity motions could be used to provide mid-tropospheric wind data over large regions of the globe.

Mancuso, R. L.↗
NASA NTRS1974

Design of state-feedback controllers including sensitivity reduction, with applications to precision pointing

The design procedure of feedback controllers was described and the considerations for the selection of the design parameters were given. The frequency domain properties of single-input single-output systems using state feedback controllers are analyzed, and desirable phase and gain margin properties are demonstrated. Special consideration is given to the design of controllers for tracking systems, especially those designed to track polynomial commands. As an example, a controller was designed for a tracking telescope with a polynomial tracking requirement and some special features such as actuator saturation and multiple measurements, one of which is sampled. The resulting system has a tracking performance comparing favorably with a much more complicated digital aided tracker. The parameter sensitivity reduction was treated by considering the variable parameters as random variables. A performance index is defined as a weighted sum of the state and control convariances that sum from both the random system disturbances and the parameter uncertainties, and is minimized numerically by adjusting a set of free parameters.

Hadass, Z.↗
NASA NTRS1976

Polyatomic molecule vibrations

Polyatomic molecule vibrations are analyzed as harmonic vibrations along normal coordinates. The energy eigenvalues are found for linear and nonlinear symmetric triatomic molecules for valence bond models of the potential function with arbitrary coupling coefficients; such models can usually be fitted to observed energy levels with reasonably good accuracy. Approximate normal coordinates for the H2O molecule are discussed. Degenerate vibrational modes such as occur in CO2 are analyzed and expressions for Fermi resonance between close-lying states of the same symmetry are developed. The bending modes of linear triatomic molecules are expressed in terms of Laguerre polynomials in cylindrical coordinates as well as in terms of Hermite polynomials in Cartesian coordinates. The effects of large-amplitude bending such as occur in the C3 molecule are analyzed, along with anharmonic effects, which split the usually degenerate bending mode energy levels. Finally, the vibrational frequencies, degeneracies, and symmetry properties of XY3, X2Y2, and XY4 type molecules are discussed.

Source record↗
NASA NTRS1976

Large amplitude free vibrations of tapered beams

The Galerkin method is used to investigate the large-amplitude free vibrations of simply supported and clamped tapered beams of rectangular cross-section which are frequently encountered in practical structures. Two types of linear tapers are considered: breadth and depth tapers. Two solutions are obtained for each type of taper, using trigonometric and polynomial displacement distributions. Frequency-amplitude relationships are obtained for all these cases for the fundamental flexural mode. The results indicate good agreement between trigonometric and polynomial solutions for all cases. The nonlinearity is noted to be always of the hardening type and, as expected, it is severe for beams with depth taper as compared with beams with breadth taper.

Raju, L. S.↗
NASA NTRS1977

On the inherent intractability of finding good codes

The problem of computing the minimum distance of an arbitrary binary linear code is non-polynomial complete. This strongly suggests, but does not imply, that it is impossible to design a computer algorithm for computing the minimum distance of an arbitrary code whose running time is bounded by a polynomial in the number of inputs.

Mceliece, R. J.↗
NASA NTRS1977

Preserving sparseness in multivariate polynominal factorization

Attempts were made to factor these ten polynomials on MACSYMA. However it did not get very far with any of the larger polynomials. At that time, MACSYMA used an algorithm created by Wang and Rothschild. This factoring algorithm was also implemented for the symbolic manipulation system, SCRATCHPAD of IBM. A closer look at this old factoring algorithm revealed three problem areas, each of which contribute to losing sparseness and intermediate expression growth. This study led to effective ways of avoiding these problems and actually to a new factoring algorithm. The three problems are known as the extraneous factor problem, the leading coefficient problem, and the bad zero problem. These problems are examined separately. Their causes and effects are set forth in detail; the ways to avoid or lessen these problems are described.

Wang, P. S.↗
NASA NTRS1977

A new algorithm for the integration of exponential and logarithmic functions

An algorithm for symbolic integration of functions built up from the rational functions by repeatedly applying either the exponential or logarithm functions is discussed. This algorithm does not require polynomial factorization nor partial fraction decomposition and requires solutions of linear systems with only a small number of unknowns. It is proven that if this algorithm is applied to rational functions over the integers, a computing time bound for the algorithm can be obtained which is a polynomial in a bound on the integer length of the coefficients, and in the degrees of the numerator and denominator of the rational function involved.

Rothstein, M.↗
NASA NTRS1977

Recurrence relations for computing with modified divided differences

Modified divided differences (MDD) provide a good way of representing a polynomial passing through points with unequally spaced abcissas. Recurrence relations for computing coefficients in either the monomial or Chebyshev basis from the MDD coefficients, and for computing the MDD coefficients for either the differentiated or the integrated polynomial are given. The latter operation is likely to be useful if MDD are used in a method for solving stiff differential equations.

Krogh, F.↗
NASA NTRS1977

New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities

An upper bound on the rate of a binary code as a function of minimum code distance (using a Hamming code metric) is arrived at from Delsarte-MacWilliams inequalities. The upper bound so found is asymptotically less than Levenshtein's bound, and a fortiori less than Elias' bound. Appendices review properties of Krawtchouk polynomials and Q-polynomials utilized in the rigorous proofs.

Mceliece, R. J.↗