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 685 records · Page 38

Algorithms and programming tools for image processing on the MPP, part 2

A number of algorithms were developed for image warping and pyramid image filtering. Techniques were investigated for the parallel processing of a large number of independent irregular shaped regions on the MPP. In addition some utilities for dealing with very long vectors and for sorting were developed. Documentation pages for the algorithms which are available for distribution are given. The performance of the MPP for a number of basic data manipulations was determined. From these results it is possible to predict the efficiency of the MPP for a number of algorithms and applications. The Parallel Pascal development system, which is a portable programming environment for the MPP, was improved and better documentation including a tutorial was written. This environment allows programs for the MPP to be developed on any conventional computer system; it consists of a set of system programs and a library of general purpose Parallel Pascal functions. The algorithms were tested on the MPP and a presentation on the development system was made to the MPP users group. The UNIX version of the Parallel Pascal System was distributed to a number of new sites.

Reeves, Anthony P.↗

A dual-processor multi-frequency implementation of the FINDS algorithm

This report presents a parallel processing implementation of the FINDS (Fault Inferring Nonlinear Detection System) algorithm on a dual processor configured target flight computer. First, a filter initialization scheme is presented which allows the no-fail filter (NFF) states to be initialized using the first iteration of the flight data. A modified failure isolation strategy, compatible with the new failure detection strategy reported earlier, is discussed and the performance of the new FDI algorithm is analyzed using flight recorded data from the NASA ATOPS B-737 aircraft in a Microwave Landing System (MLS) environment. The results show that low level MLS, IMU, and IAS sensor failures are detected and isolated instantaneously, while accelerometer and rate gyro failures continue to take comparatively longer to detect and isolate. The parallel implementation is accomplished by partitioning the FINDS algorithm into two parts: one based on the translational dynamics and the other based on the rotational kinematics. Finally, a multi-rate implementation of the algorithm is presented yielding significantly low execution times with acceptable estimation and FDI performance.

Godiwala, Pankaj M.↗

An Adaptive Numeric Predictor-corrector Guidance Algorithm for Atmospheric Entry Vehicles

An adaptive numeric predictor-corrector guidance is developed for atmospheric entry vehicles which utilize lift to achieve maximum footprint capability. Applicability of the guidance design to vehicles with a wide range of performance capabilities is desired so as to reduce the need for algorithm redesign with each new vehicle. Adaptability is desired to minimize mission-specific analysis and planning. The guidance algorithm motivation and design are presented. Performance is assessed for application of the algorithm to the NASA Entry Research Vehicle (ERV). The dispersions the guidance must be designed to handle are presented. The achievable operational footprint for expected worst-case dispersions is presented. The algorithm performs excellently for the expected dispersions and captures most of the achievable footprint.

Spratlin, Kenneth Milton↗

A Taylor-Galerkin finite element algorithm for transient nonlinear thermal-structural analysis

A Taylor-Galerkin finite element solution algorithm for transient nonlinear thermal-structural analysis of large, complex structural problems subjected to rapidly applied thermal-structural loads is described. The two-step Taylor-Galerkin algorithm is an application of an algorithm recently developed for problems in compressible fluid dynamics. The element integrals that appear in the algorithm can be evaluated in closed form for two and three dimensional elements.

Thornton, Earl A.↗

Active-passive correlation spectroscopy - A new technique for identifying ocean color algorithm spectral regions

A new active-passive airborne data correlation technique has been developed which allows the validation of existing in-water oceoan color algorithms and the rapid search, identification, and evaluation of new sensor band locations and algorithm wavelength intervals. Thus far, applied only in conjunction with the spectral curvature algorithm (SCA), the active-passive correlation spectroscopy (APCS) technique shows that (1) the usual 490-nm (center-band) chlorophyll SCA could satisfactorily be placed anywhere within the nominal 460-510-nm interval, and (2) two other spectral regions, 645-660 and 680-695 nm, show considerable promise for chlorophyll pigment measurement. Additionally, the APCS method reveals potentially useful wavelength regions (at 600 and about 670 nm) of very low chlorophyll-in-water spectral curvature into which accessory pigment algorithms for phycoerythrin might be carefully positioned. In combination, the APCS and SCA methods strongly suggest that significant information content resides within the seemingly featureless ocean color spectrum.

Hoge, F. E.↗

An efficient algorithm for solution of the unsteady transonic small-disturbance equation

A time accurate approximation factorization (AF) algorithm is formulated for solution of the three-dimensional unsteady transonic small-disturbance equation. The AF algorithm consists of a time linearization procedure coupled with a Newton iteration technique. Superior stability characteristics of the new algorithm are demonstrated through applications to steady and oscillatory flows at subsonic and supersonic freestream conditions for an F-5 fighter wing. For steady flow calculations, the size of the time step is cycled to achieve rapid convergence. For unsteady flow calculations, the AF algorithm is sufficiently robust to allow the step size to be selected based on accuracy rather than on stability considerations. Therefore, accurate solutions are obtained in only several hundred time steps yielding a significant computational cost savings when compared to alternative methods.

