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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

Examination of a Practical Aerobraking Guidance Algorithm

A practical real time guidance algorithm has been developed for aerobraking vehicles that minimizes the post-aeropass Delta V requirements for orbit insertion while nearly minimizing the maximum heating rate and the maximum structural loads. The algorithm is general in the sense that a minimum of assumptions is made, thus greatly reducing the number of parameters that must be determined prior to a given mission. An interesting feature is that in-plane guidance performance is tuned by adjusting one mission-dependent parameter, the bank margin; similarly, the out-of-plane guidance performance is tuned by adjusting a plane controller time constant. Other features of the algorithm are simplicity, efficiency, and ease of use. The algorithm is designed for, but not restricted to, a trimmed vehicle with bank angle modulation as the method of trajectory control. Performance of this guidance algorithm during flight in Earth's atmosphere is examined by its use in an aerobraking testbed program. The performance inquiry extends to a wide range of entry speeds covering a number of potential mission applications. Favorable results have been obtained with a minimum of development effort, and directions for improvement of performance are indicated.

Evans, Steven W.↗
NASA NTRS1995

Comparison of Nonequilibrium Solution Algorithms Applied to Chemically Stiff Hypersonic Flows

Three solution algorithms, explicit under-relaxation, point implicit, and lower-upper symmetric Gauss-Seidel, are used to compute nonequilibrium flow around the Apollo 4 return capsule at the 62-km altitude point in its descent trajectory. By varying the Mach number, the efficiency and robustness of the solution algorithms were tested for different levels of chemical stiffness.The performance of the solution algorithms degraded as the Mach number and stiffness of the flow increased. At Mach 15 and 30, the lower-upper symmetric Gauss-Seidel method produces an eight order of magnitude drop in the energy residual in one-third to one-half the Cray C-90 computer time as compared to the point implicit and explicit under-relaxation methods. The explicit under-relaxation algorithm experienced convergence difficulties at Mach 30 and above. At Mach 40 the performance of the lower-upper symmetric Gauss-Seidel algorithm deteriorates to the point that it is out performed by the point implicit method. The effects of the viscous terms are investigated. Grid dependency questions are explored.

Palmer, Grant↗
NASA NTRS1996

SSM/I Rain Retrievals Within a Unified All-Weather Ocean Algorithm

A new method for the physical retrieval of rain rates from satellite microwave radiometers is presented and compared to two other rainfall climatologies derived from satellites. The method is part of a unified ocean parameter retrieval algorithm that is based on the fundamental principles of radiative transfer. The algorithm simultaneously finds near-surface wind speed W, columnar water vapor V, columnar cloud liquid water L, rain rate R, and effective radiating temperature T(sub U) for the upwelling radiation. The performance of the algorithm in the absence of rain is discussed in Wentz, and this paper focuses on the rain component of the algorithm. A particular strength of the unified algorithm is its ability to 'orthogonalize' the retrievals so that there is minimum cross-talk between the retrieved parameters. For example, comparisons of the retrieved water vapor with radiosonde observations show that there is very little correlation between the water vapor retrieval error and rain rate. For rain rates from 1 to 15 mm/h, the rms difference between the retrieved water vapor and the radiosonde value is 5 mm. A novel feature of the rain retrieval method is a beamfilling correction that is based upon the ratio of the retrieved liquid water absorption coefficients at 37 GHz and 19.35 GHz. This ratio decreases by about 40% when heavy and light rain co-exist within the SSM/I footprint as compared to the case of uniform rain. This correction has the effect of increasing the rain rate when the spectral ratio of the absorption coefficients is small. Even with this beamfilling correction, tropical rainfall is still unrealistically low when the freezing level in the tropics (approx. 5 km) is used to specify the rain layer thickness. We restore realism by reducing the assumed averaged tropical rain layer thickness to 3 km, thereby accounting for the existence of warm rain processes in which the rain layer does not extend to the freezing level. Global rain rates are produced for the 1991 through 1994 period from observations taken by microwave radiometers (SSM/I) that are aboard two polar-orbiting satellites. We find that approximately 6% of the SSM/I observations detect measurable rain rates (R greater than 0.2 mm/h). Zonal averages of the rain rates show the peak at the intertropical convergence zone (ITCZ) is quite narrow in meridional extent and varies from about 7 mm/day in the winter to a maximum 11 mm/day in the summer. Very low precipitation rates (less than 0.3 mm/day) are observed in those areas of subsidence influenced by the large semipermanent anticyclones. In general, these features are similar to those reported in previously published rain climatologies. However, significant differences do exists between our rain rates and those produced by Spencer. These differences seem to be related to non-precipitating cloud water.

