Search NASA⌕ Search

SEARCH · Search NASA

Results for “Recursion”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
NASA NTRS1969

Derivation of a matrix identity.

Matrix identity associated with linear digital filtering and recursive estimating determined using matrix projection operators and properties

Hemami, H.↗
NASA NTRS1969

Computer

Arithmetic and code-checking routines of ILLAR system and recursive subprogram in FORTRAN compiler

Bouknight, J.↗
NASA NTRS1970

Berkeley array processor

Berkeley array processor /special purpose digital computer/ for correlation, convolution, recursive filtering, matrix multipication, etc

Dere, W. Y.↗
NASA NTRS1971

Toward automatic program synthesis

Automatic computer program synthesis based on theorem proving approach for construction of recursive and iterative programs operating on natural numbers, lists and trees

Manna, Z.↗
NASA NTRS1972

The calculation of the eigenvalues and eigenfunctions of Mathieu's equation

The eigenfunctions of Mathieu's equation are expanded in trigonometric series, and the resulting eigenvalue problem is cast in matrix form. This matrix is found to be a symmetric, triagonal matrix, and the eigenvalues are computed using the bisection method. The eigenfunction expansion coefficients are obtained by the standard recursion method. This computational technique for the eigenvalues and eigenfunctions of Mathieu's equation is both rapid and accurate.

Hodge, D. B.↗
NASA NTRS1971

An efficient parallel algorithm for the solution of a tridiagonal linear system of equations

Tridiagonal linear systems of equations are solved on conventional serial machines in a time proportional to N, where N is the number of equations. The conventional algorithms do not lend themselves directly to parallel computations on computers of the ILLIAC IV class, in the sense that they appear to be inherently serial. An efficient parallel algorithm is presented in which computation time grows as log sub 2 N. The algorithm is based on recursive doubling solutions of linear recurrence relations, and can be used to solve recurrence relations of all orders.

Stone, H. S.↗
NASA NTRS1971

State estimation with small nonlinearities

A variety of techniques is available for estimating the states of nonlinear dynamic systems from noisy data. The differences among several of these procedures in the presence of small dynamic and observational nonlinearities are investigated. Four discrete estimation algorithms are analyzed. The first is a strictly least square estimator, while the others are recursive algorithms similar to the Kalman filter used for estimating the states of linear systems. A group of analytic expressions is developed for the mean and covariance of the error in each of these estimators so that they may be compared without lengthy Monte Carlo simulations. The covariance expressions show that, to first order, all the estimators have the same covariance. Expressions for the means show that each estimator has a different bias. Several examples are carried out demonstrating that the relative magnitudes of the bias errors in the various estimators can be a strong function of such parameters as initial covariances and number of data points. Under some circumstances, more complicated algorithms can have larger biases than smaller ones.

Conrad, B.↗
NASA NTRS1972

The selection of approximating functions for tabulated numerical data

A computer program was developed that selects, from a list of candidate functions, the approximating functions and associated coefficients which result in the best curve fit of a given set of numerical data. The advantages of the approach used here are: (1) Multivariable approximations can be performed. (2) Flexibility with respect to the type of approximations used is available. (3) The program is designed to choose the best terms to be used in the approximation from an arbitrary list of possible terms so that little knowledge of the proper approximating form is required. (4) Recursion relations are used in determining the coefficients of the approximating functions, which reduces the computer execution time of the program.

Ingram, H. L.↗