Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithm Development”

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,081 records · Page 60

Development of an upwind, finite-volume code with finite-rate chemistry

Under this grant, two numerical algorithms were developed to predict the flow of viscous, hypersonic, chemically reacting gases over three-dimensional bodies. Both algorithms take advantage of the benefits of upwind differencing, total variation diminishing techniques, and a finite-volume framework, but obtain their solution in two separate manners. The first algorithm is a zonal, time-marching scheme, and is generally used to obtain solutions in the subsonic portions of the flow field. The second algorithm is a much less expensive, space-marching scheme and can be used for the computation of the larger, supersonic portion of the flow field. Both codes compute their interface fluxes with a temporal Riemann solver and the resulting schemes are made fully implicit including the chemical source terms and boundary conditions. Strong coupling is used between the fluid dynamic, chemical, and turbulence equations. These codes have been validated on numerous hypersonic test cases and have provided excellent comparison with existing data.

Molvik, Gregory A.↗

Development of an upwind, finite-volume code with finite-rate chemistry

Under this grant, two numerical algorithms were developed to predict the flow of viscous, hypersonic, chemically reacting gases over three-dimensional bodies. Both algorithms take advantage of the benefits of upwind differencing, total variation diminishing techniques and of a finite-volume framework, but obtain their solution in two separate manners. The first algorithm is a zonal, time-marching scheme, and is generally used to obtain solutions in the subsonic portions of the flow field. The second algorithm is a much less expensive, space-marching scheme and can be used for the computation of the larger, supersonic portion of the flow field. Both codes compute their interface fluxes with a temporal Riemann solver and the resulting schemes are made fully implicit including the chemical source terms and boundary conditions. Strong coupling is used between the fluid dynamic, chemical and turbulence equations. These codes have been validated on numerous hypersonic test cases and have provided excellent comparison with existing data. This report summarizes the research that took place from August 1,1994 to January 1, 1995.

Molvik, Gregory A.↗

Development of a Smart Release Algorithm for Mid-Air Separation of Parachute Test Articles

The Crew Exploration Vehicle Parachute Assembly System (CPAS) project is currently developing an autonomous method to separate a capsule-shaped parachute test vehicle from an air-drop platform for use in the test program to develop and validate the parachute system for the Orion spacecraft. The CPAS project seeks to perform air-drop tests of an Orion-like boilerplate capsule. Delivery of the boilerplate capsule to the test condition has proven to be a critical and complicated task. In the current concept, the boilerplate vehicle is extracted from an aircraft on top of a Type V pallet and then separated from the pallet in mid-air. The attitude of the vehicles at separation is critical to avoiding re-contact and successfully deploying the boilerplate into a heatshield-down orientation. Neither the pallet nor the boilerplate has an active control system. However, the attitude of the mated vehicle as a function of time is somewhat predictable. CPAS engineers have designed an avionics system to monitor the attitude of the mated vehicle as it is extracted from the aircraft and command a release when the desired conditions are met. The algorithm includes contingency capabilities designed to release the test vehicle before undesirable orientations occur. The algorithm was verified with simulation and ground testing. The pre-flight development and testing is discussed and limitations of ground testing are noted. The CPAS project performed a series of three drop tests as a proof-of-concept of the release technique. These tests helped to refine the attitude instrumentation and software algorithm to be used on future tests. The drop tests are described in detail and the evolution of the release system with each test is described.

Moore, James W.↗

Effective Uncertainty Quantification for Multi-Angle Polarimetric Aerosol Remote Sensing Over Ocean

Multi-angle polarimetric (MAP) measurements can enable detailed characterization of aerosol microphysical and optical properties and improve atmospheric correction in ocean color remote sensing. Advanced retrieval algorithms have been developed to obtain multiple geophysical parameters in the atmosphere–ocean system. Theoretical pixel-wise retrieval uncertainties based on error propagation have been used to quantify retrieval performance and determine the quality of data products. However, standard error propagation techniques in high-dimensional retrievals may not always represent true retrieval errors well due to issues such as local minima and the nonlinear dependence of the forward model on the retrieved parameters near the solution. In this work, we analyze these theoretical uncertainty estimates and validate them using a flexible Monte Carlo approach. The Fast Multi-Angular Polarimetric Ocean coLor (FastMAPOL) retrieval algorithm, based on efficient neural network forward models, is used to conduct the retrievals and uncertainty quantification on both synthetic HARP2 (Hyper-Angular Rainbow Polarimeter 2) and AirHARP (airborne version of HARP2) datasets. In addition, for practical application of the uncertainty evaluation technique in operational data processing, we use the automatic differentiation method to calculate derivatives analytically based on the neural network models. Both the speed and accuracy associated with uncertainty quantification for MAP retrievals are addressed in this study. Pixel-wise retrieval uncertainties are further evaluated for the real AirHARP field campaign data. The uncertainty quantification methods and results can be used to evaluate the quality of data products, as well as guide MAP algorithm development for current and future satellite systems such as NASA’s Plankton, Aerosol, Cloud, ocean Ecosystem (PACE) mission.