Batina, John T.↗

Algorithmic phase diagrams

Algorithmic phase diagrams are a neat and compact representation of the results of comparing the execution time of several algorithms for the solution of the same problem. As an example, the recent results are shown of Gannon and Van Rosendale on the solution of multiple tridiagonal systems of equations in the form of such diagrams. The act of preparing these diagrams has revealed an unexpectedly complex relationship between the best algorithm and the number and size of the tridiagonal systems, which was not evident from the algebraic formulae in the original paper. Even so, for a particular computer, one diagram suffices to predict the best algorithm for all problems that are likely to be encountered the prediction being read directly from the diagram without complex calculation.

Hockney, Roger↗

A comparative study of several wind estimation algorithms for spaceborne scatterometers

The paper presents a comparison study for the performances of seven wind estimation algorithms for spaceborne scatterometers. These algorithms are weighted least square in log domain, maximum-likelihood, least square weighted least square, adjustable weighted least square, L1 norm, and least wind speed square algorithms using radar scatterometer measurements. For each algorithm, the system performance simulation results are presented for the NASA scatterometer system planned to be launched in the 1990's.

Chi, Chong-Yung↗

Experiences with serial and parallel algorithms for channel routing using simulated annealing

Two algorithms for channel routing using simulated annealing are presented. Simulated annealing is an optimization methodology which allows the solution process to back up out of local minima that may be encountered by inappropriate selections. By properly controlling the annealing process, it is very likely that the optimal solution to an NP-complete problem such as channel routing may be found. The algorithm presented proposes very relaxed restrictions on the types of allowable transformations, including overlapping nets. By freeing that restriction and controlling overlap situations with an appropriate cost function, the algorithm becomes very flexible and can be applied to many extensions of channel routing. The selection of the transformation utilizes a number of heuristics, still retaining the pseudorandom nature of simulated annealing. The algorithm was implemented as a serial program for a workstation, and a parallel program designed for a hypercube computer. The details of the serial implementation are presented, including many of the heuristics used and some of the resulting solutions.

Brouwer, Randall Jay↗

An intelligent allocation algorithm for parallel processing

The problem of allocating nodes of a program graph to processors in a parallel processing architecture is considered. The algorithm is based on critical path analysis, some allocation heuristics, and the execution granularity of nodes in a program graph. These factors, and the structure of interprocessor communication network, influence the allocation. To achieve realistic estimations of the executive durations of allocations, the algorithm considers the fact that nodes in a program graph have to communicate through varying numbers of tokens. Coarse and fine granularities have been implemented, with interprocessor token-communication duration, varying from zero up to values comparable to the execution durations of individual nodes. The effect on allocation of communication network structures is demonstrated by performing allocations for crossbar (non-blocking) and star (blocking) networks. The algorithm assumes the availability of as many processors as it needs for the optimal allocation of any program graph. Hence, the focus of allocation has been on varying token-communication durations rather than varying the number of processors. The algorithm always utilizes as many processors as necessary for the optimal allocation of any program graph, depending upon granularity and characteristics of the interprocessor communication network.

Carroll, Chester C.↗

An analysis of a candidate control algorithm for a ride quality augmentation system

This paper presents a detailed analysis of a candidate algorithm for a ride quality augmentation system. The algorithm consists of a full-state feedback control law based on optimal control output weighting, estimators for angle of attack and sideslip, and a maneuvering algorithm. The control law is shown to perform well by both frequency and time domain analysis. The rms vertical acceleration is reduced by about 40 percent over the whole mission flight envelope. The estimators for the angle of attack and sideslip avoid the often inaccurate or costly direct measurement of those angles. The maneuvering algorithm will allow the augmented airplane to respond to pilot inputs. The design characteristics and performance are documented by the closed-loop eigenvalues; rms levels of vertical, lateral, and longitudinal acceleration; and representative time histories and frequency response.

Suikat, Reiner↗

Unsteady transonic algorithm improvements for realistic aircraft applications

Improvements to a time-accurate approximate factorization (AF) algorithm have been implemented for steady and unsteady transonic analysis of realistic aircraft configurations. The algorithm improvements include: an Engquist-Osher (E-O) type-dependent switch to more accurately and efficiently treat regions of supersonic flow, extension of the E-O switch for second-order spatial accuracy in these regions, nonreflecting far field boundary conditions for more accurate unsteady applications, and several modifications which accelerate convergence to steady-state. Calculations are presented for several configurations to evaluate the algorithm modifications. The modifications have significantly improved the stability of the AF algorithm and hence the reliability of the CAP-TSD code in general.

