SEARCH · Search NASA

Results for “Algorithm”

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.

SourceResearch connectionFrom yearThrough year

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

At least 1,063 records · Page 59

All sources NASA NTRS DOE OSTI

NASA NTRS1976

A computerized compensator design algorithm with launch vehicle applications

This short paper presents a computerized algorithm for the design of compensators for large launch vehicles. The algorithm is applicable to the design of compensators for linear, time-invariant, control systems with a plant possessing a single control input and multioutputs. The achievement of frequency response specifications is cast into a strict constraint mathematical programming format. An improved solution algorithm for solving this type of problem is given, along with the mathematical necessities for application to systems of the above type. A computer program, compensator improvement program (CIP), has been developed and applied to a pragmatic space-industry-related example.

Mitchell, J. R.↗

NASA NTRS1975

Real-time video compression algorithm for Hadamard transform processing

A real-time digital video processor using Hadamard transform techniques to reduce video bandwidth is described. The processor can be programmed with different parameters to investigate various algorithms for bandwidth compression. The processor is also adaptive in that it can select different parameter sets to trade off spatial resolution for temporal resolution in the regions of the picture that are moving. Algorithms used in programming the system are described along with results achieved at various levels of compression. The algorithms relate to spatial compression, temporal compression, and the adaptive selection of parameter sets.

Knauer, S. C.↗

NASA NTRS1976

Evaluation of algorithms for estimating wheat acreage from multispectral scanner data

The author has identified the following significant results. Fourteen different classification algorithms were tested for their ability to estimate the proportion of wheat in an area. For some algorithms, accuracy of classification in field centers was observed. The data base consisted of ground truth and LANDSAT data from 55 sections (1 x 1 mile) from five LACIE intensive test sites in Kansas and Texas. Signatures obtained from training fields selected at random from the ground truth were generally representative of the data distribution patterns. LIMMIX, an algorithm that chooses a pure signature when the data point is close enough to a signature mean and otherwise chooses the best mixture of a pair of signatures, reduced the average absolute error to 6.1% and the bias to 1.0%. QRULE run with a null test achieved a similar reduction.

Nalepka, R. F.↗

NASA NTRS1976

An algorithm for constructing minimal order inverses

In this paper an algorithm is presented for constructing minimal order inverses of linear, time invariant, controllable and observable, multivariable systems. By means of simple matrix operations, a 'state-overdescribed' system is first constructed which is an inverse of the given multivariable system. A simple Gauss-Jordan type reduction procedure is then used to remove the redundancy in the state vector of the inverse system to obtain a minimal order inverse. When the given multivariable system is not invertible, the algorithm enables a minimal order inverse of an invertible subsystem to be constructed. Numerical examples are given to illustrate the use of the algorithm.

Patel, R. V.↗

NASA NTRS1977

Flight data processing with the F-8 adaptive algorithm

An explicit adaptive control algorithm based on maximum likelihood estimation of parameters has been designed for NASA's DFBW F-8 aircraft. To avoid iterative calculations, the algorithm uses parallel channels of Kalman filters operating at fixed locations in parameter space. This algorithm has been implemented in NASA/DFRC's Remotely Augmented Vehicle (RAV) facility. Real-time sensor outputs (rate gyro, accelerometer and surface position) are telemetered to a ground computer which sends new gain values to an on-board system. Ground test data and flight records were used to establish design values of noise statistics and to verify the ground-based adaptive software. The software and its performance evaluation based on flight data are described

Hartmann, G.↗

NASA NTRS1977

PCSYS: The optimal design integration system picture drawing system with hidden line algorithm capability for aerospace vehicle configurations

A vehicle geometric definition based upon quadrilateral surface elements to produce realistic pictures of an aerospace vehicle. The PCSYS programs can be used to visually check geometric data input, monitor geometric perturbations, and to visualize the complex spatial inter-relationships between the internal and external vehicle components. PCSYS has two major component programs. The between program, IMAGE, draws a complex aerospace vehicle pictorial representation based on either an approximate but rapid hidden line algorithm or without any hidden line algorithm. The second program, HIDDEN, draws a vehicle representation using an accurate but time consuming hidden line algorithm.

Hague, D. S.↗

NASA NTRS1977

An asymptotic analysis of a general class of signal detection algorithms

For applications to the problem of radio frequency interference identification, or in the search for extraterrestrial intelligence, it is important to have a basic understanding of signal detection algorithms. A general technique for assessing the asymptotic sensitivity of a broad class of signal detection algorithms is given. In these algorithms, the decision is based on the value of X sub 1 + X sub 2...+ X sub n where the X sub 1's are obtained by sampling and preliminary processing of a physical process.

Mceliece, R. J.↗

NASA NTRS1977

Status report: Data management program algorithm evaluation activity at Marshall Space Flight Center

An algorithm evaluation activity was initiated to study the problems associated with image processing by assessing the independent and interdependent effects of registration, compression, and classification techniques on LANDSAT data for several discipline applications. The objective of the activity was to make recommendations on selected applicable image processing algorithms in terms of accuracy, cost, and timeliness or to propose alternative ways of processing the data. As a means of accomplishing this objective, an Image Coding Panel was established. The conduct of the algorithm evaluation is described.

