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,207 records · Page 67
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Development of an advanced failure detection algorithm for the SSME

Since ground testing of the Space Shuttle Main Engine began in 1975, a multifaceted detection/shutdown system has been used to detect engine anomalies and initiate shutdown. In spite of this system, 27 major incidents have occurred since testing began. Although a small percentage of over 1200 successful hot fire tests, such incidents can result in significant cost and schedule impacts. Therefore, an advanced failure detection algorithm has been developed which consists of three detection approaches designed for a failure characteristic that has been previously documented. Simulations using sensor data from five incident tests show the algorithm detecting an anomally and signalling shutdown prior to the redline cutoff time. The foundation elements of the algorithm and its functioning are described.

Norman, A.↗
NASA NTRS1989

Improved Algorithm For Finite-Field Normal-Basis Multipliers

Improved algorithm reduces complexity of calculations that must precede design of Massey-Omura finite-field normal-basis multipliers, used in error-correcting-code equipment and cryptographic devices. Algorithm represents an extension of development reported in "Algorithm To Design Finite-Field Normal-Basis Multipliers" (NPO-17109), NASA Tech Briefs, Vol. 12, No. 5, page 82.

Wang, C. C.↗
NASA NTRS1989

Network-Control Algorithm

Algorithm developed for optimal routing of packets of data along links of multilink, multinode digital communication network. Algorithm iterative and converges to cost-optimal assignment independent of initial assignment. Each node connected to other nodes through links, each containing number of two-way channels. Algorithm assigns channels according to message traffic leaving and arriving at each node. Modified to take account of different priorities among packets belonging to different users by using different delay constraints or imposing additional penalties via cost function.

Chan, Hak-Wai↗
NASA NTRS1988

Strategies for concurrent processing of complex algorithms in data driven architectures

The purpose is to document research to develop strategies for concurrent processing of complex algorithms in data driven architectures. The problem domain consists of decision-free algorithms having large-grained, computationally complex primitive operations. Such are often found in signal processing and control applications. The anticipated multiprocessor environment is a data flow architecture containing between two and twenty computing elements. Each computing element is a processor having local program memory, and which communicates with a common global data memory. A new graph theoretic model called ATAMM which establishes rules for relating a decomposed algorithm to its execution in a data flow architecture is presented. The ATAMM model is used to determine strategies to achieve optimum time performance and to develop a system diagnostic software tool. In addition, preliminary work on a new multiprocessor operating system based on the ATAMM specifications is described.

Stoughton, John W.↗
NASA NTRS1988

Cloud classification from satellite data using a fuzzy sets algorithm: A polar example

Where spatial boundaries between phenomena are diffuse, classification methods which construct mutually exclusive clusters seem inappropriate. The Fuzzy c-means (FCM) algorithm assigns each observation to all clusters, with membership values as a function of distance to the cluster center. The FCM algorithm is applied to AVHRR data for the purpose of classifying polar clouds and surfaces. Careful analysis of the fuzzy sets can provide information on which spectral channels are best suited to the classification of particular features, and can help determine likely areas of misclassification. General agreement in the resulting classes and cloud fraction was found between the FCM algorithm, a manual classification, and an unsupervised maximum likelihood classifier.

Key, J. R.↗
NASA NTRS1988

Flight tests of three-dimensional path-redefinition algorithms for transition from Radio Navigation (RNAV) to Microwave Landing System (MLS) navigation when flying an aircraft on autopilot

This report contains results of flight tests for three path update algorithms designed to provide smooth transition for an aircraft guidance system from DME, VORTAC, and barometric navaids to the more precise MLS by modifying the desired 3-D flight path. The first algorithm, called Zero Cross Track, eliminates the discontinuity in cross-track and altitude error at transition by designating the first valid MLS aircraft position as the desired first waypoint, while retaining all subsequent waypoints. The discontinuity in track angle is left unaltered. The second, called Tangent Path, also eliminates the discontinuity in cross-track and altitude errors and chooses a new desired heading to be tangent to the next oncoming circular arc turn. The third, called Continued Track, eliminates the discontinuity in cross-track, altitude, and track angle errors by accepting the current MLS position and track angle as the desired ones and recomputes the location of the next waypoint. The flight tests were conducted on the Transportation Systems Research Vehicle, a small twin-jet transport aircraft modified for research under the Advanced Transport Operating Systems program at Langley Research Center. The flight tests showed that the algorithms provided a smooth transition to MLS.

