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 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Variation in efficiency of parallel algorithms

The present study has the objective to investigate some iterative parallel-processor linear equation solving algorithms with respect to efficiency for analyses of typical linear engineering systems. Attention is given to a set of n linear equations, Ku = p, where K = an n x n positive definite, sparsely populated, symmetric matrix, u = an n x 1 vector of unknown responses, and p = an n x 1 vector of prescribed constants. This study is concerned with a hybrid method in which iteration is used to solve the problem, while a direct method is used on the local processor level. Variations in the efficiency of parallel algorithms are explored. Measures of the efficiency are based on computer experiments regarding the algorithms. For all the algorithms, the wall clock time is found to decrease as the number of processors increases.

Hayashi, A.↗
NASA NTRS1985

Performance of direct and iterative algorithms on an optical systolic processor

The frequency-multiplexed optical linear algebra processor (OLAP) is treated in detail with attention to its performance in the solution of systems of linear algebraic equations (LAEs). General guidelines suitable for most OLAPs, including digital-optical processors, are advanced concerning system and component error source models, guidelines for appropriate use of direct and iterative algorithms, the dominant error sources, and the effect of multiple simultaneous error sources. Specific results are advanced on the quantitative performance of both direct and iterative algorithms in the solution of systems of LAEs and in the solution of nonlinear matrix equations. Acoustic attenuation is found to dominate iterative algorithms and detector noise to dominate direct algorithms. The effect of multiple spatial errors is found to be additive. A theoretical expression for the amount of acoustic attenuation allowed is advanced and verified. Simulations and experimental data are included.

Ghosh, A. K.↗
NASA NTRS1985

Linearization of digital derived rate algorithm for use in linear stability analysis

The digital derived rate (DDR) algorithm is used to calculate the rate of rotation of the Centaur upper-stage rocket. The DDR is highly nonlinear algorithm, and classical linear stability analysis of the spacecraft cannot be performed without linearization. The performance of this rate algorithm is characterized by a gain and phase curve that drop off at the same frequency. This characteristic is desirable for many applications. A linearization technique for the DDR algorithm is investigated. The linearization method is described. Examples of the results of the linearization technique are illustrated, and the effects of linearization are described. A linear digital filter may be used as a substitute for performing classical linear stability analyses, while the DDR itself may be used in time response analysis.

Graham, R. E.↗
NASA NTRS1986

Performance analysis of image processing algorithms for classification of natural vegetation in the mountains of southern California

The earth's forests fix carbon from the atmosphere during photosynthesis. Scientists are concerned that massive forest removals may promote an increase in atmospheric carbon dioxide, with possible global warming and related environmental effects. Space-based remote sensing may enable the production of accurate world forest maps needed to examine this concern objectively. To test the limits of remote sensing for large-area forest mapping, we use Landsat data acquired over a site in the forested mountains of southern California to examine the relative capacities of a variety of popular image processing algorithms to discriminate different forest types. Results indicate that certain algorithms are best suited to forest classification. Differences in performance between the algorithms tested appear related to variations in their sensitivities to spectral variations caused by background reflectance, differential illumination, and spatial pattern by species. Results emphasize the complexity between the land-cover regime, remotely sensed data and the algorithms used to process these data.

Yool, S. R.↗
NASA NTRS1986

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

A time accurate approximate 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.↗
NASA NTRS1986

A generalized algorithm to design finite field normal basis multipliers

Finite field arithmetic logic is central in the implementation of some error-correcting coders and some cryptographic devices. There is a need for good multiplication algorithms which can be easily realized. Massey and Omura recently developed a new multiplication algorithm for finite fields based on a normal basis representation. Using the normal basis representation, the design of the finite field multiplier is simple and regular. The fundamental design of the Massey-Omura multiplier is based on a design of a product function. In this article, a generalized algorithm to locate a normal basis in a field is first presented. Using this normal basis, an algorithm to construct the product function is then developed. This design does not depend on particular characteristics of the generator polynomial of the field.

Wang, C. C.↗
NASA NTRS1986

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

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

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↗
NASA NTRS1985

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

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

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

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↗
NASA NTRS1987

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↗
NASA NTRS1988

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↗
NASA NTRS1988

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

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↗
NASA NTRS1988

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