Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 991 records · Page 55
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Evaluating some computer exhancement algorithms that improve the visibility of cometary morphology

Digital enhancement of cometary images is a necessary tool in studying cometary morphology. Many image processing algorithms, some developed specifically for comets, have been used to enhance the subtle, low contrast coma and tail features. We compare some of the most commonly used algorithms on two different images to evaluate their strong and weak points, and conclude that there currently exists no single 'ideal' algorithm, although the radial gradient spatial filter gives the best overall result. This comparison should aid users in selecting the best algorithm to enhance particular features of interest.

Larson, Stephen M.↗
NASA NTRS1992

Algorithms for airborne Doppler radar wind shear detection

Honeywell has developed algorithms for the detection of wind shear/microburst using airborne Doppler radar. The Honeywell algorithms use three dimensional pattern recognition techniques and the selection of an associated scanning pattern forward of the aircraft. This 'volumetric scan' approach acquires reflectivity, velocity, and spectral width from a three dimensional volume as opposed to the conventional use of a two dimensional azimuthal slice of data at a fixed elevation. The algorithm approach is based on detection and classification of velocity patterns which are indicative of microburst phenomenon while minimizing the false alarms due to ground clutter return. Simulation studies of microburst phenomenon and x-band radar interaction with the microburst have been performed and results of that study are presented. Algorithm performance indetection of both 'wet' and 'dry' microbursts is presented.

Gillberg, Jeff↗
NASA NTRS1993

Improvement and further development of SSM/I overland parameter algorithms using the WetNet workstation

Since the launch of the DMSP Special Sensor Microwave/Imager (SSM/I), several algorithms have been developed to retrieve overland parameters. These include the present operational algorithms resulting from the Navy calibration/validation effort such as land surface type (Neale et al. 1990), land surface temperature (McFarland et al. 1990), surface moisture (McFarland and Neale, 1991) and snow parameters (McFarland and Neale, 1991). In addition, other work has been done including the classification of snow cover and precipitation using the SSM/I (Grody, 1991). Due to the empirical nature of most of the above mentioned algorithms, further research is warranted and improvements can probably be obtained through a combination of radiative transfer modelling to study the physical processes governing the microwave emissions at the SSM/I frequencies, and the incorporation of additional ground truth data and special cases into the regression data sets. We have proposed specifically to improve the retrieval of surface moisture and snow parameters using the WetNet SSM/I data sets along with ground truth information namely climatic variables from the NOAA cooperative network of weather stations as well as imagery from other satellite sensors such as the AVHRR and Thematic Mapper. In the case of surface moisture retrievals the characterization of vegetation density is of primary concern. The higher spatial resolution satellite imagery collected at concurrent periods will be used to characterize vegetation types and amounts which, along with radiative transfer modelling should lead to more physically based retrievals. Snow parameter retrieval algorithm improvement will initially concentrate on the classification of snowpacks (dry snow, wet snow, refrozen snow) and later on specific products such as snow water equivalent. Significant accomplishments in the past year are presented.

Neale, Christopher M. U.↗
NASA NTRS1991

New developments in astrodynamics algorithms for autonomous rendezvous

A the core of any autonomous rendezvous guidance system must be two algorithms for solving Lambert's and Kepler's problems, the two fundamental problems in classical astrodynamics. Lambert's problem is to determine the trajectory connecting specified initial and terminal position vectors in a specified transfer time. The solution is the initial and terminal velocity vectors. Kepler's problem is to determine the trajectory that stems from a given initial state (position and velocity). The solution is the state of an earlier or later specified time. To be suitable for flight software, astrodynamics algorithms must be totally reliable, compact, and fast. Although solving Lambert's and Kepler's problems has challenged some of the world's finest minds for over two centuries, only in the last year have algorithms appeared that satisfy all three requirements just stated. This paper presents an evaluation of the most highly regarded Lambert and Kepler algorithms.

Klumpp, Allan R.↗
NASA NTRS1993