PACE↗

A snow wetness retrieval algorithm for SAR

The objectives of this study are: (1) to evaluate the backscattering signals response to snow wetness; and (2) to develop an algorithm for snow wetness measurement using C-band polarimetric synthetic aperture radar (SAR). In hydrological investigations, modeling and forecasting of snowmelt runoff requires information about snowpack properties and their spatial variability. In particular, timely measurement of snow parameters is needed for operational hydrology. The liquid water content of snowpack is one of the important parameters. Active microwave sensors are highly sensitive to liquid water in the snowpack because of the large dielectric contrast between ice and water in the microwave spectrum. They are not affected by weather and have a spatial resolution compatible with the topographic variation in alpine regions. However, a quantitative algorithm for retrieval snow wetness has not yet been developed.

Shi, Jian-Cheng↗

Data Mining and Optimization Tools for Developing Engine Parameters Tools

This project was awarded for understanding the problem and developing a plan for Data Mining tools for use in designing and implementing an Engine Condition Monitoring System. From the total budget of $5,000, Tricia and I studied the problem domain for developing ail Engine Condition Monitoring system using the sparse and non-standardized datasets to be available through a consortium at NASA Lewis Research Center. We visited NASA three times to discuss additional issues related to dataset which was not made available to us. We discussed and developed a general framework of data mining and optimization tools to extract useful information from sparse and non-standard datasets. These discussions lead to the training of Tricia Erhardt to develop Genetic Algorithm based search programs which were written in C++ and used to demonstrate the capability of GA algorithm in searching an optimal solution in noisy datasets. From the study and discussion with NASA LERC personnel, we then prepared a proposal, which is being submitted to NASA for future work for the development of data mining algorithms for engine conditional monitoring. The proposed set of algorithm uses wavelet processing for creating multi-resolution pyramid of the data for GA based multi-resolution optimal search. Wavelet processing is proposed to create a coarse resolution representation of data providing two advantages in GA based search: 1. We will have less data to begin with to make search sub-spaces. 2. It will have robustness against the noise because at every level of wavelet based decomposition, we will be decomposing the signal into low pass and high pass filters.

Dhawan, Atam P.↗

Data Mining and Optimization Tools for Developing Engine Parameters Tools

This project was awarded for understanding the problem and developing a plan for Data Mining tools for use in designing and implementing an Engine Condition Monitoring System. Tricia Erhardt and I studied the problem domain for developing an Engine Condition Monitoring system using the sparse and non-standardized datasets to be available through a consortium at NASA Lewis Research Center. We visited NASA three times to discuss additional issues related to dataset which was not made available to us. We discussed and developed a general framework of data mining and optimization tools to extract useful information from sparse and non-standard datasets. These discussions lead to the training of Tricia Erhardt to develop Genetic Algorithm based search programs which were written in C++ and used to demonstrate the capability of GA algorithm in searching an optimal solution in noisy, datasets. From the study and discussion with NASA LeRC personnel, we then prepared a proposal, which is being submitted to NASA for future work for the development of data mining algorithms for engine conditional monitoring. The proposed set of algorithm uses wavelet processing for creating multi-resolution pyramid of tile data for GA based multi-resolution optimal search.

Dhawan, Atam P.↗

Remote Sensing May Provide Unprecedented Hydrological Data