Wentz, Frank J.↗
NASA NTRS1980

Fast, Conservative Algorithm for Solving the Transonic Full-Potential Equation

A fast, fully implicit approximate factorization 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), thereby greatly enhancing 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 over-relaxation algorithms.

Holst, Terry L.↗
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 24-34%.

Pulliam, T. H.↗
NASA NTRS1998

Algorithms and Libraries

This exploratory study initiated our inquiry into algorithms and applications that would benefit by latency tolerant approach to algorithm building, including the construction of new algorithms where appropriate. In a multithreaded execution, when a processor reaches a point where remote memory access is necessary, the request is sent out on the network and a context--switch occurs to a new thread of computation. This effectively masks a long and unpredictable latency due to remote loads, thereby providing tolerance to remote access latency. We began to develop standards to profile various algorithm and application parameters, such as the degree of parallelism, granularity, precision, instruction set mix, interprocessor communication, latency etc. These tools will continue to develop and evolve as the Information Power Grid environment matures. To provide a richer context for this research, the project also focused on issues of fault-tolerance and computation migration of numerical algorithms and software. During the initial phase we tried to increase our understanding of the bottlenecks in single processor performance. Our work began by developing an approach for the automatic generation and optimization of numerical software for processors with deep memory hierarchies and pipelined functional units. Based on the results we achieved in this study we are planning to study other architectures of interest, including development of cost models, and developing code generators appropriate to these architectures.

Dongarra, Jack↗
NASA NTRS1998

Application of Least Mean Square Algorithms to Spacecraft Vibration Compensation

This paper describes the application of the Least Mean Square (LMS) algorithm in tandem with the Filtered-X Least Mean Square algorithm for controlling a science instrument's line-of-sight pointing. Pointing error is caused by a periodic disturbance and spacecraft vibration. A least mean square algorithm is used on-orbit to produce the transfer function between the instrument's servo-mechanism and error sensor. The result is a set of adaptive transversal filter weights tuned to the transfer function. The Filtered-X LMS algorithm, which is an extension of the LMS, tunes a set of transversal filter weights to the transfer function between the disturbance source and the servo-mechanism's actuation signal. The servo-mechanism's resulting actuation counters the disturbance response and thus maintains accurate science instrumental pointing. A simulation model of the Upper Atmosphere Research Satellite is used to demonstrate the algorithms.

Woodard , Stanley E.↗
NASA NTRS1999

Development and Validation of a Polar Cloud Algorithm for CERES

The objectives of this project, as described in the original proposal, were to develop an algorithm for diagnosing cloud properties over snow- and ice-covered surfaces, particularly at night, using satellite radiances from the Advanced Very High Resolution Radiometer (AVHRR) and High-resolution Infrared Radiation Sounder (HIRS) sensors. Products from this algorithm include a cloud mask and additional cloud properties such as cloud phase, amount, and height. The SIVIS software package, developed as a part of the CERES project, was originally the primary tool used to develop the algorithm, but as it is no longer supported we have had to pursue a new tool to enable the combination and analysis of collocated radiances from AVHRR and HIRS. This turned out to be a much larger endeavor than we expected, but we now have the data sets collocated (with many thanks to B. Baum for the fundamental code) and we have developed a nighttime cloud detection algorithm. Using this algorithm we have also computed realistic-looking cloud fractions from AVHRR brightness temperatures. A method to identify cloud phase has also been implemented. Atmospheric information from the TIROS Operational Vertical Sounder (TOVS) Polar Pathfinder Data Set, which includes temperature and moisture profiles as well as surface information, provides information required for determining cloud-top height.

