Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithms.”

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 991 records · Page 55

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

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

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

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

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

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

SAR correlation technique - An algorithm for processing data with large range walk

This paper presents an algorithm for synthetic aperture radar (SAR) azimuth correlation with extraneously large range migration effect which can not be accommodated by the existing frequency domain interpolation approach used in current SEASAT SAR processing. A mathematical model is first provided for the SAR point-target response in both the space (or time) and the frequency domain. A simple and efficient processing algorithm derived from the hybrid algorithm is then given. This processing algorithm enables azimuth correlation by two steps. The first step is a secondary range compression to handle the dispersion of the spectra of the azimuth response along range. The second step is the well-known frequency domain range migration correction approach for the azimuth compression. This secondary range compression can be processed simultaneously with range pulse compression. Simulation results provided here indicate that this processing algorithm yields a satisfactory compressed impulse response for SAR data with large range migration.

Jin, M.↗

Design considerations for flight test of a fault inferring nonlinear detection system algorithm for avionics sensors

The modifications to the design of a fault inferring nonlinear detection system (FINDS) algorithm to accommodate flight computer constraints and the resulting impact on the algorithm performance are summarized. An overview of the flight data-driven FINDS algorithm is presented. This is followed by a brief analysis of the effects of modifications to the algorithm on program size and execution speed. Significant improvements in estimation performance for the aircraft states and normal operating sensor biases, which have resulted from improved noise design parameters and a new steady-state wind model, are documented. The aircraft state and sensor bias estimation performances of the algorithm's extended Kalman filter are presented as a function of update frequency of the piecewise constant filter gains. The results of a new detection system strategy and failure detection performance, as a function of gain update frequency, are also presented.

Caglayan, A. K.↗

ISCCP cloud algorithm intercomparison

Research related to the International Satellite Cloud Climatology Project (ISCCP) began with a pilot study initiated in late 1981 to evaluate currently available cloud analysis algorithms. Other objectives of this study are related to a test of the effects of data volume compression schemes and the design of the operational algorithms for ISCCP. The present paper summarizes the pilot study by focusing on the most fundamental step of any cloud algorithm, that of cloud detection. An outline is provided of the objectives and limitations of the pilot study, and a description is given of the criteria used to design the operational analysis algorithm. Attention is given to the pilot study data set, a cloud detection intercomparison, a cloud analysis, and ISCCP cloud algorithm design.

Rossow, W. B.↗

Design considerations for flight test of a fault inferring nonlinear detection system algorithm for avionics sensors

This paper summarizes the modifications made to the design of a fault inferring nonlinear detection system (FINDS) algorithm to accommodate flight computer constraints and the resulting impact on the algorithm performance. An overview of the flight data-driven FINDS algorithm is presented. This is followed by a brief analysis of the effects of modifications to the algorithm on program size and execution speed. Significant improvements in estimation performance for the aircraft states and normal operating sensor biases, which have resulted from improved noise design parameters and a new steady-state wind model, are documented. The aircraft state and sensor bias estimation performances of the algorithm's extended Kalman filter are presented as a function of update frequency of the piecewise constant filter gains. The results of a new detection system strategy and failure detection performance, as a function of an update frequency, are also presented.

Caglayan, A. K.↗

A new algorithm for microwave delay estimation from water vapor radiometer data

A new algorithm has been developed for the estimation of tropospheric microwave path delays from water vapor radiometer (WVR) data, which does not require site and weather dependent empirical parameters to produce high accuracy. Instead of taking the conventional linear approach, the new algorithm first uses the observables with an emission model to determine an approximate form of the vertical water vapor distribution which is then explicitly integrated to estimate wet path delays, in a second step. The intrinsic accuracy of this algorithm has been examined for two channel WVR data using path delays and stimulated observables computed from archived radiosonde data. It is found that annual RMS errors for a wide range of sites are in the range from 1.3 mm to 2.3 mm, in the absence of clouds. This is comparable to the best overall accuracy obtainable from conventional linear algorithms, which must be tailored to site and weather conditions using large radiosonde data bases. The new algorithm's accuracy and flexibility are indications that it may be a good candidate for almost all WVR data interpretation.

Robinson, S. E.↗

An analysis of redundancy management algorithms for asynchronous fault tolerant control systems

Redundancy management algorithms, commonly referred to as voters, are algorithms used in fault-tolerant control systems to vote on incoming redundant data, isolate bad signals, and output a single good value. In a synchronous environment, this algorithm is a straightforward signal-to-signal comparison with relatively low complexity. The technology of asynchronous control systems, recently realized in the Ultrareliable Fault Tolerant Control System research program at NASA Ames Research Center, requires more complex algorithms for fault detection and signal selection. A variety of algorithms used for this process, a means of testing them, and their basic performance under a simulated environment of the ultrareliable fault-tolerant control system are presented.

Davis, Gloria J.↗

Vectorizable multigrid algorithms for transonic-flow calculations

The analysis and the 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 with those of standard successive-line overrelaxation (SLOR) algorithms.

