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,135 records · Page 63

A real-time simulation evaluation of an advanced detection. Isolation and accommodation algorithm for sensor failures in turbine engines

An advanced sensor failure detection, isolation, and accommodation (ADIA) algorithm has been developed for use with an aircraft turbofan engine control system. In a previous paper the authors described the ADIA algorithm and its real-time implementation. Subsequent improvements made to the algorithm and implementation are discussed, and the results of an evaluation presented. The evaluation used a real-time, hybrid computer simulation of an F100 turbofan engine.

Merrill, W. C.↗

Algorithms and programming tools for image processing on the MPP, introduction

The programming tools and parallel algorithms created for the Massively Parallel Processor (MPP) located at the NASA Goddard Space Center are discussed. A user-friendly environment for high level language parallel algorithm development was developed. The issues involved in implementing certain algorithms on the MPP were researched. The expected results were compared with the actual results.

Source record↗

Implicit multigrid algorithms for the three-dimensional flux split Euler equations

The full approximation scheme multigrid method is applied to several implicit flux-split algorithms for solving the three-dimensional Euler equations in a body fitted coordinate system. Each uses a variation of approximate factorization and is implemented in a finite volume formulation. The algorithms are all vectorizable with little or no scalar computations required. The flux vectors are split into upwind components using both the splittings of Steger-Warming and Van Leer. Results comparing pressure distributions with experimental data using both splitting types are shown. The stability and smoothing rate of each of the schemes are examined using a Fourier analysis of the complete system of equations. Results are presented for three-dimensional subsonic, transonic, and supersonic flows which demonstrate substantially improved convergence rates with the multigrid algorithm. The influence of using both a V-cycle and a W-cycle on the convergence is examined. Using the multigrid method on both subsonic and transonic wing calculations, the final lift coefficient is obtained to within 0.1 percent of its final value in a few as 15 cycles for a mesh with over 210,000 points. A spectral radius of 0.89 is achieved for both subsonic and transonic flow over the ONERA M6 wing while a spectral radius of 0.83 is obtained for supersonic flow over an analytically defined forebody. Results compared with experiment for all cases show good agreement.

Anderson, W. K.↗

Performance analysis of a fault inferring nonlinear detection system algorithm with integrated avionics flight data

This paper presents the performance analysis results of a fault inferring nonlinear detection system (FINDS) using integrated avionics sensor flight data for the NASA ATOPS B-737 aircraft in a Microwave Landing System (MLS) environment. First, an overview of the FINDS algorithm structure is given. Then, aircraft state estimate time histories and statistics for the flight data sensors are discussed. This is followed by an explanation of modifications made to the detection and decision functions in FINDS to improve false alarm and failure detection performance. Next, the failure detection and false alarm performance of the FINDS algorithm are analyzed by injecting bias failures into fourteen sensor outputs over six repetitive runs of the five minutes of flight data. Results indicate that the detection speed, failure level estimation, and false alarm performance show a marked improvement over the previously reported simulation runs. In agreement with earlier results, detection speed is faster for filter measurement sensors such as MLS than for filter input sensors such as flight control accelerometers. Finally, the progress in modifications of the FINDS algorithm design to accommodate flight computer constraints is discussed.

Caglayan, A. K.↗

On an algorithm for analysis of the radiation patterns of dual reflector and segmented reflector antennas

An algorithm has been developed to calculate the radiation patterns of a large reflector antenna for space applications. The algorithm treats each panel in the reflector array as an analytic surface having n-sided polygonal boundaries. The radiation fields for individual panels are computed and stored separately, and then added to yield a uniform radiation pattern for the entire reflector. Numerical methods developed to reduce the overlap of the aperture fields of adjacent panels are described in detail. Calculations of the tangential field components of the aperture plane are carried out based on the principles of geometric optics (GO). Some radiation patterns calculated with the algorithm are compared with patterns produced by other methods, together with measured data for a classical Cassegrain antenna and the calculated patterns are illustrated.

Christodoulou, C. G.↗

Approximate-factorization algorithms - Theory and applications in viscous-flow computations

A systematic development of implicit approximate-factorization algorithms in delta form for both unsteady and steady viscous flow is presented. The algorithms are cast in conservation-law form and simplified by using a thin-layer approximation to the governing equations. The implementation of implicit surface viscous boundary conditions is discussed in detail, and an example is presented illustrating the advantage of using the implicit boundary conditions. Three-dimensional results from the steady form of the algorithm are presented and compared with experimental data.

Chaussee, D. S.↗

Formulation and implementation of nonstationary adaptive estimation algorithm with applications to air-data reconstruction