Basic hydrological research and water resources management may reap tremendous benefits from remote sensing technology, studies are showing. Satellite coverage may allow unprecedented accuracy in the quantification of the global hydrological cycle, for example. Yet despite such benefits, few hydrologists currently use such data. This is partly because the needed tools and algorithms are not fully developed. Such development requires field experiments that combine remotely sensed data with detailed in situ observations. AGU's Remote Sensing in Hydrology Committee has constructed a Web site (http://Iand.gsfc.nasa.gov/RSHC.html) that gives an overview of many such experiments. Included on the site is information on each experiment's overall goal, the types of in situ and remotely sensed measurements taken, relevant climate and vegetation conditions, and so forth. Links to additional relevant Web sites are included. The site is designed to be a suitable starting point for those interested in learning more about remote sensing in hydrology. It lists members of the committee who can be contacted for further information. Hydrologists have recognized the potential of remote sensing technology since the 1970s. It offers a way to avoid the logistical and economic difficulties associated with obtaining continuous in situ measurements of various hydrological variables, difficulties that are particularly pronounced in remote regions. Microwave instruments in particular can potentially provide all-weather, areally averaged estimates of certain variables (such as precipitation, soil moisture, and snow water content) that have been essentially unattainable in the past. In remote sensing, the conversion of emitted and reflected radiances into useful hydrological data is a complex problem. The measured radiances, for example, reflect the integrated character of a pixel area, a scale inconsistent with the point measurements of traditional hydrology. To develop the needed algorithms, field experiments must be designed that combine relevant satellite measurements with traditional in situ measurements in regions that are al- ready well understood hydrologically. Such field experiments can lead to the development of hydrological models that are driven with remotely sensed data. Once the performance of these models is deemed acceptable in the heavily monitored basins, they can be "transported" for use in regions having little or no in situ measurement system. Author,5: Randal D. Koster, Paul R. Houser and Edwin T. Engman, Hydrological Sciences Branch, Laboratory for Hydrospheric Process, NASA Goddard Space Flight Center, Greenbelt, Maryland, USA; William P. Kustas, Hydrology Laboratory, Agricultural Research Service, U.S. Department of Agriculture, Beltsville, Maryland, USA.

Koster, R.↗

Solid Rocket Fuel Constitutive Theory and Polymer Cure

Solid Rocket Fuel is a complex composite material for which no general constitutive theory, based on first principles, has been developed. One of the principles such a relation would depend on is the morphology of the binder. A theory of polymer curing is required to determine this morphology. During work on such a theory an algorithm was developed for counting the number of ways a polymer chain could assemble. The methods used to develop and check this algorithm led to an analytic solution to the problem. This solution is used in a probability distribution function which characterizes the morphology of the polymer.

Ream, Robert↗

Spectral methods for modeling supersonic chemically reacting flow fields

A numerical algorithm was developed for solving the equations describing chemically reacting supersonic flows. The algorithm employs a two-stage Runge-Kutta method for integrating the equations in time and a Chebyshev spectral method for integrating the equations in space. The accuracy and efficiency of the technique were assessed by comparison with an existing implicit finite-difference procedure for modeling chemically reacting flows. The comparison showed that the procedure presented yields equivalent accuracy on much coarser grids as compared to the finite-difference procedure with resultant significant gains in computational efficiency.

Drummond, J. P.↗

Analysis and an image recovery algorithm for ultrasonic tomography system

The problem of an ultrasonic reflectivity tomography is similar to that of a spotlight-mode aircraft Synthetic Aperture Radar (SAR) system. The analysis for a circular path spotlight mode SAR in this paper leads to the insight of the system characteristics. It indicates that such a system when operated in a wide bandwidth is capable of achieving the ultimate resolution; one quarter of the wavelength of the carrier frequency. An efficient processing algorithm based on the exact two dimensional spectrum is presented. The results of simulation indicate that the impulse responses meet the predicted resolution performance. Compared to an algorithm previously developed for the ultrasonic reflectivity tomography, the throughput rate of this algorithm is about ten times higher.

Jin, Michael Y.↗

Accuracy and stability of time-split finite-difference schemes

In a recently published work by Abarbanel and Gottlieb (1980), a new class of explicit time-split algorithms designed for application to the compressible Navier-Stokes equations was developed. These algorithms, which utilize locally-one-dimensional (LOD) spatial steps, were shown to possess stability characteristics superior to those of other time-split schemes. In the present work, the properties of an implicit LOD method, analogous to the Abarbanel-Gottlieb algorithm, are examined using the two-dimensional heat conduction equation as the test problem. Both temporal and spatial inconsistencies inherent in the scheme are identified, and a new consistent, implicit splitting approach is developed and applied to the linear Burgers' equation. The relationship between this new method and other time-split implicit schemes is explained and stability problems encountered with the method in three dimensions are discussed.

Dwoyer, D. L.↗

The Langley Parameterized Shortwave Algorithm (LPSA) for Surface Radiation Budget Studies

An efficient algorithm was developed during the late 1980's and early 1990's by W. F. Staylor at NASA/LaRC for the purpose of deriving shortwave surface radiation budget parameters on a global scale. While the algorithm produced results in good agreement with observations, the lack of proper documentation resulted in a weak acceptance by the science community. The primary purpose of this report is to develop detailed documentation of the algorithm. In the process, the algorithm was modified whenever discrepancies were found between the algorithm and its referenced literature sources. In some instances, assumptions made in the algorithm could not be justified and were replaced with those that were justifiable. The algorithm uses satellite and operational meteorological data for inputs. Most of the original data sources have been replaced by more recent, higher quality data sources, and fluxes are now computed on a higher spatial resolution. Many more changes to the basic radiation scheme and meteorological inputs have been proposed to improve the algorithm and make the product more useful for new research projects. Because of the many changes already in place and more planned for the future, the algorithm has been renamed the Langley Parameterized Shortwave Algorithm (LPSA).

