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

Design of automata theory of cubical complexes with applications to diagnosis and algorithmic description

The following problems are considered: (1) methods for development of logic design together with algorithms, so that it is possible to compute a test for any failure in the logic design, if such a test exists, and developing algorithms and heuristics for the purpose of minimizing the computation for tests; and (2) a method of design of logic for ultra LSI (large scale integration). It was discovered that the so-called quantum calculus can be extended to render it possible: (1) to describe the functional behavior of a mechanism component by component, and (2) to compute tests for failures, in the mechanism, using the diagnosis algorithm. The development of an algorithm for the multioutput two-level minimization problem is presented and the program MIN 360 was written for this algorithm. The program has options of mode (exact minimum or various approximations), cost function, cost bound, etc., providing flexibility.

Roth, J. P.↗
NASA NTRS1975

Four-dimensional guidance algorithms for aircraft in an air traffic control environment

Theoretical development and computer implementation of three guidance algorithms are presented. From a small set of input parameters the algorithms generate the ground track, altitude profile, and speed profile required to implement an experimental 4-D guidance system. Given a sequence of waypoints that define a nominal flight path, the first algorithm generates a realistic, flyable ground track consisting of a sequence of straight line segments and circular arcs. Each circular turn is constrained by the minimum turning radius of the aircraft. The ground track and the specified waypoint altitudes are used as inputs to the second algorithm which generates the altitude profile. The altitude profile consists of piecewise constant flight path angle segments, each segment lying within specified upper and lower bounds. The third algorithm generates a feasible speed profile subject to constraints on the rate of change in speed, permissible speed ranges, and effects of wind. Flight path parameters are then combined into a chronological sequence to form the 4-D guidance vectors. These vectors can be used to drive the autopilot/autothrottle of the aircraft so that a 4-D flight path could be tracked completely automatically; or these vectors may be used to drive the flight director and other cockpit displays, thereby enabling the pilot to track a 4-D flight path manually.

Pecsvaradi, T.↗
NASA NTRS1976

An algorithm for propagating the square-root covariance matrix in triangular form

A method for propagating the square root of the state error covariance matrix in lower triangular form is described. The algorithm can be combined with any triangular square-root measurement update algorithm to obtain a triangular square-root sequential estimation algorithm. The triangular square-root algorithm compares favorably with the conventional sequential estimation algorithm with regard to computation time.

Tapley, B. D.↗
NASA NTRS1978

A multilevel system of algorithms for detecting and isolating signals in a background of noise

Signal information is processed with the help of algorithms, and then on the basis of such processing, a part of the information is subjected to further processing with the help of more precise algorithms. Such a system of algorithms is studied, a comparative evaluation of a series of lower level algorithms is given, and the corresponding algorithms of higher level are characterized.

Gurin, L. S.↗
NASA NTRS1978

A fast D.F.T. algorithm using complex integer transforms

Winograd (1976) has developed a new class of algorithms which depend heavily on the computation of a cyclic convolution for computing the conventional DFT (discrete Fourier transform); this new algorithm, for a few hundred transform points, requires substantially fewer multiplications than the conventional FFT algorithm. Reed and Truong have defined a special class of finite Fourier-like transforms over GF(q squared), where q = 2 to the p power minus 1 is a Mersenne prime for p = 2, 3, 5, 7, 13, 17, 19, 31, 61. In the present paper it is shown that Winograd's algorithm can be combined with the aforementioned Fourier-like transform to yield a new algorithm for computing the DFT. A fast method for accurately computing the DFT of a sequence of complex numbers of very long transform-lengths is thus obtained.

Reed, I. S.↗
NASA NTRS1978

Instrumental variables algorithm for modal parameter identification in flutter testing

The paper is concerned with the task of estimating modal parameters from system response measurement in aircraft flutter testing. A frequency-domain derivation of an instrumental-variables algorithm is presented for a linear time-invariant dynamic system of order n. Basically, this algorithm fits a set of poles and zeros to the measured transfer function. An illustrative example is provided regarding the application of the algorithm to aeroelasticity testing. It is shown that the algorithm can be implemented for on-line data reduction with a microcomputer-based analysis system. By using instrumental variables the sensitivity of the modal parameter estimates to noise in the system-response measurements is reduced greatly. The algorithm is expected to be a powerful and valuable tool for on-line estimation of modal parameters in flutter testing and should be useful in control system and structural dynamics tests.

Johnson, W.↗
NASA NTRS1979

A fast, conservative algorithm for solving the transonic full-potential equation

