Engineering Papers⌕ Search

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.

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

At least 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS1981

Fast polynomial transform and its implementation by computer

A fast polynomial transform (FPT) algorithm for computing two-dimensional cyclic convolutions on a general-purpose computer is demonstrated and compared with the FFT approach. An FPT program for two-dimensional convolutions written in FORTRAN is shown to be 20% faster than the conventional FFT algorithm. This higher speed advantage makes the FPT algorithm a candidate for many two-dimensional digital image filtering applications.

Reed, I. S.↗
NASA NTRS1981

Digital SAR processing using a fast polynomial transform

A new digital processing algorithm based on the fast polynomial transform is developed for producing images from Synthetic Aperture Radar data. This algorithm enables the computation of the two dimensional cyclic correlation of the raw echo data with the impulse response of a point target, thereby reducing distortions inherent in one dimensional transforms. This SAR processing technique was evaluated on a general-purpose computer and an actual Seasat SAR image was produced. However, regular production runs will require a dedicated facility. It is expected that such a new SAR processing algorithm could provide the basis for a real-time SAR correlator implementation in the Deep Space Network.

Butman, S.↗
NASA NTRS1980

Design of a recursive vector processor using polynomial splines

The problem of obtaining smoothed estimates of function values, particularly their derivatives, from a finite set of inaccurate measurements is considered. A recursive two-dimensional vector processor is introduced as an approximation to the nonrecursive constrained least-squares estimation. Here, piecewise bicubic Hermite polynomials are extensively used as approximating functions, and the smoothing integral is converted to a discrete quadratic form. This makes it possible to convert the problem of fitting an approximating function to one of estimating the function values and derivatives at the nodes.

Kim, C. S.↗
NASA NTRS1982

The optimization of convergence for Chebyshev polynomial methods in an unbounded domain

Grosch and Orszag (1977) have performed a numerical analysis of the problem of solving differential equations in a semiinfinite or infinite domain using Chebyshev polynomials. The principal limitation of the conducted study was that it was entirely empirical. Various differential equations were solved in different ways and the numbers were compared. The present investigation has the objective to extend the studies conducted by Grosch and Orszag by deriving asymptotic approximations to the Chebyshev coefficients of simple model functions. This approach makes it possible to conduct more systematic comparisons of different methods, extend the range of comparisons, and, perhaps most important, give simple analytic formulas for choosing the optimum domain size or mapping parameter L for various situations.

Boyd, J. P.↗
NASA NTRS1983

Convergence and stability properties of minimal polynomial and reduced rank extrapolation algorithms

The minimal polynomial and reduced rank extrapolation algorithms are two acceleration of convergence methods for sequences of vectors. In a recent survey these methods were tested and compared with the scalar, vector, topological epsilon algorithms, and were observed to be more efficient than the latter. It was also observed that the two methods have similar convergence properties. The convergence and stability properties of these methods are analyzed and the performance of the acceleration methods when applied to a class of vector sequences that includes those sequences obtained from systems of linear equations by using matrix iterative methods is discussed.

Sidi, A.↗
NASA NTRS1983

Polynomial driven time base and PN generator

In support of the planetary radar upgrade new hardware was designed to increase resolution and take advantage of new technology. Included is a description of the Polynomial Driven Time Base and PN Generator which is used for range gate coding in the planetary radar system.

Brokl, S. S.↗
NASA NTRS1984

Digital SAR processing using a fast polynomial transform

A new digital processing algorithm based on the fast polynomial transform is developed for producing images from Synthetic Aperture Radar data. This algorithm enables the computation of the two dimensional cyclic correlation of the raw echo data with the impulse response of a point target, thereby reducing distortions inherent in one dimensional transforms. This SAR processing technique was evaluated on a general-purpose computer and an actual Seasat SAR image was produced. However, regular production runs will require a dedicated facility. It is expected that such a new SAR processing algorithm could provide the basis for a real-time SAR correlator implementation in the Deep Space Network. Previously announced in STAR as N82-11295