Source record↗
NASA NTRS1999

Weighted MinMax Algorithm for Color Image Quantization

The maximum intercluster distance and the maximum quantization error that are minimized by the MinMax algorithm are shown to be inappropriate error measures for color image quantization. A fast and effective (improves image quality) method for generalizing activity weighting to any histogram-based color quantization algorithm is presented. A new non-hierarchical color quantization technique called weighted MinMax that is a hybrid between the MinMax and Linde-Buzo-Gray (LBG) algorithms is also described. The weighted MinMax algorithm incorporates activity weighting and seeks to minimize WRMSE, whereby obtaining high quality quantized images with significantly less visual distortion than the MinMax algorithm.

Reitan, Paula J.↗
NASA NTRS1989

A Computational Fluid Dynamics Algorithm on a Massively Parallel Computer

The discipline of computational fluid dynamics is demanding ever-increasing computational power to deal with complex fluid flow problems. We investigate the performance of a finite-difference computational fluid dynamics algorithm on a massively parallel computer, the Connection Machine. Of special interest is an implicit time-stepping algorithm; to obtain maximum performance from the Connection Machine, it is necessary to use a nonstandard algorithm to solve the linear systems that arise in the implicit algorithm. We find that the Connection Machine ran achieve very high computation rates on both explicit and implicit algorithms. The performance of the Connection Machine puts it in the same class as today's most powerful conventional supercomputers.

Jespersen, Dennis C.↗
NASA NTRS1999

Multi-Parent Clustering Algorithms from Stochastic Grammar Data Models

We introduce a statistical data model and an associated optimization-based clustering algorithm which allows data vectors to belong to zero, one or several "parent" clusters. For each data vector the algorithm makes a discrete decision among these alternatives. Thus, a recursive version of this algorithm would place data clusters in a Directed Acyclic Graph rather than a tree. We test the algorithm with synthetic data generated according to the statistical data model. We also illustrate the algorithm using real data from large-scale gene expression assays.

Mjoisness, Eric↗
NASA NTRS2000

A Parallel Genetic Algorithm for Automated Electronic Circuit Design

Parallelized versions of genetic algorithms (GAs) are popular primarily for three reasons: the GA is an inherently parallel algorithm, typical GA applications are very compute intensive, and powerful computing platforms, especially Beowulf-style computing clusters, are becoming more affordable and easier to implement. In addition, the low communication bandwidth required allows the use of inexpensive networking hardware such as standard office ethernet. In this paper we describe a parallel GA and its use in automated high-level circuit design. Genetic algorithms are a type of trial-and-error search technique that are guided by principles of Darwinian evolution. Just as the genetic material of two living organisms can intermix to produce offspring that are better adapted to their environment, GAs expose genetic material, frequently strings of 1s and Os, to the forces of artificial evolution: selection, mutation, recombination, etc. GAs start with a pool of randomly-generated candidate solutions which are then tested and scored with respect to their utility. Solutions are then bred by probabilistically selecting high quality parents and recombining their genetic representations to produce offspring solutions. Offspring are typically subjected to a small amount of random mutation. After a pool of offspring is produced, this process iterates until a satisfactory solution is found or an iteration limit is reached. Genetic algorithms have been applied to a wide variety of problems in many fields, including chemistry, biology, and many engineering disciplines. There are many styles of parallelism used in implementing parallel GAs. One such method is called the master-slave or processor farm approach. In this technique, slave nodes are used solely to compute fitness evaluations (the most time consuming part). The master processor collects fitness scores from the nodes and performs the genetic operators (selection, reproduction, variation, etc.). Because of dependency issues in the GA, it is possible to have idle processors. However, as long as the load at each processing node is similar, the processors are kept busy nearly all of the time. In applying GAs to circuit design, a suitable genetic representation 'is that of a circuit-construction program. We discuss one such circuit-construction programming language and show how evolution can generate useful analog circuit designs. This language has the desirable property that virtually all sets of combinations of primitives result in valid circuit graphs. Our system allows circuit size (number of devices), circuit topology, and device values to be evolved. Using a parallel genetic algorithm and circuit simulation software, we present experimental results as applied to three analog filter and two amplifier design tasks. For example, a figure shows an 85 dB amplifier design evolved by our system, and another figure shows the performance of that circuit (gain and frequency response). In all tasks, our system is able to generate circuits that achieve the target specifications.