A fast, fully implicit approximate factorization (AF) algorithm designed to solve the conservative transonic full-potential equation in either two or three dimensions is described. The algorithm uses an upwind bias of the density coefficient for stability in supersonic regions. This provides an effective upwind difference of the streamwise terms for any orientation of the velocity vector (i.e., 'rotated differencing'), and thereby greatly enhances the reliability of the present algorithm. A numerical transformation is used to establish an arbitrary body-fitted finite-difference mesh. Computed results for both airfoils and simplified wings demonstrate substantial improvement in convergence speed for the new algorithm relative to standard successive-line overrelaxation algorithms.

Holst, T. L.↗
NASA NTRS1980

On the performance of explicit and implicit algorithms for transient thermal analysis

The status of an effort to increase the efficiency of calculating transient temperature fields in complex aerospace vehicle structures is described. The advantages and disadvantages of explicit and implicit algorithms are discussed. A promising set of implicit algorithms, known as the GEAR package is described. Four test problems, used for evaluating and comparing various algorithms, have been selected and finite element models of the configurations are discribed. These problems include a space shuttle frame component, an insulated cylinder, a metallic panel for a thermal protection system and a model of the space shuttle orbiter wing. Calculations were carried out using the SPAR finite element program, the MITAS lumped parameter program and a special purpose finite element program incorporating the GEAR algorithms. Results generally indicate a preference for implicit over explicit algorithms for solution of transient structural heat transfer problems when the governing equations are stiff. Careful attention to modeling detail such as avoiding thin or short high-conducting elements can sometimes reduce the stiffness to the extent that explicit methods become advantageous.

Adelman, H. M.↗
NASA NTRS1981

Scaled Runge-Kutta algorithms for handling dense output

Low order Runge-Kutta algorithms are developed which determine the solution of a system of ordinary differential equations at any point within a given integration step, as well as at the end of each step. The scaled Runge-Kutta methods are designed to be used with existing Runge-Kutta formulas, using the derivative evaluations of these defining algorithms as the core of the system. For a slight increase in computing time, the solution may be generated within the integration step, improving the efficiency of the Runge-Kutta algorithms, since the step length need no longer be severely reduced to coincide with the desired output point. Scaled Runge-Kutta algorithms are presented for orders 3 through 5, along with accuracy comparisons between the defining algorithms and their scaled versions for a test problem.

Horn, M. K.↗
NASA NTRS1981

A diagonal form of an implicit approximate-factorization algorithm

A modification of an implicit approximate-factorization finite-difference algorithm applied to partial differential equations is presented. This algorithm is applied to the two- and three-dimensional Euler equations in general curvilinear coordinates. The modification transforms the coupled system of equations into an uncoupled diagonal form that requires less computational work. For steady-state applications, the resulting diagonal algorithm retains the stability and accuracy characteristics of the original algorithm. The diagonal algorithm reduces the storage requirement of the implicit solution process and therefore has an important effect on the application of implicit finite-difference schemes to vector processors. Results are presented for realistic two-dimensional transonic flow fields about airfoils. Computation costs are reduced to 24-34%.

Pulliam, T. H.↗
NASA NTRS1982

Scaled Runge-Kutta algorithms for treating the problem of dense output

A set of scaled Runge-Kutta algorithms for the third- through fifth-orders are developed to determine the solution at any point within the integration step at a relatively small increase in computing time. Each scaled algorithm is designed to be used with an existing Runge-Kutta formula, using the derivative evaluations of the defining algorithm along with an additional derivative evaluation (or two). Third-order, scaled algorithms are embedded within the existing formulas at no additional derivative expense. Such algorithms can easily be adopted to generate interpolating polynomials (or dependent variable stops) efficiently.

Horn, M. K.↗
NASA NTRS1981

A family of solution algorithms for nonlinear structural analysis based on relaxation equations

A family of hierarchical algorithms for nonlinear structural equations are presented. The algorithms are based on the Davidenko-Branin type homotopy and shown to yield consistent hierarchical perturbation equations. The algorithms appear to be particularly suitable to problems involving bifurcation and limit point calculations. An important by-product of the algorithms is that it provides a systematic and economical means for computing the stepsize at each iteration stage when a Newton-like method is employed to solve the systems of equations. Some sample problems are provided to illustrate the characteristics of the algorithms.

Park, K. C.↗
NASA NTRS1982

Iterative algorithms for large sparse linear systems on parallel computers

Algorithms for assembling in parallel the sparse system of linear equations that result from finite difference or finite element discretizations of elliptic partial differential equations, such as those that arise in structural engineering are developed. Parallel linear stationary iterative algorithms and parallel preconditioned conjugate gradient algorithms are developed for solving these systems. In addition, a model for comparing parallel algorithms on array architectures is developed and results of this model for the algorithms are given.