A ground track control algorithm for the Topographic Mapping Laser Altimeter (TMLA)

The results of an analysis of an algorithm that will provide autonomous onboard orbit control using orbits determined with Global Positioning System (GPS) data. The algorithm uses the GPS data to (1) compute the ground track error relative to a fixed longitude grid, and (2) determine the altitude adjustment required to correct the longitude error. A program was written on a personal computer (PC) to test the concept for numerous altitudes and values of solar flux using a simplified orbit model including only the J sub 2 zonal harmonic and simple orbit decay computations. The algorithm was then implemented in a precision orbit propagation program having a full range of perturbations. The analysis showed that, even with all perturbations (including actual time histories of solar flux variation), the algorithm could effectively control the spacecraft ground track and yield more than 99 percent Earth coverage in the time required to complete one coverage cycle on the fixed grid (220 to 230 days depending on altitude and overlap allowance).

Blaes, V.↗
NASA NTRS1993

A Genetic Algorithm Tool (splicer) for Complex Scheduling Problems and the Space Station Freedom Resupply Problem

The Space Station Freedom will require the supply of items in a regular fashion. A schedule for the delivery of these items is not easy to design due to the large span of time involved and the possibility of cancellations and changes in shuttle flights. This paper presents the basic concepts of a genetic algorithm model, and also presents the results of an effort to apply genetic algorithms to the design of propellant resupply schedules. As part of this effort, a simple simulator and an encoding by which a genetic algorithm can find near optimal schedules have been developed. Additionally, this paper proposes ways in which robust schedules, i.e., schedules that can tolerate small changes, can be found using genetic algorithms.

Wang, Lui↗
NASA NTRS1993

A simple parallel prefix algorithm for compact finite-difference schemes

A compact scheme is a discretization scheme that is advantageous in obtaining highly accurate solutions. However, the resulting systems from compact schemes are tridiagonal systems that are difficult to solve efficiently on parallel computers. Considering the almost symmetric Toeplitz structure, a parallel algorithm, simple parallel prefix (SPP), is proposed. The SPP algorithm requires less memory than the conventional LU decomposition and is highly efficient on parallel machines. It consists of a prefix communication pattern and AXPY operations. Both the computation and the communication can be truncated without degrading the accuracy when the system is diagonally dominant. A formal accuracy study was conducted to provide a simple truncation formula. Experimental results were measured on a MasPar MP-1 SIMD machine and on a Cray 2 vector machine. Experimental results show that the simple parallel prefix algorithm is a good algorithm for the compact scheme on high-performance computers.

Sun, Xian-He↗
NASA NTRS1992

A fuzzy clustering algorithm to detect planar and quadric shapes

In this paper, we introduce a new fuzzy clustering algorithm to detect an unknown number of planar and quadric shapes in noisy data. The proposed algorithm is computationally and implementationally simple, and it overcomes many of the drawbacks of the existing algorithms that have been proposed for similar tasks. Since the clustering is performed in the original image space, and since no features need to be computed, this approach is particularly suited for sparse data. The algorithm may also be used in pattern recognition applications.

Krishnapuram, Raghu↗
NASA NTRS1991

Applications of singular value analysis and partial-step algorithm for nonlinear orbit determination

An adaptive method in which cruise and nonlinear orbit determination problems can be solved using a single program is presented. It involves singular value decomposition augmented with an extended partial step algorithm. The extended partial step algorithm constrains the size of the correction to the spacecraft state and other solve-for parameters. The correction is controlled by an a priori covariance and a user-supplied bounds parameter. The extended partial step method is an extension of the update portion of the singular value decomposition algorithm. It thus preserves the numerical stability of the singular value decomposition method, while extending the region over which it converges. In linear cases, this method reduces to the singular value decomposition algorithm with the full rank solution. Two examples are presented to illustrate the method's utility.

Ryne, Mark S.↗
NASA NTRS1993

A parallelizable load balancing algorithm