The dynamics model and data sources used to perform air-data reconstruction are discussed, as well as the Kalman filter. The need for adaptive determination of the noise statistics of the process is indicated. The filter innovations are presented as a means of developing the adaptive criterion, which is based on the true mean and covariance of the filter innovations. A method for the numerical approximation of the mean and covariance of the filter innovations is presented. The algorithm as developed is applied to air-data reconstruction for the Space Shuttle, and data obtained from the third landing are presented. To verify the performance of the adaptive algorithm, the reconstruction is also performed using a constant covariance Kalman filter. The results of the reconstructions are compared, and the adaptive algorithm exhibits better performance.

Whitmore, S. A.↗

New algorithms for microwave measurements of ocean winds Applications to Seasat and the special sensor microwave imager

Improved second generation wind algorithms are used to process the three month Seasat SMMR and SASS data sets. The new algorithms are derived without using in situ anemometer measurements. All known biases in the sensors prime measurements are removed, and the algorithms prime model functions are internally self-consistent. The computed SMMR and SASS winds are collocated and compared on a 10 km cell-by-cell basis, giving a total of 115444 wind comparisons. The comparisons are done using three different sets of SMMR channels. When the 6.6H SMMR channel is used for wind retrieval, the SMMR and SASS winds agree to within 1.3 m/s over the SASS primary swath. At nadir where the radar cross section is less sensitive to wind, the agreement degrades to 1.9 m/s. The agreement is very good for winds from 0 to 15 m/s. Above 15 m/s, the off-nadir SASS winds are consistently lower than the SMMR winds, while at nadir the high SASS winds are greater than SMMR's. When 10.7H is used for the SMMR wind channel, the SMMR/SASS wind comparisons are not quite as good. When the frequency of the wind channel is increased to 18 GHz, the SMMR/SASS agreement substantially degrades to about 5 m/S.

Wentz, F. J.↗

Acquisition and track algorithms for the Astros star tracker

The Astros star tracker has been designed for an employment with the Space Shuttle. An achievement of the performance levels needed has required critical trade-offs between the hardware design and the control algorithms. This paper provides a description of the development of the acquisition and track algorithms. Attention is given to an Astros system overview, a system firmware description, cluster evaluation, guide star selection, exposure time determination, video data input, update interval timing, exposure time sequencing full frame video A/D conversion, analog threshold for acquisition, minimum threshold determination, and the theoretical basis for the track algorithm.

Shalom, E.↗

A pattern-matching algorithm for two-dimensional coordinate lists

A pattern-matching algorithm for two-dimensional coordinate lists is described. The algorithm matches pairs of coordinates in two lists based on the triangles that can be formed from triplets of points in each list. The algorithm is insensitive to coordinate translation, rotation, magnification, or inversion and can tolerate random errors or distortions.

Groth, E. J.↗

Software implementation of detection algorithms for the MCSA

The NASA Multichannel Spectrum Analyzer supplies data in several formats and in a wide range of frequency resolutions. To decide if an extraterrestrial signal is present, this data is searched using detection algorithms particularly sensitive to signals concentrated in frequency and/or time. The algorithms, whose ultimate sensitivities are determined by theoretical considerations, are also constrained by available computing power. At present, practical detection of repetitive pulses is possible at an average power about five times lower than that for incoherent CW detection. After a period of field testing, the best detection algorithms, presently implelmented in software, will be converted to hardware to increase their speed.

Cullers, D. K.↗

A diagonal algorithm for the method of pseudocompressibility

The method of pseudocompressibility has been shown to be an efficient method for obtaining a steady-state solution to the incompressible Navier-Stokes equations. Recent improvements to this method include the use of a diagonal scheme for the inversion of the equations at each iteration. The necessary transformations have been derived for the pseudocompressibility equations in generalized coordinates. The diagonal algorithm reduces the computing time necessary to obtain a steady-state solution by a factor of nearly three. Implicit viscous terms are maintained in the equations, and it has become possible to use fourth-order implicit dissipation. The steady-state solution is unchanged by the approximations resulting from the diagonalization of the equations. Computed results for flow over a two-dimensional backward-facing step and a three-dimensional cylinder mounted normal to a flat plate are presented for both the old and new algorithms. The accuracy and computing efficiency of these algorithms are compared.

Rogers, S. E.↗

An upwind algorithm for the parabolized Navier-Stokes equations

A new upwind algorithm based on Roe's scheme has been developed to solve the two-dimensional parabolized Navier-Stokes (PNS) equations. This method does not require the addition of user specified smoothing terms for the capture of discontinuities such as shock waves. Thus, the method is easy to use and can be applied without modification to a wide variety of supersonic flowfields. The advantages and disadvantages of this adaptation are discussed in relation to those of the conventional Beam-Warming scheme in terms of accuracy, stability, computer time and storage, and programming effort. The new algorithm has been validated by applying it to three laminar test cases including flat plate boundary-layer flow, hypersonic flow past a 15 deg compression corner, and hypersonic flow into a converging inlet. The computed results compare well with experiment and show a dramatic improvement in the resolution of flowfield details when compared with the results obtained using the conventional Beam-Warming algorithm.