Adams, L. M.↗
NASA NTRS1983

Basis for spectral curvature algorithms in remote sensing of chlorophyll

A simple, empirically derived algorithm for estimating oceanic chlorophyll concentrations from spectral radiances measured by a low-flying spectroradiometer has proved highly successful in field experiments in 1980-82. The sensor used was the Multichannel Ocean Color Sensor, and the originator of the algorithm was Grew (1981). This paper presents an explanation for the algorithm based on the optical properties of waters containing chlorophyll and other phytoplankton pigments and the radiative transfer equations governing the remotely sensed signal. The effects of varying solar zenith, atmospheric transmittance, and interfering substances in the water on the chlorophyll algorithm are characterized, and applicability of the algorithm is discussed.

Campbell, J. W.↗
NASA NTRS1982

Robustness of adaptive control algorithms in the presence of unmodeled dynamics

This paper reports the outcome of an exhaustive analytical and numerical investigation of stability and robustness properties of a wide class of adaptive control algorithms in the presence of unmodeled dynamics and output disturbances. The class of adaptive algorithms considered are those commonly referred to as model-reference adaptive control algorithms, self-tuning controllers, and dead-beat adaptive controllers; they have been developed for both continuous-time systems and discrete-time systems. The existing adaptive control algorithms have been proven to be globally asymptotically stable under certain assumptions, the key ones being (1) that the number of poles and zeroes of the unknown plant are known, and (2) that the primary performance criterion is related to good command following. These theoretical assumptions are too restrictive from an engineering point of view. Real plants always contain unmodeled high-frequency dynamics and small delays, and hence no upper bound on the number of the plant poles and zeroes exists. Also real plants are always subject to unmeasurable output additive disturbances, although these may be guide small. Hence, it is important to critically examine the stability robustness properties of the existing adaptive algorithms when some of the theoretical assumptions are removed; in particular, their stability and performance properties in the presence of unmodeled dynamics and output disturbances. Previously announced in STAR as N83-16061

Rohrs, C. E.↗
NASA NTRS1985

Vectorizable multigrid algorithms for transonic flow calculations

The analysis and incorporation into a multigrid scheme of several vectorizable algorithms are discussed. Von Neumann analyses of vertical line, horizontal line, and alternating direction ZEBRA algorithms were performed; and the results were used to predict their multigrid damping rates. The algorithms were then successfully implemented in a transonic conservative full-potential computer program. The convergence acceleration effect of multiple grids is shown and the convergence rates of the vectorizable algorithms are compared to the convergence rates of standard successive line overrelaxation (SLOR) algorithms.

Melson, N. D.↗
NASA NTRS1985

Analysis of estimation algorithms for CDTI and CAS applications

Estimation algorithms for Cockpit Display of Traffic Information (CDTI) and Collision Avoidance System (CAS) applications were analyzed and/or developed. The algorithms are based on actual or projected operational and performance characteristics of an Enhanced TCAS II traffic sensor developed by Bendix and the Federal Aviation Administration. Three algorithm areas are examined and discussed. These are horizontal x and y, range and altitude estimation algorithms. Raw estimation errors are quantified using Monte Carlo simulations developed for each application; the raw errors are then used to infer impacts on the CDTI and CAS applications. Applications of smoothing algorithms to CDTI problems are also discussed briefly. Technical conclusions are summarized based on the analysis of simulation results.

Goka, T.↗
NASA NTRS1984

A SAR correlation algorithm which accommodates large-range migration

This paper presents an algorithm for azimuth correlation of synthetic aperture radar (SAR) data with extraordinarily large-range migration which cannot be accommodated by the existing frequency domain interpolation approach used in current Seasat SAR processing. A mathematical model is provided for the SAR range-correlated point-target response both in the spatial and frequency domains. A simple and efficient processing algorithm derived from the exact two-dimensional correlation algorithm is given. This algorithm enables azimuth correlation by two cascaded one-dimensional correlation steps. The first step is to transform the range-correlated SAR data into the frequency domain in azimuth, followed by a newly developed range convolution filter to correct the range-dispersed spectrum of the range-correlated point-target response (RCPTR). The second step is the frequency-domain range migration correction approach for the azimuth compression. Simulation results provided here indicate that this processing algorithm yields a satisfactory compressed impulse response for SAR data with large-range migration whereas previous methods were subject to a broadening of the impulse response along range.

Jin, M. Y.↗