We present a parallelizable load balancing algorithm for grid-based problems that employs a give and take concept among neighboring subdomains. The algorithm is found to converge very quickly to almost perfect load balance while minimizing the surface-to-volume ratio of the domains. The algorithm can be used for problems whose volume cost grows nonlinearly with the number of elements, because it measures continuously the computational cost to be incurred for each subdomain. This is an advantage over most algorithms currently in use (e.g., recursive subdivision), which assume a linear relationship between the computational cost and the number of elements.

Loehner, Rainald↗
NASA NTRS1992

Surface reflectance retrieval from satellite and aircraft sensors - Results of sensors and algorithm comparisons during FIFE

Visible to shortwave infrared radiometric data collected by a number of remote sensing instruments on aircraft and satellite platforms were compared over common areas in the First International Satellite Land Surface Climatology Project (ISLSCP) Field Experiment (FIFE) site on August 4, 1989, to assess their radiometric consistency and the adequacy of atmospheric correction algorithms. The instruments in the study included the Landsat 5 Thematic Mapper (TM), the SPOT 1 high-resolution visible (HRV) 1 sensor, the NS001 Thematic Mapper simulator, and the modular multispectral radiometers (MMRs). Atmospheric correction routines analyzed were an algorithm developed for FIFE, LOWTRAN 7, and 5S. A comparison between corresponding bands of the SPOT 1 HRV 1 and the Landsat 5 TM sensors indicated that the two instruments were radiometrically consistent to within about 5 percent. Retrieved surface reflectance factors using the FIFE algorithm over one site under clear atmospheric conditions indicated a capability to determine near-nadir surface reflectance factors to within about 0.01 at a reflectance of 0.06 in the visible (0.4-0.7 microns) and about 0.30 in the near infrared (0.7-1.2 microns) for all but the NS001 sensor. All three atmospheric correction procedures produced absolute reflectances to within 0.005 in the visible and near infrared. In the shortwave infrared (1.2-2.5 microns) region the three algorithms differed in the retrieved surface reflectances primarily owing to differences in predicted gaseous absorption. Although uncertainties in the measured surface reflectance in the shortwave infrared precluded definitive results, the 5S code appeared to predict gaseous transmission marginally more accurately than LOWTRAN 7.

Markham, B. L.↗
NASA NTRS1993

A Lanczos algorithm for vibration, suckling and termal analysis

This paper reviews an eigensolver algorithm based on the Lanczos Method for vibration, buckling and thermal analysis. The original code was written for inclusion in the Computational Mechanics Testbed (COMET), a general purpose finite element code. A portable version of the Lanczos code that is optimized for high-performance supercomputers has been developed. Special features of the algorithm include the capability to compute rigid body modes, thermal modes and Lanczos vectors that are derived from the applied load vector. The latter is necessary when using the Lanczos vectors as reduced-basis vectors in transient structural response and transient heat conduction calculations. The modularity of the code allows the user the option of including the most up-to-date utilities, such as the equation solver best suited for the application. The algorithm is discussed in detail and results of several applications are presented. Timing results for a vibration application indicate that the Lanczos algorithm is twenty times faster than the subspace iteration method which has been extensively used in the past.

Bostic, Susan W.↗
NASA NTRS1993

Implicit upwind solution algorithms for three-dimensional unstructured meshes

The development of implicit upwind algorithms for the solution of the three-dimensional, time-dependent Euler equations on unstructured tetrahedral meshes is described. The implicit temporal discretization involves either a two-sweep Gauss-Seide relaxation procedure, a two-sweep Point-Jacobi relaxation procedure, or a single-sweep Point-Implicit procedure; the upwind spatial discretization is based on the flux-difference splitting of Roe. Detailed descriptions of the three implicit solution algorithms are given, and calculations for the Boeing 747 transport configuration are presented to demonstrate the algorithms. Advantages and disadvantages of the implicit algorithms are discussed. A steady-state solution for the 747 configuration, obtained at transonic flow conditions using a mesh of over 100,000 cells, required less than one hour of CPU time on a Cray-2 computer, thus demonstrating the speed and robustness of the general capability.