Melson, N. D.↗

Development of response models for the Earth Radiation Budget Experiment (ERBE) sensors. Part 4: Preliminary nonscanner models and count conversion algorithms

Two count conversion algorithms and the associated dynamic sensor model for the M/WFOV nonscanner radiometers are defined. The sensor model provides and updates the constants necessary for the conversion algorithms, though the frequency with which these updates were needed was uncertain. This analysis therefore develops mathematical models for the conversion of irradiance at the sensor field of view (FOV) limiter into data counts, derives from this model two algorithms for the conversion of data counts to irradiance at the sensor FOV aperture and develops measurement models which account for a specific target source together with a sensor. The resulting algorithms are of the gain/offset and Kalman filter types. The gain/offset algorithm was chosen since it provided sufficient accuracy using simpler computations.

Halyo, Nesim↗

Fronts propagating with curvature dependent speed: Algorithms based on Hamilton-Jacobi formulations

New numerical algorithms are devised (PSC algorithms) for following fronts propagating with curvature-dependent speed. The speed may be an arbitrary function of curvature, and the front can also be passively advected by an underlying flow. These algorithms approximate the equations of motion, which resemble Hamilton-Jacobi equations with parabolic right-hand-sides, by using techniques from the hyperbolic conservation laws. Non-oscillatory schemes of various orders of accuracy are used to solve the equations, providing methods that accurately capture the formation of sharp gradients and cusps in the moving fronts. The algorithms handle topological merging and breaking naturally, work in any number of space dimensions, and do not require that the moving surface be written as a function. The methods can be used also for more general Hamilton-Jacobi-type problems. The algorithms are demonstrated by computing the solution to a variety of surface motion problems.

Osher, Stanley↗

Upwind relaxation algorithms for Euler/Navier-Stokes equations

A description of and results from a solution algorithm for the compressible Navier-Stokes equations are presented. The main features of the algorithm are second or third order accurate upwind discretization of the convection and pressure derivatives and a relaxation scheme for the unfactored implicit backward Euler time method, implemented in a finite-volume formulation. Upwind methods were successfully used to obtain solutions to the Euler equations for flows with strong shock waves. The particular upwind method being used is based on the flux vector splitting technique developed by Van Leer and both second and third order accurate discretizations were developed. Currently, the most widely used implicit solution technique for the Navier-Stokes equations use approximate factorization (AF) methods to treat multidimensional problems. The time integration scheme being used in the present algorithm corresponds to a line Gauss-Seidel relaxation method. This method produces good convergence rates for steady-state flows, and most of the algorithm was vectorized on the NASA Langley VPS 32 computer. The Navier-Stokes algorithm was tested for several two-dimensional flow problems. Solutions for the problems gave excellent results. The presented effort is directed toward the extension of the scheme to the full three-dimensional Navier-Stokes equations.

Thomas, J. L.↗

Implementation and analysis of a Navier-Stokes algorithm on parallel computers

The results of the implementation of a Navier-Stokes algorithm on three parallel/vector computers are presented. The object of this research is to determine how well, or poorly, a single numerical algorithm would map onto three different architectures. The algorithm is a compact difference scheme for the solution of the incompressible, two-dimensional, time-dependent Navier-Stokes equations. The computers were chosen so as to encompass a variety of architectures. They are the following: the MPP, an SIMD machine with 16K bit serial processors; Flex/32, an MIMD machine with 20 processors; and Cray/2. The implementation of the algorithm is discussed in relation to these architectures and measures of the performance on each machine are given. The basic comparison is among SIMD instruction parallelism on the MPP, MIMD process parallelism on the Flex/32, and vectorization of a serial code on the Cray/2. Simple performance models are used to describe the performance. These models highlight the bottlenecks and limiting factors for this algorithm on these architectures. Finally, conclusions are presented.

Fatoohi, Raad A.↗

Computer architecture for efficient algorithmic executions in real-time systems: New technology for avionics systems and advanced space vehicles

Improvements and advances in the development of computer architecture now provide innovative technology for the recasting of traditional sequential solutions into high-performance, low-cost, parallel system to increase system performance. Research conducted in development of specialized computer architecture for the algorithmic execution of an avionics system, guidance and control problem in real time is described. A comprehensive treatment of both the hardware and software structures of a customized computer which performs real-time computation of guidance commands with updated estimates of target motion and time-to-go is presented. An optimal, real-time allocation algorithm was developed which maps the algorithmic tasks onto the processing elements. This allocation is based on the critical path analysis. The final stage is the design and development of the hardware structures suitable for the efficient execution of the allocated task graph. The processing element is designed for rapid execution of the allocated tasks. Fault tolerance is a key feature of the overall architecture. Parallel numerical integration techniques, tasks definitions, and allocation algorithms are discussed. The parallel implementation is analytically verified and the experimental results are presented. The design of the data-driven computer architecture, customized for the execution of the particular algorithm, is discussed.

Carroll, Chester C.↗