Search NASA⌕ Search

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.

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

At least 1,045 records · Page 58
All sourcesNASA NTRSDOE OSTI
NASA NTRS1974

Star adaptation for two-algorithms used on serial computers

Two representative algorithms used on a serial computer and presently executed on the Control Data Corporation 6000 computer were adapted to execute efficiently on the Control Data STAR-100 computer. Gaussian elimination for the solution of simultaneous linear equations and the Gauss-Legendre quadrature formula for the approximation of an integral are the two algorithms discussed. A description is given of how the programs were adapted for STAR and why these adaptations were necessary to obtain an efficient STAR program. Some points to consider when adapting an algorithm for STAR are discussed. Program listings of the 6000 version coded in 6000 FORTRAN, the adapted STAR version coded in 6000 FORTRAN, and the STAR version coded in STAR FORTRAN are presented in the appendices.

Howser, L. M.↗
NASA NTRS1974

Study of genetic direct search algorithms for function optimization

The results are presented of a study to determine the performance of genetic direct search algorithms in solving function optimization problems arising in the optimal and adaptive control areas. The findings indicate that: (1) genetic algorithms can outperform standard algorithms in multimodal and/or noisy optimization situations, but suffer from lack of gradient exploitation facilities when gradient information can be utilized to guide the search. (2) For large populations, or low dimensional function spaces, mutation is a sufficient operator. However for small populations or high dimensional functions, crossover applied in about equal frequency with mutation is an optimum combination. (3) Complexity, in terms of storage space and running time, is significantly increased when population size is increased or the inversion operator, or the second level adaptation routine is added to the basic structure.

Zeigler, B. P.↗
NASA NTRS1973

A vehicle scheduling algorithm using non-serial discrete dynamic programming with space shuttle applications

Description of the development and operation of a vehicle-scheduling algorithm which has applications to the NASA problem of assigning payloads to space delivery vehicles. The algorithm is based on a discrete, integer-valued, nonserial, dynamic-programming solution to the classical problem of developing resource utilization plans with limited resources. The algorithm places special emphasis on incorporating interpayload (precedence) relationships; maintaining optimal alternate schedule definitions (a unique feature of dynamic programming) in the event of contingencies (namely, resource inventory changes) without problem resolution; and, by using a special information storage technique, reducing the computational complexity of solving realistic problems.

Dupnick, E.↗
NASA NTRS1974

Finite element solution algorithm for incompressible fluid dynamics

A finite element solution algorithm is established for the two-dimensional Navier-Stokes equations governing the transient motion of a viscous incompressible fluid, i.e., hydrodynamics. Dependent variable transformation renders the differential equation description uniformly elliptic. The finite element algorithm is established using the Galerkin criterion on a local basis within the Method of Weighted Residuals. It is unconstrained with respect to system linearity, computational mesh uniformity or solution domain closure regularity. The finite element matrices are established using a linear 'natural coordinate function' description. Computational solutions using the COMOC computer program illustrate the various features of the algorithm including recirculating flows.

Baker, A. J.↗
NASA NTRS1974

Weighted adaptive algorithms for estimation of Gaussian distribution parameters

Two weighted adaptive algorithms are proposed for updating the estimates of the mean vector and the covariance matrix, respectively, in a multispectral pattern recognition system. To achieve computational efficiency, the auxiliary matrices have been utilized in the algorithm for covariance matrix updating. Enhancements in the performance accuracy of a multispectral processing system and extensions of the Gaussian maximum likelihood classification capabilities to larger scale surveys are the motivations in developing the algorithms presented herein.

Chang, C. Y.↗
NASA NTRS1975

An initial feasibility stage for Stoer's constrained least squares algorithm

A procedure is described for computing an initial feasible vector, x sub 0, for Stoer's algorithm for solving the linear least squares problem subject to linear equality and inequality constraints. The procedure described fits well with Stoer's algorithm since much of the computation performed to determine x sub 0 accomplishes initializing transformations of the problem data, which would otherwise be done in Stoer's algorithm after being given an x sub 0.

Lawson, C. L.↗
NASA NTRS1975

A timeline algorithm for astronomy missions

An algorithm is presented for generating viewing timelines for orbital astronomy missions of the pointing (nonsurvey/scan) type. The algorithm establishes a target sequence from a list of candidate targets in a way which maximizes total viewing time. Two special cases are treated. One concerns dim targets which, due to lighting constraints, are scheduled only during the antipolar portion of each orbit. They normally require long observation times extending over several revolutions. A minimum slew heuristic is employed to select the sequence of dim targets. The other case deals with bright, or short duration, targets, which have less restrictive lighting constraints and are scheduled during the portion of each orbit when dim targets cannot be viewed. Since this process moves much more rapidly than the dim path, an enumeration algorithm is used to select the sequence that maximizes total viewing time.