Batina, John T.↗

Analysis of algorithms for the retrieval of rain-rate profiles from a spaceborne dual-wavelength radar

The ability to retrieve rain-rate profiles from a dual-wavelength spaceborne radar system operating at 13.6 and 35 GHz is analyzed. The fundamental problem of extracting either the attenuation and/or the reflectivity from the backscatter echo, which contains both contributions, is addressed. Three algorithms, the backscatter, the attenuation coefficient, and the dual-wavelength methods, are examined. These algorithms are tested using four rain-rate profiles derived from radar measurements. In particular, measured (true) values are compared with calculated (retrieved) rain rates applying the algorithms with superimposed uncertainties assuming a suggested spaceborne dual-wavelength radar system. Error values of rain rates are determined where these values reflect failure of the assumptions utilized in the derivation of the algorithms, rain backscatter noise, and instrument noise. It is concluded that no single technique gives rise to a panacea in the making of accurate rain measurements and that difficulties exist with each method.

Goldhirsh, Julius↗

Flight test results of a vector-based failure detection and isolation algorithm for a redundant strapdown inertial measurement unit

Flight test results of a vector-based fault-tolerant algorithm for a redundant strapdown inertial measurement unit are presented. Because the inertial sensors provide flight-critical information for flight control and navigation, failure detection and isolation is developed in terms of a multi-level structure. Threshold compensation techniques for gyros and accelerometers, developed to enhance the sensitivity of the failure detection process to low-level failures, are presented. Four flight tests, conducted in a commercial transport type environment, were used to determine the ability of the failure detection and isolation algorithm to detect failure signals, such a hard-over, null, or bias shifts. The algorithm provided timely detection and correct isolation of flight control- and low-level failures. The flight tests of the vector-based algorithm demonstrated its capability to provide false alarm free dual fail-operational performance for the skewed array of inertial sensors.

Morrell, F. R.↗

Rapid code acquisition algorithms employing PN matched filters

The performance of four algorithms using pseudonoise matched filters (PNMFs), for direct-sequence spread-spectrum systems, is analyzed. They are: parallel search with fix dwell detector (PL-FDD), parallel search with sequential detector (PL-SD), parallel-serial search with fix dwell detector (PS-FDD), and parallel-serial search with sequential detector (PS-SD). The operation characteristic for each detector and the mean acquisition time for each algorithm are derived. All the algorithms are studied in conjunction with the noncoherent integration technique, which enables the system to operate in the presence of data modulation. Several previous proposals using PNMF are seen as special cases of the present algorithms.

Su, Yu T.↗

A near optimal guidance algorithm for aero-assisted orbit transfer

The paper presents a near optimal guidance algorithm for aero-assited orbit plane change, based on minimizing the energy loss during the atmospheric portion of the maneuver. The guidance algorithm makes use of recent results obtained from energy state approximations and singular perturbation analysis of optimal heading change for a hypersonic gliding vehicle. This earlier work ignored the terminal constraint on altitude needed to insure that the vehicle exits that atmosphere. Thus, the resulting guidance algorithm was only appropriate for maneuvering reentry vehicle guidance. In the context of singular perturbation theory, a constraint on final altitude gives rise to a difficult terminal boundary layer problem, which cannot be solved in closed form. This paper will demonstrate the near optimality of a predictive/corrective guidance algorithm for the terminal maneuver. Comparisons are made to numerically optimized trajectories for a range or orbit plane angles.

Calise, Anthony J.↗

The ATAMM procedure model for concurrent processing of large grained control and signal processing algorithms

An overview is presented of a model for describing data and control flow associated with the execution of large-grained, decision-free algorithms in a special distributed computer environment. The ATAMM (Algorithm-To-Architecture Mapping Model) model provides a basis for relating an algorithm to its execution in a dataflow multicomputer environment. The ATAMM model features a marked graph Petri net description of the algorithm behavior with regard to both data and control flow. The model provides an analytical basis for calculating performance bounds on throughput characteristics which are demonstrated here.

Stoughton, John W.↗

Algorithm Estimates Microwave Water-Vapor Delay

Accuracy equals or exceeds conventional linear algorithms. "Profile" algorithm improved algorithm using water-vapor-radiometer data to produce estimates of microwave delays caused by water vapor in troposphere. Does not require site-specific and weather-dependent empirical parameters other than standard meteorological data, latitude, and altitude for use in conjunction with published standard atmospheric data. Basic premise of profile algorithm, wet-path delay approximated closely by solution to simplified version of nonlinear delay problem and generated numerically from each radiometer observation and simultaneous meteorological data.

Robinson, Steven E.↗