Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative”

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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
NASA NTRS1972

Iterative explicit guidance for low thrust spacecraft.

A retargeting procedure is developed for use as a nonlinear low thrust guidance scheme. The selection of a control program composed of a sequence of inertially fixed thrust-acceleration vectors permits all trajectory computations to be made with closed form expressions, and allows the controls to be represented by constant parameters, thrust-acceleration vectors and thrusting times. By requiring each trajectory to be time optimal, the guidance problem is transformed into a parameter optimization problem which is solved by the conjugate gradient method. The scheme is applied to a low thrust capture mission, and the results of computer simulations are presented.

Jacobson, R. A.↗
NASA NTRS1973

A two-dimensional, iterative solution for the jet flap

A solution is presented for the jet-flapped wing in two dimensions. The main flow is assumed to be inviscid and incompressible. The flow inside the jet is considered irrotational and the upper and lower boundaries between the jet and free stream are assumed to behave as vortex sheets which allow no mixing. The solution is found to be in satisfactory agreement with two dimensional experimental results and other theoretical work for intermediate values of momentum coefficient, but the regions of agreement vary with jet exit angle. At small values of momentum coefficient, the trajectory for the jet, as computed by this method, has more penetration than that of other available data, while at high values of moment coefficient this solution results in less penetration of the jet into the main flow.

Herold, A. C.↗
NASA NTRS1973

An Iterative Approach to the Feature Selection Problem

The problem dealt with concerns feature selection or reducing the dimension of the data to be processed from n to k. By reducing the dimension of the data from n to k, classification time is generally reduced. Yet the dimension reduction should not be so great that classification accuracy is impaired. Thus, the general problem is considered of classifying an n-dimensional observation vector x into one of m-distinct classes where each class is normally distributed with mean and covariance. It is shown that the probability of misclassification is minimized if a maximum likelihood classification procedure is used to classify the data. The dimension of each observation vector to be processed is conveniently reduced by performing the transformation y = Bx, where B is a K by n matrix of rank k. Thus, the n-dimensional classification problem transforms into a k-dimensional classification problem.

Decell, H. P., Jr.↗
NASA NTRS1973

An iterative approach to the feature selection problem

The B-average divergence for m-distinct classes, resulting from the linear transformation y = Bx, is proposed as a feature selection criterion, where B is a k by n matrix of rank k not greater than n. It is shown that if the B-average divergence resulting from B is large enough, then the probability of misclassification, considered as a function f the class of all k by n matrices, is essentially minimized by B. A computer program, utilizing a gradient procedure, is developed to numerically maximize the B-average divergence and results are presented for the Cl flight line. For this example, corresponding to 9-distinct classes, most of the discriminatory information is found to lie in a 3-dimensional subspace, defined by an appropriately chosen 3 by 12 matrix B.

Decell, H. P., Jr.↗
NASA NTRS1973

Iterative techniques to estimate signature vectors for mixture processing of multispectral data

Two methods for obtaining the required spectral signatures for a particular mixture model are considered. For the model considered, the spectral signatures become signature vectors. The first method is based upon determination of the signature vectors in such a way that a measure of the inconsistency between the mixture model and the observed data is minimized. The second method is based upon determination of the signature vectors in such a way that the estimated mean percentage coverage of individual species matches apriori or ground truth estimates. The two methods proposed are applied to actual multispectral data in order to verify the concepts presented.

Salvato, P., Jr.↗