Hueschen, Richard M.↗
NASA NTRS1988

A parallel row-based algorithm with error control for standard-cell replacement on a hypercube multiprocessor

A new row-based parallel algorithm for standard-cell placement targeted for execution on a hypercube multiprocessor is presented. Key features of this implementation include a dynamic simulated-annealing schedule, row-partitioning of the VLSI chip image, and two novel new approaches to controlling error in parallel cell-placement algorithms; Heuristic Cell-Coloring and Adaptive (Parallel Move) Sequence Control. Heuristic Cell-Coloring identifies sets of noninteracting cells that can be moved repeatedly, and in parallel, with no buildup of error in the placement cost. Adaptive Sequence Control allows multiple parallel cell moves to take place between global cell-position updates. This feedback mechanism is based on an error bound derived analytically from the traditional annealing move-acceptance profile. Placement results are presented for real industry circuits and the performance is summarized of an implementation on the Intel iPSC/2 Hypercube. The runtime of this algorithm is 5 to 16 times faster than a previous program developed for the Hypercube, while producing equivalent quality placement. An integrated place and route program for the Intel iPSC/2 Hypercube is currently being developed.

Sargent, Jeff Scott↗
NASA NTRS1988

A new algorithm for modeling friction in dynamic mechanical systems

A method of modeling friction forces that impede the motion of parts of dynamic mechanical systems is described. Conventional methods in which the friction effect is assumed a constant force, or torque, in a direction opposite to the relative motion, are applicable only to those cases where applied forces are large in comparison to the friction, and where there is little interest in system behavior close to the times of transitions through zero velocity. An algorithm is described that provides accurate determination of friction forces over a wide range of applied force and velocity conditions. The method avoids the simulation errors resulting from a finite integration interval used in connection with a conventional friction model, as is the case in many digital computer-based simulations. The algorithm incorporates a predictive calculation based on initial conditions of motion, externally applied forces, inertia, and integration step size. The predictive calculation in connection with an external integration process provides an accurate determination of both static and Coulomb friction forces and resulting motions in dynamic simulations. Accuracy of the results is improved over that obtained with conventional methods and a relatively large integration step size is permitted. A function block for incorporation in a specific simulation program is described. The general form of the algorithm facilitates implementation with various programming languages such as FORTRAN or C, as well as with other simulation programs.

Hill, R. E.↗
NASA NTRS1989

Parallel processors and nonlinear structural dynamics algorithms and software

The adaptation of a finite element program with explicit time integration to a massively parallel SIMD (single instruction multiple data) computer, the CONNECTION Machine is described. The adaptation required the development of a new algorithm, called the exchange algorithm, in which all nodal variables are allocated to the element with an exchange of nodal forces at each time step. The architectural and C* programming language features of the CONNECTION Machine are also summarized. Various alternate data structures and associated algorithms for nonlinear finite element analysis are discussed and compared. Results are presented which demonstrate that the CONNECTION Machine is capable of outperforming the CRAY XMP/14.

Belytschko, Ted↗
NASA NTRS1988

Kanerva's sparse distributed memory: An associative memory algorithm well-suited to the Connection Machine

The advent of the Connection Machine profoundly changes the world of supercomputers. The highly nontraditional architecture makes possible the exploration of algorithms that were impractical for standard Von Neumann architectures. Sparse distributed memory (SDM) is an example of such an algorithm. Sparse distributed memory is a particularly simple and elegant formulation for an associative memory. The foundations for sparse distributed memory are described, and some simple examples of using the memory are presented. The relationship of sparse distributed memory to three important computational systems is shown: random-access memory, neural networks, and the cerebellum of the brain. Finally, the implementation of the algorithm for sparse distributed memory on the Connection Machine is discussed.

Rogers, David↗
NASA NTRS1989

Solution of the hydrodynamic device model using high-order non-oscillatory shock capturing algorithms

A micron n+ - n - n+ silicon diode is simulated via the hydrodynamic model for carrier transport. The numerical algorithms employed are for the non-steady case, and a limiting process is used to reach steady state. The simulation employs shock capturing algorithms, and indeed shocks, or very rapid transition regimes, are observed in the transient case for the coupled system, consisting of the potential equation and the conservation equations describing charge, momentum, and energy transfer for the electron carriers. These algorithms, termed essentially non-oscillatory, were successfully applied in other contexts to model the flow in gas dynamics, magnetohydrodynamics, and other physical situations involving the conservation laws in fluid mechanics. The method here is first order in time, but the use of small time steps allows for good accuracy. Runge-Kutta methods allow one to achieve higher accuracy in time if desired. The spatial accuracy is of high order in regions of smoothness.