Long, Jason D.↗
NASA NTRS2000

JavaGenes and Condor: Cycle-Scavenging Genetic Algorithms

A genetic algorithm code, JavaGenes, was written in Java and used to evolve pharmaceutical drug molecules and digital circuits. JavaGenes was run under the Condor cycle-scavenging batch system managing 100-170 desktop SGI workstations. Genetic algorithms mimic biological evolution by evolving solutions to problems using crossover and mutation. While most genetic algorithms evolve strings or trees, JavaGenes evolves graphs representing (currently) molecules and circuits. Java was chosen as the implementation language because the genetic algorithm requires random splitting and recombining of graphs, a complex data structure manipulation with ample opportunities for memory leaks, loose pointers, out-of-bound indices, and other hard to find bugs. Java garbage-collection memory management, lack of pointer arithmetic, and array-bounds index checking prevents these bugs from occurring, substantially reducing development time. While a run-time performance penalty must be paid, the only unacceptable performance we encountered was using standard Java serialization to checkpoint and restart the code. This was fixed by a two-day implementation of custom checkpointing. JavaGenes is minimally integrated with Condor; in other words, JavaGenes must do its own checkpointing and I/O redirection. A prototype Java-aware version of Condor was developed using standard Java serialization for checkpointing. For the prototype to be useful, standard Java serialization must be significantly optimized. JavaGenes is approximately 8700 lines of code and a few thousand JavaGenes jobs have been run. Most jobs ran for a few days. Results include proof that genetic algorithms can evolve directed and undirected graphs, development of a novel crossover operator for graphs, a paper in the journal Nanotechnology, and another paper in preparation.

Globus, Al↗
NASA NTRS2000

OCTS And Seawifs Bio-Optical Algorithm and Product Vaildattion and Intercomparison in US Coastal Waters

Monitoring the health of U.S. coastal waters is an important goal of the National Oceanic and Atmospheric Administration (NOAA). Satellite sensors are capable of providing daily synoptic data of large expanses of the U.S. coast. Ocean color sensor, in particular, can be used to monitor the water quality of coastal waters on an operational basis. To appraise the validity of satellite-derived measurements, such as chlorophyll concentration, the bio-optical algorithms used to derive them must be evaluated in coastal environments. Towards this purpose, over 21 cruises in diverse U.S. coastal waters have been conducted. Of these 21 cruises, 12 have been performed in conjunction with and under the auspices of the NASA/SIMBIOS Project. The primary goal of these cruises has been to obtain in-situ measurements of downwelling irradiance, upwelling radiance, and chlorophyll concentrations in order to evaluate bio-optical algorithms that estimate chlorophyll concentration. In this Technical Memorandum, we evaluate the ability of five bio-optical algorithms, including the current SeaWiFS algorithm, to estimate chlorophyll concentration in surface waters of the South Atlantic Bight (SAB). The SAB consists of a variety of environments including coastal and continental shelf regimes, Gulf Stream waters, and the Sargasso Sea. The biological and optical characteristics of the region is complicated by temporal and spatial variability in phytoplankton composition, primary productivity, and the concentrations of colored dissolved organic matter (CDOM) and suspended sediment. As such, the SAB is an ideal location to test the robustness of algorithms for coastal use.

Brow, Chirstopher↗
NASA NTRS2001

OCTS and SeaWiFS Bio-Optical Algorithm and Product Validation and Intercomparison in US Coastal Waters