Batina, John T.↗
NASA NTRS1991

Phase retrieval for the Hubble Space Telescope using iterative propagation algorithms

Phase retrieval algorithms, including the iterative transform algorithm and gradient search algorithms, were generalized to include the effects of propagation through a complicated optical system and to discount the effects of bad CCD pixels. For the gradient search algorithms, analytic gradients were derived that greatly speed up the computation over finite difference methods. For the Hubble Space Telescope (HST), the aperture function was reconstructed and the phase errors were retrieved. This information is useful to design correction optics for the telescope and for the deconvolution of blurred images from the HST.

Fienup, J. R.↗
NASA NTRS1992

A combined surface/volume scattering retracking algorithm for ice sheet satellite altimetry

An algorithm that is based upon a combined surface-volume scattering model is developed. It can be used to retrack individual altimeter waveforms over ice sheets. An iterative least-squares procedure is used to fit the combined model to the return waveforms. The retracking algorithm comprises two distinct sections. The first generates initial model parameter estimates from a filtered altimeter waveform. The second uses the initial estimates, the theoretical model, and the waveform data to generate corrected parameter estimates. This retracking algorithm can be used to assess the accuracy of elevations produced from current retracking algorithms when subsurface volume scattering is present. This is extremely important so that repeated altimeter elevation measurements can be used to accurately detect changes in the mass balance of the ice sheets. By analyzing the distribution of the model parameters over large portions of the ice sheet, regional and seasonal variations in the near-surface properties of the snowpack can be quantified.

Davis, Curt H.↗
NASA NTRS1992

Robust control algorithms for Mars aerobraking

Four atmospheric guidance concepts have been adapted to control an interplanetary vehicle aerobraking in the Martian atmosphere. The first two offer improvements to the Analytic Predictor Corrector (APC) to increase its robustness to density variations. The second two are variations of a new Liapunov tracking exit phase algorithm, developed to guide the vehicle along a reference trajectory. These four new controllers are tested using a six degree of freedom computer simulation to evaluate their robustness. MARSGRAM is used to develop realistic atmospheres for the study. When square wave density pulses perturb the atmosphere all four controllers are successful. The algorithms are tested against atmospheres where the inbound and outbound density functions are different. Square wave density pulses are again used, but only for the outbound leg of the trajectory. Additionally, sine waves are used to perturb the density function. The new algorithms are found to be more robust than any previously tested and a Liapunov controller is selected as the most robust control algorithm overall examined.

Shipley, Buford W., Jr.↗
NASA NTRS1993

Recursive dynamics algorithm for multibody systems with prescribed motion

This paper uses spatial operator techniques to develop a new algorithm for the dynamics of multibody systems with hinges undergoing prescribed motion. This algorithm is spatially recursive, and its computational complexity grows only linearly with the number of degrees of freedom in the system. Its structure is a hybrid of known recursive forward and inverse dynamics algorithms for regular multibody systems. Changes to the prescribed/nonprescribed nature of hinges can be implemented during run time since they are handled with very low overhead in the algorithm.

Jain, Abhinandan↗
NASA NTRS1993

SSME Automated Engine Calibrating System (AECS) alternative algorithm

An algorithm is derived for the real-time calibration of the engine mixture ratio during SSME ground testing. Because currently used calibration methods are post-test operations, there exists no fail-safe way of predicting at what mixture ratio a planned test will run. It is proposed that the algorithm developed here be used as part of an AECS which could ensure that nearly all SSME tests are run at the proper mixture ratio. In this way, AECS has the potential of increasing the efficiency of the SSME ground test program. This algorithm is an alternative to that presented in a previous paper. In addition to the derivation of the algorithm, an overview of this calibration system is presented along with a discussion of a possible single coefficient calibration system and the list of test stand facility instrumentation necessary for AECS implementation.

Greene, William D.↗