Fatemi, Emad↗
NASA NTRS1988

Algorithm for automatic atmospheric corrections to visible and near-IR satellite imagery

An algorithm for automatic atmospheric correction of satellite imagery of the earth's surface is proposed which is applicable to low-resolution and high-resolution imagery of land areas. The algorithm is based on the satellite image being corrected and on the climatology of the area, and it requires that some pixels in the image correspond to dense dark vegetation as the surface cover. The algorithm is sensitive to the assumed reflectance of the dense dark vegetation, and the accuracy of the corrected surface reflectance is expected to be + or - 0.01. Using the method, aerosol optical thicknesses were derived from clear and hazy Landsat MSS images in the Washington, D.C. and Chesapeake Bay region, and the results are found to agree well with simultaneous sunphotometer ground measurements.

Kaufman, Yoram J.↗
NASA NTRS1988

Recursive algorithms for vector extrapolation methods

Three classes of recursion relations are devised for implementing some extrapolation methods for vector sequences. One class of recursion relations can be used to implement methods like the modified minimal polynomial extrapolation and the topological epsilon algorithm; another allows implementation of methods like minimal polynomial and reduced rank extrapolation; while the remaining class can be employed in the implementation of the vector E-algorithm. Operation counts and storage requirements for these methods are also discussed, and some related techniques for special applications are also presented. Included are methods for the rapid evaluations of the vector E-algorithm.

Ford, William F.↗
NASA NTRS1987

Fast and stable recursive algorithms for continuous-time and discrete-time model conversions

Based on the Newton-Raphson method, this paper presents recursive algorithms that are rapidly convergent and more stable for modeling the equivalent continuous-time (discrete-time) model from the available discrete-time (continuous-time) model for a fixed sampling period. The newly developed recursive algorithms relax the constraints imposed upon the existing model conversion algorithms, and, thus, enhance the applications of microprocessors and associated microelectronics to digital control systems. A practical example is presented to demonstrate the effectiveness of the proposed procedures.

Shieh, L. S.↗
NASA NTRS1989

Progress on a Taylor weak statement finite element algorithm for high-speed aerodynamic flows

A new finite element numerical Computational Fluid Dynamics (CFD) algorithm has matured to the point of efficiently solving two-dimensional high speed real-gas compressible flow problems in generalized coordinates on modern vector computer systems. The algorithm employs a Taylor Weak Statement classical Galerkin formulation, a variably implicit Newton iteration, and a tensor matrix product factorization of the linear algebra Jacobian under a generalized coordinate transformation. Allowing for a general two-dimensional conservation law system, the algorithm has been exercised on the Euler and laminar forms of the Navier-Stokes equations. Real-gas fluid properties are admitted, and numerical results verify solution accuracy, efficiency, and stability over a range of test problem parameters.

Baker, A. J.↗
NASA NTRS1989

An implicit and stiffly stable finite element CFD algorithm for unsteady aerodynamics

A stable and accurate finite element CFD algorithm for hyperbolic/incompletely parabolic conservation law systems is described and verified. It combines a Taylor weak statement FEM, an optimal implicit Runge-Kutta time integration algorithm, and a matrix tensor product approximate factorization linear algebra procedure. The results of computational experiments show that the developed algorithm is robust.

Baker, A. J.↗
NASA NTRS1988

On the Wiener-Masani algorithm for finding the generating function of multivariate stochastic processes

The algorithms developed by Wiener and Masani (1957 and 1958) and Masani (1960) for the characterization of a class of multivariate stationary stochastic processes are investigated analytically. The algorithms permit the determination of (1) the generating function, (2) the prediction-error matrix, and (3) an autoregressive representation of the linear least-squares predictor. A number of theorems and lemmas are proved, and it is shown that the range of validity of the algorithms can be extended significantly beyond that given by Wiener and Masani.

Miamee, A. G.↗
NASA NTRS1988

On the development of efficient algorithms for three dimensional fluid flow

The difficulties of constructing efficient algorithms for three-dimensional flow are discussed. Reasonable candidates are analyzed and tested, and most are found to have obvious shortcomings. Yet, there is promise that an efficient class of algorithms exist between the severely time-step sized-limited explicit or approximately factored algorithms and the computationally intensive direct inversion of large sparse matrices by Gaussian elimination.

Maccormack, R. W.↗