Jayroe, R. R., Jr.↗

NASA NTRS1977

An algorithm for the automatic synchronization of Omega receivers

The Omega navigation system and the requirement for receiver synchronization are discussed. A description of the synchronization algorithm is provided. The numerical simulation and its associated assumptions were examined and results of the simulation are presented. The suggested form of the synchronization algorithm and the suggested receiver design values were surveyed. A Fortran of the synchronization algorithm used in the simulation was also included.

Stonestreet, W. M.↗

NASA NTRS1978

A fast DFT algorithm using complex integer transforms

Winograd's algorithm for computing the discrete Fourier transform is extended considerably for certain large transform lengths. This is accomplished by performing the cyclic convolution, required by Winograd's method, by a fast transform over certain complex integer fields. This algorithm requires fewer multiplications than either the standard fast Fourier transform or Winograd's more conventional algorithms.

Reed, I. S.↗

NASA NTRS1978

A new hybrid algorithm for computing a fast discrete Fourier transform

For certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform is extended considerably. This is accomplished by performing the cyclic convolution, required by Winograd's method, with the Mersenne-prime number theoretic transform. This new algorithm requires fewer multiplications than either the standard fast Fourier transform or Winograd's more conventional algorithm.

Reed, I. S.↗

NASA NTRS1977

A two-level trajectory decomposition algorithm featuring optimal intermediate target selection

A decomposition algorithm is presented which optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.

Petersen, F. M.↗

NASA NTRS1978

An interaction solution algorithm for viscous aerodynamic performance prediction

A weak-interaction solution algorithm is established for aerodynamic flow field prediction about an isolated airfoil. It requires numerical solution of differential equations governing potential flow, viscous and turbulent boundary layer flow, and the turbulent wake flow downstream of a trailing edge. The algorithm accounts for computed viscous displacement effects on the potential flow. These in turn alter the viscous flow through imposed pressure gradients. Closure for turbulence is accomplished using a second order model. Numerical evaluations assess factors affecting solution accuracy, convergence and stability for the combined potential, boundary layer, and parabolic Navier-Stokes equation systems as solved using a finite element algorithm.

Baker, A. J.↗

NASA NTRS1977

Evaluation of an infrared horizon scanner bias determination algorithm for earth-oriented spacecraft

An algorithm for estimating infrared horizon scanner biases for earth-oriented spacecraft is presented. A mathematical description of the proposed algorithm is given, and the algorithm is evaluated for use by two earth-oriented spacecraft: the Applications Explorer Missions-A/Heat Capacity Mapping Mission (AEM-A/HCMM) and Seasat-A. The results of this study indicate that scanner alignment and calibration errors appear as nearly constant biases in the scanner pitch and roll data and that these constant biases can be estimated to within 0.05 degree for AEM-A and 0.03 degree for Seasat-A.

Hotovy, S. G.↗

NASA NTRS1978

Approximate algorithms for fast optimal attitude computation

Fast accurate algorithms are presented for computing an optimal attitude which minimizes a quadratic loss function. These algorithms compute an optimal rotation which carries a set of reference vectors into a set of corresponding observation vectors. Simplifications of these algorithms are obtained for the case of small rotation angles. Applications to the Magsat mission are discussed.

Shuster, M. D.↗

NASA NTRS1978

On a new algorithm for time step integration of nonlinear systems

A new implicit algorithm for time step integration of finite element structural dynamic equations is presented. Convergence, stability and numerical damping properties are discussed. Due to the way nonlinear structural behavior is taken into account, the algorithm is expected to compare favorably with existing ones. Some simple numerical results are presented. A related explicit algorithm is also derived and shortly discussed.

Anderheggen, E.↗

NASA NTRS1978

The Lanczos algorithm with selective orthogonalization

A new stable and efficient implementation of the Lanczos algorithm is presented. The algorithm is a powerful method for finding a few eigenvalues and eigenvectors at one or both ends of the spectrum of a symmetric matrix A. The algorithm is particularly effective if A is large and sparse in that the only way in which A enters the calculation is through a subroutine which computes Av for any vector v. Thus the user is free to take advantage of any sparsity structure in A and A need not even be represented as a matrix et al.

Parlett, B. N.↗

NASA NTRS1978

An algorithm for optimal structural design with frequency constraints

The paper presents a finite element method for minimum weight design of structures with lower-bound constraints on the natural frequencies, and upper and lower bounds on the design variables. The design algorithm is essentially an iterative solution of the Kuhn-Tucker optimality criterion. The three most important features of the algorithm are: (1) a small number of design iterations are needed to reach optimal or near-optimal design, (2) structural elements with a wide variety of size-stiffness may be used, the only significant restriction being the exclusion of curved beam and shell elements, and (3) the algorithm will work for multiple as well as single frequency constraints. The design procedure is illustrated with three simple problems.

Kiusalaas, J.↗