Monitoring the health of US coastal waters is an important goal of the National Oceanic and Atmospheric Administration (NOAA). Satellite sensors are capable of providing daily synoptic data of large expanses of the US coast. Ocean color sensors, in particular, can be used to monitor the water quality of coastal waters on an operational basis. To appraise the validity of satellite-derived measurements, such as chlorophyll concentration, the bio-optical algorithms used to derive them must be evaluated in coastal environments. Towards this purpose, over 21 cruises in diverse US coastal waters have been conducted. Of these 21 cruises, 12 have been performed in conjunction with and under the auspices of the NASA/Sensor Intercomparison and Merger for Biological and Interdisciplinary Oceanic Studies (SIMBIOS) Project. The primary goal of these cruises has been to obtain in-situ measurements of downwelling irradiance, upwelling radiance, and chlorophyll concentrations in order to evaluate bio-optical algorithms that estimate chlorophyll concentration. In this Technical Memorandum, we evaluate the ability of five bio-optical algorithms, including the current Sea-Viewing Wide Field-of-view Sensor (SeaWiFS) algorithm, to estimate chlorophyll concentration in surface waters of the South Atlantic Bight (SAB). The SAB consists of a variety of environments including coastal and continental shelf regimes, Gulf Stream waters, and the Sargasso Sea. The biological and optical characteristics of the region is complicated by temporal and spatial variability in phytoplankton composition, primary productivity, and the concentrations of colored dissolved organic matter (CDOM) and suspended sediment. As such, the SAB is an ideal location to test the robustness of algorithms for coastal use.

Brown, Christopher W.↗
NASA NTRS2001

The Computational Complexity, Parallel Scalability, and Performance of Atmospheric Data Assimilation Algorithms

The computational complexity of algorithms for Four Dimensional Data Assimilation (4DDA) at NASA's Data Assimilation Office (DAO) is discussed. In 4DDA, observations are assimilated with the output of a dynamical model to generate best-estimates of the states of the system. It is thus a mapping problem, whereby scattered observations are converted into regular accurate maps of wind, temperature, moisture and other variables. The DAO is developing and using 4DDA algorithms that provide these datasets, or analyses, in support of Earth System Science research. Two large-scale algorithms are discussed. The first approach, the Goddard Earth Observing System Data Assimilation System (GEOS DAS), uses an atmospheric general circulation model (GCM) and an observation-space based analysis system, the Physical-space Statistical Analysis System (PSAS). GEOS DAS is very similar to global meteorological weather forecasting data assimilation systems, but is used at NASA for climate research. Systems of this size typically run at between 1 and 20 gigaflop/s. The second approach, the Kalman filter, uses a more consistent algorithm to determine the forecast error covariance matrix than does GEOS DAS. For atmospheric assimilation, the gridded dynamical fields typically have More than 10(exp 6) variables, therefore the full error covariance matrix may be in excess of a teraword. For the Kalman filter this problem can easily scale to petaflop/s proportions. We discuss the computational complexity of GEOS DAS and our implementation of the Kalman filter. We also discuss and quantify some of the technical issues and limitations in developing efficient, in terms of wall clock time, and scalable parallel implementations of the algorithms.

Lyster, Peter M.↗
NASA NTRS1997

UFLIC: A Line Integral Convolution Algorithm for Visualizing Unsteady Flows

This paper presents an algorithm, UFLIC (Unsteady Flow LIC), to visualize vector data in unsteady flow fields. Using the Line Integral Convolution (LIC) as the underlying method, a new convolution algorithm is proposed that can effectively trace the flow's global features over time. The new algorithm consists of a time-accurate value depositing scheme and a successive feed-forward method. The value depositing scheme accurately models the flow advection, and the successive feed-forward method maintains the coherence between animation frames. Our new algorithm can produce time-accurate, highly coherent flow animations to highlight global features in unsteady flow fields. CFD scientists, for the first time, are able to visualize unsteady surface flows using our algorithm.

Shen, Han-Wei↗
NASA NTRS2002

NWRA AVOSS Wake Vortex Prediction Algorithm

This report provides a detailed description of the wake vortex prediction algorithm used in the Demonstration Version of NASA's Aircraft Vortex Spacing System (AVOSS). The report includes all equations used in the algorithm, an explanation of how to run the algorithm, and a discussion of how the source code for the algorithm is organized. Several appendices contain important supplementary information, including suggestions for enhancing the algorithm and results from test cases.

Robins, R. E.↗