Truong, T. K.↗
NASA NTRS1984

Comparison of various drag coefficient expansions using polynomials and splines

The longitudinal differential equation of motion has been used to investigate various aerodynamic expansion techniques. The total drag coefficient was expanded using conventional polynomials and splines with and without floating knot locations. This paper discusses the various techniques and approaches, compares results obtained from simultaneously fitting four separate flights (time vs distance measurements) and outlines the potential advantages and/or disadvantages of the various aerodynamic expansion techniques. It is believed that this is the first time splines have been used in the aerodynamic coefficient estimation process and that these results and techniques are germane to other applications.

Sabot, S. M.↗
NASA NTRS1986

A new VLSI complex integer multiplier which uses a quadratic-polynomial residue system with Fermat numbers

A quadratic-polynomial Fermat residue number system (QFNS) has been used to compute complex integer multiplications. The advantage of such a QFNS is that a complex integer multiplication requires only two integer multiplications. In this article, a new type Fermat number multiplier is developed which eliminates the initialization condition of the previous method. It is shown that the new complex multiplier can be implemented on a single VLSI chip. Such a chip is designed and fabricated in CMOS-pw technology.

Truong, T. K.↗
NASA NTRS1987

A new VLSI complex integer multiplier which uses a quadratic-polynomial residue system with Fermat numbers

A quadratic-polynomial Fermat residue number system (QFNS) has been used to compute complex integer multiplications. The advantage of such a QFNS is that a complex integer multiplication requires only two integer multiplications. In this article, a new type Fermat number multiplier is developed which eliminates the initialization condition of the previous method. It is shown that the new complex multiplier can be implemented on a single VLSI chip. Such a chip is designed and fabricated in CMOS-Pw technology.

Shyu, H. C.↗
NASA NTRS1989

Closure of the cubic tensor polynomial failure surface

An analytical method has been developed to ensure closure of the cubic form of the tensor polynomial strength criterion. The intrinsic complexity of the cubic function is such that special conditions must be met to close the failure surface in three-dimensional stress space. These requirements are derived in terms of non-intersecting conditions for asymptotes and an asymptotic plane. To demonstrate the validity of this approach, closed failure surfaces were derived for two graphite/epoxy material systems (3M SP288-T300 and IM7 8551-7). The agreement of test data with this model clearly shows that it is possible to use a higher order cubic failure theory with confidence.

Jiang, Zhiqing↗
NASA NTRS1990

Trigonometric Polynomials For Estimation Of Spectra

Orthogonal sets of trigonometric polynomials used as suboptimal substitutes for discrete prolate-spheroidal "windows" of Thomson method of estimation of spectra. As used here, "windows" denotes weighting functions used in sampling time series to obtain their power spectra within specified frequency bands. Simplified windows designed to require less computation than do discrete prolate-spheroidal windows, albeit at price of some loss of accuracy.

Greenhall, Charles A.↗
NASA NTRS1990

Efficient Implementation of Minimal Polynomial and Reduced Rank Extrapolation Methods

The minimal polynomial extrapolation (MPE) and reduced rank extrapolation (RRE) are two effective techniques that have been used in accelerating the convergence of vector sequences, such as those that are obtained from iterative solution of linear and nonlinear systems of equation. Their definitions involve some linear least squares problems, and this causes difficulties in their numerical implementation. Timewise efficient and numerically stable implementations for MPE and RRE are developed. A computer program written in FORTRAN 77 is also appended and applied to some model problems.

Sidi, Avram↗
NASA NTRS1991

Polynomial Transformations For Discrete-Time Linear Systems

Transformations based on polynomial matrices of finite degree developed for use in computing functions for compensation, inversion, and approximation of discrete-time, multivariable, linear systems. Method derived from z-transform transfer-function form of matrices. Applicable to cascade-compensation problems in design of control systems.

Baram, Yoram↗