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 415 records · Page 23

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.↗

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.↗

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.↗

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.↗

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.↗

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.↗

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↗

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.↗

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.↗

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.↗

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.↗

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.↗

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.↗

Routh's algorithm - A centennial survey

One hundred years have passed since the publication of Routh's fundamental work on determining the stability of constant linear systems. The paper presents an outline of the algorithm and considers such aspects of it as the distribution of zeros and applications of it that relate to the greatest common divisor, the abscissa of stability, continued fractions, canonical forms, the nonnegativity of polynomials and polynomial matrices, the absolute stability, optimality and passivity of dynamic systems, and the stability of two-dimensional circuits.

Barnett, S.↗

Prediction of compliant wall drag reduction, part 1

Computer codes developed to test Bushnell's compliant wall drag reduction model are discussed. One code computes the evolution of mean velocity profiles during the period between bursts as forced by an imposed large-scale pressure pulse due to earlier bursts. Another code computes the local stability characteristics of these computed profiles. The programs use Chebyshev polynomials to resolve the normal boundary layer (y) direction and a staggered grid of mesh points to resolve the x direction. Typically, 257 grid points and 33 Chebyshev polynomials are used in the computations.

Orszag, S. A.↗

Improved ground truth geoid for the GEOS-3 calibration area

The purpose of this investigation is to develop methods and procedures are reported for computing a detailed geoid to be used as geodetic ground truth for the calibration and verification of GEOS-3 altimeter data. The technique developed is based on rectifying the best available detailed geoid so that the rectified geoid will have correct scale, orientation, shape and position with respect to the geocenter. The approach involved the development of a mathematical model based on a second degree polynomial, in rectangular Cartesian coordinates, describing the geoid undulations at the control stations. A generalized least squares solution was obtained for the polynomial which describes the variation of the undulation differences between the control stations geoid and the gravimetric geoid. Three rectified geoid were determined. These geoids correspond to three sets of tracking station data: (1) WFC/C-band data; (2) GSFC/C-band data; and (3) OSU-275 data. The absolute accuracy of these rectified geoids is linearly correlated with the uncertainties of the tracking station coordinates and, to a certain extent, with those of the detailed geoid being rectified.

Mourad, A. G.↗

A note of expansions of functions of velocity in the two-body problem

Fourier expansions based on both the true anomaly and the mean anomaly are obtained for the functions of velocity in the two-body problem; the series of coefficients is written from classical formulae involving associated Legendre polynomials, Gegenbauer polynomials, or Bessel functions. The Fourier expansions are compared with the expansions in powers of eccentricity developed by Broucke (1974) through use of computerized Poisson series manipulation.

Kinoshita, H.↗

Polynominal Interpolation Methods for Viscous Flow Calculations

Higher-order collocation procedures resulting in tridiagonal matrix systems are derived from polynomial spline interpolation and by Hermitian (Taylor series) finite-difference discretization. The similarities and special features of these different developments are discussed. The governing systems apply for both uniform and variable meshes. Hybrid schemes resulting from two different polynomial approximations for the first and second derivatives lead to a nonuniform mesh extension of the so-called compact or Pad? difference technique (Hermite 4). A variety of fourth-order methods are described and the Hermitian approach is extended to sixth-order (Hermite 6). The appropriate spline boundary conditions are derived for all procedures. For central finite differences, this leads to a two-point, second-order accurate generalization of the commonly used three-point end-difference formula. Solutions with several spline and Hermite procedures are presented for the boundary layer equations, with and without mass transfer, and for the incompressible viscous flow in a driven cavity. Divergence and nondivergence equations are considered for the cavity. Among the fourth-order techniques, it is shown that spline 4 has the smallest truncation error. The spline 4 procedure generally requires one-quarter the number of mesh points in a given coordinate direction as a central finite-difference calculation of equal accuracy. The Hermite 6 procedure leads to remarkably accurate boundary layer solutions.

Rubin, S. G.↗