Gupta, Shashi K.↗

The Dark Target Algorithm for Observing the Global Aerosol System: Past, Present and Future

The Dark Target aerosol algorithm was developed to exploit the information content available from the observations of Moderate-Resolution Imaging Spectroradiometers (MODIS), to better characterize the global aerosol system. The algorithm is based on measurements of the light scattered by aerosols toward a space-borne sensor against the backdrop of relatively dark Earth scenes, thus giving rise to the name “Dark Target”. Development required nearly a decade of research that included application of MODIS airborne simulators to provide test beds for proto-algorithms and analysis of existing data to form realistic assumptions to constrain surface reflectance and aerosol optical properties. This research in itself played a significant role in expanding our understanding of aerosol properties, even before Terra MODIS launch. Contributing to that understanding were the observations and retrievals of the growing Aerosol Robotic Network (AERONET) of sun-sky radiometers, which has walked hand-in-hand with MODIS and the development of other aerosol algorithms, providing validation of the satellite-retrieved products after launch. The MODIS Dark Target products prompted advances in Earth science and applications across subdisciplines such as climate, transport of aerosols, air quality, and data assimilation systems. Then, as the Terra and Aqua MODIS sensors aged, the challenge was to monitor the effects of calibration drifts on the aerosol products and to differentiate physical trends in the aerosol system from artefacts introduced by instrument characterization. Our intention is to continue to adapt and apply the well-vetted Dark Target algorithms to new instruments, including both polar-orbiting and geosynchronous sensors. The goal is to produce an uninterrupted time series of an aerosol climate data record that begins at the dawn of the 21st century and continues indefinitely into the future.

Aerosol↗

Symbolic discrete event system specification

Extending discrete event modeling formalisms to facilitate greater symbol manipulation capabilities is important to further their use in intelligent control and design of high autonomy systems. An extension to the DEVS formalism that facilitates symbolic expression of event times by extending the time base from the real numbers to the field of linear polynomials over the reals is defined. A simulation algorithm is developed to generate the branching trajectories resulting from the underlying nondeterminism. To efficiently manage symbolic constraints, a consistency checking algorithm for linear polynomial constraints based on feasibility checking algorithms borrowed from linear programming has been developed. The extended formalism offers a convenient means to conduct multiple, simultaneous explorations of model behaviors. Examples of application are given with concentration on fault model analysis.

Zeigler, Bernard P.↗

Applications and development of communication models for the touchstone GAMMA and DELTA prototypes

The goal of this project was to develop models of the interconnection networks of the Intel iPSC/860 and DELTA multicomputers to guide the design of efficient algorithms for interprocessor communication in problems that commonly occur in CFD codes and other applications. Interprocessor communication costs of codes for message-passing architectures such as the iPSC/860 and DELTA significantly affect the level of performance that can be obtained from those machines. This project addressed several specific problems in the achievement of efficient communication on the Intel iPSC/860 hypercube and DELTA mesh. In particular, an efficient global processor synchronization algorithm was developed for the iPSC/860 and numerous broadcast algorithms were designed for the DELTA.

Seidel, Steven R.↗

Crater Identification Algorithm for the Lost in Low Lunar Orbit Scenario

Recent emphasis by NASA on returning astronauts to the Moon has placed attention on the subject of lunar surface feature tracking. Although many algorithms have been proposed for lunar surface feature tracking navigation, much less attention has been paid to the issue of navigational state initialization from lunar craters in a lost in low lunar orbit (LLO) scenario. That is, a scenario in which lunar surface feature tracking must begin, but current navigation state knowledge is either unavailable or too poor to initiate a tracking algorithm. The situation is analogous to the lost in space scenario for star trackers. A new crater identification algorithm is developed herein that allows for navigation state initialization from as few as one image of the lunar surface with no a priori state knowledge. The algorithm takes as inputs the locations and diameters of craters that have been detected in an image, and uses the information to match the craters to entries in the USGS lunar crater catalog via non-dimensional crater triangle parameters. Due to the large number of uncataloged craters that exist on the lunar surface, a probability-based check was developed to reject false identifications. The algorithm was tested on craters detected in four revolutions of Apollo 16 LLO images, and shown to perform well.

Hanak, Chad↗