Moore, J. E.↗
NASA NTRS1975

Algorithms

The implementation of the algorithms used in the flight program to approximate elementary functions and mathematical procedures was checked. This was done by verifying that at least one, and in most cases, more than one function computed through the use of the algorithms was calculated properly. The following algorithms were checked: sine-cosine, arctangent, natural logarithm, square root, inverse square root, as well as the vector dot and cross products.

Source record↗
NASA NTRS1974

Performance analysis of a frame sync algorithm for uncoded PSK telemetry

The optimum procedure for locating a frame sync word periodically inserted in uncoded binary data received over a binary symmetric channel is based on the Hamming distance metric. In this paper, a practical frame sync acquisition and maintenance algorithm is described, and its performance is analyzed. Specifically, with respect to this algorithm, an upper bound on the probability of false sync acquisition, the mean time to sync acquisition, and the subsequent mean time to loss of sync are computed for arbitrary bit error rates, frame lengths, sync word lengths, and algorithm parameters.

Levitt, B. K.↗
NASA NTRS1975

A least mean squares CUBIC algorithm for on-line differential of sampled analog signals

A digital computer algorithm is developed for on-line time differentiation of sampled analog voltage signals. The derivative is obtained by employing a least mean squares technique. The recursive algorithm results in a considerable reduction in computer time compared to a complete new solution of the normal equations each time a new data point is accepted. Implementation of the algorithm on a digital computer is discussed. Examples are simulated on a DEC PDP-8 computer.

Allum, J. H. J.↗
NASA NTRS1975

Boundary-detection algorithm for locating edges in digital imagery

The author has identified the following significant results. Initial development of a computer program which implements a boundary detection algorithm to detect edges in digital images is described. An evaluation of the boundary detection algorithm was conducted to locate boundaries of lakes from LANDSAT-1 imagery. The accuracy of the boundary detection algorithm was determined by comparing the area within boundaries of lakes located using digitized LANDSAT imagery with the area of the same lakes planimetered from imagery collected from an aircraft platform.

Myers, V. I.↗
NASA NTRS1976

Architecture and data processing alternatives for the TSE computer. Volume 3: Execution of a parallel counting algorithm using array logic (Tse) devices

A parallel algorithm for counting the number of logic-l elements in a binary array or image developed during preliminary investigation of the Tse concept is described. The counting algorithm is implemented using a basic combinational structure. Modifications which improve the efficiency of the basic structure are also presented. A programmable Tse computer structure is proposed, along with a hardware control unit, Tse instruction set, and software program for execution of the counting algorithm. Finally, a comparison is made between the different structures in terms of their more important characteristics.

Metcalfe, A. G.↗
NASA NTRS1975

Evaluation of several navigation algorithms for application to general aviation

Using data obtained in flight, three position determining algorithms for use by general aviation aircraft were evaluated representing increasing software requirements. These were a DME only, DME/air data and blended DME/air data. Although each step represented additional software with resultant increase in position accuracy, all could be performed on a programmable electronic desk calculator. Results from the computation of aircraft position using the three algorithms are presented. The algorithms employed can be extended to accept VOR, TACAN bearing, ADF, or other NAVAID Data. To obtain the flight data an experimental system was configured and flown on a general aviation aircraft. Principal hardware elements (all with low-cost potential) were a programmable calculator, a single DME receiver (multiplexed for multiple DME use) and a low-cost air speed sensor (shed-vortex principle). The flight test demonstrated satisfactory performance of these principal elements.

Conrad, B.↗
NASA NTRS1975

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

A decomposition algorithm is presented that 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 NTRS1975

A random search algorithm for laboratory computers

The small laboratory computer is ideal for experimental control and data acquisition. Postexperimental data processing is often performed on large computers because of the availability of sophisticated programs, but costs and data compatibility are negative factors. Parameter optimization can be accomplished on the small computer, offering ease of programming, data compatibility, and low cost. A previously proposed random-search algorithm ('random creep') was found to be very slow in convergence. A method is proposed (the 'random leap' algorithm) which starts in a global search mode and automatically adjusts step size to speed convergence. A FORTRAN executive program for the random-leap algorithm is presented which calls a user-supplied function subroutine. An example of a function subroutine is given which calculates maximum-likelihood estimates of receiver operating-characteristic parameters from binary response data. Other applications in parameter estimation, generalized least squares, and matrix inversion are discussed.

Curry, R. E.↗
NASA NTRS1976

An algorithm for reducing the bandwidth and profile of a sparse matrix

A new algorithm for reducing the bandwidth and profile of a sparse matrix is described. Extensive testing on finite element matrices indicates that the algorithm typically produces bandwidth and profile which are comparable to those of the commonly-used reverse Cuthill-McKee algorithm, yet requires significantly less computation time.

Gibbs, N. E.↗
NASA NTRS1976

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