Lawrence, S. L.↗

Development of algorithms for understanding the temporal and spatial variability of the earth's radiation balance

A brief description is given of how temporal and spatial variability in the earth's radiative behavior influences the goals of satellite radiation monitoring systems and how some previous systems have addressed the existing problems. Then, results of some simulations of radiation budget monitoring missions are presented. These studies led to the design of the Earth Radiation Budget Experiment (ERBE). A description is given of the temporal and spatial averaging algorithms developed for the ERBE data analysis. These algorithms are intended primarily to produce monthly averages of the net radiant exitance on regional, zonal, and global scales and to provide insight into the regional diurnal variability of radiative parameters such as albedo and long-wave radiant exitance. The algorithms are applied to scanner and nonscanner data for up to three satellites. Modeling of dialy shortwave albedo and radiant exitance with satellite samling that is insufficient to fully account for changing meteorology is discussed in detail. Studies performed during the ERBE mission and software design are reviewed. These studies provide quantitative estimates of the effects of temporally sparse and biased sampling on inferred diurnal and regional radiative parameters. Other topics covered include long-wave diurnal modeling, extraction of a regional monthly net clear-sky radiation budget, the statistical significance of observed diurnal variability, quality control of the analysis, and proposals for validating the results of ERBE time and space averaging.

Brooks, D. R.↗

FPT Algorithm for Two-Dimensional Cyclic Convolutions

Fast-polynomial-transform (FPT) algorithm computes two-dimensional cyclic convolution of two-dimensional arrays of complex numbers. New algorithm uses cyclic polynomial convolutions of same length. Algorithm regular, modular, and expandable.

Truong, Trieu-Kie↗

The Tukey algorithm for enhancing MST radar data

One of the most troublesome features in MSR (mesosphere stratosphere troposphere) velocity measurements is the determination of unwanted scatterer whose velocity is different from that of the surrounding atmosphere. Aircraft seen in the sidelobes of the antenna are the principal problem. Because coherent integration essentially eliminates echoes with line of sight velocities greater than 10 or 20 m/s, aircraft are seen only when their flight path is almost perpendicular to the line of sight. Then, they give large returns whose velocities may be positive or negative, and certainly different from that of the surrounding air. The glitches in the minute by minute velocity records are quite troublesome in that they may distort the statistics of the velocity. An objective way is therefore needed to remove sporadic points of this kind. For this purpose, the Tukey algorithm is appropriate and has some advantages over averaging. The Tukey algorithm, applied to a data array, uses for each data point the median of it and the two points surrounding it. If the three points form a monotonically increasing or decreasing sequence, the original point is copied with change. However, if the central point is remote from the other two, it is replaced by whichever of the two surrounding points is closest in value. The greatest effect of the Tukey algorithm is on data where the successive points are uncorrelated. Examples are given.

Bowhill, S. A.↗

Advanced 3-D viscous SSME turbine rotor stator CFD algorithms

Current Space Shuttle Main Engine (SSME) high pressure fuel turbopump problems have generated a desire to analyze the flow field of rotating machinery. The status of Computational Fluid Dynamics (CFD) has reached the point that soon the capability to solve unsteady three-dimensional viscous flow fields will be at hand. The work presented involves upgrading the computational efficiency of an operational three-dimensional algorithm. The modifications include algorithm development, algorithm approximation and acceleration, and special coding optimizations. The overall result of these modifications has reduced processing time by nearly 80%.

Janus, J. Mark↗

Concurrent extensions to the FORTRAN language for parallel programming of computational fluid dynamics algorithms

Experiments were conducted at NASA Ames Research Center to define multi-tasking software requirements for multiple-instruction, multiple-data stream (MIMD) computer architectures. The focus was on specifying solutions for algorithms in the field of computational fluid dynamics (CFD). The program objectives were to allow researchers to produce usable parallel application software as soon as possible after acquiring MIMD computer equipment, to provide researchers with an easy-to-learn and easy-to-use parallel software language which could be implemented on several different MIMD machines, and to enable researchers to list preferred design specifications for future MIMD computer architectures. Analysis of CFD algorithms indicated that extensions of an existing programming language, adaptable to new computer architectures, provided the best solution to meeting program objectives. The CoFORTRAN Language was written in response to these objectives and to provide researchers a means to experiment with parallel software solutions to CFD algorithms on machines with parallel architectures.

Weeks, Cindy Lou↗